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-programs/copysome2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:06:42,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:06:42,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:06:42,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:06:42,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:06:42,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:06:42,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:06:42,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:06:42,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:06:42,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:06:42,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:06:42,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:06:42,581 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:06:42,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:06:42,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:06:42,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:06:42,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:06:42,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:06:42,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:06:42,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:06:42,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:06:42,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:06:42,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:06:42,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:06:42,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:06:42,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:06:42,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:06:42,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:06:42,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:06:42,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:06:42,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:06:42,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:06:42,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:06:42,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:06:42,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:06:42,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:06:42,628 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:06:42,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:06:42,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:06:42,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:06:42,656 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:06:42,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:06:42,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:06:42,660 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:06:42,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:06:42,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:06:42,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:06:42,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:06:42,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:06:42,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:06:42,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:06:42,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:06:42,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:06:42,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:06:42,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:06:42,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:06:42,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:06:42,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:06:42,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:06:42,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:06:42,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:06:42,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:06:42,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:06:42,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:06:42,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:06:42,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:06:42,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:06:42,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:06:42,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:06:42,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:06:42,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:06:42,741 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:06:42,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome2_true-unreach-call.i [2018-11-14 17:06:42,807 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b999fa01/1d5fc5d228d6444f93f307d095786ea2/FLAGa018c134d [2018-11-14 17:06:43,224 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:06:43,224 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/copysome2_true-unreach-call.i [2018-11-14 17:06:43,231 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b999fa01/1d5fc5d228d6444f93f307d095786ea2/FLAGa018c134d [2018-11-14 17:06:43,247 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b999fa01/1d5fc5d228d6444f93f307d095786ea2 [2018-11-14 17:06:43,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:06:43,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:06:43,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:43,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:06:43,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:06:43,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e4202d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43, skipping insertion in model container [2018-11-14 17:06:43,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:06:43,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:06:43,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:43,560 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:06:43,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:43,629 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:06:43,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43 WrapperNode [2018-11-14 17:06:43,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:43,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:06:43,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:06:43,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:06:43,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... [2018-11-14 17:06:43,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:06:43,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:06:43,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:06:43,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:06:43,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:06:43,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:06:43,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:06:43,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:06:43,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:06:43,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:06:43,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:06:43,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:06:43,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:06:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:06:43,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:06:44,607 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:06:44,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:44 BoogieIcfgContainer [2018-11-14 17:06:44,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:06:44,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:06:44,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:06:44,613 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:06:44,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:06:43" (1/3) ... [2018-11-14 17:06:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c40b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:44, skipping insertion in model container [2018-11-14 17:06:44,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:43" (2/3) ... [2018-11-14 17:06:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c40b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:44, skipping insertion in model container [2018-11-14 17:06:44,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:44" (3/3) ... [2018-11-14 17:06:44,619 INFO L112 eAbstractionObserver]: Analyzing ICFG copysome2_true-unreach-call.i [2018-11-14 17:06:44,629 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:06:44,637 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:06:44,652 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:06:44,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:06:44,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:06:44,685 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:06:44,686 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:06:44,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:06:44,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:06:44,686 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:06:44,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:06:44,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:06:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 17:06:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:06:44,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:44,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:44,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:44,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1981526840, now seen corresponding path program 1 times [2018-11-14 17:06:44,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:44,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:44,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:44,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 17:06:44,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-14 17:06:44,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 17:06:44,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2018-11-14 17:06:44,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2018-11-14 17:06:44,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {39#true} is VALID [2018-11-14 17:06:44,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 17:06:44,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-14 17:06:44,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 17:06:44,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-14 17:06:44,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 17:06:44,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} havoc ~x~0;~x~0 := 0; {40#false} is VALID [2018-11-14 17:06:44,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:06:44,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {40#false} is VALID [2018-11-14 17:06:44,915 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {40#false} is VALID [2018-11-14 17:06:44,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 17:06:44,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~cond == 0; {40#false} is VALID [2018-11-14 17:06:44,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 17:06:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:06:44,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:44,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:06:44,928 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:06:44,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:44,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:06:45,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:45,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:06:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:06:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:06:45,178 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 17:06:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:45,375 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2018-11-14 17:06:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:06:45,375 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:06:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2018-11-14 17:06:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2018-11-14 17:06:45,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2018-11-14 17:06:45,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:45,686 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:06:45,687 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:06:45,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:06:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:06:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:06:45,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:45,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:06:45,850 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:06:45,851 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:06:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:45,855 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 17:06:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:06:45,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:45,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:45,857 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:06:45,857 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:06:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:45,862 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 17:06:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:06:45,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:45,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:45,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:45,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:06:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 17:06:45,869 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-14 17:06:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:45,869 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 17:06:45,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:06:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:06:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:06:45,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:45,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:45,871 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:45,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1703822323, now seen corresponding path program 1 times [2018-11-14 17:06:45,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:45,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:46,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2018-11-14 17:06:46,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {224#true} is VALID [2018-11-14 17:06:46,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2018-11-14 17:06:46,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #91#return; {224#true} is VALID [2018-11-14 17:06:46,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret12 := main(); {224#true} is VALID [2018-11-14 17:06:46,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {226#(= main_~i~0 0)} is VALID [2018-11-14 17:06:46,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#(= main_~i~0 0)} assume true; {226#(= main_~i~0 0)} is VALID [2018-11-14 17:06:46,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(= main_~i~0 0)} assume !(~i~0 < 200000); {225#false} is VALID [2018-11-14 17:06:46,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#false} ~i~0 := 0; {225#false} is VALID [2018-11-14 17:06:46,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {225#false} assume true; {225#false} is VALID [2018-11-14 17:06:46,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#false} assume !(~i~0 < 200000); {225#false} is VALID [2018-11-14 17:06:46,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {225#false} ~i~0 := 0; {225#false} is VALID [2018-11-14 17:06:46,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {225#false} assume true; {225#false} is VALID [2018-11-14 17:06:46,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {225#false} assume !(~i~0 < 200000); {225#false} is VALID [2018-11-14 17:06:46,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {225#false} havoc ~x~0;~x~0 := 0; {225#false} is VALID [2018-11-14 17:06:46,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {225#false} assume true; {225#false} is VALID [2018-11-14 17:06:46,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {225#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {225#false} is VALID [2018-11-14 17:06:46,012 INFO L256 TraceCheckUtils]: 17: Hoare triple {225#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {225#false} is VALID [2018-11-14 17:06:46,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {225#false} ~cond := #in~cond; {225#false} is VALID [2018-11-14 17:06:46,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {225#false} assume ~cond == 0; {225#false} is VALID [2018-11-14 17:06:46,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {225#false} assume !false; {225#false} is VALID [2018-11-14 17:06:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:06:46,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:46,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:46,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 17:06:46,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:46,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:46,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:46,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:46,126 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 17:06:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:46,751 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-14 17:06:46,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:46,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 17:06:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 17:06:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 17:06:46,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-14 17:06:46,935 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-14 17:06:46,939 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:06:46,939 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:06:46,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:06:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-14 17:06:46,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:46,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 37 states. [2018-11-14 17:06:46,984 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 37 states. [2018-11-14 17:06:46,984 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 37 states. [2018-11-14 17:06:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:46,988 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 17:06:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 17:06:46,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:46,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:46,989 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 42 states. [2018-11-14 17:06:46,990 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 42 states. [2018-11-14 17:06:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:46,993 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 17:06:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 17:06:46,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:46,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:46,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:46,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:06:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 17:06:46,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2018-11-14 17:06:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:46,998 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 17:06:46,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 17:06:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:06:47,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:47,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:47,000 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:47,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash 222760444, now seen corresponding path program 1 times [2018-11-14 17:06:47,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:47,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:47,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:47,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:47,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-14 17:06:47,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {445#true} is VALID [2018-11-14 17:06:47,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-14 17:06:47,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #91#return; {445#true} is VALID [2018-11-14 17:06:47,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret12 := main(); {445#true} is VALID [2018-11-14 17:06:47,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {447#(= main_~i~0 0)} is VALID [2018-11-14 17:06:47,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(= main_~i~0 0)} assume true; {447#(= main_~i~0 0)} is VALID [2018-11-14 17:06:47,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {447#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {447#(= main_~i~0 0)} is VALID [2018-11-14 17:06:47,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {447#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {448#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:47,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#(<= main_~i~0 1)} assume true; {448#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:47,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#(<= main_~i~0 1)} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {446#false} ~i~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {446#false} assume !!(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {446#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {446#false} is VALID [2018-11-14 17:06:47,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {446#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {446#false} is VALID [2018-11-14 17:06:47,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {446#false} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {446#false} ~i~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {446#false} assume !!(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {446#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {446#false} is VALID [2018-11-14 17:06:47,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {446#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {446#false} is VALID [2018-11-14 17:06:47,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {446#false} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {446#false} havoc ~x~0;~x~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {446#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {446#false} is VALID [2018-11-14 17:06:47,181 INFO L256 TraceCheckUtils]: 28: Hoare triple {446#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {446#false} is VALID [2018-11-14 17:06:47,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2018-11-14 17:06:47,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {446#false} assume ~cond == 0; {446#false} is VALID [2018-11-14 17:06:47,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-14 17:06:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:47,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:47,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:47,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:47,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-14 17:06:47,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {445#true} is VALID [2018-11-14 17:06:47,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-14 17:06:47,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #91#return; {445#true} is VALID [2018-11-14 17:06:47,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret12 := main(); {445#true} is VALID [2018-11-14 17:06:47,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {467#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:47,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#(<= main_~i~0 0)} assume true; {467#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:47,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {467#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {467#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:47,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {467#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {448#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:47,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#(<= main_~i~0 1)} assume true; {448#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:47,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#(<= main_~i~0 1)} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {446#false} ~i~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {446#false} assume !!(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {446#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {446#false} is VALID [2018-11-14 17:06:47,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {446#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {446#false} is VALID [2018-11-14 17:06:47,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {446#false} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {446#false} ~i~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {446#false} assume !!(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {446#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {446#false} is VALID [2018-11-14 17:06:47,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {446#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {446#false} is VALID [2018-11-14 17:06:47,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {446#false} assume !(~i~0 < 200000); {446#false} is VALID [2018-11-14 17:06:47,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {446#false} havoc ~x~0;~x~0 := 0; {446#false} is VALID [2018-11-14 17:06:47,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {446#false} assume true; {446#false} is VALID [2018-11-14 17:06:47,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {446#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {446#false} is VALID [2018-11-14 17:06:47,610 INFO L256 TraceCheckUtils]: 28: Hoare triple {446#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {446#false} is VALID [2018-11-14 17:06:47,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2018-11-14 17:06:47,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {446#false} assume ~cond == 0; {446#false} is VALID [2018-11-14 17:06:47,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-14 17:06:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:47,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:47,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:06:47,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-14 17:06:47,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:47,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:06:47,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:47,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:06:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:06:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:47,771 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2018-11-14 17:06:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:48,171 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-14 17:06:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:06:48,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-14 17:06:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 17:06:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2018-11-14 17:06:48,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2018-11-14 17:06:48,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:48,377 INFO L225 Difference]: With dead ends: 79 [2018-11-14 17:06:48,377 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:06:48,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:06:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-14 17:06:48,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:48,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2018-11-14 17:06:48,428 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2018-11-14 17:06:48,428 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2018-11-14 17:06:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:48,432 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-14 17:06:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-14 17:06:48,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:48,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:48,435 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2018-11-14 17:06:48,435 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2018-11-14 17:06:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:48,440 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-14 17:06:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-14 17:06:48,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:48,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:48,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:48,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:06:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-14 17:06:48,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 32 [2018-11-14 17:06:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:48,446 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-14 17:06:48,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:06:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-14 17:06:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:06:48,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:48,448 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:48,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:48,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash -441871469, now seen corresponding path program 2 times [2018-11-14 17:06:48,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:48,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:48,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:48,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {817#true} call ULTIMATE.init(); {817#true} is VALID [2018-11-14 17:06:48,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {817#true} is VALID [2018-11-14 17:06:48,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {817#true} assume true; {817#true} is VALID [2018-11-14 17:06:48,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {817#true} {817#true} #91#return; {817#true} is VALID [2018-11-14 17:06:48,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {817#true} call #t~ret12 := main(); {817#true} is VALID [2018-11-14 17:06:48,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {817#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {819#(= main_~i~0 0)} is VALID [2018-11-14 17:06:48,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {819#(= main_~i~0 0)} assume true; {819#(= main_~i~0 0)} is VALID [2018-11-14 17:06:48,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {819#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {819#(= main_~i~0 0)} is VALID [2018-11-14 17:06:48,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {820#(<= main_~i~0 1)} assume true; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {820#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {820#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {821#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:48,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#(<= main_~i~0 2)} assume true; {821#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:48,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {821#(<= main_~i~0 2)} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {818#false} ~i~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {818#false} is VALID [2018-11-14 17:06:48,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {818#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {818#false} is VALID [2018-11-14 17:06:48,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {818#false} is VALID [2018-11-14 17:06:48,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {818#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {818#false} is VALID [2018-11-14 17:06:48,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {818#false} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {818#false} ~i~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {818#false} is VALID [2018-11-14 17:06:48,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {818#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {818#false} is VALID [2018-11-14 17:06:48,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {818#false} is VALID [2018-11-14 17:06:48,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {818#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {818#false} is VALID [2018-11-14 17:06:48,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {818#false} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,628 INFO L273 TraceCheckUtils]: 36: Hoare triple {818#false} havoc ~x~0;~x~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,628 INFO L273 TraceCheckUtils]: 37: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,628 INFO L273 TraceCheckUtils]: 38: Hoare triple {818#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {818#false} is VALID [2018-11-14 17:06:48,629 INFO L256 TraceCheckUtils]: 39: Hoare triple {818#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {818#false} is VALID [2018-11-14 17:06:48,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {818#false} ~cond := #in~cond; {818#false} is VALID [2018-11-14 17:06:48,629 INFO L273 TraceCheckUtils]: 41: Hoare triple {818#false} assume ~cond == 0; {818#false} is VALID [2018-11-14 17:06:48,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {818#false} assume !false; {818#false} is VALID [2018-11-14 17:06:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 17:06:48,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:48,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:48,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:06:48,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:06:48,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:48,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:48,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {817#true} call ULTIMATE.init(); {817#true} is VALID [2018-11-14 17:06:48,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {817#true} is VALID [2018-11-14 17:06:48,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {817#true} assume true; {817#true} is VALID [2018-11-14 17:06:48,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {817#true} {817#true} #91#return; {817#true} is VALID [2018-11-14 17:06:48,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {817#true} call #t~ret12 := main(); {817#true} is VALID [2018-11-14 17:06:48,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {817#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {840#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:48,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {840#(<= main_~i~0 0)} assume true; {840#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:48,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {840#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {840#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:48,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {840#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {820#(<= main_~i~0 1)} assume true; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {820#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {820#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:48,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {820#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {821#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:48,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#(<= main_~i~0 2)} assume true; {821#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:48,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {821#(<= main_~i~0 2)} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {818#false} ~i~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {818#false} is VALID [2018-11-14 17:06:48,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {818#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {818#false} is VALID [2018-11-14 17:06:48,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {818#false} is VALID [2018-11-14 17:06:48,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {818#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {818#false} is VALID [2018-11-14 17:06:48,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {818#false} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {818#false} ~i~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {818#false} is VALID [2018-11-14 17:06:48,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {818#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {818#false} is VALID [2018-11-14 17:06:48,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {818#false} assume !!(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {818#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {818#false} is VALID [2018-11-14 17:06:48,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {818#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {818#false} is VALID [2018-11-14 17:06:48,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {818#false} assume !(~i~0 < 200000); {818#false} is VALID [2018-11-14 17:06:48,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {818#false} havoc ~x~0;~x~0 := 0; {818#false} is VALID [2018-11-14 17:06:48,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {818#false} assume true; {818#false} is VALID [2018-11-14 17:06:48,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {818#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {818#false} is VALID [2018-11-14 17:06:48,926 INFO L256 TraceCheckUtils]: 39: Hoare triple {818#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {818#false} is VALID [2018-11-14 17:06:48,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {818#false} ~cond := #in~cond; {818#false} is VALID [2018-11-14 17:06:48,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {818#false} assume ~cond == 0; {818#false} is VALID [2018-11-14 17:06:48,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {818#false} assume !false; {818#false} is VALID [2018-11-14 17:06:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 17:06:48,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:48,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:06:48,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-14 17:06:48,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:48,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:06:49,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:49,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:06:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:06:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:06:49,049 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 6 states. [2018-11-14 17:06:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:49,403 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-14 17:06:49,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:06:49,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-14 17:06:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:06:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-14 17:06:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:06:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2018-11-14 17:06:49,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2018-11-14 17:06:49,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:49,568 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:06:49,568 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:06:49,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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-14 17:06:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:06:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-14 17:06:49,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:49,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 59 states. [2018-11-14 17:06:49,605 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 59 states. [2018-11-14 17:06:49,605 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 59 states. [2018-11-14 17:06:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:49,609 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-14 17:06:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-14 17:06:49,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:49,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:49,610 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 64 states. [2018-11-14 17:06:49,610 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 64 states. [2018-11-14 17:06:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:49,614 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-14 17:06:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-14 17:06:49,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:49,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:49,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:49,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:06:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-11-14 17:06:49,618 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 43 [2018-11-14 17:06:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:49,619 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-14 17:06:49,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:06:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-14 17:06:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:06:49,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:49,621 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:49,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:49,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash 836945628, now seen corresponding path program 3 times [2018-11-14 17:06:49,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:49,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:49,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:49,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-14 17:06:49,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1283#true} is VALID [2018-11-14 17:06:49,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:49,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #91#return; {1283#true} is VALID [2018-11-14 17:06:49,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret12 := main(); {1283#true} is VALID [2018-11-14 17:06:49,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1285#(= main_~i~0 0)} is VALID [2018-11-14 17:06:49,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {1285#(= main_~i~0 0)} assume true; {1285#(= main_~i~0 0)} is VALID [2018-11-14 17:06:49,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {1285#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1285#(= main_~i~0 0)} is VALID [2018-11-14 17:06:49,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:49,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 1)} assume true; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:49,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:49,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {1286#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:49,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {1287#(<= main_~i~0 2)} assume true; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:49,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {1287#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:49,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {1287#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1288#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:49,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(<= main_~i~0 3)} assume true; {1288#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:49,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {1288#(<= main_~i~0 3)} assume !(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {1284#false} ~i~0 := 0; {1284#false} is VALID [2018-11-14 17:06:49,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1284#false} is VALID [2018-11-14 17:06:49,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {1284#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1284#false} is VALID [2018-11-14 17:06:49,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,987 INFO L273 TraceCheckUtils]: 23: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1284#false} is VALID [2018-11-14 17:06:49,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {1284#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1284#false} is VALID [2018-11-14 17:06:49,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1284#false} is VALID [2018-11-14 17:06:49,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {1284#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1284#false} is VALID [2018-11-14 17:06:49,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {1284#false} assume !(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {1284#false} ~i~0 := 0; {1284#false} is VALID [2018-11-14 17:06:49,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1284#false} is VALID [2018-11-14 17:06:49,991 INFO L273 TraceCheckUtils]: 36: Hoare triple {1284#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1284#false} is VALID [2018-11-14 17:06:49,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1284#false} is VALID [2018-11-14 17:06:49,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {1284#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1284#false} is VALID [2018-11-14 17:06:49,992 INFO L273 TraceCheckUtils]: 41: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,992 INFO L273 TraceCheckUtils]: 42: Hoare triple {1284#false} assume !!(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {1284#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1284#false} is VALID [2018-11-14 17:06:49,993 INFO L273 TraceCheckUtils]: 44: Hoare triple {1284#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1284#false} is VALID [2018-11-14 17:06:49,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {1284#false} assume !(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:49,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {1284#false} havoc ~x~0;~x~0 := 0; {1284#false} is VALID [2018-11-14 17:06:49,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:49,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {1284#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1284#false} is VALID [2018-11-14 17:06:49,995 INFO L256 TraceCheckUtils]: 50: Hoare triple {1284#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1284#false} is VALID [2018-11-14 17:06:49,995 INFO L273 TraceCheckUtils]: 51: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2018-11-14 17:06:49,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {1284#false} assume ~cond == 0; {1284#false} is VALID [2018-11-14 17:06:49,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-14 17:06:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 17:06:50,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:50,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:50,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:06:50,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:06:50,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:50,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:50,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-14 17:06:50,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1283#true} is VALID [2018-11-14 17:06:50,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #91#return; {1283#true} is VALID [2018-11-14 17:06:50,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret12 := main(); {1283#true} is VALID [2018-11-14 17:06:50,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1283#true} is VALID [2018-11-14 17:06:50,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {1283#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1283#true} is VALID [2018-11-14 17:06:50,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {1283#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1283#true} is VALID [2018-11-14 17:06:50,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {1283#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1283#true} is VALID [2018-11-14 17:06:50,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {1283#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1283#true} is VALID [2018-11-14 17:06:50,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {1283#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1283#true} is VALID [2018-11-14 17:06:50,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {1283#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1283#true} is VALID [2018-11-14 17:06:50,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {1283#true} assume !(~i~0 < 200000); {1283#true} is VALID [2018-11-14 17:06:50,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {1283#true} ~i~0 := 0; {1283#true} is VALID [2018-11-14 17:06:50,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {1283#true} assume !!(~i~0 < 200000); {1283#true} is VALID [2018-11-14 17:06:50,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1283#true} is VALID [2018-11-14 17:06:50,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {1283#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1283#true} is VALID [2018-11-14 17:06:50,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {1283#true} assume !!(~i~0 < 200000); {1283#true} is VALID [2018-11-14 17:06:50,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {1283#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1283#true} is VALID [2018-11-14 17:06:50,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {1283#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1283#true} is VALID [2018-11-14 17:06:50,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-14 17:06:50,310 INFO L273 TraceCheckUtils]: 27: Hoare triple {1283#true} assume !!(~i~0 < 200000); {1373#(< main_~i~0 200000)} is VALID [2018-11-14 17:06:50,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {1373#(< main_~i~0 200000)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1373#(< main_~i~0 200000)} is VALID [2018-11-14 17:06:50,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {1373#(< main_~i~0 200000)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1380#(<= main_~i~0 200000)} is VALID [2018-11-14 17:06:50,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {1380#(<= main_~i~0 200000)} assume true; {1380#(<= main_~i~0 200000)} is VALID [2018-11-14 17:06:50,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {1380#(<= main_~i~0 200000)} assume !(~i~0 < 200000); {1283#true} is VALID [2018-11-14 17:06:50,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {1283#true} ~i~0 := 0; {1390#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:50,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {1390#(<= main_~i~0 0)} assume true; {1390#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:50,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {1390#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:50,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {1390#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1390#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:50,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {1390#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:50,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {1286#(<= main_~i~0 1)} assume true; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:50,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {1286#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:50,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {1286#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1286#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:50,347 INFO L273 TraceCheckUtils]: 40: Hoare triple {1286#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:50,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {1287#(<= main_~i~0 2)} assume true; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:50,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {1287#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:50,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {1287#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1287#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:50,354 INFO L273 TraceCheckUtils]: 44: Hoare triple {1287#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1288#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:50,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {1288#(<= main_~i~0 3)} assume true; {1288#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:50,356 INFO L273 TraceCheckUtils]: 46: Hoare triple {1288#(<= main_~i~0 3)} assume !(~i~0 < 200000); {1284#false} is VALID [2018-11-14 17:06:50,356 INFO L273 TraceCheckUtils]: 47: Hoare triple {1284#false} havoc ~x~0;~x~0 := 0; {1284#false} is VALID [2018-11-14 17:06:50,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {1284#false} assume true; {1284#false} is VALID [2018-11-14 17:06:50,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {1284#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1284#false} is VALID [2018-11-14 17:06:50,356 INFO L256 TraceCheckUtils]: 50: Hoare triple {1284#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1284#false} is VALID [2018-11-14 17:06:50,357 INFO L273 TraceCheckUtils]: 51: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2018-11-14 17:06:50,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {1284#false} assume ~cond == 0; {1284#false} is VALID [2018-11-14 17:06:50,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-14 17:06:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 17:06:50,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:50,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-11-14 17:06:50,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-14 17:06:50,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:50,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:06:50,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:50,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:06:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:06:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:06:50,456 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 9 states. [2018-11-14 17:06:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,133 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2018-11-14 17:06:51,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:06:51,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-14 17:06:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:06:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2018-11-14 17:06:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:06:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2018-11-14 17:06:51,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 126 transitions. [2018-11-14 17:06:51,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:51,442 INFO L225 Difference]: With dead ends: 123 [2018-11-14 17:06:51,442 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 17:06:51,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:06:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 17:06:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-14 17:06:51,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:51,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-14 17:06:51,516 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-14 17:06:51,516 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-14 17:06:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,520 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-11-14 17:06:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-11-14 17:06:51,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:51,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:51,521 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-14 17:06:51,521 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-14 17:06:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,524 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-11-14 17:06:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-11-14 17:06:51,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:51,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:51,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:51,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 17:06:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-11-14 17:06:51,529 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 54 [2018-11-14 17:06:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:51,529 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-14 17:06:51,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:06:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-11-14 17:06:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:06:51,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:51,531 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:51,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:51,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 903373756, now seen corresponding path program 4 times [2018-11-14 17:06:51,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:51,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:51,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:51,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:51,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1880#true} is VALID [2018-11-14 17:06:51,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {1880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1880#true} is VALID [2018-11-14 17:06:51,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 17:06:51,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #91#return; {1880#true} is VALID [2018-11-14 17:06:51,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret12 := main(); {1880#true} is VALID [2018-11-14 17:06:51,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {1880#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1882#(= main_~i~0 0)} is VALID [2018-11-14 17:06:51,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {1882#(= main_~i~0 0)} assume true; {1882#(= main_~i~0 0)} is VALID [2018-11-14 17:06:51,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {1882#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1882#(= main_~i~0 0)} is VALID [2018-11-14 17:06:51,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:51,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {1883#(<= main_~i~0 1)} assume true; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:51,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {1883#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:51,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {1883#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:51,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {1884#(<= main_~i~0 2)} assume true; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:51,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {1884#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:51,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {1884#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:51,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {1885#(<= main_~i~0 3)} assume true; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:51,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {1885#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:51,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {1885#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:51,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {1886#(<= main_~i~0 4)} assume true; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:51,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {1886#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:51,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {1886#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1887#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:51,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {1887#(<= main_~i~0 5)} assume true; {1887#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:51,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {1887#(<= main_~i~0 5)} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {1881#false} ~i~0 := 0; {1881#false} is VALID [2018-11-14 17:06:51,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:51,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:51,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:51,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:51,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:51,776 INFO L273 TraceCheckUtils]: 35: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:51,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,777 INFO L273 TraceCheckUtils]: 38: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:51,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:51,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 45: Hoare triple {1881#false} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,778 INFO L273 TraceCheckUtils]: 46: Hoare triple {1881#false} ~i~0 := 0; {1881#false} is VALID [2018-11-14 17:06:51,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:51,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:51,779 INFO L273 TraceCheckUtils]: 51: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,780 INFO L273 TraceCheckUtils]: 52: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,780 INFO L273 TraceCheckUtils]: 53: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:51,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:51,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,781 INFO L273 TraceCheckUtils]: 57: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:51,781 INFO L273 TraceCheckUtils]: 58: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:51,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,781 INFO L273 TraceCheckUtils]: 61: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:51,782 INFO L273 TraceCheckUtils]: 62: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:51,782 INFO L273 TraceCheckUtils]: 63: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,782 INFO L273 TraceCheckUtils]: 64: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:51,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:51,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {1881#false} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:51,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {1881#false} havoc ~x~0;~x~0 := 0; {1881#false} is VALID [2018-11-14 17:06:51,784 INFO L273 TraceCheckUtils]: 70: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:51,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {1881#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1881#false} is VALID [2018-11-14 17:06:51,784 INFO L256 TraceCheckUtils]: 72: Hoare triple {1881#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1881#false} is VALID [2018-11-14 17:06:51,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {1881#false} ~cond := #in~cond; {1881#false} is VALID [2018-11-14 17:06:51,785 INFO L273 TraceCheckUtils]: 74: Hoare triple {1881#false} assume ~cond == 0; {1881#false} is VALID [2018-11-14 17:06:51,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2018-11-14 17:06:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-14 17:06:51,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:51,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:06:51,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:06:51,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:51,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:52,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1880#true} is VALID [2018-11-14 17:06:52,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {1880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1880#true} is VALID [2018-11-14 17:06:52,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 17:06:52,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #91#return; {1880#true} is VALID [2018-11-14 17:06:52,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret12 := main(); {1880#true} is VALID [2018-11-14 17:06:52,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {1880#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1906#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:52,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {1906#(<= main_~i~0 0)} assume true; {1906#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:52,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {1906#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1906#(<= main_~i~0 0)} is VALID [2018-11-14 17:06:52,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {1906#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:52,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {1883#(<= main_~i~0 1)} assume true; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:52,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {1883#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1883#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:52,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {1883#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:52,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {1884#(<= main_~i~0 2)} assume true; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:52,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {1884#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1884#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:52,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {1884#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:52,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {1885#(<= main_~i~0 3)} assume true; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:52,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {1885#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1885#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:52,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {1885#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:52,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {1886#(<= main_~i~0 4)} assume true; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:52,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {1886#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {1886#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:52,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {1886#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1887#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:52,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {1887#(<= main_~i~0 5)} assume true; {1887#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:52,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {1887#(<= main_~i~0 5)} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {1881#false} ~i~0 := 0; {1881#false} is VALID [2018-11-14 17:06:52,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:52,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:52,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:52,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:52,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:52,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:52,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,129 INFO L273 TraceCheckUtils]: 37: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,130 INFO L273 TraceCheckUtils]: 38: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:52,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:52,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,130 INFO L273 TraceCheckUtils]: 42: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 43: Hoare triple {1881#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {1881#false} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {1881#false} ~i~0 := 0; {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 49: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 52: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 53: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:52,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 57: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 58: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 59: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,133 INFO L273 TraceCheckUtils]: 60: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,134 INFO L273 TraceCheckUtils]: 61: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:52,134 INFO L273 TraceCheckUtils]: 62: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:52,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {1881#false} assume !!(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {1881#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {1881#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 67: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 68: Hoare triple {1881#false} assume !(~i~0 < 200000); {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 69: Hoare triple {1881#false} havoc ~x~0;~x~0 := 0; {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 70: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 17:06:52,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {1881#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {1881#false} is VALID [2018-11-14 17:06:52,136 INFO L256 TraceCheckUtils]: 72: Hoare triple {1881#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1881#false} is VALID [2018-11-14 17:06:52,136 INFO L273 TraceCheckUtils]: 73: Hoare triple {1881#false} ~cond := #in~cond; {1881#false} is VALID [2018-11-14 17:06:52,136 INFO L273 TraceCheckUtils]: 74: Hoare triple {1881#false} assume ~cond == 0; {1881#false} is VALID [2018-11-14 17:06:52,136 INFO L273 TraceCheckUtils]: 75: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2018-11-14 17:06:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-14 17:06:52,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:06:52,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-14 17:06:52,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:52,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:06:52,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:52,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:06:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:06:52,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:06:52,277 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2018-11-14 17:06:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:52,876 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-11-14 17:06:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:06:52,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-14 17:06:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:06:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2018-11-14 17:06:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:06:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2018-11-14 17:06:52,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 143 transitions. [2018-11-14 17:06:53,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:53,159 INFO L225 Difference]: With dead ends: 155 [2018-11-14 17:06:53,159 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 17:06:53,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:06:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 17:06:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-11-14 17:06:53,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:53,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 92 states. [2018-11-14 17:06:53,203 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 92 states. [2018-11-14 17:06:53,204 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 92 states. [2018-11-14 17:06:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:53,207 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-11-14 17:06:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-11-14 17:06:53,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:53,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:53,208 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 97 states. [2018-11-14 17:06:53,208 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 97 states. [2018-11-14 17:06:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:53,211 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-11-14 17:06:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-11-14 17:06:53,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:53,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:53,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:53,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:06:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2018-11-14 17:06:53,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 76 [2018-11-14 17:06:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:53,216 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-14 17:06:53,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:06:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2018-11-14 17:06:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 17:06:53,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:53,217 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:53,217 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:53,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1639600429, now seen corresponding path program 5 times [2018-11-14 17:06:53,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:53,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:53,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:53,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {2628#true} call ULTIMATE.init(); {2628#true} is VALID [2018-11-14 17:06:53,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {2628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2628#true} is VALID [2018-11-14 17:06:53,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:06:53,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2628#true} #91#return; {2628#true} is VALID [2018-11-14 17:06:53,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {2628#true} call #t~ret12 := main(); {2628#true} is VALID [2018-11-14 17:06:53,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {2628#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2630#(= main_~i~0 0)} is VALID [2018-11-14 17:06:53,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {2630#(= main_~i~0 0)} assume true; {2630#(= main_~i~0 0)} is VALID [2018-11-14 17:06:53,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {2630#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2630#(= main_~i~0 0)} is VALID [2018-11-14 17:06:53,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {2630#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:53,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {2631#(<= main_~i~0 1)} assume true; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:53,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {2631#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:06:53,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {2631#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:53,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {2632#(<= main_~i~0 2)} assume true; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:53,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {2632#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:06:53,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {2632#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:53,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {2633#(<= main_~i~0 3)} assume true; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:53,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {2633#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:06:53,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {2633#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:53,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {2634#(<= main_~i~0 4)} assume true; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:53,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {2634#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:06:53,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {2634#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:53,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#(<= main_~i~0 5)} assume true; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:53,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:06:53,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2636#(<= main_~i~0 6)} is VALID [2018-11-14 17:06:53,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {2636#(<= main_~i~0 6)} assume true; {2636#(<= main_~i~0 6)} is VALID [2018-11-14 17:06:53,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {2636#(<= main_~i~0 6)} assume !(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {2629#false} ~i~0 := 0; {2629#false} is VALID [2018-11-14 17:06:53,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,731 INFO L273 TraceCheckUtils]: 34: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 39: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,732 INFO L273 TraceCheckUtils]: 40: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 41: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 42: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 43: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 45: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 49: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 50: Hoare triple {2629#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 51: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 52: Hoare triple {2629#false} assume !(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {2629#false} ~i~0 := 0; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 56: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 59: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 60: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 61: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,735 INFO L273 TraceCheckUtils]: 62: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,736 INFO L273 TraceCheckUtils]: 63: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,736 INFO L273 TraceCheckUtils]: 64: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,736 INFO L273 TraceCheckUtils]: 67: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,737 INFO L273 TraceCheckUtils]: 69: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,737 INFO L273 TraceCheckUtils]: 71: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,737 INFO L273 TraceCheckUtils]: 72: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,738 INFO L273 TraceCheckUtils]: 74: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,738 INFO L273 TraceCheckUtils]: 75: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,738 INFO L273 TraceCheckUtils]: 76: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:06:53,738 INFO L273 TraceCheckUtils]: 77: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:06:53,739 INFO L273 TraceCheckUtils]: 78: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,739 INFO L273 TraceCheckUtils]: 79: Hoare triple {2629#false} assume !(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:06:53,739 INFO L273 TraceCheckUtils]: 80: Hoare triple {2629#false} havoc ~x~0;~x~0 := 0; {2629#false} is VALID [2018-11-14 17:06:53,739 INFO L273 TraceCheckUtils]: 81: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:06:53,739 INFO L273 TraceCheckUtils]: 82: Hoare triple {2629#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2629#false} is VALID [2018-11-14 17:06:53,740 INFO L256 TraceCheckUtils]: 83: Hoare triple {2629#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2629#false} is VALID [2018-11-14 17:06:53,740 INFO L273 TraceCheckUtils]: 84: Hoare triple {2629#false} ~cond := #in~cond; {2629#false} is VALID [2018-11-14 17:06:53,740 INFO L273 TraceCheckUtils]: 85: Hoare triple {2629#false} assume ~cond == 0; {2629#false} is VALID [2018-11-14 17:06:53,740 INFO L273 TraceCheckUtils]: 86: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2018-11-14 17:06:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-14 17:06:53,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:53,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:53,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:21,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 17:07:21,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:21,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:21,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {2628#true} call ULTIMATE.init(); {2628#true} is VALID [2018-11-14 17:07:21,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {2628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2628#true} is VALID [2018-11-14 17:07:21,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2628#true} {2628#true} #91#return; {2628#true} is VALID [2018-11-14 17:07:21,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {2628#true} call #t~ret12 := main(); {2628#true} is VALID [2018-11-14 17:07:21,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {2628#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2628#true} is VALID [2018-11-14 17:07:21,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {2628#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {2628#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2628#true} is VALID [2018-11-14 17:07:21,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {2628#true} assume true; {2628#true} is VALID [2018-11-14 17:07:21,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {2628#true} assume !(~i~0 < 200000); {2628#true} is VALID [2018-11-14 17:07:21,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {2628#true} ~i~0 := 0; {2718#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:21,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {2718#(<= main_~i~0 0)} assume true; {2718#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:21,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {2718#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {2718#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:21,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {2718#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2718#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:21,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {2718#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:21,489 INFO L273 TraceCheckUtils]: 31: Hoare triple {2631#(<= main_~i~0 1)} assume true; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:21,489 INFO L273 TraceCheckUtils]: 32: Hoare triple {2631#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:21,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {2631#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2631#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:21,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {2631#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:21,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {2632#(<= main_~i~0 2)} assume true; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:21,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {2632#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:21,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {2632#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2632#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:21,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {2632#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:21,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {2633#(<= main_~i~0 3)} assume true; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:21,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {2633#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:21,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {2633#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2633#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:21,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {2633#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:21,513 INFO L273 TraceCheckUtils]: 43: Hoare triple {2634#(<= main_~i~0 4)} assume true; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:21,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {2634#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:21,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {2634#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2634#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:21,515 INFO L273 TraceCheckUtils]: 46: Hoare triple {2634#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:21,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {2635#(<= main_~i~0 5)} assume true; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:21,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {2635#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:21,517 INFO L273 TraceCheckUtils]: 49: Hoare triple {2635#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {2635#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:21,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {2636#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:21,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#(<= main_~i~0 6)} assume true; {2636#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:21,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#(<= main_~i~0 6)} assume !(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {2629#false} ~i~0 := 0; {2629#false} is VALID [2018-11-14 17:07:21,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,520 INFO L273 TraceCheckUtils]: 56: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,520 INFO L273 TraceCheckUtils]: 60: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,521 INFO L273 TraceCheckUtils]: 63: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,521 INFO L273 TraceCheckUtils]: 64: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,521 INFO L273 TraceCheckUtils]: 65: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,522 INFO L273 TraceCheckUtils]: 66: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,522 INFO L273 TraceCheckUtils]: 67: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,522 INFO L273 TraceCheckUtils]: 68: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,522 INFO L273 TraceCheckUtils]: 69: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,522 INFO L273 TraceCheckUtils]: 70: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,523 INFO L273 TraceCheckUtils]: 74: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,523 INFO L273 TraceCheckUtils]: 75: Hoare triple {2629#false} assume !!(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 76: Hoare triple {2629#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {2629#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 78: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 79: Hoare triple {2629#false} assume !(~i~0 < 200000); {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 80: Hoare triple {2629#false} havoc ~x~0;~x~0 := 0; {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 81: Hoare triple {2629#false} assume true; {2629#false} is VALID [2018-11-14 17:07:21,524 INFO L273 TraceCheckUtils]: 82: Hoare triple {2629#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {2629#false} is VALID [2018-11-14 17:07:21,525 INFO L256 TraceCheckUtils]: 83: Hoare triple {2629#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2629#false} is VALID [2018-11-14 17:07:21,525 INFO L273 TraceCheckUtils]: 84: Hoare triple {2629#false} ~cond := #in~cond; {2629#false} is VALID [2018-11-14 17:07:21,525 INFO L273 TraceCheckUtils]: 85: Hoare triple {2629#false} assume ~cond == 0; {2629#false} is VALID [2018-11-14 17:07:21,525 INFO L273 TraceCheckUtils]: 86: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2018-11-14 17:07:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-14 17:07:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 17:07:21,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-11-14 17:07:21,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:21,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:07:21,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:21,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:07:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:07:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:07:21,725 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand 10 states. [2018-11-14 17:07:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,190 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2018-11-14 17:07:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:07:22,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-11-14 17:07:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:07:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-14 17:07:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:07:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-14 17:07:22,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2018-11-14 17:07:22,360 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-14 17:07:22,363 INFO L225 Difference]: With dead ends: 174 [2018-11-14 17:07:22,363 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 17:07:22,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:07:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 17:07:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2018-11-14 17:07:22,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:22,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 103 states. [2018-11-14 17:07:22,402 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 103 states. [2018-11-14 17:07:22,402 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 103 states. [2018-11-14 17:07:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,405 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2018-11-14 17:07:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2018-11-14 17:07:22,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:22,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:22,406 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 108 states. [2018-11-14 17:07:22,406 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 108 states. [2018-11-14 17:07:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,409 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2018-11-14 17:07:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2018-11-14 17:07:22,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:22,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:22,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:22,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 17:07:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2018-11-14 17:07:22,412 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 87 [2018-11-14 17:07:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:22,413 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2018-11-14 17:07:22,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:07:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2018-11-14 17:07:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-14 17:07:22,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:22,414 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:22,415 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:22,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2009209700, now seen corresponding path program 6 times [2018-11-14 17:07:22,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:22,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:22,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:22,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:22,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {3470#true} call ULTIMATE.init(); {3470#true} is VALID [2018-11-14 17:07:22,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {3470#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3470#true} is VALID [2018-11-14 17:07:22,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:22,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3470#true} {3470#true} #91#return; {3470#true} is VALID [2018-11-14 17:07:22,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {3470#true} call #t~ret12 := main(); {3470#true} is VALID [2018-11-14 17:07:22,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {3470#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {3472#(= main_~i~0 0)} is VALID [2018-11-14 17:07:22,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {3472#(= main_~i~0 0)} assume true; {3472#(= main_~i~0 0)} is VALID [2018-11-14 17:07:22,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {3472#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3472#(= main_~i~0 0)} is VALID [2018-11-14 17:07:22,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {3472#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:22,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {3473#(<= main_~i~0 1)} assume true; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:22,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {3473#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:22,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {3473#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:22,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {3474#(<= main_~i~0 2)} assume true; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:22,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {3474#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:22,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {3474#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:22,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {3475#(<= main_~i~0 3)} assume true; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:22,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {3475#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:22,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {3475#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:22,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {3476#(<= main_~i~0 4)} assume true; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:22,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {3476#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:22,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {3476#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:22,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {3477#(<= main_~i~0 5)} assume true; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:22,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {3477#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:22,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {3477#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:22,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {3478#(<= main_~i~0 6)} assume true; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:22,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {3478#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:22,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {3478#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3479#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:22,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {3479#(<= main_~i~0 7)} assume true; {3479#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:22,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {3479#(<= main_~i~0 7)} assume !(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#false} ~i~0 := 0; {3471#false} is VALID [2018-11-14 17:07:22,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,721 INFO L273 TraceCheckUtils]: 53: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,721 INFO L273 TraceCheckUtils]: 54: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {3471#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {3471#false} assume !(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,722 INFO L273 TraceCheckUtils]: 60: Hoare triple {3471#false} ~i~0 := 0; {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 62: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 63: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 64: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 65: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,723 INFO L273 TraceCheckUtils]: 66: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 67: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 68: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 69: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 70: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 71: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,724 INFO L273 TraceCheckUtils]: 72: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,725 INFO L273 TraceCheckUtils]: 73: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,725 INFO L273 TraceCheckUtils]: 74: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,725 INFO L273 TraceCheckUtils]: 75: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,725 INFO L273 TraceCheckUtils]: 76: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,725 INFO L273 TraceCheckUtils]: 77: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 78: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 79: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 81: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 84: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {3471#false} assume !!(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 87: Hoare triple {3471#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 88: Hoare triple {3471#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3471#false} is VALID [2018-11-14 17:07:22,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,728 INFO L273 TraceCheckUtils]: 90: Hoare triple {3471#false} assume !(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:22,728 INFO L273 TraceCheckUtils]: 91: Hoare triple {3471#false} havoc ~x~0;~x~0 := 0; {3471#false} is VALID [2018-11-14 17:07:22,728 INFO L273 TraceCheckUtils]: 92: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:22,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {3471#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3471#false} is VALID [2018-11-14 17:07:22,728 INFO L256 TraceCheckUtils]: 94: Hoare triple {3471#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3471#false} is VALID [2018-11-14 17:07:22,729 INFO L273 TraceCheckUtils]: 95: Hoare triple {3471#false} ~cond := #in~cond; {3471#false} is VALID [2018-11-14 17:07:22,729 INFO L273 TraceCheckUtils]: 96: Hoare triple {3471#false} assume ~cond == 0; {3471#false} is VALID [2018-11-14 17:07:22,729 INFO L273 TraceCheckUtils]: 97: Hoare triple {3471#false} assume !false; {3471#false} is VALID [2018-11-14 17:07:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-14 17:07:22,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:22,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:22,750 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:27,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-14 17:07:27,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:27,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:27,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {3470#true} call ULTIMATE.init(); {3470#true} is VALID [2018-11-14 17:07:27,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {3470#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3470#true} is VALID [2018-11-14 17:07:27,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3470#true} {3470#true} #91#return; {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {3470#true} call #t~ret12 := main(); {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {3470#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {3470#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {3470#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {3470#true} assume !(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {3470#true} ~i~0 := 0; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 34: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 43: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 44: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,589 INFO L273 TraceCheckUtils]: 45: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 46: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 47: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 52: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,590 INFO L273 TraceCheckUtils]: 53: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 55: Hoare triple {3470#true} assume !!(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 56: Hoare triple {3470#true} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 57: Hoare triple {3470#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 58: Hoare triple {3470#true} assume true; {3470#true} is VALID [2018-11-14 17:07:27,591 INFO L273 TraceCheckUtils]: 59: Hoare triple {3470#true} assume !(~i~0 < 200000); {3470#true} is VALID [2018-11-14 17:07:27,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {3470#true} ~i~0 := 0; {3663#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:27,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {3663#(<= main_~i~0 0)} assume true; {3663#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:27,632 INFO L273 TraceCheckUtils]: 62: Hoare triple {3663#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {3663#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:27,640 INFO L273 TraceCheckUtils]: 63: Hoare triple {3663#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3663#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:27,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {3663#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:27,664 INFO L273 TraceCheckUtils]: 65: Hoare triple {3473#(<= main_~i~0 1)} assume true; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:27,677 INFO L273 TraceCheckUtils]: 66: Hoare triple {3473#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:27,685 INFO L273 TraceCheckUtils]: 67: Hoare triple {3473#(<= main_~i~0 1)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3473#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:27,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {3473#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:27,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {3474#(<= main_~i~0 2)} assume true; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:27,699 INFO L273 TraceCheckUtils]: 70: Hoare triple {3474#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:27,699 INFO L273 TraceCheckUtils]: 71: Hoare triple {3474#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3474#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:27,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {3474#(<= main_~i~0 2)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:27,702 INFO L273 TraceCheckUtils]: 73: Hoare triple {3475#(<= main_~i~0 3)} assume true; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:27,705 INFO L273 TraceCheckUtils]: 74: Hoare triple {3475#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:27,705 INFO L273 TraceCheckUtils]: 75: Hoare triple {3475#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3475#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:27,705 INFO L273 TraceCheckUtils]: 76: Hoare triple {3475#(<= main_~i~0 3)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:27,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {3476#(<= main_~i~0 4)} assume true; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:27,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {3476#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:27,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {3476#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3476#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:27,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {3476#(<= main_~i~0 4)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:27,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {3477#(<= main_~i~0 5)} assume true; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:27,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {3477#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:27,708 INFO L273 TraceCheckUtils]: 83: Hoare triple {3477#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3477#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:27,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {3477#(<= main_~i~0 5)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:27,709 INFO L273 TraceCheckUtils]: 85: Hoare triple {3478#(<= main_~i~0 6)} assume true; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:27,709 INFO L273 TraceCheckUtils]: 86: Hoare triple {3478#(<= main_~i~0 6)} assume !!(~i~0 < 200000); {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:27,710 INFO L273 TraceCheckUtils]: 87: Hoare triple {3478#(<= main_~i~0 6)} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {3478#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:27,710 INFO L273 TraceCheckUtils]: 88: Hoare triple {3478#(<= main_~i~0 6)} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {3479#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:27,711 INFO L273 TraceCheckUtils]: 89: Hoare triple {3479#(<= main_~i~0 7)} assume true; {3479#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:27,711 INFO L273 TraceCheckUtils]: 90: Hoare triple {3479#(<= main_~i~0 7)} assume !(~i~0 < 200000); {3471#false} is VALID [2018-11-14 17:07:27,712 INFO L273 TraceCheckUtils]: 91: Hoare triple {3471#false} havoc ~x~0;~x~0 := 0; {3471#false} is VALID [2018-11-14 17:07:27,712 INFO L273 TraceCheckUtils]: 92: Hoare triple {3471#false} assume true; {3471#false} is VALID [2018-11-14 17:07:27,712 INFO L273 TraceCheckUtils]: 93: Hoare triple {3471#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {3471#false} is VALID [2018-11-14 17:07:27,712 INFO L256 TraceCheckUtils]: 94: Hoare triple {3471#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3471#false} is VALID [2018-11-14 17:07:27,712 INFO L273 TraceCheckUtils]: 95: Hoare triple {3471#false} ~cond := #in~cond; {3471#false} is VALID [2018-11-14 17:07:27,713 INFO L273 TraceCheckUtils]: 96: Hoare triple {3471#false} assume ~cond == 0; {3471#false} is VALID [2018-11-14 17:07:27,713 INFO L273 TraceCheckUtils]: 97: Hoare triple {3471#false} assume !false; {3471#false} is VALID [2018-11-14 17:07:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-14 17:07:27,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:27,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:07:27,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-14 17:07:27,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:27,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:27,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:27,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:27,824 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 11 states. [2018-11-14 17:07:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,395 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2018-11-14 17:07:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:07:28,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-14 17:07:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2018-11-14 17:07:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2018-11-14 17:07:28,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 169 transitions. [2018-11-14 17:07:28,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:28,574 INFO L225 Difference]: With dead ends: 193 [2018-11-14 17:07:28,574 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 17:07:28,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 17:07:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-11-14 17:07:28,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:28,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 114 states. [2018-11-14 17:07:28,611 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 114 states. [2018-11-14 17:07:28,611 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 114 states. [2018-11-14 17:07:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,615 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-11-14 17:07:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-11-14 17:07:28,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,616 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 119 states. [2018-11-14 17:07:28,616 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 119 states. [2018-11-14 17:07:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,619 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-11-14 17:07:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-11-14 17:07:28,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:28,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 17:07:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-11-14 17:07:28,623 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 98 [2018-11-14 17:07:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:28,624 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-11-14 17:07:28,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-11-14 17:07:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:07:28,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:28,625 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:28,625 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:28,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash 290093683, now seen corresponding path program 7 times [2018-11-14 17:07:28,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {4406#true} call ULTIMATE.init(); {4406#true} is VALID [2018-11-14 17:07:29,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {4406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4406#true} is VALID [2018-11-14 17:07:29,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {4406#true} assume true; {4406#true} is VALID [2018-11-14 17:07:29,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4406#true} {4406#true} #91#return; {4406#true} is VALID [2018-11-14 17:07:29,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {4406#true} call #t~ret12 := main(); {4406#true} is VALID [2018-11-14 17:07:29,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {4406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4408#(= main_~i~0 0)} is VALID [2018-11-14 17:07:29,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {4408#(= main_~i~0 0)} assume true; {4408#(= main_~i~0 0)} is VALID [2018-11-14 17:07:29,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {4408#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4408#(= main_~i~0 0)} is VALID [2018-11-14 17:07:29,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {4408#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:29,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {4409#(<= main_~i~0 1)} assume true; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:29,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {4409#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:29,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {4409#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:29,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {4410#(<= main_~i~0 2)} assume true; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:29,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {4410#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:29,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {4410#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:29,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {4411#(<= main_~i~0 3)} assume true; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:29,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {4411#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:29,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {4411#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:29,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {4412#(<= main_~i~0 4)} assume true; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:29,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {4412#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:29,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {4412#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:29,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {4413#(<= main_~i~0 5)} assume true; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:29,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {4413#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:29,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {4413#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:29,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#(<= main_~i~0 6)} assume true; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:29,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:29,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:29,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {4415#(<= main_~i~0 7)} assume true; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:29,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {4415#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:29,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {4415#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4416#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:29,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {4416#(<= main_~i~0 8)} assume true; {4416#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:29,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {4416#(<= main_~i~0 8)} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {4407#false} ~i~0 := 0; {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 38: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 41: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 43: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 44: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 56: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 63: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:29,370 INFO L273 TraceCheckUtils]: 64: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:29,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {4407#false} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {4407#false} ~i~0 := 0; {4407#false} is VALID [2018-11-14 17:07:29,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,372 INFO L273 TraceCheckUtils]: 69: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,372 INFO L273 TraceCheckUtils]: 70: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,372 INFO L273 TraceCheckUtils]: 71: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,372 INFO L273 TraceCheckUtils]: 72: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,372 INFO L273 TraceCheckUtils]: 73: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 74: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 75: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 76: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 77: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,373 INFO L273 TraceCheckUtils]: 78: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,374 INFO L273 TraceCheckUtils]: 79: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,374 INFO L273 TraceCheckUtils]: 80: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,374 INFO L273 TraceCheckUtils]: 82: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,374 INFO L273 TraceCheckUtils]: 83: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,375 INFO L273 TraceCheckUtils]: 84: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,375 INFO L273 TraceCheckUtils]: 85: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,375 INFO L273 TraceCheckUtils]: 86: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,375 INFO L273 TraceCheckUtils]: 87: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,376 INFO L273 TraceCheckUtils]: 88: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,376 INFO L273 TraceCheckUtils]: 89: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,376 INFO L273 TraceCheckUtils]: 90: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,376 INFO L273 TraceCheckUtils]: 91: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,376 INFO L273 TraceCheckUtils]: 92: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,377 INFO L273 TraceCheckUtils]: 93: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,377 INFO L273 TraceCheckUtils]: 94: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,377 INFO L273 TraceCheckUtils]: 95: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,377 INFO L273 TraceCheckUtils]: 96: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,377 INFO L273 TraceCheckUtils]: 97: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 98: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 99: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 100: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 101: Hoare triple {4407#false} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:29,378 INFO L273 TraceCheckUtils]: 102: Hoare triple {4407#false} havoc ~x~0;~x~0 := 0; {4407#false} is VALID [2018-11-14 17:07:29,379 INFO L273 TraceCheckUtils]: 103: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:29,379 INFO L273 TraceCheckUtils]: 104: Hoare triple {4407#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {4407#false} is VALID [2018-11-14 17:07:29,379 INFO L256 TraceCheckUtils]: 105: Hoare triple {4407#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4407#false} is VALID [2018-11-14 17:07:29,379 INFO L273 TraceCheckUtils]: 106: Hoare triple {4407#false} ~cond := #in~cond; {4407#false} is VALID [2018-11-14 17:07:29,379 INFO L273 TraceCheckUtils]: 107: Hoare triple {4407#false} assume ~cond == 0; {4407#false} is VALID [2018-11-14 17:07:29,380 INFO L273 TraceCheckUtils]: 108: Hoare triple {4407#false} assume !false; {4407#false} is VALID [2018-11-14 17:07:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-14 17:07:29,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:29,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:29,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:29,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {4406#true} call ULTIMATE.init(); {4406#true} is VALID [2018-11-14 17:07:29,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {4406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4406#true} is VALID [2018-11-14 17:07:29,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {4406#true} assume true; {4406#true} is VALID [2018-11-14 17:07:29,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4406#true} {4406#true} #91#return; {4406#true} is VALID [2018-11-14 17:07:29,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {4406#true} call #t~ret12 := main(); {4406#true} is VALID [2018-11-14 17:07:29,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {4406#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {4435#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:29,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {4435#(<= main_~i~0 0)} assume true; {4435#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:29,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {4435#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4435#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:29,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {4435#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {4409#(<= main_~i~0 1)} assume true; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {4409#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4409#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {4409#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {4410#(<= main_~i~0 2)} assume true; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:30,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {4410#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4410#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:30,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {4410#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:30,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {4411#(<= main_~i~0 3)} assume true; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:30,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {4411#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4411#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:30,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {4411#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:30,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {4412#(<= main_~i~0 4)} assume true; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:30,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {4412#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4412#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:30,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {4412#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:30,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {4413#(<= main_~i~0 5)} assume true; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:30,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {4413#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4413#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {4413#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#(<= main_~i~0 6)} assume true; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4414#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {4415#(<= main_~i~0 7)} assume true; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {4415#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {4415#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {4415#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4416#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {4416#(<= main_~i~0 8)} assume true; {4416#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {4416#(<= main_~i~0 8)} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {4407#false} ~i~0 := 0; {4407#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 33: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 35: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 46: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 54: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,036 INFO L273 TraceCheckUtils]: 58: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 59: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 60: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 63: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 64: Hoare triple {4407#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 65: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 66: Hoare triple {4407#false} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,037 INFO L273 TraceCheckUtils]: 67: Hoare triple {4407#false} ~i~0 := 0; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 68: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 69: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 72: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,038 INFO L273 TraceCheckUtils]: 75: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 76: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 77: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 78: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 79: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 80: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 81: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 82: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,039 INFO L273 TraceCheckUtils]: 84: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 86: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 87: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 88: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 89: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 90: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 91: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,040 INFO L273 TraceCheckUtils]: 92: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 93: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 94: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 95: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 96: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 97: Hoare triple {4407#false} assume !!(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {4407#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 99: Hoare triple {4407#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {4407#false} is VALID [2018-11-14 17:07:30,041 INFO L273 TraceCheckUtils]: 100: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 101: Hoare triple {4407#false} assume !(~i~0 < 200000); {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 102: Hoare triple {4407#false} havoc ~x~0;~x~0 := 0; {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 103: Hoare triple {4407#false} assume true; {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {4407#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L256 TraceCheckUtils]: 105: Hoare triple {4407#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 106: Hoare triple {4407#false} ~cond := #in~cond; {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 107: Hoare triple {4407#false} assume ~cond == 0; {4407#false} is VALID [2018-11-14 17:07:30,042 INFO L273 TraceCheckUtils]: 108: Hoare triple {4407#false} assume !false; {4407#false} is VALID [2018-11-14 17:07:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-14 17:07:30,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:30,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:07:30,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-11-14 17:07:30,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:30,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:07:30,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:30,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:07:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:07:30,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:30,127 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 12 states. [2018-11-14 17:07:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,045 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2018-11-14 17:07:31,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:31,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-11-14 17:07:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2018-11-14 17:07:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2018-11-14 17:07:31,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2018-11-14 17:07:31,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:31,280 INFO L225 Difference]: With dead ends: 212 [2018-11-14 17:07:31,280 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 17:07:31,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 17:07:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-11-14 17:07:31,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:31,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 125 states. [2018-11-14 17:07:31,332 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 125 states. [2018-11-14 17:07:31,332 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 125 states. [2018-11-14 17:07:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,336 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2018-11-14 17:07:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2018-11-14 17:07:31,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,337 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 130 states. [2018-11-14 17:07:31,337 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 130 states. [2018-11-14 17:07:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,340 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2018-11-14 17:07:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2018-11-14 17:07:31,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:31,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 17:07:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-14 17:07:31,344 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 109 [2018-11-14 17:07:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:31,344 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-14 17:07:31,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:07:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-14 17:07:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 17:07:31,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:31,346 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:31,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:31,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1331082884, now seen corresponding path program 8 times [2018-11-14 17:07:31,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:31,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {5436#true} call ULTIMATE.init(); {5436#true} is VALID [2018-11-14 17:07:31,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {5436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5436#true} is VALID [2018-11-14 17:07:31,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {5436#true} assume true; {5436#true} is VALID [2018-11-14 17:07:31,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5436#true} {5436#true} #91#return; {5436#true} is VALID [2018-11-14 17:07:31,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {5436#true} call #t~ret12 := main(); {5436#true} is VALID [2018-11-14 17:07:31,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {5436#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5438#(= main_~i~0 0)} is VALID [2018-11-14 17:07:31,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {5438#(= main_~i~0 0)} assume true; {5438#(= main_~i~0 0)} is VALID [2018-11-14 17:07:31,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {5438#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5438#(= main_~i~0 0)} is VALID [2018-11-14 17:07:31,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {5438#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:31,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {5439#(<= main_~i~0 1)} assume true; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:31,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {5439#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:31,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {5439#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:31,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {5440#(<= main_~i~0 2)} assume true; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:31,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {5440#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:31,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {5440#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:31,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {5441#(<= main_~i~0 3)} assume true; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:31,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {5441#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:31,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {5441#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:31,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {5442#(<= main_~i~0 4)} assume true; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:31,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {5442#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:31,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {5442#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:31,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {5443#(<= main_~i~0 5)} assume true; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:31,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {5443#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:31,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {5443#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:31,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {5444#(<= main_~i~0 6)} assume true; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:31,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {5444#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:31,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {5444#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:31,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {5445#(<= main_~i~0 7)} assume true; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:31,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {5445#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:31,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {5445#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:31,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {5446#(<= main_~i~0 8)} assume true; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:31,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {5446#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:31,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {5446#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5447#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:31,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {5447#(<= main_~i~0 9)} assume true; {5447#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:31,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {5447#(<= main_~i~0 9)} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {5437#false} ~i~0 := 0; {5437#false} is VALID [2018-11-14 17:07:31,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 68: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {5437#false} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {5437#false} ~i~0 := 0; {5437#false} is VALID [2018-11-14 17:07:31,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 76: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 84: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 85: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 103: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,724 INFO L273 TraceCheckUtils]: 108: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 109: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 110: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 111: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 112: Hoare triple {5437#false} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {5437#false} havoc ~x~0;~x~0 := 0; {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L273 TraceCheckUtils]: 115: Hoare triple {5437#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {5437#false} is VALID [2018-11-14 17:07:31,725 INFO L256 TraceCheckUtils]: 116: Hoare triple {5437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5437#false} is VALID [2018-11-14 17:07:31,726 INFO L273 TraceCheckUtils]: 117: Hoare triple {5437#false} ~cond := #in~cond; {5437#false} is VALID [2018-11-14 17:07:31,726 INFO L273 TraceCheckUtils]: 118: Hoare triple {5437#false} assume ~cond == 0; {5437#false} is VALID [2018-11-14 17:07:31,726 INFO L273 TraceCheckUtils]: 119: Hoare triple {5437#false} assume !false; {5437#false} is VALID [2018-11-14 17:07:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-14 17:07:31,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:31,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:31,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:31,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:31,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {5436#true} call ULTIMATE.init(); {5436#true} is VALID [2018-11-14 17:07:31,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {5436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5436#true} is VALID [2018-11-14 17:07:31,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {5436#true} assume true; {5436#true} is VALID [2018-11-14 17:07:31,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5436#true} {5436#true} #91#return; {5436#true} is VALID [2018-11-14 17:07:31,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {5436#true} call #t~ret12 := main(); {5436#true} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {5436#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5466#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:31,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {5466#(<= main_~i~0 0)} assume true; {5466#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:32,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {5466#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5466#(<= main_~i~0 0)} is VALID [2018-11-14 17:07:32,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:32,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {5439#(<= main_~i~0 1)} assume true; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:32,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {5439#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5439#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:32,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {5439#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:32,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {5440#(<= main_~i~0 2)} assume true; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:32,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {5440#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5440#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:32,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {5440#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:32,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {5441#(<= main_~i~0 3)} assume true; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:32,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {5441#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5441#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:32,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {5441#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:32,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {5442#(<= main_~i~0 4)} assume true; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:32,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {5442#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5442#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:32,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {5442#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:32,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {5443#(<= main_~i~0 5)} assume true; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:32,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {5443#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5443#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:32,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {5443#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:32,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {5444#(<= main_~i~0 6)} assume true; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:32,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {5444#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5444#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:32,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {5444#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:32,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {5445#(<= main_~i~0 7)} assume true; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:32,111 INFO L273 TraceCheckUtils]: 28: Hoare triple {5445#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5445#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:32,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {5445#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:32,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {5446#(<= main_~i~0 8)} assume true; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:32,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {5446#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {5446#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:32,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {5446#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5447#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:32,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {5447#(<= main_~i~0 9)} assume true; {5447#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:32,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {5447#(<= main_~i~0 9)} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {5437#false} ~i~0 := 0; {5437#false} is VALID [2018-11-14 17:07:32,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 56: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 57: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 58: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 60: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 66: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,121 INFO L273 TraceCheckUtils]: 67: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 68: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 71: Hoare triple {5437#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 72: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {5437#false} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 74: Hoare triple {5437#false} ~i~0 := 0; {5437#false} is VALID [2018-11-14 17:07:32,122 INFO L273 TraceCheckUtils]: 75: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 76: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 77: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 78: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 79: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 80: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 81: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 82: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 83: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,123 INFO L273 TraceCheckUtils]: 84: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 85: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 86: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 87: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 88: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 89: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 90: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 91: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,124 INFO L273 TraceCheckUtils]: 92: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 93: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 94: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 96: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 97: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 98: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 99: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 100: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,125 INFO L273 TraceCheckUtils]: 101: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 102: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 103: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 104: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 105: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 106: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 107: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 108: Hoare triple {5437#false} assume !!(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,126 INFO L273 TraceCheckUtils]: 109: Hoare triple {5437#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 110: Hoare triple {5437#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 111: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 112: Hoare triple {5437#false} assume !(~i~0 < 200000); {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 113: Hoare triple {5437#false} havoc ~x~0;~x~0 := 0; {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 114: Hoare triple {5437#false} assume true; {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 115: Hoare triple {5437#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L256 TraceCheckUtils]: 116: Hoare triple {5437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5437#false} is VALID [2018-11-14 17:07:32,127 INFO L273 TraceCheckUtils]: 117: Hoare triple {5437#false} ~cond := #in~cond; {5437#false} is VALID [2018-11-14 17:07:32,128 INFO L273 TraceCheckUtils]: 118: Hoare triple {5437#false} assume ~cond == 0; {5437#false} is VALID [2018-11-14 17:07:32,128 INFO L273 TraceCheckUtils]: 119: Hoare triple {5437#false} assume !false; {5437#false} is VALID [2018-11-14 17:07:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-14 17:07:32,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:07:32,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 120 [2018-11-14 17:07:32,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:32,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:07:32,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:32,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:07:32,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:07:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:07:32,211 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 13 states. [2018-11-14 17:07:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:32,755 INFO L93 Difference]: Finished difference Result 231 states and 279 transitions. [2018-11-14 17:07:32,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:07:32,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 120 [2018-11-14 17:07:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:07:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2018-11-14 17:07:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:07:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 195 transitions. [2018-11-14 17:07:32,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 195 transitions. [2018-11-14 17:07:33,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:33,012 INFO L225 Difference]: With dead ends: 231 [2018-11-14 17:07:33,012 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 17:07:33,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:07:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 17:07:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2018-11-14 17:07:33,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:33,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 136 states. [2018-11-14 17:07:33,442 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 136 states. [2018-11-14 17:07:33,442 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 136 states. [2018-11-14 17:07:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,446 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2018-11-14 17:07:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 166 transitions. [2018-11-14 17:07:33,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,447 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 141 states. [2018-11-14 17:07:33,447 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 141 states. [2018-11-14 17:07:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,450 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2018-11-14 17:07:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 166 transitions. [2018-11-14 17:07:33,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:33,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-14 17:07:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2018-11-14 17:07:33,454 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 120 [2018-11-14 17:07:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:33,455 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2018-11-14 17:07:33,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:07:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2018-11-14 17:07:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-14 17:07:33,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:33,456 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:33,457 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:33,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1503730195, now seen corresponding path program 9 times [2018-11-14 17:07:33,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:33,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:33,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {6560#true} call ULTIMATE.init(); {6560#true} is VALID [2018-11-14 17:07:33,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {6560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6560#true} is VALID [2018-11-14 17:07:33,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {6560#true} assume true; {6560#true} is VALID [2018-11-14 17:07:33,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6560#true} {6560#true} #91#return; {6560#true} is VALID [2018-11-14 17:07:33,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {6560#true} call #t~ret12 := main(); {6560#true} is VALID [2018-11-14 17:07:33,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {6560#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {6562#(= main_~i~0 0)} is VALID [2018-11-14 17:07:33,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {6562#(= main_~i~0 0)} assume true; {6562#(= main_~i~0 0)} is VALID [2018-11-14 17:07:33,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {6562#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6562#(= main_~i~0 0)} is VALID [2018-11-14 17:07:33,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {6562#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:33,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {6563#(<= main_~i~0 1)} assume true; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:33,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {6563#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:07:33,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {6563#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:33,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {6564#(<= main_~i~0 2)} assume true; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:33,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {6564#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:07:33,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {6564#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:33,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {6565#(<= main_~i~0 3)} assume true; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:33,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {6565#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:07:33,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {6565#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:33,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {6566#(<= main_~i~0 4)} assume true; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:33,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {6566#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:07:33,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {6566#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:33,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {6567#(<= main_~i~0 5)} assume true; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:33,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {6567#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:07:33,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {6567#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:33,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {6568#(<= main_~i~0 6)} assume true; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:33,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {6568#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:07:33,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {6568#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:33,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {6569#(<= main_~i~0 7)} assume true; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:33,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {6569#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:07:33,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {6569#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:33,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {6570#(<= main_~i~0 8)} assume true; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:33,695 INFO L273 TraceCheckUtils]: 31: Hoare triple {6570#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:07:33,696 INFO L273 TraceCheckUtils]: 32: Hoare triple {6570#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:33,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {6571#(<= main_~i~0 9)} assume true; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:33,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {6571#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:07:33,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {6571#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6572#(<= main_~i~0 10)} is VALID [2018-11-14 17:07:33,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {6572#(<= main_~i~0 10)} assume true; {6572#(<= main_~i~0 10)} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {6572#(<= main_~i~0 10)} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {6561#false} ~i~0 := 0; {6561#false} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,704 INFO L273 TraceCheckUtils]: 42: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 48: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 49: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 52: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 63: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 65: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 66: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,707 INFO L273 TraceCheckUtils]: 67: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,708 INFO L273 TraceCheckUtils]: 70: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,708 INFO L273 TraceCheckUtils]: 72: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 74: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 75: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 76: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 77: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:07:33,709 INFO L273 TraceCheckUtils]: 78: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 79: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 80: Hoare triple {6561#false} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 81: Hoare triple {6561#false} ~i~0 := 0; {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 82: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 83: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,710 INFO L273 TraceCheckUtils]: 84: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 85: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 86: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 88: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 89: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,711 INFO L273 TraceCheckUtils]: 90: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 91: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 92: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 93: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 94: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 95: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,712 INFO L273 TraceCheckUtils]: 96: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 97: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 98: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 99: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 100: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 101: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,713 INFO L273 TraceCheckUtils]: 102: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 103: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 104: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 105: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 106: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 107: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,714 INFO L273 TraceCheckUtils]: 108: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 109: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 110: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 111: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 112: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 113: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,715 INFO L273 TraceCheckUtils]: 114: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 115: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 116: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 117: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 118: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 119: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,716 INFO L273 TraceCheckUtils]: 120: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 121: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 122: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 123: Hoare triple {6561#false} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 124: Hoare triple {6561#false} havoc ~x~0;~x~0 := 0; {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 125: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:07:33,717 INFO L273 TraceCheckUtils]: 126: Hoare triple {6561#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6561#false} is VALID [2018-11-14 17:07:33,718 INFO L256 TraceCheckUtils]: 127: Hoare triple {6561#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6561#false} is VALID [2018-11-14 17:07:33,718 INFO L273 TraceCheckUtils]: 128: Hoare triple {6561#false} ~cond := #in~cond; {6561#false} is VALID [2018-11-14 17:07:33,718 INFO L273 TraceCheckUtils]: 129: Hoare triple {6561#false} assume ~cond == 0; {6561#false} is VALID [2018-11-14 17:07:33,718 INFO L273 TraceCheckUtils]: 130: Hoare triple {6561#false} assume !false; {6561#false} is VALID [2018-11-14 17:07:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 17:07:33,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:33,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:33,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:01,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 17:08:01,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:01,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:01,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {6560#true} call ULTIMATE.init(); {6560#true} is VALID [2018-11-14 17:08:01,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {6560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6560#true} is VALID [2018-11-14 17:08:01,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {6560#true} assume true; {6560#true} is VALID [2018-11-14 17:08:01,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6560#true} {6560#true} #91#return; {6560#true} is VALID [2018-11-14 17:08:01,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {6560#true} call #t~ret12 := main(); {6560#true} is VALID [2018-11-14 17:08:01,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {6560#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {6591#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:01,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {6591#(<= main_~i~0 0)} assume true; {6591#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:01,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {6591#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6591#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:01,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {6591#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:01,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {6563#(<= main_~i~0 1)} assume true; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:01,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {6563#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6563#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:01,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {6563#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:01,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {6564#(<= main_~i~0 2)} assume true; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:01,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {6564#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6564#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:01,366 INFO L273 TraceCheckUtils]: 14: Hoare triple {6564#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:01,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {6565#(<= main_~i~0 3)} assume true; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:01,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {6565#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6565#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:01,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {6565#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:01,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {6566#(<= main_~i~0 4)} assume true; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:01,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {6566#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6566#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:01,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {6566#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:01,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {6567#(<= main_~i~0 5)} assume true; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:01,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {6567#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6567#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:01,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {6567#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:01,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {6568#(<= main_~i~0 6)} assume true; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:01,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {6568#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6568#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:01,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {6568#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:01,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {6569#(<= main_~i~0 7)} assume true; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:01,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {6569#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6569#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:01,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {6569#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:01,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {6570#(<= main_~i~0 8)} assume true; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:01,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {6570#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6570#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:01,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {6570#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:01,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {6571#(<= main_~i~0 9)} assume true; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:01,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {6571#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {6571#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:01,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {6571#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6572#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:01,379 INFO L273 TraceCheckUtils]: 36: Hoare triple {6572#(<= main_~i~0 10)} assume true; {6572#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:01,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {6572#(<= main_~i~0 10)} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {6561#false} ~i~0 := 0; {6561#false} is VALID [2018-11-14 17:08:01,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,380 INFO L273 TraceCheckUtils]: 40: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,381 INFO L273 TraceCheckUtils]: 42: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,381 INFO L273 TraceCheckUtils]: 46: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,382 INFO L273 TraceCheckUtils]: 48: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,382 INFO L273 TraceCheckUtils]: 51: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 53: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 54: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 55: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 56: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 60: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 61: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 64: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,384 INFO L273 TraceCheckUtils]: 65: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 66: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 67: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 68: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 69: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 70: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 71: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 72: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {6561#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 79: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 80: Hoare triple {6561#false} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 81: Hoare triple {6561#false} ~i~0 := 0; {6561#false} is VALID [2018-11-14 17:08:01,386 INFO L273 TraceCheckUtils]: 82: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 83: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 86: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 87: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 88: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 89: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 90: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,387 INFO L273 TraceCheckUtils]: 91: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 92: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 96: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 97: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 98: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 100: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 101: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 103: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 104: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 105: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 107: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,389 INFO L273 TraceCheckUtils]: 108: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 109: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 112: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 113: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 114: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 115: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,390 INFO L273 TraceCheckUtils]: 116: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 117: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 118: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 119: Hoare triple {6561#false} assume !!(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 120: Hoare triple {6561#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 121: Hoare triple {6561#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 122: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 123: Hoare triple {6561#false} assume !(~i~0 < 200000); {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 124: Hoare triple {6561#false} havoc ~x~0;~x~0 := 0; {6561#false} is VALID [2018-11-14 17:08:01,391 INFO L273 TraceCheckUtils]: 125: Hoare triple {6561#false} assume true; {6561#false} is VALID [2018-11-14 17:08:01,392 INFO L273 TraceCheckUtils]: 126: Hoare triple {6561#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {6561#false} is VALID [2018-11-14 17:08:01,392 INFO L256 TraceCheckUtils]: 127: Hoare triple {6561#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6561#false} is VALID [2018-11-14 17:08:01,392 INFO L273 TraceCheckUtils]: 128: Hoare triple {6561#false} ~cond := #in~cond; {6561#false} is VALID [2018-11-14 17:08:01,392 INFO L273 TraceCheckUtils]: 129: Hoare triple {6561#false} assume ~cond == 0; {6561#false} is VALID [2018-11-14 17:08:01,392 INFO L273 TraceCheckUtils]: 130: Hoare triple {6561#false} assume !false; {6561#false} is VALID [2018-11-14 17:08:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-14 17:08:01,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:08:01,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-11-14 17:08:01,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:01,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:08:01,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:01,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:08:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:08:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:08:01,482 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand 14 states. [2018-11-14 17:08:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,110 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2018-11-14 17:08:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:08:02,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-11-14 17:08:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:08:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 208 transitions. [2018-11-14 17:08:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:08:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 208 transitions. [2018-11-14 17:08:02,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 208 transitions. [2018-11-14 17:08:02,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:02,723 INFO L225 Difference]: With dead ends: 250 [2018-11-14 17:08:02,723 INFO L226 Difference]: Without dead ends: 152 [2018-11-14 17:08:02,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:08:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-14 17:08:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-11-14 17:08:02,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:02,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 147 states. [2018-11-14 17:08:02,777 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 147 states. [2018-11-14 17:08:02,777 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 147 states. [2018-11-14 17:08:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,780 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-11-14 17:08:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2018-11-14 17:08:02,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:02,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:02,781 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 152 states. [2018-11-14 17:08:02,782 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 152 states. [2018-11-14 17:08:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:02,785 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-11-14 17:08:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2018-11-14 17:08:02,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:02,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:02,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:02,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-14 17:08:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-11-14 17:08:02,789 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 131 [2018-11-14 17:08:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:02,789 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-11-14 17:08:02,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:08:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-11-14 17:08:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 17:08:02,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:02,791 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 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] [2018-11-14 17:08:02,791 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:02,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -282029476, now seen corresponding path program 10 times [2018-11-14 17:08:02,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:03,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {7778#true} call ULTIMATE.init(); {7778#true} is VALID [2018-11-14 17:08:03,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {7778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7778#true} is VALID [2018-11-14 17:08:03,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {7778#true} assume true; {7778#true} is VALID [2018-11-14 17:08:03,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7778#true} {7778#true} #91#return; {7778#true} is VALID [2018-11-14 17:08:03,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {7778#true} call #t~ret12 := main(); {7778#true} is VALID [2018-11-14 17:08:03,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {7778#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {7780#(= main_~i~0 0)} is VALID [2018-11-14 17:08:03,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {7780#(= main_~i~0 0)} assume true; {7780#(= main_~i~0 0)} is VALID [2018-11-14 17:08:03,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {7780#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7780#(= main_~i~0 0)} is VALID [2018-11-14 17:08:03,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {7780#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:03,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {7781#(<= main_~i~0 1)} assume true; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:03,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {7781#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:03,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:03,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~i~0 2)} assume true; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:03,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {7782#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:03,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {7782#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:03,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {7783#(<= main_~i~0 3)} assume true; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:03,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {7783#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:03,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {7783#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:03,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {7784#(<= main_~i~0 4)} assume true; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:03,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:03,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {7784#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:03,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {7785#(<= main_~i~0 5)} assume true; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:03,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {7785#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:03,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {7785#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:03,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {7786#(<= main_~i~0 6)} assume true; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:03,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {7786#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:03,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {7786#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:03,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {7787#(<= main_~i~0 7)} assume true; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:03,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {7787#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:03,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {7787#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:03,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {7788#(<= main_~i~0 8)} assume true; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:03,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {7788#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:03,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {7788#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:03,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {7789#(<= main_~i~0 9)} assume true; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:03,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {7789#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:03,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {7789#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:03,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {7790#(<= main_~i~0 10)} assume true; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:03,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {7790#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:03,767 INFO L273 TraceCheckUtils]: 38: Hoare triple {7790#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7791#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:03,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {7791#(<= main_~i~0 11)} assume true; {7791#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:03,768 INFO L273 TraceCheckUtils]: 40: Hoare triple {7791#(<= main_~i~0 11)} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {7779#false} ~i~0 := 0; {7779#false} is VALID [2018-11-14 17:08:03,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,769 INFO L273 TraceCheckUtils]: 45: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,770 INFO L273 TraceCheckUtils]: 47: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,770 INFO L273 TraceCheckUtils]: 48: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,770 INFO L273 TraceCheckUtils]: 49: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 52: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 53: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 62: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 63: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 64: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 70: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 75: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 76: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 77: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 78: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 79: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 80: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 81: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 82: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,774 INFO L273 TraceCheckUtils]: 83: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 84: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 85: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 86: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 87: Hoare triple {7779#false} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 88: Hoare triple {7779#false} ~i~0 := 0; {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 89: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 90: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 94: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 95: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 96: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 97: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 98: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,776 INFO L273 TraceCheckUtils]: 99: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 100: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 101: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 102: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 103: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 104: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 105: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 106: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,777 INFO L273 TraceCheckUtils]: 107: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 108: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 109: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 110: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 111: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 112: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 113: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 114: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 115: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,778 INFO L273 TraceCheckUtils]: 116: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 117: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 118: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 119: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 120: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 121: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 122: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 123: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,779 INFO L273 TraceCheckUtils]: 124: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 125: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 126: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 127: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 128: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 129: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 130: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 131: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:03,780 INFO L273 TraceCheckUtils]: 132: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 133: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 134: Hoare triple {7779#false} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 135: Hoare triple {7779#false} havoc ~x~0;~x~0 := 0; {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 136: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 137: Hoare triple {7779#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L256 TraceCheckUtils]: 138: Hoare triple {7779#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 139: Hoare triple {7779#false} ~cond := #in~cond; {7779#false} is VALID [2018-11-14 17:08:03,781 INFO L273 TraceCheckUtils]: 140: Hoare triple {7779#false} assume ~cond == 0; {7779#false} is VALID [2018-11-14 17:08:03,782 INFO L273 TraceCheckUtils]: 141: Hoare triple {7779#false} assume !false; {7779#false} is VALID [2018-11-14 17:08:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-14 17:08:03,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:03,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:08:03,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:05,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:05,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:05,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:05,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {7778#true} call ULTIMATE.init(); {7778#true} is VALID [2018-11-14 17:08:05,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {7778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7778#true} is VALID [2018-11-14 17:08:05,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {7778#true} assume true; {7778#true} is VALID [2018-11-14 17:08:05,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7778#true} {7778#true} #91#return; {7778#true} is VALID [2018-11-14 17:08:05,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {7778#true} call #t~ret12 := main(); {7778#true} is VALID [2018-11-14 17:08:05,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {7778#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {7810#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:05,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {7810#(<= main_~i~0 0)} assume true; {7810#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:05,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {7810#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7810#(<= main_~i~0 0)} is VALID [2018-11-14 17:08:05,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {7810#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:05,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {7781#(<= main_~i~0 1)} assume true; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:05,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {7781#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7781#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:05,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:05,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~i~0 2)} assume true; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:05,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {7782#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7782#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:05,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {7782#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:05,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {7783#(<= main_~i~0 3)} assume true; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:05,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {7783#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7783#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:05,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {7783#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:05,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {7784#(<= main_~i~0 4)} assume true; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:05,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7784#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:05,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {7784#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:05,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {7785#(<= main_~i~0 5)} assume true; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:05,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {7785#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7785#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:05,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {7785#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:05,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {7786#(<= main_~i~0 6)} assume true; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:05,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {7786#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7786#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:05,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {7786#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:05,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {7787#(<= main_~i~0 7)} assume true; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:05,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {7787#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7787#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:05,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {7787#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:05,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {7788#(<= main_~i~0 8)} assume true; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:05,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {7788#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7788#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:05,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {7788#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:05,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {7789#(<= main_~i~0 9)} assume true; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:05,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {7789#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7789#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:05,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {7789#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:05,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {7790#(<= main_~i~0 10)} assume true; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:05,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {7790#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {7790#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:05,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {7790#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7791#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:05,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {7791#(<= main_~i~0 11)} assume true; {7791#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {7791#(<= main_~i~0 11)} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {7779#false} ~i~0 := 0; {7779#false} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 54: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 55: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 60: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 64: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 65: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 66: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 67: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 68: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 74: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 75: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 76: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 77: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 78: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 79: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 80: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 81: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 83: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 84: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 85: Hoare triple {7779#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 86: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 87: Hoare triple {7779#false} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 88: Hoare triple {7779#false} ~i~0 := 0; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 89: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 90: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 91: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 92: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 93: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 94: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 95: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 96: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 97: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 98: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 99: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 100: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 101: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 102: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 103: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 104: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 105: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 106: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 107: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 108: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 109: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 110: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 111: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 112: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 113: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 114: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 115: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 116: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 117: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 118: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 119: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 120: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 121: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 122: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 123: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 124: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 125: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 126: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 127: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 128: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 129: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 130: Hoare triple {7779#false} assume !!(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 131: Hoare triple {7779#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 132: Hoare triple {7779#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 133: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 134: Hoare triple {7779#false} assume !(~i~0 < 200000); {7779#false} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 135: Hoare triple {7779#false} havoc ~x~0;~x~0 := 0; {7779#false} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 136: Hoare triple {7779#false} assume true; {7779#false} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 137: Hoare triple {7779#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {7779#false} is VALID [2018-11-14 17:08:05,985 INFO L256 TraceCheckUtils]: 138: Hoare triple {7779#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7779#false} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 139: Hoare triple {7779#false} ~cond := #in~cond; {7779#false} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 140: Hoare triple {7779#false} assume ~cond == 0; {7779#false} is VALID [2018-11-14 17:08:05,986 INFO L273 TraceCheckUtils]: 141: Hoare triple {7779#false} assume !false; {7779#false} is VALID [2018-11-14 17:08:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-14 17:08:06,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:06,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 17:08:06,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-11-14 17:08:06,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:06,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:08:06,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:06,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:08:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:08:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:08:06,106 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 15 states. [2018-11-14 17:08:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:06,878 INFO L93 Difference]: Finished difference Result 269 states and 325 transitions. [2018-11-14 17:08:06,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:08:06,878 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-11-14 17:08:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:08:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2018-11-14 17:08:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:08:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2018-11-14 17:08:06,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 221 transitions. [2018-11-14 17:08:07,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:07,583 INFO L225 Difference]: With dead ends: 269 [2018-11-14 17:08:07,583 INFO L226 Difference]: Without dead ends: 163 [2018-11-14 17:08:07,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:08:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-14 17:08:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-11-14 17:08:07,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:07,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 158 states. [2018-11-14 17:08:07,676 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 158 states. [2018-11-14 17:08:07,676 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 158 states. [2018-11-14 17:08:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:07,681 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-11-14 17:08:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-11-14 17:08:07,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:07,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:07,681 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 163 states. [2018-11-14 17:08:07,682 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 163 states. [2018-11-14 17:08:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:07,685 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-11-14 17:08:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-11-14 17:08:07,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:07,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:07,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:07,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 17:08:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-11-14 17:08:07,691 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 142 [2018-11-14 17:08:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:07,691 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-11-14 17:08:07,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:08:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-11-14 17:08:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-14 17:08:07,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:07,693 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 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] [2018-11-14 17:08:07,693 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:07,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1823765069, now seen corresponding path program 11 times [2018-11-14 17:08:07,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:07,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:07,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:08,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {9090#true} call ULTIMATE.init(); {9090#true} is VALID [2018-11-14 17:08:08,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {9090#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9090#true} is VALID [2018-11-14 17:08:08,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {9090#true} assume true; {9090#true} is VALID [2018-11-14 17:08:08,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9090#true} {9090#true} #91#return; {9090#true} is VALID [2018-11-14 17:08:08,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {9090#true} call #t~ret12 := main(); {9090#true} is VALID [2018-11-14 17:08:08,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {9090#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {9092#(= main_~i~0 0)} is VALID [2018-11-14 17:08:08,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {9092#(= main_~i~0 0)} assume true; {9092#(= main_~i~0 0)} is VALID [2018-11-14 17:08:08,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {9092#(= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9092#(= main_~i~0 0)} is VALID [2018-11-14 17:08:08,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {9092#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9093#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:08,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {9093#(<= main_~i~0 1)} assume true; {9093#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:08,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {9093#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9093#(<= main_~i~0 1)} is VALID [2018-11-14 17:08:08,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {9093#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9094#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:08,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {9094#(<= main_~i~0 2)} assume true; {9094#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:08,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {9094#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9094#(<= main_~i~0 2)} is VALID [2018-11-14 17:08:08,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {9094#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9095#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:08,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {9095#(<= main_~i~0 3)} assume true; {9095#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:08,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {9095#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9095#(<= main_~i~0 3)} is VALID [2018-11-14 17:08:08,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {9095#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9096#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:08,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {9096#(<= main_~i~0 4)} assume true; {9096#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:08,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {9096#(<= main_~i~0 4)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9096#(<= main_~i~0 4)} is VALID [2018-11-14 17:08:08,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {9096#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9097#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:08,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {9097#(<= main_~i~0 5)} assume true; {9097#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:08,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {9097#(<= main_~i~0 5)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9097#(<= main_~i~0 5)} is VALID [2018-11-14 17:08:08,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {9097#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9098#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:08,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {9098#(<= main_~i~0 6)} assume true; {9098#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:08,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {9098#(<= main_~i~0 6)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9098#(<= main_~i~0 6)} is VALID [2018-11-14 17:08:08,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {9098#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9099#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:08,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {9099#(<= main_~i~0 7)} assume true; {9099#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:08,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {9099#(<= main_~i~0 7)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9099#(<= main_~i~0 7)} is VALID [2018-11-14 17:08:08,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {9099#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9100#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:08,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {9100#(<= main_~i~0 8)} assume true; {9100#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:08,378 INFO L273 TraceCheckUtils]: 31: Hoare triple {9100#(<= main_~i~0 8)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9100#(<= main_~i~0 8)} is VALID [2018-11-14 17:08:08,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {9100#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9101#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:08,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {9101#(<= main_~i~0 9)} assume true; {9101#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:08,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {9101#(<= main_~i~0 9)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9101#(<= main_~i~0 9)} is VALID [2018-11-14 17:08:08,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {9101#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9102#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:08,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {9102#(<= main_~i~0 10)} assume true; {9102#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:08,381 INFO L273 TraceCheckUtils]: 37: Hoare triple {9102#(<= main_~i~0 10)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9102#(<= main_~i~0 10)} is VALID [2018-11-14 17:08:08,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {9102#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9103#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:08,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {9103#(<= main_~i~0 11)} assume true; {9103#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:08,383 INFO L273 TraceCheckUtils]: 40: Hoare triple {9103#(<= main_~i~0 11)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~nondet3; {9103#(<= main_~i~0 11)} is VALID [2018-11-14 17:08:08,384 INFO L273 TraceCheckUtils]: 41: Hoare triple {9103#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9104#(<= main_~i~0 12)} is VALID [2018-11-14 17:08:08,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {9104#(<= main_~i~0 12)} assume true; {9104#(<= main_~i~0 12)} is VALID [2018-11-14 17:08:08,385 INFO L273 TraceCheckUtils]: 43: Hoare triple {9104#(<= main_~i~0 12)} assume !(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,385 INFO L273 TraceCheckUtils]: 44: Hoare triple {9091#false} ~i~0 := 0; {9091#false} is VALID [2018-11-14 17:08:08,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,386 INFO L273 TraceCheckUtils]: 46: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,387 INFO L273 TraceCheckUtils]: 52: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 56: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 57: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 58: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 68: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 69: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 70: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 71: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,389 INFO L273 TraceCheckUtils]: 72: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 74: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 75: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 76: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 77: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 78: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 79: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,390 INFO L273 TraceCheckUtils]: 80: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 81: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 82: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 83: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 84: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 87: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 88: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,391 INFO L273 TraceCheckUtils]: 89: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 90: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 91: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem5 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem5, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem5; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 92: Hoare triple {9091#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 93: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 94: Hoare triple {9091#false} assume !(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 95: Hoare triple {9091#false} ~i~0 := 0; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 96: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 97: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,392 INFO L273 TraceCheckUtils]: 98: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 99: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 100: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 101: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 102: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 103: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 105: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,393 INFO L273 TraceCheckUtils]: 106: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 107: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 108: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 109: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 110: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 111: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 112: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 113: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 114: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,394 INFO L273 TraceCheckUtils]: 115: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 116: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 117: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 118: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 119: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 120: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 121: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 122: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 123: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,395 INFO L273 TraceCheckUtils]: 124: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 125: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 126: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 127: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 128: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 129: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 130: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 131: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 132: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,396 INFO L273 TraceCheckUtils]: 133: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 134: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 135: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 136: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 137: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 138: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 139: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 140: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,397 INFO L273 TraceCheckUtils]: 141: Hoare triple {9091#false} assume !!(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 142: Hoare triple {9091#false} assume ~i~0 != ~z~0;call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem7, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem7; {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 143: Hoare triple {9091#false} #t~post6 := ~i~0;~i~0 := #t~post6 + 1;havoc #t~post6; {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 144: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 145: Hoare triple {9091#false} assume !(~i~0 < 200000); {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 146: Hoare triple {9091#false} havoc ~x~0;~x~0 := 0; {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 147: Hoare triple {9091#false} assume true; {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 148: Hoare triple {9091#false} assume !!(~x~0 < 200000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem11 := read~int(~#a3~0.base, ~#a3~0.offset + ~x~0 * 4, 4); {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L256 TraceCheckUtils]: 149: Hoare triple {9091#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {9091#false} is VALID [2018-11-14 17:08:08,398 INFO L273 TraceCheckUtils]: 150: Hoare triple {9091#false} ~cond := #in~cond; {9091#false} is VALID [2018-11-14 17:08:08,399 INFO L273 TraceCheckUtils]: 151: Hoare triple {9091#false} assume ~cond == 0; {9091#false} is VALID [2018-11-14 17:08:08,399 INFO L273 TraceCheckUtils]: 152: Hoare triple {9091#false} assume !false; {9091#false} is VALID [2018-11-14 17:08:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-14 17:08:08,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:08,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:08:08,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1