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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:38:15,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:38:15,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:38:15,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:38:15,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:38:15,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:38:15,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:38:15,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:38:15,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:38:15,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:38:15,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:38:15,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:38:15,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:38:15,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:38:15,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:38:15,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:38:15,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:38:15,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:38:15,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:38:15,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:38:15,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:38:15,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:38:15,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:38:15,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:38:15,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:38:15,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:38:15,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:38:15,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:38:15,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:38:15,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:38:15,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:38:15,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:38:15,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:38:15,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:38:15,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:38:15,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:38:15,647 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:38:15,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:38:15,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:38:15,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:38:15,678 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:38:15,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:38:15,679 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:38:15,679 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:38:15,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:38:15,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:38:15,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:38:15,680 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:38:15,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:38:15,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:38:15,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:38:15,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:38:15,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:38:15,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:38:15,683 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:38:15,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:38:15,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:38:15,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:38:15,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:38:15,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:38:15,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:38:15,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:38:15,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:38:15,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:38:15,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:38:15,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:38:15,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:38:15,687 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:38:15,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:38:15,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:38:15,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:38:15,784 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:38:15,784 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:38:15,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call2_ground.i [2018-11-14 18:38:15,856 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92b197043/31581f35a35b4d679cb4c71308bc83d2/FLAG3681674f3 [2018-11-14 18:38:16,354 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:38:16,355 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call2_ground.i [2018-11-14 18:38:16,362 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92b197043/31581f35a35b4d679cb4c71308bc83d2/FLAG3681674f3 [2018-11-14 18:38:16,377 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92b197043/31581f35a35b4d679cb4c71308bc83d2 [2018-11-14 18:38:16,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:38:16,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:38:16,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:38:16,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:38:16,396 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:38:16,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be17014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16, skipping insertion in model container [2018-11-14 18:38:16,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:38:16,435 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:38:16,669 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:38:16,674 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:38:16,712 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:38:16,747 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:38:16,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16 WrapperNode [2018-11-14 18:38:16,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:38:16,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:38:16,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:38:16,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:38:16,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (1/1) ... [2018-11-14 18:38:16,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:38:16,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:38:16,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:38:16,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:38:16,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (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 18:38:16,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:38:16,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:38:16,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:38:16,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:38:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:38:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:38:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:38:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:38:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:38:17,647 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:38:17,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:38:17 BoogieIcfgContainer [2018-11-14 18:38:17,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:38:17,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:38:17,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:38:17,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:38:17,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:38:16" (1/3) ... [2018-11-14 18:38:17,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a8129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:38:17, skipping insertion in model container [2018-11-14 18:38:17,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:38:16" (2/3) ... [2018-11-14 18:38:17,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a8129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:38:17, skipping insertion in model container [2018-11-14 18:38:17,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:38:17" (3/3) ... [2018-11-14 18:38:17,657 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_false-unreach-call2_ground.i [2018-11-14 18:38:17,668 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:38:17,682 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:38:17,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:38:17,732 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:38:17,733 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:38:17,733 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:38:17,733 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:38:17,733 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:38:17,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:38:17,734 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:38:17,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:38:17,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:38:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 18:38:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:38:17,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:17,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:17,768 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:17,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash -712186415, now seen corresponding path program 1 times [2018-11-14 18:38:17,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:17,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:17,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:17,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 18:38:17,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-14 18:38:17,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 18:38:17,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #83#return; {35#true} is VALID [2018-11-14 18:38:17,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2018-11-14 18:38:17,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {35#true} is VALID [2018-11-14 18:38:17,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 18:38:17,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {36#false} is VALID [2018-11-14 18:38:17,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 18:38:17,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {36#false} is VALID [2018-11-14 18:38:17,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 18:38:17,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {36#false} is VALID [2018-11-14 18:38:17,933 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {36#false} is VALID [2018-11-14 18:38:17,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 18:38:17,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 18:38:17,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 18:38:17,940 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 18:38:17,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:38:17,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:38:17,948 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:38:17,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:17,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:38:18,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:18,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:38:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:38:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:38:18,039 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 18:38:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:18,448 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-14 18:38:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:38:18,448 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:38:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:38:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 18:38:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:38:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 18:38:18,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-14 18:38:18,706 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 18:38:18,717 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:38:18,717 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:38:18,721 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 18:38:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:38:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:38:18,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:18,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:38:18,764 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:38:18,764 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:38:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:18,768 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 18:38:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:38:18,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:18,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:18,769 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:38:18,770 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:38:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:18,775 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 18:38:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:38:18,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:18,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:18,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:18,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:38:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-14 18:38:18,781 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2018-11-14 18:38:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:18,782 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-14 18:38:18,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:38:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 18:38:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:38:18,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:18,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:18,784 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:18,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1922293170, now seen corresponding path program 1 times [2018-11-14 18:38:18,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:18,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:18,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:18,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-14 18:38:18,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-14 18:38:18,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-14 18:38:18,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #83#return; {204#true} is VALID [2018-11-14 18:38:18,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret8 := main(); {204#true} is VALID [2018-11-14 18:38:18,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {206#(<= 1 main_~swapped~0)} is VALID [2018-11-14 18:38:18,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(<= 1 main_~swapped~0)} assume true; {206#(<= 1 main_~swapped~0)} is VALID [2018-11-14 18:38:18,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#(<= 1 main_~swapped~0)} assume !(~swapped~0 != 0); {205#false} is VALID [2018-11-14 18:38:18,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {205#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {205#false} is VALID [2018-11-14 18:38:18,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {205#false} assume true; {205#false} is VALID [2018-11-14 18:38:18,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {205#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {205#false} is VALID [2018-11-14 18:38:18,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#false} assume true; {205#false} is VALID [2018-11-14 18:38:18,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {205#false} is VALID [2018-11-14 18:38:18,889 INFO L256 TraceCheckUtils]: 13: Hoare triple {205#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {205#false} is VALID [2018-11-14 18:38:18,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2018-11-14 18:38:18,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {205#false} assume ~cond == 0; {205#false} is VALID [2018-11-14 18:38:18,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-14 18:38:18,892 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 18:38:18,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:38:18,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:38:18,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:38:18,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:18,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:38:18,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:38:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:38:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:38:18,969 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-14 18:38:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:19,422 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 18:38:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:38:19,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:38:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:38:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:38:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:38:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:38:19,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-14 18:38:19,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:19,619 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:38:19,619 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:38:19,621 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 18:38:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:38:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 18:38:19,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:19,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 18:38:19,650 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:38:19,651 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:38:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:19,654 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:38:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:38:19,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:19,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:19,656 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:38:19,656 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:38:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:19,659 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:38:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:38:19,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:19,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:19,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:38:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-14 18:38:19,663 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2018-11-14 18:38:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:19,664 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-14 18:38:19,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:38:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:38:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:38:19,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:19,665 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:19,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:19,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1246945532, now seen corresponding path program 1 times [2018-11-14 18:38:19,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:19,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:19,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:19,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:19,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-14 18:38:19,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {384#true} is VALID [2018-11-14 18:38:19,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-14 18:38:19,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {384#true} {384#true} #83#return; {384#true} is VALID [2018-11-14 18:38:19,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {384#true} call #t~ret8 := main(); {384#true} is VALID [2018-11-14 18:38:19,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {384#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {384#true} is VALID [2018-11-14 18:38:19,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-14 18:38:19,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {386#(= main_~i~0 1)} is VALID [2018-11-14 18:38:19,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(= main_~i~0 1)} assume true; {386#(= main_~i~0 1)} is VALID [2018-11-14 18:38:19,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#(= main_~i~0 1)} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-14 18:38:19,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 18:38:19,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#false} assume !(~swapped~0 != 0); {385#false} is VALID [2018-11-14 18:38:19,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {385#false} is VALID [2018-11-14 18:38:19,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 18:38:19,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {385#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {385#false} is VALID [2018-11-14 18:38:19,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 18:38:19,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {385#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {385#false} is VALID [2018-11-14 18:38:19,863 INFO L256 TraceCheckUtils]: 17: Hoare triple {385#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {385#false} is VALID [2018-11-14 18:38:19,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-14 18:38:19,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume ~cond == 0; {385#false} is VALID [2018-11-14 18:38:19,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-14 18:38:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:19,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:38:19,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:38:19,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:38:19,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:19,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:38:19,902 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 18:38:19,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:38:19,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:38:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:38:19,903 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-14 18:38:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:20,125 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 18:38:20,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:38:20,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:38:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:38:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:38:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:38:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:38:20,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 18:38:20,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:20,233 INFO L225 Difference]: With dead ends: 65 [2018-11-14 18:38:20,233 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:38:20,234 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 18:38:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:38:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-14 18:38:20,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:20,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-14 18:38:20,256 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-14 18:38:20,256 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-14 18:38:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:20,260 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:38:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:38:20,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:20,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:20,262 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-14 18:38:20,262 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-14 18:38:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:20,265 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:38:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:38:20,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:20,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:20,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:20,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:38:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 18:38:20,269 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2018-11-14 18:38:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:20,269 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 18:38:20,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:38:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 18:38:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:38:20,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:20,271 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:20,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:20,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash -923621540, now seen corresponding path program 1 times [2018-11-14 18:38:20,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:20,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:20,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 18:38:20,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 18:38:20,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 18:38:20,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #83#return; {599#true} is VALID [2018-11-14 18:38:20,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret8 := main(); {599#true} is VALID [2018-11-14 18:38:20,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {599#true} is VALID [2018-11-14 18:38:20,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 18:38:20,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {601#(= main_~i~0 1)} is VALID [2018-11-14 18:38:20,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {601#(= main_~i~0 1)} assume true; {601#(= main_~i~0 1)} is VALID [2018-11-14 18:38:20,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {601#(= main_~i~0 1)} is VALID [2018-11-14 18:38:20,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {601#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {601#(= main_~i~0 1)} is VALID [2018-11-14 18:38:20,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {601#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {602#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:20,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(<= main_~i~0 2)} assume true; {602#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:20,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#(<= main_~i~0 2)} assume !(~i~0 < 100000); {600#false} is VALID [2018-11-14 18:38:20,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#false} assume !(~swapped~0 != 0); {600#false} is VALID [2018-11-14 18:38:20,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {600#false} is VALID [2018-11-14 18:38:20,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {600#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {600#false} is VALID [2018-11-14 18:38:20,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {600#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {600#false} is VALID [2018-11-14 18:38:20,401 INFO L256 TraceCheckUtils]: 21: Hoare triple {600#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {600#false} is VALID [2018-11-14 18:38:20,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {600#false} ~cond := #in~cond; {600#false} is VALID [2018-11-14 18:38:20,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {600#false} assume ~cond == 0; {600#false} is VALID [2018-11-14 18:38:20,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 18:38:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:20,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:20,403 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 18:38:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:20,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:20,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 18:38:20,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 18:38:20,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 18:38:20,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #83#return; {599#true} is VALID [2018-11-14 18:38:20,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret8 := main(); {599#true} is VALID [2018-11-14 18:38:20,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {599#true} is VALID [2018-11-14 18:38:20,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 18:38:20,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {627#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:20,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {627#(<= main_~i~0 1)} assume true; {627#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:20,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {627#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:20,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {627#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:20,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {627#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {602#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:20,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(<= main_~i~0 2)} assume true; {602#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:20,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#(<= main_~i~0 2)} assume !(~i~0 < 100000); {600#false} is VALID [2018-11-14 18:38:20,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#false} assume !(~swapped~0 != 0); {600#false} is VALID [2018-11-14 18:38:20,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {600#false} is VALID [2018-11-14 18:38:20,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {600#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {600#false} is VALID [2018-11-14 18:38:20,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 18:38:20,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {600#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {600#false} is VALID [2018-11-14 18:38:20,785 INFO L256 TraceCheckUtils]: 21: Hoare triple {600#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {600#false} is VALID [2018-11-14 18:38:20,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {600#false} ~cond := #in~cond; {600#false} is VALID [2018-11-14 18:38:20,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {600#false} assume ~cond == 0; {600#false} is VALID [2018-11-14 18:38:20,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 18:38:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:20,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:20,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:38:20,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 18:38:20,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:20,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:38:20,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:20,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:38:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:38:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:38:20,877 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2018-11-14 18:38:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:21,187 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-14 18:38:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:38:21,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 18:38:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:38:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-14 18:38:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:38:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-14 18:38:21,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2018-11-14 18:38:21,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:21,340 INFO L225 Difference]: With dead ends: 75 [2018-11-14 18:38:21,340 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 18:38:21,341 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 18:38:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 18:38:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-14 18:38:21,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:21,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-14 18:38:21,376 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-14 18:38:21,376 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-14 18:38:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:21,378 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-14 18:38:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-14 18:38:21,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:21,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:21,379 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-14 18:38:21,379 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-14 18:38:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:21,382 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-14 18:38:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-14 18:38:21,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:21,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:21,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:21,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:38:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 18:38:21,386 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-11-14 18:38:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 18:38:21,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:38:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:38:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:38:21,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:21,388 INFO L375 BasicCegarLoop]: trace histogram [3, 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 18:38:21,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 856441780, now seen corresponding path program 2 times [2018-11-14 18:38:21,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:21,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-14 18:38:21,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-14 18:38:21,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 18:38:21,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #83#return; {926#true} is VALID [2018-11-14 18:38:21,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret8 := main(); {926#true} is VALID [2018-11-14 18:38:21,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {926#true} is VALID [2018-11-14 18:38:21,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 18:38:21,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {928#(= main_~i~0 1)} is VALID [2018-11-14 18:38:21,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {928#(= main_~i~0 1)} assume true; {928#(= main_~i~0 1)} is VALID [2018-11-14 18:38:21,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {928#(= main_~i~0 1)} is VALID [2018-11-14 18:38:21,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {928#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {928#(= main_~i~0 1)} is VALID [2018-11-14 18:38:21,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {928#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {929#(<= main_~i~0 2)} assume true; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {929#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {930#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:21,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {930#(<= main_~i~0 3)} assume true; {930#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:21,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {930#(<= main_~i~0 3)} assume !(~i~0 < 100000); {927#false} is VALID [2018-11-14 18:38:21,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {927#false} assume !(~swapped~0 != 0); {927#false} is VALID [2018-11-14 18:38:21,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {927#false} is VALID [2018-11-14 18:38:21,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {927#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {927#false} is VALID [2018-11-14 18:38:21,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {927#false} is VALID [2018-11-14 18:38:21,519 INFO L256 TraceCheckUtils]: 25: Hoare triple {927#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {927#false} is VALID [2018-11-14 18:38:21,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2018-11-14 18:38:21,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {927#false} assume ~cond == 0; {927#false} is VALID [2018-11-14 18:38:21,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-14 18:38:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:21,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:21,522 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 18:38:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:38:21,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:38:21,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:21,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:21,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-14 18:38:21,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-14 18:38:21,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 18:38:21,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #83#return; {926#true} is VALID [2018-11-14 18:38:21,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret8 := main(); {926#true} is VALID [2018-11-14 18:38:21,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {926#true} is VALID [2018-11-14 18:38:21,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 18:38:21,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {955#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:21,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {955#(<= main_~i~0 1)} assume true; {955#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:21,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {955#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:21,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {955#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {955#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:21,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {955#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {929#(<= main_~i~0 2)} assume true; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {929#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:21,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {930#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:21,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {930#(<= main_~i~0 3)} assume true; {930#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:21,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {930#(<= main_~i~0 3)} assume !(~i~0 < 100000); {927#false} is VALID [2018-11-14 18:38:21,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {927#false} assume !(~swapped~0 != 0); {927#false} is VALID [2018-11-14 18:38:21,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {927#false} is VALID [2018-11-14 18:38:21,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {927#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {927#false} is VALID [2018-11-14 18:38:21,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 18:38:21,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {927#false} is VALID [2018-11-14 18:38:21,709 INFO L256 TraceCheckUtils]: 25: Hoare triple {927#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {927#false} is VALID [2018-11-14 18:38:21,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2018-11-14 18:38:21,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {927#false} assume ~cond == 0; {927#false} is VALID [2018-11-14 18:38:21,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-14 18:38:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:21,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:21,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:38:21,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 18:38:21,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:21,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:38:21,801 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 18:38:21,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:38:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:38:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:38:21,802 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2018-11-14 18:38:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:22,089 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-14 18:38:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:38:22,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 18:38:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:38:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-14 18:38:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:38:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-14 18:38:22,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-14 18:38:22,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:22,235 INFO L225 Difference]: With dead ends: 90 [2018-11-14 18:38:22,235 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:38:22,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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 18:38:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:38:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-14 18:38:22,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:22,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-14 18:38:22,344 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-14 18:38:22,344 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-14 18:38:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:22,347 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 18:38:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 18:38:22,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:22,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:22,348 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-14 18:38:22,348 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-14 18:38:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:22,351 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 18:38:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 18:38:22,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:22,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:22,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:22,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:38:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-14 18:38:22,355 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 29 [2018-11-14 18:38:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:22,356 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-14 18:38:22,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:38:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 18:38:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:38:22,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:22,357 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:22,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:22,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2083523572, now seen corresponding path program 3 times [2018-11-14 18:38:22,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:22,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:22,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-14 18:38:22,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1311#true} is VALID [2018-11-14 18:38:22,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 18:38:22,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #83#return; {1311#true} is VALID [2018-11-14 18:38:22,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret8 := main(); {1311#true} is VALID [2018-11-14 18:38:22,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1311#true} is VALID [2018-11-14 18:38:22,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 18:38:22,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1313#(= main_~i~0 1)} is VALID [2018-11-14 18:38:22,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#(= main_~i~0 1)} assume true; {1313#(= main_~i~0 1)} is VALID [2018-11-14 18:38:22,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1313#(= main_~i~0 1)} is VALID [2018-11-14 18:38:22,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1313#(= main_~i~0 1)} is VALID [2018-11-14 18:38:22,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 2)} assume true; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 3)} assume true; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {1315#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {1315#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:22,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#(<= main_~i~0 4)} assume true; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:22,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1312#false} is VALID [2018-11-14 18:38:22,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {1312#false} assume !(~swapped~0 != 0); {1312#false} is VALID [2018-11-14 18:38:22,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {1312#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1312#false} is VALID [2018-11-14 18:38:22,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {1312#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1312#false} is VALID [2018-11-14 18:38:22,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {1312#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1312#false} is VALID [2018-11-14 18:38:22,515 INFO L256 TraceCheckUtils]: 29: Hoare triple {1312#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1312#false} is VALID [2018-11-14 18:38:22,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-14 18:38:22,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {1312#false} assume ~cond == 0; {1312#false} is VALID [2018-11-14 18:38:22,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-14 18:38:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:22,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:22,519 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 18:38:22,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:38:22,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:38:22,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:22,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:22,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-14 18:38:22,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1311#true} is VALID [2018-11-14 18:38:22,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 18:38:22,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #83#return; {1311#true} is VALID [2018-11-14 18:38:22,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret8 := main(); {1311#true} is VALID [2018-11-14 18:38:22,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1311#true} is VALID [2018-11-14 18:38:22,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 18:38:22,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:22,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {1341#(<= main_~i~0 1)} assume true; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:22,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {1341#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1341#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:22,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {1341#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:22,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {1341#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 2)} assume true; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:22,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 3)} assume true; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {1315#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:22,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {1315#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:22,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#(<= main_~i~0 4)} assume true; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:22,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1312#false} is VALID [2018-11-14 18:38:22,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {1312#false} assume !(~swapped~0 != 0); {1312#false} is VALID [2018-11-14 18:38:22,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {1312#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1312#false} is VALID [2018-11-14 18:38:22,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {1312#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1312#false} is VALID [2018-11-14 18:38:22,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 18:38:22,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {1312#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1312#false} is VALID [2018-11-14 18:38:22,784 INFO L256 TraceCheckUtils]: 29: Hoare triple {1312#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1312#false} is VALID [2018-11-14 18:38:22,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-14 18:38:22,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {1312#false} assume ~cond == 0; {1312#false} is VALID [2018-11-14 18:38:22,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-14 18:38:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:22,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:38:22,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 18:38:22,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:22,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:38:22,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:22,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:38:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:38:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:38:22,848 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 7 states. [2018-11-14 18:38:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:23,050 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2018-11-14 18:38:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:38:23,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 18:38:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:38:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:38:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:38:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:38:23,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 18:38:23,167 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 18:38:23,169 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:38:23,169 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:38:23,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:38:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:38:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-14 18:38:23,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:23,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 58 states. [2018-11-14 18:38:23,204 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 58 states. [2018-11-14 18:38:23,204 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 58 states. [2018-11-14 18:38:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:23,207 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-14 18:38:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-14 18:38:23,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:23,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:23,208 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 62 states. [2018-11-14 18:38:23,208 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 62 states. [2018-11-14 18:38:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:23,211 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-14 18:38:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-14 18:38:23,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:23,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:23,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:23,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 18:38:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-14 18:38:23,215 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 33 [2018-11-14 18:38:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-14 18:38:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:38:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 18:38:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:38:23,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:23,217 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:23,217 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:23,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1880340580, now seen corresponding path program 4 times [2018-11-14 18:38:23,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:23,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:23,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:23,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:23,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:23,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {1755#true} call ULTIMATE.init(); {1755#true} is VALID [2018-11-14 18:38:23,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {1755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1755#true} is VALID [2018-11-14 18:38:23,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 18:38:23,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1755#true} {1755#true} #83#return; {1755#true} is VALID [2018-11-14 18:38:23,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {1755#true} call #t~ret8 := main(); {1755#true} is VALID [2018-11-14 18:38:23,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {1755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1755#true} is VALID [2018-11-14 18:38:23,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 18:38:23,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {1755#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1757#(= main_~i~0 1)} is VALID [2018-11-14 18:38:23,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {1757#(= main_~i~0 1)} assume true; {1757#(= main_~i~0 1)} is VALID [2018-11-14 18:38:23,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {1757#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1757#(= main_~i~0 1)} is VALID [2018-11-14 18:38:23,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {1757#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1757#(= main_~i~0 1)} is VALID [2018-11-14 18:38:23,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {1757#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {1758#(<= main_~i~0 2)} assume true; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {1758#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {1758#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {1759#(<= main_~i~0 3)} assume true; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {1759#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {1759#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {1759#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {1760#(<= main_~i~0 4)} assume true; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {1760#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {1760#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {1760#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:23,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {1761#(<= main_~i~0 5)} assume true; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:23,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {1761#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1756#false} is VALID [2018-11-14 18:38:23,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {1756#false} assume !(~swapped~0 != 0); {1756#false} is VALID [2018-11-14 18:38:23,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {1756#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1756#false} is VALID [2018-11-14 18:38:23,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {1756#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1756#false} is VALID [2018-11-14 18:38:23,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {1756#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1756#false} is VALID [2018-11-14 18:38:23,401 INFO L256 TraceCheckUtils]: 33: Hoare triple {1756#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1756#false} is VALID [2018-11-14 18:38:23,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {1756#false} ~cond := #in~cond; {1756#false} is VALID [2018-11-14 18:38:23,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {1756#false} assume ~cond == 0; {1756#false} is VALID [2018-11-14 18:38:23,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {1756#false} assume !false; {1756#false} is VALID [2018-11-14 18:38:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:23,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:23,405 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 18:38:23,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:38:23,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:38:23,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:23,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:23,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {1755#true} call ULTIMATE.init(); {1755#true} is VALID [2018-11-14 18:38:23,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {1755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1755#true} is VALID [2018-11-14 18:38:23,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 18:38:23,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1755#true} {1755#true} #83#return; {1755#true} is VALID [2018-11-14 18:38:23,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {1755#true} call #t~ret8 := main(); {1755#true} is VALID [2018-11-14 18:38:23,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {1755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1755#true} is VALID [2018-11-14 18:38:23,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 18:38:23,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {1755#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:23,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(<= main_~i~0 1)} assume true; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:23,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1786#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:23,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:23,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {1786#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {1758#(<= main_~i~0 2)} assume true; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {1758#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {1758#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:23,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {1759#(<= main_~i~0 3)} assume true; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {1759#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {1759#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:23,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {1759#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {1760#(<= main_~i~0 4)} assume true; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {1760#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {1760#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:23,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {1760#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:23,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {1761#(<= main_~i~0 5)} assume true; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:23,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {1761#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1756#false} is VALID [2018-11-14 18:38:23,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {1756#false} assume !(~swapped~0 != 0); {1756#false} is VALID [2018-11-14 18:38:23,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {1756#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1756#false} is VALID [2018-11-14 18:38:23,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {1756#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1756#false} is VALID [2018-11-14 18:38:23,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 18:38:23,869 INFO L273 TraceCheckUtils]: 32: Hoare triple {1756#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1756#false} is VALID [2018-11-14 18:38:23,870 INFO L256 TraceCheckUtils]: 33: Hoare triple {1756#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1756#false} is VALID [2018-11-14 18:38:23,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {1756#false} ~cond := #in~cond; {1756#false} is VALID [2018-11-14 18:38:23,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {1756#false} assume ~cond == 0; {1756#false} is VALID [2018-11-14 18:38:23,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {1756#false} assume !false; {1756#false} is VALID [2018-11-14 18:38:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:23,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:23,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:38:23,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 18:38:23,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:23,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:38:23,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:23,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:38:23,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:38:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:38:23,944 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 8 states. [2018-11-14 18:38:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:24,110 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-11-14 18:38:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:38:24,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 18:38:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:38:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 18:38:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:38:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 18:38:24,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2018-11-14 18:38:24,252 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 18:38:24,254 INFO L225 Difference]: With dead ends: 122 [2018-11-14 18:38:24,254 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 18:38:24,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:38:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 18:38:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-11-14 18:38:24,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:24,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 66 states. [2018-11-14 18:38:24,326 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 66 states. [2018-11-14 18:38:24,326 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 66 states. [2018-11-14 18:38:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:24,329 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2018-11-14 18:38:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-11-14 18:38:24,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:24,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:24,329 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 70 states. [2018-11-14 18:38:24,329 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 70 states. [2018-11-14 18:38:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:24,332 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2018-11-14 18:38:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-11-14 18:38:24,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:24,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:24,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:38:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-14 18:38:24,336 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2018-11-14 18:38:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:24,336 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-14 18:38:24,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:38:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 18:38:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:38:24,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:24,337 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:24,338 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:24,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1370329276, now seen corresponding path program 5 times [2018-11-14 18:38:24,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:24,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:24,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:24,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:24,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:24,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2018-11-14 18:38:24,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2258#true} is VALID [2018-11-14 18:38:24,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 18:38:24,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #83#return; {2258#true} is VALID [2018-11-14 18:38:24,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret8 := main(); {2258#true} is VALID [2018-11-14 18:38:24,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {2258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2258#true} is VALID [2018-11-14 18:38:24,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 18:38:24,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {2258#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2260#(= main_~i~0 1)} is VALID [2018-11-14 18:38:24,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~i~0 1)} assume true; {2260#(= main_~i~0 1)} is VALID [2018-11-14 18:38:24,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {2260#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2260#(= main_~i~0 1)} is VALID [2018-11-14 18:38:24,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {2260#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2260#(= main_~i~0 1)} is VALID [2018-11-14 18:38:24,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {2260#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {2261#(<= main_~i~0 2)} assume true; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {2261#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {2261#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {2262#(<= main_~i~0 3)} assume true; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {2262#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {2262#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(<= main_~i~0 4)} assume true; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {2263#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {2263#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#(<= main_~i~0 5)} assume true; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:24,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {2265#(<= main_~i~0 6)} assume true; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:24,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {2265#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2259#false} is VALID [2018-11-14 18:38:24,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {2259#false} assume !(~swapped~0 != 0); {2259#false} is VALID [2018-11-14 18:38:24,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {2259#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2259#false} is VALID [2018-11-14 18:38:24,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {2259#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2259#false} is VALID [2018-11-14 18:38:24,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {2259#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2259#false} is VALID [2018-11-14 18:38:24,524 INFO L256 TraceCheckUtils]: 37: Hoare triple {2259#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2259#false} is VALID [2018-11-14 18:38:24,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {2259#false} ~cond := #in~cond; {2259#false} is VALID [2018-11-14 18:38:24,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {2259#false} assume ~cond == 0; {2259#false} is VALID [2018-11-14 18:38:24,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2018-11-14 18:38:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:24,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:24,528 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 18:38:24,537 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:38:24,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:38:24,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:24,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:24,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2018-11-14 18:38:24,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2258#true} is VALID [2018-11-14 18:38:24,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 18:38:24,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #83#return; {2258#true} is VALID [2018-11-14 18:38:24,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret8 := main(); {2258#true} is VALID [2018-11-14 18:38:24,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {2258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2258#true} is VALID [2018-11-14 18:38:24,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 18:38:24,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {2258#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:24,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {2290#(<= main_~i~0 1)} assume true; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:24,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {2290#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2290#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:24,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {2290#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:24,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {2290#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {2261#(<= main_~i~0 2)} assume true; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {2261#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:24,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {2261#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {2262#(<= main_~i~0 3)} assume true; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {2262#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:24,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {2262#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(<= main_~i~0 4)} assume true; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {2263#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:24,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {2263#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#(<= main_~i~0 5)} assume true; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:24,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:24,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {2265#(<= main_~i~0 6)} assume true; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:24,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {2265#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2259#false} is VALID [2018-11-14 18:38:24,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {2259#false} assume !(~swapped~0 != 0); {2259#false} is VALID [2018-11-14 18:38:24,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {2259#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2259#false} is VALID [2018-11-14 18:38:24,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {2259#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2259#false} is VALID [2018-11-14 18:38:24,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 18:38:24,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {2259#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2259#false} is VALID [2018-11-14 18:38:24,747 INFO L256 TraceCheckUtils]: 37: Hoare triple {2259#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2259#false} is VALID [2018-11-14 18:38:24,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {2259#false} ~cond := #in~cond; {2259#false} is VALID [2018-11-14 18:38:24,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {2259#false} assume ~cond == 0; {2259#false} is VALID [2018-11-14 18:38:24,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2018-11-14 18:38:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:24,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:24,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:38:24,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:38:24,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:24,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:38:24,847 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 18:38:24,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:38:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:38:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:38:24,848 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 9 states. [2018-11-14 18:38:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:25,425 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2018-11-14 18:38:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:38:25,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:38:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:38:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 18:38:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:38:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 18:38:25,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2018-11-14 18:38:25,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:25,676 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:38:25,676 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:38:25,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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 18:38:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:38:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-11-14 18:38:25,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:25,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 74 states. [2018-11-14 18:38:25,729 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 74 states. [2018-11-14 18:38:25,729 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 74 states. [2018-11-14 18:38:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:25,732 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-14 18:38:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-14 18:38:25,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:25,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:25,732 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 78 states. [2018-11-14 18:38:25,733 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 78 states. [2018-11-14 18:38:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:25,735 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-14 18:38:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-14 18:38:25,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:25,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:25,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:25,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:38:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-14 18:38:25,738 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 41 [2018-11-14 18:38:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:25,739 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-14 18:38:25,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:38:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-14 18:38:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:38:25,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:25,740 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:25,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:25,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1485603564, now seen corresponding path program 6 times [2018-11-14 18:38:25,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:25,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:25,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:25,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {2820#true} call ULTIMATE.init(); {2820#true} is VALID [2018-11-14 18:38:25,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {2820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2820#true} is VALID [2018-11-14 18:38:25,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 18:38:25,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #83#return; {2820#true} is VALID [2018-11-14 18:38:25,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {2820#true} call #t~ret8 := main(); {2820#true} is VALID [2018-11-14 18:38:25,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {2820#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2820#true} is VALID [2018-11-14 18:38:25,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 18:38:25,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {2820#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2822#(= main_~i~0 1)} is VALID [2018-11-14 18:38:25,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {2822#(= main_~i~0 1)} assume true; {2822#(= main_~i~0 1)} is VALID [2018-11-14 18:38:25,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {2822#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2822#(= main_~i~0 1)} is VALID [2018-11-14 18:38:26,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {2822#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2822#(= main_~i~0 1)} is VALID [2018-11-14 18:38:26,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {2822#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {2823#(<= main_~i~0 2)} assume true; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {2823#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {2823#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {2823#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {2824#(<= main_~i~0 3)} assume true; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {2824#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {2824#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {2824#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {2825#(<= main_~i~0 4)} assume true; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {2825#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {2825#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {2825#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {2826#(<= main_~i~0 5)} assume true; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,012 INFO L273 TraceCheckUtils]: 25: Hoare triple {2826#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {2826#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {2826#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {2827#(<= main_~i~0 6)} assume true; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {2827#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {2827#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {2827#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:26,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {2828#(<= main_~i~0 7)} assume true; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:26,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {2828#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2821#false} is VALID [2018-11-14 18:38:26,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {2821#false} assume !(~swapped~0 != 0); {2821#false} is VALID [2018-11-14 18:38:26,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {2821#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2821#false} is VALID [2018-11-14 18:38:26,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {2821#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {2821#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L256 TraceCheckUtils]: 41: Hoare triple {2821#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 42: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {2821#false} assume ~cond == 0; {2821#false} is VALID [2018-11-14 18:38:26,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2018-11-14 18:38:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:26,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:26,031 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 18:38:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:38:26,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-14 18:38:26,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:26,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:26,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {2820#true} call ULTIMATE.init(); {2820#true} is VALID [2018-11-14 18:38:26,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {2820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2820#true} is VALID [2018-11-14 18:38:26,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 18:38:26,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #83#return; {2820#true} is VALID [2018-11-14 18:38:26,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {2820#true} call #t~ret8 := main(); {2820#true} is VALID [2018-11-14 18:38:26,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {2820#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2820#true} is VALID [2018-11-14 18:38:26,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 18:38:26,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {2820#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:26,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {2853#(<= main_~i~0 1)} assume true; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:26,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {2853#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2853#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:26,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {2853#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:26,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {2853#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {2823#(<= main_~i~0 2)} assume true; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {2823#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {2823#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:26,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {2823#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {2824#(<= main_~i~0 3)} assume true; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {2824#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {2824#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:26,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {2824#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {2825#(<= main_~i~0 4)} assume true; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {2825#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {2825#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:26,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {2825#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {2826#(<= main_~i~0 5)} assume true; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {2826#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {2826#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:26,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {2826#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {2827#(<= main_~i~0 6)} assume true; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {2827#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {2827#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:26,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {2827#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:26,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {2828#(<= main_~i~0 7)} assume true; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:26,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {2828#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2821#false} is VALID [2018-11-14 18:38:26,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {2821#false} assume !(~swapped~0 != 0); {2821#false} is VALID [2018-11-14 18:38:26,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {2821#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2821#false} is VALID [2018-11-14 18:38:26,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {2821#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2821#false} is VALID [2018-11-14 18:38:26,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 18:38:26,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {2821#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2821#false} is VALID [2018-11-14 18:38:26,474 INFO L256 TraceCheckUtils]: 41: Hoare triple {2821#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2821#false} is VALID [2018-11-14 18:38:26,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2018-11-14 18:38:26,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {2821#false} assume ~cond == 0; {2821#false} is VALID [2018-11-14 18:38:26,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2018-11-14 18:38:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:38:26,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 18:38:26,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:26,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:38:26,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:26,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:38:26,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:38:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:38:26,547 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 10 states. [2018-11-14 18:38:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:27,141 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2018-11-14 18:38:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:38:27,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 18:38:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:38:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-14 18:38:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:38:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-14 18:38:27,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2018-11-14 18:38:27,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:27,252 INFO L225 Difference]: With dead ends: 154 [2018-11-14 18:38:27,253 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:38:27,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:38:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:38:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-14 18:38:27,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:27,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 82 states. [2018-11-14 18:38:27,280 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 82 states. [2018-11-14 18:38:27,280 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 82 states. [2018-11-14 18:38:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:27,284 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-14 18:38:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-14 18:38:27,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:27,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:27,284 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 86 states. [2018-11-14 18:38:27,285 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 86 states. [2018-11-14 18:38:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:27,288 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-14 18:38:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-14 18:38:27,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:27,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:27,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:27,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 18:38:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-14 18:38:27,291 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 45 [2018-11-14 18:38:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:27,292 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-14 18:38:27,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:38:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-14 18:38:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:38:27,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:27,293 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:27,293 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1791263380, now seen corresponding path program 7 times [2018-11-14 18:38:27,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:27,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:27,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:27,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:27,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {3441#true} call ULTIMATE.init(); {3441#true} is VALID [2018-11-14 18:38:27,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {3441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3441#true} is VALID [2018-11-14 18:38:27,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 18:38:27,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3441#true} {3441#true} #83#return; {3441#true} is VALID [2018-11-14 18:38:27,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {3441#true} call #t~ret8 := main(); {3441#true} is VALID [2018-11-14 18:38:27,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {3441#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3441#true} is VALID [2018-11-14 18:38:27,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 18:38:27,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {3441#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {3443#(= main_~i~0 1)} is VALID [2018-11-14 18:38:27,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {3443#(= main_~i~0 1)} assume true; {3443#(= main_~i~0 1)} is VALID [2018-11-14 18:38:27,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {3443#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3443#(= main_~i~0 1)} is VALID [2018-11-14 18:38:27,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {3443#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3443#(= main_~i~0 1)} is VALID [2018-11-14 18:38:27,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {3443#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:27,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#(<= main_~i~0 2)} assume true; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:27,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:27,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:27,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:27,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 3)} assume true; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:27,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:27,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {3445#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:27,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {3445#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:27,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {3446#(<= main_~i~0 4)} assume true; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:27,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:27,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:27,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {3446#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:27,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {3447#(<= main_~i~0 5)} assume true; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:27,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {3447#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:27,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {3447#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:27,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {3447#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:27,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#(<= main_~i~0 6)} assume true; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:27,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:27,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:27,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:27,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#(<= main_~i~0 7)} assume true; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:27,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:27,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:27,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:27,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {3450#(<= main_~i~0 8)} assume true; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:27,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {3450#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3442#false} is VALID [2018-11-14 18:38:27,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:27,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {3442#false} assume !(~swapped~0 != 0); {3442#false} is VALID [2018-11-14 18:38:27,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {3442#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3442#false} is VALID [2018-11-14 18:38:27,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:27,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {3442#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {3442#false} is VALID [2018-11-14 18:38:27,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:27,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {3442#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {3442#false} is VALID [2018-11-14 18:38:27,581 INFO L256 TraceCheckUtils]: 45: Hoare triple {3442#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3442#false} is VALID [2018-11-14 18:38:27,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {3442#false} ~cond := #in~cond; {3442#false} is VALID [2018-11-14 18:38:27,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {3442#false} assume ~cond == 0; {3442#false} is VALID [2018-11-14 18:38:27,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {3442#false} assume !false; {3442#false} is VALID [2018-11-14 18:38:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:27,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:27,584 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 18:38:27,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:27,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:28,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {3441#true} call ULTIMATE.init(); {3441#true} is VALID [2018-11-14 18:38:28,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {3441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3441#true} is VALID [2018-11-14 18:38:28,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 18:38:28,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3441#true} {3441#true} #83#return; {3441#true} is VALID [2018-11-14 18:38:28,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {3441#true} call #t~ret8 := main(); {3441#true} is VALID [2018-11-14 18:38:28,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {3441#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3441#true} is VALID [2018-11-14 18:38:28,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 18:38:28,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {3441#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:28,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {3475#(<= main_~i~0 1)} assume true; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:28,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {3475#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3475#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:28,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {3475#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:28,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {3475#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:28,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#(<= main_~i~0 2)} assume true; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:28,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:28,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:28,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:28,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 3)} assume true; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:28,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:28,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {3445#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:28,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {3445#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:28,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {3446#(<= main_~i~0 4)} assume true; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:28,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:28,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:28,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {3446#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:28,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {3447#(<= main_~i~0 5)} assume true; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:28,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {3447#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:28,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {3447#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:28,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {3447#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:28,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#(<= main_~i~0 6)} assume true; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:28,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:28,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:28,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:28,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#(<= main_~i~0 7)} assume true; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:28,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:28,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:28,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:28,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {3450#(<= main_~i~0 8)} assume true; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:28,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {3450#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3442#false} is VALID [2018-11-14 18:38:28,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:28,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {3442#false} assume !(~swapped~0 != 0); {3442#false} is VALID [2018-11-14 18:38:28,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {3442#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3442#false} is VALID [2018-11-14 18:38:28,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:28,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {3442#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {3442#false} is VALID [2018-11-14 18:38:28,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 18:38:28,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {3442#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {3442#false} is VALID [2018-11-14 18:38:28,340 INFO L256 TraceCheckUtils]: 45: Hoare triple {3442#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3442#false} is VALID [2018-11-14 18:38:28,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {3442#false} ~cond := #in~cond; {3442#false} is VALID [2018-11-14 18:38:28,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {3442#false} assume ~cond == 0; {3442#false} is VALID [2018-11-14 18:38:28,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {3442#false} assume !false; {3442#false} is VALID [2018-11-14 18:38:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:38:28,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 18:38:28,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:28,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:38:28,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:28,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:38:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:38:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:38:28,423 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 11 states. [2018-11-14 18:38:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:28,749 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2018-11-14 18:38:28,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:38:28,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 18:38:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:38:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-14 18:38:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:38:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-14 18:38:28,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2018-11-14 18:38:28,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:28,965 INFO L225 Difference]: With dead ends: 170 [2018-11-14 18:38:28,965 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 18:38:28,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:38:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 18:38:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-11-14 18:38:29,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:29,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 90 states. [2018-11-14 18:38:29,009 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 90 states. [2018-11-14 18:38:29,009 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 90 states. [2018-11-14 18:38:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:29,010 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-14 18:38:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-11-14 18:38:29,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:29,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:29,012 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 94 states. [2018-11-14 18:38:29,012 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 94 states. [2018-11-14 18:38:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:29,014 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-14 18:38:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-11-14 18:38:29,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:29,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:29,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:29,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:38:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-14 18:38:29,017 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 49 [2018-11-14 18:38:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:29,018 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-14 18:38:29,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:38:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-14 18:38:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 18:38:29,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:29,019 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:29,019 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:29,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1675334084, now seen corresponding path program 8 times [2018-11-14 18:38:29,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:29,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:29,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:29,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:29,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-14 18:38:29,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4121#true} is VALID [2018-11-14 18:38:29,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 18:38:29,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #83#return; {4121#true} is VALID [2018-11-14 18:38:29,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret8 := main(); {4121#true} is VALID [2018-11-14 18:38:29,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4121#true} is VALID [2018-11-14 18:38:29,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 18:38:29,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4123#(= main_~i~0 1)} is VALID [2018-11-14 18:38:29,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {4123#(= main_~i~0 1)} assume true; {4123#(= main_~i~0 1)} is VALID [2018-11-14 18:38:29,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {4123#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4123#(= main_~i~0 1)} is VALID [2018-11-14 18:38:29,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {4123#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4123#(= main_~i~0 1)} is VALID [2018-11-14 18:38:29,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {4123#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:29,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#(<= main_~i~0 2)} assume true; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:29,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:29,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:29,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:29,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {4125#(<= main_~i~0 3)} assume true; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:29,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {4125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:29,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:29,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:29,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 4)} assume true; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:29,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:29,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:29,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:29,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 5)} assume true; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:29,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:29,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:29,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {4127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:29,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 6)} assume true; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:29,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:29,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {4128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:29,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {4128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:29,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 7)} assume true; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:29,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {4129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:29,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {4129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:29,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {4129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:29,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {4130#(<= main_~i~0 8)} assume true; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:29,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {4130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:29,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {4130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:29,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {4130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:29,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {4131#(<= main_~i~0 9)} assume true; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:29,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {4131#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4122#false} is VALID [2018-11-14 18:38:29,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:29,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {4122#false} assume !(~swapped~0 != 0); {4122#false} is VALID [2018-11-14 18:38:29,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {4122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4122#false} is VALID [2018-11-14 18:38:29,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:29,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {4122#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4122#false} is VALID [2018-11-14 18:38:29,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:29,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {4122#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4122#false} is VALID [2018-11-14 18:38:29,721 INFO L256 TraceCheckUtils]: 49: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4122#false} is VALID [2018-11-14 18:38:29,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-14 18:38:29,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} assume ~cond == 0; {4122#false} is VALID [2018-11-14 18:38:29,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-14 18:38:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:29,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:29,724 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 18:38:29,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:38:29,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:38:29,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:29,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:30,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-14 18:38:30,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4121#true} is VALID [2018-11-14 18:38:30,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 18:38:30,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #83#return; {4121#true} is VALID [2018-11-14 18:38:30,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret8 := main(); {4121#true} is VALID [2018-11-14 18:38:30,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4121#true} is VALID [2018-11-14 18:38:30,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 18:38:30,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:30,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {4156#(<= main_~i~0 1)} assume true; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:30,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {4156#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4156#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:30,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {4156#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:30,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {4156#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:30,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#(<= main_~i~0 2)} assume true; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:30,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:30,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:30,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:30,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {4125#(<= main_~i~0 3)} assume true; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:30,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {4125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:30,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:30,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:30,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 4)} assume true; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:30,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:30,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:30,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:30,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 5)} assume true; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:30,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:30,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:30,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {4127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:30,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 6)} assume true; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:30,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:30,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {4128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:30,070 INFO L273 TraceCheckUtils]: 31: Hoare triple {4128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:30,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 7)} assume true; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:30,071 INFO L273 TraceCheckUtils]: 33: Hoare triple {4129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:30,071 INFO L273 TraceCheckUtils]: 34: Hoare triple {4129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:30,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {4129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:30,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {4130#(<= main_~i~0 8)} assume true; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:30,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {4130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:30,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {4130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:30,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {4130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:30,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {4131#(<= main_~i~0 9)} assume true; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:30,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {4131#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4122#false} is VALID [2018-11-14 18:38:30,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {4122#false} assume !(~swapped~0 != 0); {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {4122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {4122#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 47: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {4122#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4122#false} is VALID [2018-11-14 18:38:30,098 INFO L256 TraceCheckUtils]: 49: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4122#false} is VALID [2018-11-14 18:38:30,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-14 18:38:30,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} assume ~cond == 0; {4122#false} is VALID [2018-11-14 18:38:30,099 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-14 18:38:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:30,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:30,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:38:30,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 18:38:30,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:30,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:38:30,196 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 18:38:30,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:38:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:38:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:38:30,197 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 12 states. [2018-11-14 18:38:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:30,440 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2018-11-14 18:38:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:38:30,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 18:38:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:38:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 18:38:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:38:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 18:38:30,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2018-11-14 18:38:30,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:30,951 INFO L225 Difference]: With dead ends: 186 [2018-11-14 18:38:30,951 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 18:38:30,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 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 18:38:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 18:38:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-14 18:38:31,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:31,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 98 states. [2018-11-14 18:38:31,025 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 98 states. [2018-11-14 18:38:31,025 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 98 states. [2018-11-14 18:38:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:31,027 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2018-11-14 18:38:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2018-11-14 18:38:31,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:31,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:31,028 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 102 states. [2018-11-14 18:38:31,028 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 102 states. [2018-11-14 18:38:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:31,030 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2018-11-14 18:38:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2018-11-14 18:38:31,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:31,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:31,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:31,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 18:38:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-14 18:38:31,033 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 53 [2018-11-14 18:38:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:31,034 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-14 18:38:31,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:38:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 18:38:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 18:38:31,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:31,035 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:31,035 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:31,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:31,035 INFO L82 PathProgramCache]: Analyzing trace with hash 19511836, now seen corresponding path program 9 times [2018-11-14 18:38:31,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:31,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:31,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:31,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2018-11-14 18:38:31,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {4860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4860#true} is VALID [2018-11-14 18:38:31,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 18:38:31,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #83#return; {4860#true} is VALID [2018-11-14 18:38:31,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret8 := main(); {4860#true} is VALID [2018-11-14 18:38:31,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {4860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4860#true} is VALID [2018-11-14 18:38:31,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 18:38:31,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {4860#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4862#(= main_~i~0 1)} is VALID [2018-11-14 18:38:31,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {4862#(= main_~i~0 1)} assume true; {4862#(= main_~i~0 1)} is VALID [2018-11-14 18:38:31,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {4862#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4862#(= main_~i~0 1)} is VALID [2018-11-14 18:38:31,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {4862#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4862#(= main_~i~0 1)} is VALID [2018-11-14 18:38:31,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {4862#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {4863#(<= main_~i~0 2)} assume true; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {4863#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {4863#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {4863#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {4864#(<= main_~i~0 3)} assume true; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {4864#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {4864#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {4864#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {4865#(<= main_~i~0 4)} assume true; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {4865#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {4865#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {4865#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {4866#(<= main_~i~0 5)} assume true; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {4866#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 6)} assume true; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {4867#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {4867#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {4868#(<= main_~i~0 7)} assume true; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {4868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {4868#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {4868#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,296 INFO L273 TraceCheckUtils]: 36: Hoare triple {4869#(<= main_~i~0 8)} assume true; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {4869#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {4869#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {4869#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {4870#(<= main_~i~0 9)} assume true; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {4870#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {4870#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {4870#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:31,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {4871#(<= main_~i~0 10)} assume true; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:31,301 INFO L273 TraceCheckUtils]: 45: Hoare triple {4871#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4861#false} is VALID [2018-11-14 18:38:31,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {4861#false} assume !(~swapped~0 != 0); {4861#false} is VALID [2018-11-14 18:38:31,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {4861#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4861#false} is VALID [2018-11-14 18:38:31,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,303 INFO L273 TraceCheckUtils]: 50: Hoare triple {4861#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4861#false} is VALID [2018-11-14 18:38:31,303 INFO L273 TraceCheckUtils]: 51: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {4861#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4861#false} is VALID [2018-11-14 18:38:31,303 INFO L256 TraceCheckUtils]: 53: Hoare triple {4861#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4861#false} is VALID [2018-11-14 18:38:31,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2018-11-14 18:38:31,304 INFO L273 TraceCheckUtils]: 55: Hoare triple {4861#false} assume ~cond == 0; {4861#false} is VALID [2018-11-14 18:38:31,304 INFO L273 TraceCheckUtils]: 56: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2018-11-14 18:38:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:31,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:31,308 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 18:38:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:38:31,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 18:38:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:31,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:31,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2018-11-14 18:38:31,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {4860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4860#true} is VALID [2018-11-14 18:38:31,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 18:38:31,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #83#return; {4860#true} is VALID [2018-11-14 18:38:31,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret8 := main(); {4860#true} is VALID [2018-11-14 18:38:31,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {4860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4860#true} is VALID [2018-11-14 18:38:31,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 18:38:31,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {4860#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4896#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:31,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {4896#(<= main_~i~0 1)} assume true; {4896#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:31,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {4896#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4896#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:31,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {4896#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4896#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:31,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {4896#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {4863#(<= main_~i~0 2)} assume true; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {4863#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {4863#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:31,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {4863#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {4864#(<= main_~i~0 3)} assume true; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {4864#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {4864#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:31,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {4864#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {4865#(<= main_~i~0 4)} assume true; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {4865#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {4865#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:31,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {4865#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {4866#(<= main_~i~0 5)} assume true; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {4866#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:31,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 6)} assume true; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {4867#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:31,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {4867#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {4868#(<= main_~i~0 7)} assume true; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {4868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {4868#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:31,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {4868#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {4869#(<= main_~i~0 8)} assume true; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {4869#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {4869#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:31,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {4869#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {4870#(<= main_~i~0 9)} assume true; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {4870#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {4870#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:31,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {4870#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:31,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {4871#(<= main_~i~0 10)} assume true; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:31,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {4871#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4861#false} is VALID [2018-11-14 18:38:31,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {4861#false} assume !(~swapped~0 != 0); {4861#false} is VALID [2018-11-14 18:38:31,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {4861#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4861#false} is VALID [2018-11-14 18:38:31,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {4861#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {4861#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L256 TraceCheckUtils]: 53: Hoare triple {4861#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2018-11-14 18:38:31,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {4861#false} assume ~cond == 0; {4861#false} is VALID [2018-11-14 18:38:31,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2018-11-14 18:38:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:31,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:38:31,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-14 18:38:31,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:31,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:38:31,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:31,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:38:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:38:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:38:31,820 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 13 states. [2018-11-14 18:38:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:32,159 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2018-11-14 18:38:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:38:32,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-14 18:38:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:38:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2018-11-14 18:38:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:38:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2018-11-14 18:38:32,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 107 transitions. [2018-11-14 18:38:32,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:32,586 INFO L225 Difference]: With dead ends: 202 [2018-11-14 18:38:32,586 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 18:38:32,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:38:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 18:38:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2018-11-14 18:38:32,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:32,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 106 states. [2018-11-14 18:38:32,694 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 106 states. [2018-11-14 18:38:32,694 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 106 states. [2018-11-14 18:38:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:32,697 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-11-14 18:38:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2018-11-14 18:38:32,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:32,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:32,698 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 110 states. [2018-11-14 18:38:32,698 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 110 states. [2018-11-14 18:38:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:32,699 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-11-14 18:38:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2018-11-14 18:38:32,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:32,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:32,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-14 18:38:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-11-14 18:38:32,703 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 57 [2018-11-14 18:38:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:32,703 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2018-11-14 18:38:32,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:38:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 18:38:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 18:38:32,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:32,704 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:32,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2147219060, now seen corresponding path program 10 times [2018-11-14 18:38:32,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:32,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:32,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:33,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {5658#true} call ULTIMATE.init(); {5658#true} is VALID [2018-11-14 18:38:33,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {5658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5658#true} is VALID [2018-11-14 18:38:33,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {5658#true} assume true; {5658#true} is VALID [2018-11-14 18:38:33,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5658#true} {5658#true} #83#return; {5658#true} is VALID [2018-11-14 18:38:33,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {5658#true} call #t~ret8 := main(); {5658#true} is VALID [2018-11-14 18:38:33,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {5658#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5658#true} is VALID [2018-11-14 18:38:33,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {5658#true} assume true; {5658#true} is VALID [2018-11-14 18:38:33,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {5658#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {5660#(= main_~i~0 1)} is VALID [2018-11-14 18:38:33,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {5660#(= main_~i~0 1)} assume true; {5660#(= main_~i~0 1)} is VALID [2018-11-14 18:38:33,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {5660#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5660#(= main_~i~0 1)} is VALID [2018-11-14 18:38:33,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {5660#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5660#(= main_~i~0 1)} is VALID [2018-11-14 18:38:33,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {5660#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {5661#(<= main_~i~0 2)} assume true; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {5661#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {5661#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {5661#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {5662#(<= main_~i~0 3)} assume true; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {5662#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {5662#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {5662#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {5663#(<= main_~i~0 4)} assume true; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {5663#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {5663#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {5663#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {5664#(<= main_~i~0 5)} assume true; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {5664#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {5664#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {5664#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {5665#(<= main_~i~0 6)} assume true; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {5665#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {5665#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {5665#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {5666#(<= main_~i~0 7)} assume true; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {5666#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {5666#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {5666#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {5667#(<= main_~i~0 8)} assume true; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {5667#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {5667#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {5667#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {5668#(<= main_~i~0 9)} assume true; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {5668#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {5668#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {5668#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {5669#(<= main_~i~0 10)} assume true; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {5669#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,288 INFO L273 TraceCheckUtils]: 46: Hoare triple {5669#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,289 INFO L273 TraceCheckUtils]: 47: Hoare triple {5669#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5670#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:33,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {5670#(<= main_~i~0 11)} assume true; {5670#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:33,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {5670#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5659#false} is VALID [2018-11-14 18:38:33,291 INFO L273 TraceCheckUtils]: 50: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,291 INFO L273 TraceCheckUtils]: 51: Hoare triple {5659#false} assume !(~swapped~0 != 0); {5659#false} is VALID [2018-11-14 18:38:33,291 INFO L273 TraceCheckUtils]: 52: Hoare triple {5659#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5659#false} is VALID [2018-11-14 18:38:33,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {5659#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {5659#false} is VALID [2018-11-14 18:38:33,292 INFO L273 TraceCheckUtils]: 55: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {5659#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5659#false} is VALID [2018-11-14 18:38:33,292 INFO L256 TraceCheckUtils]: 57: Hoare triple {5659#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5659#false} is VALID [2018-11-14 18:38:33,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {5659#false} ~cond := #in~cond; {5659#false} is VALID [2018-11-14 18:38:33,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {5659#false} assume ~cond == 0; {5659#false} is VALID [2018-11-14 18:38:33,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {5659#false} assume !false; {5659#false} is VALID [2018-11-14 18:38:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:33,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:33,296 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 18:38:33,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:38:33,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:38:33,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:33,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:33,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {5658#true} call ULTIMATE.init(); {5658#true} is VALID [2018-11-14 18:38:33,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {5658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5658#true} is VALID [2018-11-14 18:38:33,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {5658#true} assume true; {5658#true} is VALID [2018-11-14 18:38:33,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5658#true} {5658#true} #83#return; {5658#true} is VALID [2018-11-14 18:38:33,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {5658#true} call #t~ret8 := main(); {5658#true} is VALID [2018-11-14 18:38:33,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {5658#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5658#true} is VALID [2018-11-14 18:38:33,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {5658#true} assume true; {5658#true} is VALID [2018-11-14 18:38:33,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {5658#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {5695#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:33,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {5695#(<= main_~i~0 1)} assume true; {5695#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:33,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {5695#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5695#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:33,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {5695#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5695#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:33,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {5695#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {5661#(<= main_~i~0 2)} assume true; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {5661#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {5661#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5661#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:33,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {5661#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {5662#(<= main_~i~0 3)} assume true; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {5662#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {5662#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5662#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:33,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {5662#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {5663#(<= main_~i~0 4)} assume true; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {5663#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {5663#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5663#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:33,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {5663#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {5664#(<= main_~i~0 5)} assume true; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {5664#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {5664#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5664#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:33,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {5664#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {5665#(<= main_~i~0 6)} assume true; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {5665#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {5665#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5665#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:33,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {5665#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {5666#(<= main_~i~0 7)} assume true; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {5666#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {5666#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5666#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:33,514 INFO L273 TraceCheckUtils]: 35: Hoare triple {5666#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {5667#(<= main_~i~0 8)} assume true; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {5667#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {5667#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5667#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:33,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {5667#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {5668#(<= main_~i~0 9)} assume true; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {5668#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {5668#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5668#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:33,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {5668#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {5669#(<= main_~i~0 10)} assume true; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {5669#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {5669#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5669#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:33,523 INFO L273 TraceCheckUtils]: 47: Hoare triple {5669#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5670#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:33,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {5670#(<= main_~i~0 11)} assume true; {5670#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:33,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {5670#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5659#false} is VALID [2018-11-14 18:38:33,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {5659#false} assume !(~swapped~0 != 0); {5659#false} is VALID [2018-11-14 18:38:33,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {5659#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5659#false} is VALID [2018-11-14 18:38:33,525 INFO L273 TraceCheckUtils]: 53: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {5659#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {5659#false} is VALID [2018-11-14 18:38:33,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {5659#false} assume true; {5659#false} is VALID [2018-11-14 18:38:33,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {5659#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5659#false} is VALID [2018-11-14 18:38:33,526 INFO L256 TraceCheckUtils]: 57: Hoare triple {5659#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5659#false} is VALID [2018-11-14 18:38:33,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {5659#false} ~cond := #in~cond; {5659#false} is VALID [2018-11-14 18:38:33,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {5659#false} assume ~cond == 0; {5659#false} is VALID [2018-11-14 18:38:33,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {5659#false} assume !false; {5659#false} is VALID [2018-11-14 18:38:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:33,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:38:33,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-14 18:38:33,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:33,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:38:33,623 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 18:38:33,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:38:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:38:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:38:33,624 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 14 states. [2018-11-14 18:38:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:33,960 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2018-11-14 18:38:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:38:33,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-14 18:38:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:38:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-14 18:38:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:38:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-14 18:38:33,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2018-11-14 18:38:34,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:34,486 INFO L225 Difference]: With dead ends: 218 [2018-11-14 18:38:34,486 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 18:38:34,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:38:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 18:38:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-11-14 18:38:34,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:34,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 114 states. [2018-11-14 18:38:34,528 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 114 states. [2018-11-14 18:38:34,529 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 114 states. [2018-11-14 18:38:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:34,533 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2018-11-14 18:38:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2018-11-14 18:38:34,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:34,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:34,534 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 118 states. [2018-11-14 18:38:34,534 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 118 states. [2018-11-14 18:38:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:34,537 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2018-11-14 18:38:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2018-11-14 18:38:34,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:34,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:34,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:34,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 18:38:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2018-11-14 18:38:34,541 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 61 [2018-11-14 18:38:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:34,542 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2018-11-14 18:38:34,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:38:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 18:38:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 18:38:34,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:34,543 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:34,544 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:34,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1742190900, now seen corresponding path program 11 times [2018-11-14 18:38:34,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:34,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:34,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:35,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {6515#true} call ULTIMATE.init(); {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {6515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {6515#true} assume true; {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6515#true} {6515#true} #83#return; {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {6515#true} call #t~ret8 := main(); {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {6515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6515#true} is VALID [2018-11-14 18:38:35,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {6515#true} assume true; {6515#true} is VALID [2018-11-14 18:38:35,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {6515#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {6517#(= main_~i~0 1)} is VALID [2018-11-14 18:38:35,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {6517#(= main_~i~0 1)} assume true; {6517#(= main_~i~0 1)} is VALID [2018-11-14 18:38:35,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {6517#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6517#(= main_~i~0 1)} is VALID [2018-11-14 18:38:35,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {6517#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6517#(= main_~i~0 1)} is VALID [2018-11-14 18:38:35,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {6517#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#(<= main_~i~0 2)} assume true; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {6519#(<= main_~i~0 3)} assume true; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {6519#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {6519#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {6519#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {6520#(<= main_~i~0 4)} assume true; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {6520#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {6520#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {6520#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {6521#(<= main_~i~0 5)} assume true; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,595 INFO L273 TraceCheckUtils]: 25: Hoare triple {6521#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {6521#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,596 INFO L273 TraceCheckUtils]: 27: Hoare triple {6521#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {6522#(<= main_~i~0 6)} assume true; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,597 INFO L273 TraceCheckUtils]: 29: Hoare triple {6522#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {6522#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,599 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 7)} assume true; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {6523#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {6523#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {6523#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,601 INFO L273 TraceCheckUtils]: 36: Hoare triple {6524#(<= main_~i~0 8)} assume true; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {6524#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {6524#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {6524#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {6525#(<= main_~i~0 9)} assume true; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {6525#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,605 INFO L273 TraceCheckUtils]: 42: Hoare triple {6525#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {6525#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {6526#(<= main_~i~0 10)} assume true; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {6526#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,607 INFO L273 TraceCheckUtils]: 46: Hoare triple {6526#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,608 INFO L273 TraceCheckUtils]: 47: Hoare triple {6526#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,608 INFO L273 TraceCheckUtils]: 48: Hoare triple {6527#(<= main_~i~0 11)} assume true; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {6527#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {6527#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,610 INFO L273 TraceCheckUtils]: 51: Hoare triple {6527#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6528#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:35,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {6528#(<= main_~i~0 12)} assume true; {6528#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:35,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {6528#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6516#false} is VALID [2018-11-14 18:38:35,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {6516#false} assume !(~swapped~0 != 0); {6516#false} is VALID [2018-11-14 18:38:35,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {6516#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6516#false} is VALID [2018-11-14 18:38:35,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {6516#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {6516#false} is VALID [2018-11-14 18:38:35,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,613 INFO L273 TraceCheckUtils]: 60: Hoare triple {6516#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6516#false} is VALID [2018-11-14 18:38:35,613 INFO L256 TraceCheckUtils]: 61: Hoare triple {6516#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6516#false} is VALID [2018-11-14 18:38:35,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {6516#false} ~cond := #in~cond; {6516#false} is VALID [2018-11-14 18:38:35,614 INFO L273 TraceCheckUtils]: 63: Hoare triple {6516#false} assume ~cond == 0; {6516#false} is VALID [2018-11-14 18:38:35,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {6516#false} assume !false; {6516#false} is VALID [2018-11-14 18:38:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:35,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:35,617 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 18:38:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:38:35,660 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:38:35,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:35,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:35,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {6515#true} call ULTIMATE.init(); {6515#true} is VALID [2018-11-14 18:38:35,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {6515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6515#true} is VALID [2018-11-14 18:38:35,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {6515#true} assume true; {6515#true} is VALID [2018-11-14 18:38:35,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6515#true} {6515#true} #83#return; {6515#true} is VALID [2018-11-14 18:38:35,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {6515#true} call #t~ret8 := main(); {6515#true} is VALID [2018-11-14 18:38:35,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {6515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6515#true} is VALID [2018-11-14 18:38:35,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {6515#true} assume true; {6515#true} is VALID [2018-11-14 18:38:35,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {6515#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {6553#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:35,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {6553#(<= main_~i~0 1)} assume true; {6553#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:35,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {6553#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6553#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:35,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6553#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:35,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {6553#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#(<= main_~i~0 2)} assume true; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6518#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:35,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {6519#(<= main_~i~0 3)} assume true; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {6519#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {6519#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6519#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:35,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {6519#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {6520#(<= main_~i~0 4)} assume true; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {6520#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {6520#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6520#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:35,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {6520#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {6521#(<= main_~i~0 5)} assume true; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {6521#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {6521#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6521#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:35,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {6521#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {6522#(<= main_~i~0 6)} assume true; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {6522#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {6522#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6522#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:35,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {6522#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {6523#(<= main_~i~0 7)} assume true; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {6523#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {6523#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6523#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:35,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {6523#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {6524#(<= main_~i~0 8)} assume true; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {6524#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {6524#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6524#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:35,869 INFO L273 TraceCheckUtils]: 39: Hoare triple {6524#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {6525#(<= main_~i~0 9)} assume true; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {6525#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,871 INFO L273 TraceCheckUtils]: 42: Hoare triple {6525#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6525#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:35,871 INFO L273 TraceCheckUtils]: 43: Hoare triple {6525#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,872 INFO L273 TraceCheckUtils]: 44: Hoare triple {6526#(<= main_~i~0 10)} assume true; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,872 INFO L273 TraceCheckUtils]: 45: Hoare triple {6526#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,873 INFO L273 TraceCheckUtils]: 46: Hoare triple {6526#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6526#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:35,874 INFO L273 TraceCheckUtils]: 47: Hoare triple {6526#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,874 INFO L273 TraceCheckUtils]: 48: Hoare triple {6527#(<= main_~i~0 11)} assume true; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,875 INFO L273 TraceCheckUtils]: 49: Hoare triple {6527#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {6527#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6527#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:35,876 INFO L273 TraceCheckUtils]: 51: Hoare triple {6527#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6528#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:35,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {6528#(<= main_~i~0 12)} assume true; {6528#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:35,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {6528#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6516#false} is VALID [2018-11-14 18:38:35,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {6516#false} assume !(~swapped~0 != 0); {6516#false} is VALID [2018-11-14 18:38:35,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {6516#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6516#false} is VALID [2018-11-14 18:38:35,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {6516#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {6516#false} is VALID [2018-11-14 18:38:35,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {6516#false} assume true; {6516#false} is VALID [2018-11-14 18:38:35,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {6516#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6516#false} is VALID [2018-11-14 18:38:35,879 INFO L256 TraceCheckUtils]: 61: Hoare triple {6516#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6516#false} is VALID [2018-11-14 18:38:35,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {6516#false} ~cond := #in~cond; {6516#false} is VALID [2018-11-14 18:38:35,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {6516#false} assume ~cond == 0; {6516#false} is VALID [2018-11-14 18:38:35,880 INFO L273 TraceCheckUtils]: 64: Hoare triple {6516#false} assume !false; {6516#false} is VALID [2018-11-14 18:38:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:35,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:35,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:38:35,905 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-14 18:38:35,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:35,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:38:35,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:35,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:38:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:38:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:38:35,967 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 15 states. [2018-11-14 18:38:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:36,605 INFO L93 Difference]: Finished difference Result 234 states and 290 transitions. [2018-11-14 18:38:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:38:36,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-14 18:38:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:38:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2018-11-14 18:38:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:38:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2018-11-14 18:38:36,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2018-11-14 18:38:37,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:37,182 INFO L225 Difference]: With dead ends: 234 [2018-11-14 18:38:37,182 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 18:38:37,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:38:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 18:38:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-11-14 18:38:37,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:37,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 122 states. [2018-11-14 18:38:37,223 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 122 states. [2018-11-14 18:38:37,223 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 122 states. [2018-11-14 18:38:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:37,226 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2018-11-14 18:38:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2018-11-14 18:38:37,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:37,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:37,227 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 126 states. [2018-11-14 18:38:37,227 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 126 states. [2018-11-14 18:38:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:37,230 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2018-11-14 18:38:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2018-11-14 18:38:37,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:37,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:37,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:37,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 18:38:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2018-11-14 18:38:37,234 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 65 [2018-11-14 18:38:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:37,234 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2018-11-14 18:38:37,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:38:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-14 18:38:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 18:38:37,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:37,235 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:37,236 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:37,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 646228772, now seen corresponding path program 12 times [2018-11-14 18:38:37,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:37,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:38,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2018-11-14 18:38:38,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {7431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7431#true} is VALID [2018-11-14 18:38:38,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {7431#true} assume true; {7431#true} is VALID [2018-11-14 18:38:38,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7431#true} {7431#true} #83#return; {7431#true} is VALID [2018-11-14 18:38:38,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {7431#true} call #t~ret8 := main(); {7431#true} is VALID [2018-11-14 18:38:38,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {7431#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7431#true} is VALID [2018-11-14 18:38:38,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {7431#true} assume true; {7431#true} is VALID [2018-11-14 18:38:38,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {7431#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {7433#(= main_~i~0 1)} is VALID [2018-11-14 18:38:38,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {7433#(= main_~i~0 1)} assume true; {7433#(= main_~i~0 1)} is VALID [2018-11-14 18:38:38,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {7433#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7433#(= main_~i~0 1)} is VALID [2018-11-14 18:38:38,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {7433#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7433#(= main_~i~0 1)} is VALID [2018-11-14 18:38:38,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {7433#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {7434#(<= main_~i~0 2)} assume true; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {7434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {7434#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {7434#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {7435#(<= main_~i~0 3)} assume true; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {7435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {7435#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {7435#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {7436#(<= main_~i~0 4)} assume true; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {7436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {7436#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {7436#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {7437#(<= main_~i~0 5)} assume true; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {7437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {7437#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {7437#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {7438#(<= main_~i~0 6)} assume true; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {7438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,171 INFO L273 TraceCheckUtils]: 30: Hoare triple {7438#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {7438#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {7439#(<= main_~i~0 7)} assume true; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {7439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {7439#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {7439#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {7440#(<= main_~i~0 8)} assume true; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {7440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {7440#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {7440#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {7441#(<= main_~i~0 9)} assume true; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {7441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,178 INFO L273 TraceCheckUtils]: 42: Hoare triple {7441#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {7441#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {7442#(<= main_~i~0 10)} assume true; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {7442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {7442#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {7442#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {7443#(<= main_~i~0 11)} assume true; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {7443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {7443#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {7443#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {7444#(<= main_~i~0 12)} assume true; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {7444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {7444#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {7444#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {7445#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:38,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {7445#(<= main_~i~0 13)} assume true; {7445#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:38,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {7445#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7432#false} is VALID [2018-11-14 18:38:38,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {7432#false} assume !(~swapped~0 != 0); {7432#false} is VALID [2018-11-14 18:38:38,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {7432#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7432#false} is VALID [2018-11-14 18:38:38,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {7432#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {7432#false} is VALID [2018-11-14 18:38:38,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {7432#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7432#false} is VALID [2018-11-14 18:38:38,188 INFO L256 TraceCheckUtils]: 65: Hoare triple {7432#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7432#false} is VALID [2018-11-14 18:38:38,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {7432#false} ~cond := #in~cond; {7432#false} is VALID [2018-11-14 18:38:38,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {7432#false} assume ~cond == 0; {7432#false} is VALID [2018-11-14 18:38:38,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2018-11-14 18:38:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:38,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:38,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:38:38,242 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-14 18:38:38,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:38,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:38,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2018-11-14 18:38:38,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {7431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7431#true} is VALID [2018-11-14 18:38:38,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {7431#true} assume true; {7431#true} is VALID [2018-11-14 18:38:38,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7431#true} {7431#true} #83#return; {7431#true} is VALID [2018-11-14 18:38:38,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {7431#true} call #t~ret8 := main(); {7431#true} is VALID [2018-11-14 18:38:38,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {7431#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7431#true} is VALID [2018-11-14 18:38:38,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {7431#true} assume true; {7431#true} is VALID [2018-11-14 18:38:38,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {7431#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {7470#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:38,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {7470#(<= main_~i~0 1)} assume true; {7470#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:38,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {7470#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7470#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:38,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {7470#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7470#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:38,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {7470#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {7434#(<= main_~i~0 2)} assume true; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {7434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {7434#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7434#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:38,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {7434#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {7435#(<= main_~i~0 3)} assume true; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {7435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {7435#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7435#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:38,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {7435#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {7436#(<= main_~i~0 4)} assume true; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {7436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {7436#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7436#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:38,399 INFO L273 TraceCheckUtils]: 23: Hoare triple {7436#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {7437#(<= main_~i~0 5)} assume true; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {7437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {7437#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7437#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:38,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {7437#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {7438#(<= main_~i~0 6)} assume true; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {7438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {7438#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7438#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:38,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {7438#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {7439#(<= main_~i~0 7)} assume true; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {7439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {7439#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7439#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:38,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {7439#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {7440#(<= main_~i~0 8)} assume true; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {7440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {7440#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7440#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:38,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {7440#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {7441#(<= main_~i~0 9)} assume true; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {7441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {7441#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7441#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:38,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {7441#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {7442#(<= main_~i~0 10)} assume true; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {7442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {7442#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7442#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:38,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {7442#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {7443#(<= main_~i~0 11)} assume true; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {7443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {7443#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7443#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:38,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {7443#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,415 INFO L273 TraceCheckUtils]: 52: Hoare triple {7444#(<= main_~i~0 12)} assume true; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {7444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {7444#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7444#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:38,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {7444#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {7445#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:38,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {7445#(<= main_~i~0 13)} assume true; {7445#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:38,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {7445#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7432#false} is VALID [2018-11-14 18:38:38,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {7432#false} assume !(~swapped~0 != 0); {7432#false} is VALID [2018-11-14 18:38:38,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {7432#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7432#false} is VALID [2018-11-14 18:38:38,419 INFO L273 TraceCheckUtils]: 61: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,419 INFO L273 TraceCheckUtils]: 62: Hoare triple {7432#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {7432#false} is VALID [2018-11-14 18:38:38,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {7432#false} assume true; {7432#false} is VALID [2018-11-14 18:38:38,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {7432#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7432#false} is VALID [2018-11-14 18:38:38,420 INFO L256 TraceCheckUtils]: 65: Hoare triple {7432#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7432#false} is VALID [2018-11-14 18:38:38,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {7432#false} ~cond := #in~cond; {7432#false} is VALID [2018-11-14 18:38:38,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {7432#false} assume ~cond == 0; {7432#false} is VALID [2018-11-14 18:38:38,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2018-11-14 18:38:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 2 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 18:38:38,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-11-14 18:38:38,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:38,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:38:38,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:38,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:38:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:38:38,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:38:38,508 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 16 states. [2018-11-14 18:38:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:38,935 INFO L93 Difference]: Finished difference Result 250 states and 310 transitions. [2018-11-14 18:38:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:38:38,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-11-14 18:38:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:38:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2018-11-14 18:38:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:38:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2018-11-14 18:38:38,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 122 transitions. [2018-11-14 18:38:39,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:39,553 INFO L225 Difference]: With dead ends: 250 [2018-11-14 18:38:39,553 INFO L226 Difference]: Without dead ends: 134 [2018-11-14 18:38:39,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:38:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-14 18:38:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-11-14 18:38:39,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:39,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 130 states. [2018-11-14 18:38:39,701 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 130 states. [2018-11-14 18:38:39,701 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 130 states. [2018-11-14 18:38:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:39,706 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2018-11-14 18:38:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2018-11-14 18:38:39,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:39,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:39,707 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 134 states. [2018-11-14 18:38:39,707 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 134 states. [2018-11-14 18:38:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:39,710 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2018-11-14 18:38:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2018-11-14 18:38:39,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:39,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:39,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:39,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-14 18:38:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2018-11-14 18:38:39,714 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 69 [2018-11-14 18:38:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:39,714 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2018-11-14 18:38:39,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:38:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-14 18:38:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:38:39,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:39,715 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:39,716 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:39,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1394138244, now seen corresponding path program 13 times [2018-11-14 18:38:39,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:39,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:39,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:39,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:39,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:40,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {8406#true} call ULTIMATE.init(); {8406#true} is VALID [2018-11-14 18:38:40,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {8406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8406#true} is VALID [2018-11-14 18:38:40,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {8406#true} assume true; {8406#true} is VALID [2018-11-14 18:38:40,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8406#true} {8406#true} #83#return; {8406#true} is VALID [2018-11-14 18:38:40,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {8406#true} call #t~ret8 := main(); {8406#true} is VALID [2018-11-14 18:38:40,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {8406#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {8406#true} is VALID [2018-11-14 18:38:40,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {8406#true} assume true; {8406#true} is VALID [2018-11-14 18:38:40,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {8406#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {8408#(= main_~i~0 1)} is VALID [2018-11-14 18:38:40,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {8408#(= main_~i~0 1)} assume true; {8408#(= main_~i~0 1)} is VALID [2018-11-14 18:38:40,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {8408#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8408#(= main_~i~0 1)} is VALID [2018-11-14 18:38:40,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {8408#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8408#(= main_~i~0 1)} is VALID [2018-11-14 18:38:40,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {8408#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:40,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {8409#(<= main_~i~0 2)} assume true; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:40,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {8409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:40,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {8409#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:40,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {8409#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:40,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {8410#(<= main_~i~0 3)} assume true; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:40,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {8410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:40,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {8410#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:40,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {8410#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:40,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {8411#(<= main_~i~0 4)} assume true; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:40,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {8411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:40,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {8411#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:40,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {8411#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:40,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {8412#(<= main_~i~0 5)} assume true; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:40,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {8412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:40,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {8412#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:40,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {8412#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:40,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {8413#(<= main_~i~0 6)} assume true; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:40,198 INFO L273 TraceCheckUtils]: 29: Hoare triple {8413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:40,198 INFO L273 TraceCheckUtils]: 30: Hoare triple {8413#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:40,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {8413#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:40,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {8414#(<= main_~i~0 7)} assume true; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:40,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {8414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:40,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {8414#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:40,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {8414#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:40,202 INFO L273 TraceCheckUtils]: 36: Hoare triple {8415#(<= main_~i~0 8)} assume true; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:40,202 INFO L273 TraceCheckUtils]: 37: Hoare triple {8415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:40,203 INFO L273 TraceCheckUtils]: 38: Hoare triple {8415#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:40,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {8415#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:40,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {8416#(<= main_~i~0 9)} assume true; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:40,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {8416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:40,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {8416#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:40,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {8416#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:40,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {8417#(<= main_~i~0 10)} assume true; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:40,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {8417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:40,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {8417#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:40,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {8417#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:40,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {8418#(<= main_~i~0 11)} assume true; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:40,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {8418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:40,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {8418#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:40,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {8418#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:40,230 INFO L273 TraceCheckUtils]: 52: Hoare triple {8419#(<= main_~i~0 12)} assume true; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:40,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {8419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:40,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {8419#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:40,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {8419#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:40,279 INFO L273 TraceCheckUtils]: 56: Hoare triple {8420#(<= main_~i~0 13)} assume true; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:40,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {8420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:40,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {8420#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:40,315 INFO L273 TraceCheckUtils]: 59: Hoare triple {8420#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8421#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:40,324 INFO L273 TraceCheckUtils]: 60: Hoare triple {8421#(<= main_~i~0 14)} assume true; {8421#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:40,339 INFO L273 TraceCheckUtils]: 61: Hoare triple {8421#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8407#false} is VALID [2018-11-14 18:38:40,339 INFO L273 TraceCheckUtils]: 62: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:40,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {8407#false} assume !(~swapped~0 != 0); {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {8407#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L273 TraceCheckUtils]: 65: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L273 TraceCheckUtils]: 66: Hoare triple {8407#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L273 TraceCheckUtils]: 67: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L273 TraceCheckUtils]: 68: Hoare triple {8407#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {8407#false} is VALID [2018-11-14 18:38:40,340 INFO L256 TraceCheckUtils]: 69: Hoare triple {8407#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {8407#false} is VALID [2018-11-14 18:38:40,341 INFO L273 TraceCheckUtils]: 70: Hoare triple {8407#false} ~cond := #in~cond; {8407#false} is VALID [2018-11-14 18:38:40,341 INFO L273 TraceCheckUtils]: 71: Hoare triple {8407#false} assume ~cond == 0; {8407#false} is VALID [2018-11-14 18:38:40,341 INFO L273 TraceCheckUtils]: 72: Hoare triple {8407#false} assume !false; {8407#false} is VALID [2018-11-14 18:38:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 2 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:40,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:40,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:40,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:40,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:41,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {8406#true} call ULTIMATE.init(); {8406#true} is VALID [2018-11-14 18:38:41,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {8406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8406#true} is VALID [2018-11-14 18:38:41,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {8406#true} assume true; {8406#true} is VALID [2018-11-14 18:38:41,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8406#true} {8406#true} #83#return; {8406#true} is VALID [2018-11-14 18:38:41,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {8406#true} call #t~ret8 := main(); {8406#true} is VALID [2018-11-14 18:38:41,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {8406#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {8406#true} is VALID [2018-11-14 18:38:41,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {8406#true} assume true; {8406#true} is VALID [2018-11-14 18:38:41,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {8406#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {8446#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:41,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {8446#(<= main_~i~0 1)} assume true; {8446#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:41,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {8446#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8446#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:41,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {8446#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8446#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:41,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {8446#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:41,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {8409#(<= main_~i~0 2)} assume true; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:41,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {8409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:41,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {8409#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8409#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:41,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {8409#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:41,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {8410#(<= main_~i~0 3)} assume true; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:41,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {8410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:41,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {8410#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8410#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:41,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {8410#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:41,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {8411#(<= main_~i~0 4)} assume true; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:41,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {8411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:41,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {8411#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8411#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:41,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {8411#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:41,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {8412#(<= main_~i~0 5)} assume true; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:41,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {8412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:41,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {8412#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8412#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:41,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {8412#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:41,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {8413#(<= main_~i~0 6)} assume true; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:41,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {8413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:41,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {8413#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8413#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:41,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {8413#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:41,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {8414#(<= main_~i~0 7)} assume true; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:41,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {8414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:41,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {8414#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8414#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:41,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {8414#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:41,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {8415#(<= main_~i~0 8)} assume true; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:41,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {8415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:41,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {8415#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8415#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:41,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {8415#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:41,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {8416#(<= main_~i~0 9)} assume true; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:41,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {8416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:41,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {8416#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8416#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:41,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {8416#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:41,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {8417#(<= main_~i~0 10)} assume true; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:41,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {8417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:41,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {8417#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8417#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:41,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {8417#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:41,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {8418#(<= main_~i~0 11)} assume true; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:41,460 INFO L273 TraceCheckUtils]: 49: Hoare triple {8418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:41,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {8418#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8418#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:41,461 INFO L273 TraceCheckUtils]: 51: Hoare triple {8418#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:41,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {8419#(<= main_~i~0 12)} assume true; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:41,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {8419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:41,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {8419#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8419#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:41,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {8419#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:41,464 INFO L273 TraceCheckUtils]: 56: Hoare triple {8420#(<= main_~i~0 13)} assume true; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:41,464 INFO L273 TraceCheckUtils]: 57: Hoare triple {8420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:41,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {8420#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8420#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:41,466 INFO L273 TraceCheckUtils]: 59: Hoare triple {8420#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8421#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:41,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {8421#(<= main_~i~0 14)} assume true; {8421#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:41,467 INFO L273 TraceCheckUtils]: 61: Hoare triple {8421#(<= main_~i~0 14)} assume !(~i~0 < 100000); {8407#false} is VALID [2018-11-14 18:38:41,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:41,467 INFO L273 TraceCheckUtils]: 63: Hoare triple {8407#false} assume !(~swapped~0 != 0); {8407#false} is VALID [2018-11-14 18:38:41,468 INFO L273 TraceCheckUtils]: 64: Hoare triple {8407#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {8407#false} is VALID [2018-11-14 18:38:41,468 INFO L273 TraceCheckUtils]: 65: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:41,468 INFO L273 TraceCheckUtils]: 66: Hoare triple {8407#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {8407#false} is VALID [2018-11-14 18:38:41,468 INFO L273 TraceCheckUtils]: 67: Hoare triple {8407#false} assume true; {8407#false} is VALID [2018-11-14 18:38:41,468 INFO L273 TraceCheckUtils]: 68: Hoare triple {8407#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {8407#false} is VALID [2018-11-14 18:38:41,469 INFO L256 TraceCheckUtils]: 69: Hoare triple {8407#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {8407#false} is VALID [2018-11-14 18:38:41,469 INFO L273 TraceCheckUtils]: 70: Hoare triple {8407#false} ~cond := #in~cond; {8407#false} is VALID [2018-11-14 18:38:41,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {8407#false} assume ~cond == 0; {8407#false} is VALID [2018-11-14 18:38:41,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {8407#false} assume !false; {8407#false} is VALID [2018-11-14 18:38:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 2 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:41,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:38:41,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-11-14 18:38:41,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:41,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:38:41,563 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 18:38:41,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:38:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:38:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:38:41,565 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 17 states. [2018-11-14 18:38:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:41,880 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2018-11-14 18:38:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:38:41,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-11-14 18:38:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:38:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-14 18:38:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:38:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-14 18:38:41,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2018-11-14 18:38:41,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:41,999 INFO L225 Difference]: With dead ends: 266 [2018-11-14 18:38:42,000 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:38:42,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:38:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:38:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-11-14 18:38:42,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:42,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 138 states. [2018-11-14 18:38:42,044 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 138 states. [2018-11-14 18:38:42,044 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 138 states. [2018-11-14 18:38:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:42,047 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-11-14 18:38:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-11-14 18:38:42,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:42,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:42,048 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 142 states. [2018-11-14 18:38:42,048 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 142 states. [2018-11-14 18:38:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:42,051 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-11-14 18:38:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-11-14 18:38:42,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:42,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:42,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:42,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-14 18:38:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2018-11-14 18:38:42,054 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 73 [2018-11-14 18:38:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:42,054 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2018-11-14 18:38:42,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:38:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-14 18:38:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 18:38:42,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:42,055 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:42,055 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:42,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash -769282092, now seen corresponding path program 14 times [2018-11-14 18:38:42,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:42,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {9440#true} call ULTIMATE.init(); {9440#true} is VALID [2018-11-14 18:38:42,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {9440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9440#true} is VALID [2018-11-14 18:38:42,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {9440#true} assume true; {9440#true} is VALID [2018-11-14 18:38:42,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9440#true} {9440#true} #83#return; {9440#true} is VALID [2018-11-14 18:38:42,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {9440#true} call #t~ret8 := main(); {9440#true} is VALID [2018-11-14 18:38:42,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {9440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9440#true} is VALID [2018-11-14 18:38:42,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {9440#true} assume true; {9440#true} is VALID [2018-11-14 18:38:42,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {9440#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {9442#(= main_~i~0 1)} is VALID [2018-11-14 18:38:42,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {9442#(= main_~i~0 1)} assume true; {9442#(= main_~i~0 1)} is VALID [2018-11-14 18:38:42,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {9442#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9442#(= main_~i~0 1)} is VALID [2018-11-14 18:38:42,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {9442#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9442#(= main_~i~0 1)} is VALID [2018-11-14 18:38:42,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {9442#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {9443#(<= main_~i~0 2)} assume true; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {9443#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {9443#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {9443#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {9444#(<= main_~i~0 3)} assume true; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {9444#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {9444#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {9444#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {9445#(<= main_~i~0 4)} assume true; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {9445#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 5)} assume true; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {9446#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {9446#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {9447#(<= main_~i~0 6)} assume true; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {9447#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {9447#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {9447#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {9448#(<= main_~i~0 7)} assume true; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {9448#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {9448#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {9448#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {9449#(<= main_~i~0 8)} assume true; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {9449#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {9449#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {9449#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {9450#(<= main_~i~0 9)} assume true; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {9450#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {9450#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {9450#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {9451#(<= main_~i~0 10)} assume true; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {9451#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {9451#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {9451#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {9452#(<= main_~i~0 11)} assume true; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {9452#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {9452#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {9452#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {9453#(<= main_~i~0 12)} assume true; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {9453#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {9453#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {9453#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#(<= main_~i~0 13)} assume true; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {9454#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {9455#(<= main_~i~0 14)} assume true; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {9455#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {9455#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {9455#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:42,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#(<= main_~i~0 15)} assume true; {9456#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:42,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9441#false} is VALID [2018-11-14 18:38:42,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,426 INFO L273 TraceCheckUtils]: 67: Hoare triple {9441#false} assume !(~swapped~0 != 0); {9441#false} is VALID [2018-11-14 18:38:42,426 INFO L273 TraceCheckUtils]: 68: Hoare triple {9441#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9441#false} is VALID [2018-11-14 18:38:42,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,426 INFO L273 TraceCheckUtils]: 70: Hoare triple {9441#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {9441#false} is VALID [2018-11-14 18:38:42,426 INFO L273 TraceCheckUtils]: 71: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,427 INFO L273 TraceCheckUtils]: 72: Hoare triple {9441#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9441#false} is VALID [2018-11-14 18:38:42,427 INFO L256 TraceCheckUtils]: 73: Hoare triple {9441#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9441#false} is VALID [2018-11-14 18:38:42,427 INFO L273 TraceCheckUtils]: 74: Hoare triple {9441#false} ~cond := #in~cond; {9441#false} is VALID [2018-11-14 18:38:42,427 INFO L273 TraceCheckUtils]: 75: Hoare triple {9441#false} assume ~cond == 0; {9441#false} is VALID [2018-11-14 18:38:42,428 INFO L273 TraceCheckUtils]: 76: Hoare triple {9441#false} assume !false; {9441#false} is VALID [2018-11-14 18:38:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 2 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:42,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:42,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:38:42,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:38:42,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:42,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:42,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {9440#true} call ULTIMATE.init(); {9440#true} is VALID [2018-11-14 18:38:42,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {9440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9440#true} is VALID [2018-11-14 18:38:42,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {9440#true} assume true; {9440#true} is VALID [2018-11-14 18:38:42,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9440#true} {9440#true} #83#return; {9440#true} is VALID [2018-11-14 18:38:42,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {9440#true} call #t~ret8 := main(); {9440#true} is VALID [2018-11-14 18:38:42,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {9440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9440#true} is VALID [2018-11-14 18:38:42,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {9440#true} assume true; {9440#true} is VALID [2018-11-14 18:38:42,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {9440#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {9481#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:42,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {9481#(<= main_~i~0 1)} assume true; {9481#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:42,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {9481#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9481#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:42,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {9481#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9481#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:42,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {9481#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {9443#(<= main_~i~0 2)} assume true; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {9443#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {9443#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9443#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:42,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {9443#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {9444#(<= main_~i~0 3)} assume true; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {9444#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {9444#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9444#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:42,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {9444#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {9445#(<= main_~i~0 4)} assume true; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {9445#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9445#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:42,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 5)} assume true; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {9446#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9446#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:42,747 INFO L273 TraceCheckUtils]: 27: Hoare triple {9446#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {9447#(<= main_~i~0 6)} assume true; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,748 INFO L273 TraceCheckUtils]: 29: Hoare triple {9447#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {9447#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9447#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:42,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {9447#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {9448#(<= main_~i~0 7)} assume true; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {9448#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {9448#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9448#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:42,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {9448#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {9449#(<= main_~i~0 8)} assume true; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {9449#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {9449#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9449#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:42,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {9449#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {9450#(<= main_~i~0 9)} assume true; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {9450#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {9450#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9450#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:42,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {9450#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {9451#(<= main_~i~0 10)} assume true; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {9451#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {9451#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9451#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:42,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {9451#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {9452#(<= main_~i~0 11)} assume true; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {9452#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {9452#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9452#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:42,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {9452#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {9453#(<= main_~i~0 12)} assume true; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {9453#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {9453#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9453#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:42,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {9453#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {9454#(<= main_~i~0 13)} assume true; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {9454#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {9454#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9454#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:42,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {9454#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {9455#(<= main_~i~0 14)} assume true; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {9455#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,767 INFO L273 TraceCheckUtils]: 62: Hoare triple {9455#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9455#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:42,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {9455#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:42,768 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#(<= main_~i~0 15)} assume true; {9456#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:42,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#(<= main_~i~0 15)} assume !(~i~0 < 100000); {9441#false} is VALID [2018-11-14 18:38:42,769 INFO L273 TraceCheckUtils]: 66: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,770 INFO L273 TraceCheckUtils]: 67: Hoare triple {9441#false} assume !(~swapped~0 != 0); {9441#false} is VALID [2018-11-14 18:38:42,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {9441#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9441#false} is VALID [2018-11-14 18:38:42,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {9441#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {9441#false} is VALID [2018-11-14 18:38:42,770 INFO L273 TraceCheckUtils]: 71: Hoare triple {9441#false} assume true; {9441#false} is VALID [2018-11-14 18:38:42,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {9441#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9441#false} is VALID [2018-11-14 18:38:42,771 INFO L256 TraceCheckUtils]: 73: Hoare triple {9441#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9441#false} is VALID [2018-11-14 18:38:42,771 INFO L273 TraceCheckUtils]: 74: Hoare triple {9441#false} ~cond := #in~cond; {9441#false} is VALID [2018-11-14 18:38:42,771 INFO L273 TraceCheckUtils]: 75: Hoare triple {9441#false} assume ~cond == 0; {9441#false} is VALID [2018-11-14 18:38:42,771 INFO L273 TraceCheckUtils]: 76: Hoare triple {9441#false} assume !false; {9441#false} is VALID [2018-11-14 18:38:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 2 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:38:42,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-14 18:38:42,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:42,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:38:42,903 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 18:38:42,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:38:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:38:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:38:42,904 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand 18 states. [2018-11-14 18:38:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:43,840 INFO L93 Difference]: Finished difference Result 282 states and 350 transitions. [2018-11-14 18:38:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:38:43,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-11-14 18:38:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:38:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2018-11-14 18:38:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:38:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2018-11-14 18:38:43,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 132 transitions. [2018-11-14 18:38:43,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:43,989 INFO L225 Difference]: With dead ends: 282 [2018-11-14 18:38:43,989 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 18:38:43,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:38:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 18:38:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-11-14 18:38:44,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:44,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 146 states. [2018-11-14 18:38:44,133 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 146 states. [2018-11-14 18:38:44,134 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 146 states. [2018-11-14 18:38:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:44,138 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2018-11-14 18:38:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 185 transitions. [2018-11-14 18:38:44,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:44,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:44,139 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 150 states. [2018-11-14 18:38:44,139 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 150 states. [2018-11-14 18:38:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:44,142 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2018-11-14 18:38:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 185 transitions. [2018-11-14 18:38:44,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:44,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:44,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:44,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 18:38:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2018-11-14 18:38:44,147 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 77 [2018-11-14 18:38:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:44,147 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2018-11-14 18:38:44,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:38:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-14 18:38:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 18:38:44,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:44,149 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:44,149 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:44,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash -501854164, now seen corresponding path program 15 times [2018-11-14 18:38:44,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:44,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:45,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {10533#true} call ULTIMATE.init(); {10533#true} is VALID [2018-11-14 18:38:45,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {10533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10533#true} is VALID [2018-11-14 18:38:45,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {10533#true} assume true; {10533#true} is VALID [2018-11-14 18:38:45,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10533#true} {10533#true} #83#return; {10533#true} is VALID [2018-11-14 18:38:45,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {10533#true} call #t~ret8 := main(); {10533#true} is VALID [2018-11-14 18:38:45,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {10533#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10533#true} is VALID [2018-11-14 18:38:45,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {10533#true} assume true; {10533#true} is VALID [2018-11-14 18:38:45,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {10533#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {10535#(= main_~i~0 1)} is VALID [2018-11-14 18:38:45,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {10535#(= main_~i~0 1)} assume true; {10535#(= main_~i~0 1)} is VALID [2018-11-14 18:38:45,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {10535#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10535#(= main_~i~0 1)} is VALID [2018-11-14 18:38:45,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {10535#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10535#(= main_~i~0 1)} is VALID [2018-11-14 18:38:45,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {10535#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {10536#(<= main_~i~0 2)} assume true; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {10536#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {10536#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {10536#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {10537#(<= main_~i~0 3)} assume true; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {10537#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {10537#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {10537#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {10538#(<= main_~i~0 4)} assume true; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {10538#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {10538#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {10538#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {10539#(<= main_~i~0 5)} assume true; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {10539#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {10539#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {10539#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {10540#(<= main_~i~0 6)} assume true; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {10540#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {10540#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {10540#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {10541#(<= main_~i~0 7)} assume true; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {10541#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {10541#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {10541#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {10542#(<= main_~i~0 8)} assume true; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {10542#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {10542#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {10542#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {10543#(<= main_~i~0 9)} assume true; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {10543#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {10543#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,199 INFO L273 TraceCheckUtils]: 43: Hoare triple {10543#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {10544#(<= main_~i~0 10)} assume true; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,200 INFO L273 TraceCheckUtils]: 45: Hoare triple {10544#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,201 INFO L273 TraceCheckUtils]: 46: Hoare triple {10544#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {10544#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {10545#(<= main_~i~0 11)} assume true; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,203 INFO L273 TraceCheckUtils]: 49: Hoare triple {10545#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,204 INFO L273 TraceCheckUtils]: 50: Hoare triple {10545#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,204 INFO L273 TraceCheckUtils]: 51: Hoare triple {10545#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,205 INFO L273 TraceCheckUtils]: 52: Hoare triple {10546#(<= main_~i~0 12)} assume true; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {10546#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,206 INFO L273 TraceCheckUtils]: 54: Hoare triple {10546#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,207 INFO L273 TraceCheckUtils]: 55: Hoare triple {10546#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,208 INFO L273 TraceCheckUtils]: 56: Hoare triple {10547#(<= main_~i~0 13)} assume true; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,208 INFO L273 TraceCheckUtils]: 57: Hoare triple {10547#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,209 INFO L273 TraceCheckUtils]: 58: Hoare triple {10547#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,210 INFO L273 TraceCheckUtils]: 59: Hoare triple {10547#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,210 INFO L273 TraceCheckUtils]: 60: Hoare triple {10548#(<= main_~i~0 14)} assume true; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,211 INFO L273 TraceCheckUtils]: 61: Hoare triple {10548#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {10548#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {10548#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,213 INFO L273 TraceCheckUtils]: 64: Hoare triple {10549#(<= main_~i~0 15)} assume true; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {10549#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,236 INFO L273 TraceCheckUtils]: 66: Hoare triple {10549#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,236 INFO L273 TraceCheckUtils]: 67: Hoare triple {10549#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {10550#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:45,238 INFO L273 TraceCheckUtils]: 68: Hoare triple {10550#(<= main_~i~0 16)} assume true; {10550#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:45,238 INFO L273 TraceCheckUtils]: 69: Hoare triple {10550#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10534#false} is VALID [2018-11-14 18:38:45,238 INFO L273 TraceCheckUtils]: 70: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,238 INFO L273 TraceCheckUtils]: 71: Hoare triple {10534#false} assume !(~swapped~0 != 0); {10534#false} is VALID [2018-11-14 18:38:45,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {10534#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 73: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {10534#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {10534#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L256 TraceCheckUtils]: 77: Hoare triple {10534#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {10534#false} ~cond := #in~cond; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 79: Hoare triple {10534#false} assume ~cond == 0; {10534#false} is VALID [2018-11-14 18:38:45,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {10534#false} assume !false; {10534#false} is VALID [2018-11-14 18:38:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 2 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:45,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:38:45,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-14 18:38:45,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:45,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:45,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {10533#true} call ULTIMATE.init(); {10533#true} is VALID [2018-11-14 18:38:45,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {10533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10533#true} is VALID [2018-11-14 18:38:45,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {10533#true} assume true; {10533#true} is VALID [2018-11-14 18:38:45,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10533#true} {10533#true} #83#return; {10533#true} is VALID [2018-11-14 18:38:45,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {10533#true} call #t~ret8 := main(); {10533#true} is VALID [2018-11-14 18:38:45,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {10533#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10533#true} is VALID [2018-11-14 18:38:45,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {10533#true} assume true; {10533#true} is VALID [2018-11-14 18:38:45,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {10533#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {10575#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:45,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {10575#(<= main_~i~0 1)} assume true; {10575#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:45,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {10575#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10575#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:45,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {10575#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10575#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:45,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {10575#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {10536#(<= main_~i~0 2)} assume true; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {10536#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {10536#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10536#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:45,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {10536#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {10537#(<= main_~i~0 3)} assume true; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {10537#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {10537#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10537#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:45,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {10537#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {10538#(<= main_~i~0 4)} assume true; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {10538#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {10538#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10538#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:45,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {10538#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {10539#(<= main_~i~0 5)} assume true; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {10539#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {10539#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10539#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:45,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {10539#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {10540#(<= main_~i~0 6)} assume true; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {10540#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {10540#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10540#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:45,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {10540#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,549 INFO L273 TraceCheckUtils]: 32: Hoare triple {10541#(<= main_~i~0 7)} assume true; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {10541#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {10541#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10541#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:45,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {10541#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {10542#(<= main_~i~0 8)} assume true; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {10542#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {10542#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10542#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:45,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {10542#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,553 INFO L273 TraceCheckUtils]: 40: Hoare triple {10543#(<= main_~i~0 9)} assume true; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {10543#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {10543#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10543#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:45,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {10543#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {10544#(<= main_~i~0 10)} assume true; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {10544#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {10544#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10544#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:45,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {10544#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {10545#(<= main_~i~0 11)} assume true; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {10545#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {10545#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10545#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:45,560 INFO L273 TraceCheckUtils]: 51: Hoare triple {10545#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,560 INFO L273 TraceCheckUtils]: 52: Hoare triple {10546#(<= main_~i~0 12)} assume true; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,561 INFO L273 TraceCheckUtils]: 53: Hoare triple {10546#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,561 INFO L273 TraceCheckUtils]: 54: Hoare triple {10546#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10546#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:45,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {10546#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {10547#(<= main_~i~0 13)} assume true; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {10547#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,563 INFO L273 TraceCheckUtils]: 58: Hoare triple {10547#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10547#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:45,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {10547#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,564 INFO L273 TraceCheckUtils]: 60: Hoare triple {10548#(<= main_~i~0 14)} assume true; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,565 INFO L273 TraceCheckUtils]: 61: Hoare triple {10548#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {10548#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10548#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:45,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {10548#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {10549#(<= main_~i~0 15)} assume true; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {10549#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {10549#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10549#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:45,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {10549#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {10550#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:45,569 INFO L273 TraceCheckUtils]: 68: Hoare triple {10550#(<= main_~i~0 16)} assume true; {10550#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:45,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {10550#(<= main_~i~0 16)} assume !(~i~0 < 100000); {10534#false} is VALID [2018-11-14 18:38:45,570 INFO L273 TraceCheckUtils]: 70: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {10534#false} assume !(~swapped~0 != 0); {10534#false} is VALID [2018-11-14 18:38:45,570 INFO L273 TraceCheckUtils]: 72: Hoare triple {10534#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10534#false} is VALID [2018-11-14 18:38:45,570 INFO L273 TraceCheckUtils]: 73: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,570 INFO L273 TraceCheckUtils]: 74: Hoare triple {10534#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {10534#false} is VALID [2018-11-14 18:38:45,571 INFO L273 TraceCheckUtils]: 75: Hoare triple {10534#false} assume true; {10534#false} is VALID [2018-11-14 18:38:45,571 INFO L273 TraceCheckUtils]: 76: Hoare triple {10534#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10534#false} is VALID [2018-11-14 18:38:45,571 INFO L256 TraceCheckUtils]: 77: Hoare triple {10534#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10534#false} is VALID [2018-11-14 18:38:45,571 INFO L273 TraceCheckUtils]: 78: Hoare triple {10534#false} ~cond := #in~cond; {10534#false} is VALID [2018-11-14 18:38:45,571 INFO L273 TraceCheckUtils]: 79: Hoare triple {10534#false} assume ~cond == 0; {10534#false} is VALID [2018-11-14 18:38:45,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {10534#false} assume !false; {10534#false} is VALID [2018-11-14 18:38:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 2 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:45,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:45,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 18:38:45,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-11-14 18:38:45,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:45,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:38:45,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:45,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:38:45,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:38:45,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:38:45,673 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand 19 states. [2018-11-14 18:38:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:46,191 INFO L93 Difference]: Finished difference Result 298 states and 370 transitions. [2018-11-14 18:38:46,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:38:46,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-11-14 18:38:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:38:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 137 transitions. [2018-11-14 18:38:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:38:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 137 transitions. [2018-11-14 18:38:46,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 137 transitions. [2018-11-14 18:38:46,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:46,381 INFO L225 Difference]: With dead ends: 298 [2018-11-14 18:38:46,381 INFO L226 Difference]: Without dead ends: 158 [2018-11-14 18:38:46,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:38:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-14 18:38:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-11-14 18:38:46,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:46,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 154 states. [2018-11-14 18:38:46,436 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 154 states. [2018-11-14 18:38:46,437 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 154 states. [2018-11-14 18:38:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:46,439 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2018-11-14 18:38:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 195 transitions. [2018-11-14 18:38:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:46,440 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 158 states. [2018-11-14 18:38:46,440 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 158 states. [2018-11-14 18:38:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:46,442 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2018-11-14 18:38:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 195 transitions. [2018-11-14 18:38:46,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:46,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:46,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:46,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-14 18:38:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2018-11-14 18:38:46,446 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 81 [2018-11-14 18:38:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:46,446 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2018-11-14 18:38:46,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:38:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-14 18:38:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:38:46,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:46,447 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:46,447 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:46,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1301218436, now seen corresponding path program 16 times [2018-11-14 18:38:46,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:46,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:46,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:46,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:46,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:47,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {11685#true} call ULTIMATE.init(); {11685#true} is VALID [2018-11-14 18:38:47,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {11685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {11685#true} assume true; {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11685#true} {11685#true} #83#return; {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {11685#true} call #t~ret8 := main(); {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {11685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {11685#true} assume true; {11685#true} is VALID [2018-11-14 18:38:47,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {11685#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {11687#(= main_~i~0 1)} is VALID [2018-11-14 18:38:47,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {11687#(= main_~i~0 1)} assume true; {11687#(= main_~i~0 1)} is VALID [2018-11-14 18:38:47,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {11687#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11687#(= main_~i~0 1)} is VALID [2018-11-14 18:38:47,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {11687#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11687#(= main_~i~0 1)} is VALID [2018-11-14 18:38:47,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {11687#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {11688#(<= main_~i~0 2)} assume true; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {11688#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {11688#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {11688#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {11689#(<= main_~i~0 3)} assume true; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {11689#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {11689#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {11689#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {11690#(<= main_~i~0 4)} assume true; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {11690#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {11690#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {11690#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {11691#(<= main_~i~0 5)} assume true; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {11691#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {11691#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,050 INFO L273 TraceCheckUtils]: 27: Hoare triple {11691#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {11692#(<= main_~i~0 6)} assume true; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,051 INFO L273 TraceCheckUtils]: 29: Hoare triple {11692#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {11692#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {11692#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {11693#(<= main_~i~0 7)} assume true; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,053 INFO L273 TraceCheckUtils]: 33: Hoare triple {11693#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {11693#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,055 INFO L273 TraceCheckUtils]: 35: Hoare triple {11693#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {11694#(<= main_~i~0 8)} assume true; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,056 INFO L273 TraceCheckUtils]: 37: Hoare triple {11694#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,056 INFO L273 TraceCheckUtils]: 38: Hoare triple {11694#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,057 INFO L273 TraceCheckUtils]: 39: Hoare triple {11694#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {11695#(<= main_~i~0 9)} assume true; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {11695#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {11695#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {11695#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,072 INFO L273 TraceCheckUtils]: 44: Hoare triple {11696#(<= main_~i~0 10)} assume true; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {11696#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {11696#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {11696#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {11697#(<= main_~i~0 11)} assume true; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {11697#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {11697#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {11697#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {11698#(<= main_~i~0 12)} assume true; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {11698#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {11698#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,077 INFO L273 TraceCheckUtils]: 55: Hoare triple {11698#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {11699#(<= main_~i~0 13)} assume true; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,078 INFO L273 TraceCheckUtils]: 57: Hoare triple {11699#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {11699#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {11699#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {11700#(<= main_~i~0 14)} assume true; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {11700#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {11700#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,082 INFO L273 TraceCheckUtils]: 63: Hoare triple {11700#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {11701#(<= main_~i~0 15)} assume true; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {11701#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,083 INFO L273 TraceCheckUtils]: 66: Hoare triple {11701#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {11701#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {11702#(<= main_~i~0 16)} assume true; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,085 INFO L273 TraceCheckUtils]: 69: Hoare triple {11702#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,085 INFO L273 TraceCheckUtils]: 70: Hoare triple {11702#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,086 INFO L273 TraceCheckUtils]: 71: Hoare triple {11702#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {11703#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:47,087 INFO L273 TraceCheckUtils]: 72: Hoare triple {11703#(<= main_~i~0 17)} assume true; {11703#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:47,087 INFO L273 TraceCheckUtils]: 73: Hoare triple {11703#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11686#false} is VALID [2018-11-14 18:38:47,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {11686#false} assume !(~swapped~0 != 0); {11686#false} is VALID [2018-11-14 18:38:47,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {11686#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11686#false} is VALID [2018-11-14 18:38:47,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {11686#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L273 TraceCheckUtils]: 80: Hoare triple {11686#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L256 TraceCheckUtils]: 81: Hoare triple {11686#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {11686#false} ~cond := #in~cond; {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L273 TraceCheckUtils]: 83: Hoare triple {11686#false} assume ~cond == 0; {11686#false} is VALID [2018-11-14 18:38:47,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {11686#false} assume !false; {11686#false} is VALID [2018-11-14 18:38:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 2 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:47,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:47,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:38:47,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:38:47,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:47,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:47,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {11685#true} call ULTIMATE.init(); {11685#true} is VALID [2018-11-14 18:38:47,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {11685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11685#true} is VALID [2018-11-14 18:38:47,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {11685#true} assume true; {11685#true} is VALID [2018-11-14 18:38:47,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11685#true} {11685#true} #83#return; {11685#true} is VALID [2018-11-14 18:38:47,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {11685#true} call #t~ret8 := main(); {11685#true} is VALID [2018-11-14 18:38:47,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {11685#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11685#true} is VALID [2018-11-14 18:38:47,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {11685#true} assume true; {11685#true} is VALID [2018-11-14 18:38:47,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {11685#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {11728#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:47,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {11728#(<= main_~i~0 1)} assume true; {11728#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:47,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {11728#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11728#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:47,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {11728#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11728#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:47,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {11728#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {11688#(<= main_~i~0 2)} assume true; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {11688#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {11688#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11688#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:47,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {11688#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {11689#(<= main_~i~0 3)} assume true; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {11689#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {11689#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11689#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:47,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {11689#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {11690#(<= main_~i~0 4)} assume true; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {11690#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {11690#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11690#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:47,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {11690#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {11691#(<= main_~i~0 5)} assume true; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {11691#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {11691#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11691#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:47,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {11691#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {11692#(<= main_~i~0 6)} assume true; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {11692#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {11692#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11692#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:47,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {11692#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {11693#(<= main_~i~0 7)} assume true; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {11693#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {11693#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11693#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:47,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {11693#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {11694#(<= main_~i~0 8)} assume true; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {11694#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {11694#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11694#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:47,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {11694#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,418 INFO L273 TraceCheckUtils]: 40: Hoare triple {11695#(<= main_~i~0 9)} assume true; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {11695#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {11695#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11695#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:47,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {11695#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,421 INFO L273 TraceCheckUtils]: 44: Hoare triple {11696#(<= main_~i~0 10)} assume true; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {11696#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {11696#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11696#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:47,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {11696#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {11697#(<= main_~i~0 11)} assume true; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {11697#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,424 INFO L273 TraceCheckUtils]: 50: Hoare triple {11697#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11697#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:47,425 INFO L273 TraceCheckUtils]: 51: Hoare triple {11697#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {11698#(<= main_~i~0 12)} assume true; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,426 INFO L273 TraceCheckUtils]: 53: Hoare triple {11698#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {11698#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11698#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:47,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {11698#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {11699#(<= main_~i~0 13)} assume true; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {11699#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {11699#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11699#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:47,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {11699#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,430 INFO L273 TraceCheckUtils]: 60: Hoare triple {11700#(<= main_~i~0 14)} assume true; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,430 INFO L273 TraceCheckUtils]: 61: Hoare triple {11700#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,431 INFO L273 TraceCheckUtils]: 62: Hoare triple {11700#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11700#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:47,432 INFO L273 TraceCheckUtils]: 63: Hoare triple {11700#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,432 INFO L273 TraceCheckUtils]: 64: Hoare triple {11701#(<= main_~i~0 15)} assume true; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {11701#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {11701#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11701#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:47,434 INFO L273 TraceCheckUtils]: 67: Hoare triple {11701#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,434 INFO L273 TraceCheckUtils]: 68: Hoare triple {11702#(<= main_~i~0 16)} assume true; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,435 INFO L273 TraceCheckUtils]: 69: Hoare triple {11702#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,435 INFO L273 TraceCheckUtils]: 70: Hoare triple {11702#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:47,436 INFO L273 TraceCheckUtils]: 71: Hoare triple {11702#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {11703#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:47,437 INFO L273 TraceCheckUtils]: 72: Hoare triple {11703#(<= main_~i~0 17)} assume true; {11703#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:47,437 INFO L273 TraceCheckUtils]: 73: Hoare triple {11703#(<= main_~i~0 17)} assume !(~i~0 < 100000); {11686#false} is VALID [2018-11-14 18:38:47,438 INFO L273 TraceCheckUtils]: 74: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,438 INFO L273 TraceCheckUtils]: 75: Hoare triple {11686#false} assume !(~swapped~0 != 0); {11686#false} is VALID [2018-11-14 18:38:47,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {11686#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11686#false} is VALID [2018-11-14 18:38:47,438 INFO L273 TraceCheckUtils]: 77: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {11686#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {11686#false} is VALID [2018-11-14 18:38:47,439 INFO L273 TraceCheckUtils]: 79: Hoare triple {11686#false} assume true; {11686#false} is VALID [2018-11-14 18:38:47,439 INFO L273 TraceCheckUtils]: 80: Hoare triple {11686#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11686#false} is VALID [2018-11-14 18:38:47,439 INFO L256 TraceCheckUtils]: 81: Hoare triple {11686#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11686#false} is VALID [2018-11-14 18:38:47,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {11686#false} ~cond := #in~cond; {11686#false} is VALID [2018-11-14 18:38:47,440 INFO L273 TraceCheckUtils]: 83: Hoare triple {11686#false} assume ~cond == 0; {11686#false} is VALID [2018-11-14 18:38:47,440 INFO L273 TraceCheckUtils]: 84: Hoare triple {11686#false} assume !false; {11686#false} is VALID [2018-11-14 18:38:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 2 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:47,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:38:47,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 85 [2018-11-14 18:38:47,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:47,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:38:47,553 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 18:38:47,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:38:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:38:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:38:47,555 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand 20 states. [2018-11-14 18:38:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:48,543 INFO L93 Difference]: Finished difference Result 314 states and 390 transitions. [2018-11-14 18:38:48,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:38:48,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 85 [2018-11-14 18:38:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:38:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 142 transitions. [2018-11-14 18:38:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:38:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 142 transitions. [2018-11-14 18:38:48,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 142 transitions. [2018-11-14 18:38:48,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:48,871 INFO L225 Difference]: With dead ends: 314 [2018-11-14 18:38:48,871 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 18:38:48,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:38:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 18:38:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-11-14 18:38:48,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:48,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 162 states. [2018-11-14 18:38:48,924 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 162 states. [2018-11-14 18:38:48,924 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 162 states. [2018-11-14 18:38:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:48,928 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2018-11-14 18:38:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2018-11-14 18:38:48,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:48,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:48,929 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 166 states. [2018-11-14 18:38:48,930 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 166 states. [2018-11-14 18:38:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:48,932 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2018-11-14 18:38:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2018-11-14 18:38:48,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:48,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:48,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:48,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-14 18:38:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 199 transitions. [2018-11-14 18:38:48,935 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 199 transitions. Word has length 85 [2018-11-14 18:38:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:48,936 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 199 transitions. [2018-11-14 18:38:48,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:38:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-14 18:38:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-14 18:38:48,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:48,937 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:48,937 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:48,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash 711314652, now seen corresponding path program 17 times [2018-11-14 18:38:48,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:48,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:48,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:49,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {12896#true} call ULTIMATE.init(); {12896#true} is VALID [2018-11-14 18:38:49,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {12896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12896#true} is VALID [2018-11-14 18:38:49,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {12896#true} assume true; {12896#true} is VALID [2018-11-14 18:38:49,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12896#true} {12896#true} #83#return; {12896#true} is VALID [2018-11-14 18:38:49,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {12896#true} call #t~ret8 := main(); {12896#true} is VALID [2018-11-14 18:38:49,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {12896#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {12896#true} is VALID [2018-11-14 18:38:49,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {12896#true} assume true; {12896#true} is VALID [2018-11-14 18:38:49,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {12896#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {12898#(= main_~i~0 1)} is VALID [2018-11-14 18:38:49,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {12898#(= main_~i~0 1)} assume true; {12898#(= main_~i~0 1)} is VALID [2018-11-14 18:38:49,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {12898#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12898#(= main_~i~0 1)} is VALID [2018-11-14 18:38:49,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {12898#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12898#(= main_~i~0 1)} is VALID [2018-11-14 18:38:49,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {12898#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {12899#(<= main_~i~0 2)} assume true; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {12899#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {12899#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {12899#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {12900#(<= main_~i~0 3)} assume true; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {12900#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {12900#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {12900#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {12901#(<= main_~i~0 4)} assume true; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {12901#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {12901#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {12901#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {12902#(<= main_~i~0 5)} assume true; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {12902#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {12902#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {12902#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {12903#(<= main_~i~0 6)} assume true; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {12903#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {12903#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {12903#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {12904#(<= main_~i~0 7)} assume true; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {12904#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {12904#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {12904#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {12905#(<= main_~i~0 8)} assume true; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {12905#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {12905#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {12905#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {12906#(<= main_~i~0 9)} assume true; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {12906#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {12906#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {12906#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {12907#(<= main_~i~0 10)} assume true; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {12907#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {12907#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {12907#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {12908#(<= main_~i~0 11)} assume true; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {12908#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {12908#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,283 INFO L273 TraceCheckUtils]: 51: Hoare triple {12908#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,284 INFO L273 TraceCheckUtils]: 52: Hoare triple {12909#(<= main_~i~0 12)} assume true; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,284 INFO L273 TraceCheckUtils]: 53: Hoare triple {12909#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,285 INFO L273 TraceCheckUtils]: 54: Hoare triple {12909#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,285 INFO L273 TraceCheckUtils]: 55: Hoare triple {12909#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,286 INFO L273 TraceCheckUtils]: 56: Hoare triple {12910#(<= main_~i~0 13)} assume true; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,307 INFO L273 TraceCheckUtils]: 57: Hoare triple {12910#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,307 INFO L273 TraceCheckUtils]: 58: Hoare triple {12910#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,308 INFO L273 TraceCheckUtils]: 59: Hoare triple {12910#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,308 INFO L273 TraceCheckUtils]: 60: Hoare triple {12911#(<= main_~i~0 14)} assume true; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,308 INFO L273 TraceCheckUtils]: 61: Hoare triple {12911#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,309 INFO L273 TraceCheckUtils]: 62: Hoare triple {12911#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,309 INFO L273 TraceCheckUtils]: 63: Hoare triple {12911#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,309 INFO L273 TraceCheckUtils]: 64: Hoare triple {12912#(<= main_~i~0 15)} assume true; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {12912#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,310 INFO L273 TraceCheckUtils]: 66: Hoare triple {12912#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,311 INFO L273 TraceCheckUtils]: 67: Hoare triple {12912#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,311 INFO L273 TraceCheckUtils]: 68: Hoare triple {12913#(<= main_~i~0 16)} assume true; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,312 INFO L273 TraceCheckUtils]: 69: Hoare triple {12913#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,312 INFO L273 TraceCheckUtils]: 70: Hoare triple {12913#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,313 INFO L273 TraceCheckUtils]: 71: Hoare triple {12913#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,314 INFO L273 TraceCheckUtils]: 72: Hoare triple {12914#(<= main_~i~0 17)} assume true; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,314 INFO L273 TraceCheckUtils]: 73: Hoare triple {12914#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,315 INFO L273 TraceCheckUtils]: 74: Hoare triple {12914#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,315 INFO L273 TraceCheckUtils]: 75: Hoare triple {12914#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {12915#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:49,316 INFO L273 TraceCheckUtils]: 76: Hoare triple {12915#(<= main_~i~0 18)} assume true; {12915#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:49,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {12915#(<= main_~i~0 18)} assume !(~i~0 < 100000); {12897#false} is VALID [2018-11-14 18:38:49,317 INFO L273 TraceCheckUtils]: 78: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,317 INFO L273 TraceCheckUtils]: 79: Hoare triple {12897#false} assume !(~swapped~0 != 0); {12897#false} is VALID [2018-11-14 18:38:49,317 INFO L273 TraceCheckUtils]: 80: Hoare triple {12897#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {12897#false} is VALID [2018-11-14 18:38:49,317 INFO L273 TraceCheckUtils]: 81: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {12897#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L273 TraceCheckUtils]: 84: Hoare triple {12897#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L256 TraceCheckUtils]: 85: Hoare triple {12897#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L273 TraceCheckUtils]: 86: Hoare triple {12897#false} ~cond := #in~cond; {12897#false} is VALID [2018-11-14 18:38:49,318 INFO L273 TraceCheckUtils]: 87: Hoare triple {12897#false} assume ~cond == 0; {12897#false} is VALID [2018-11-14 18:38:49,319 INFO L273 TraceCheckUtils]: 88: Hoare triple {12897#false} assume !false; {12897#false} is VALID [2018-11-14 18:38:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 2 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:49,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:49,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:38:49,388 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:38:49,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:49,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:49,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {12896#true} call ULTIMATE.init(); {12896#true} is VALID [2018-11-14 18:38:49,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {12896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12896#true} is VALID [2018-11-14 18:38:49,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {12896#true} assume true; {12896#true} is VALID [2018-11-14 18:38:49,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12896#true} {12896#true} #83#return; {12896#true} is VALID [2018-11-14 18:38:49,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {12896#true} call #t~ret8 := main(); {12896#true} is VALID [2018-11-14 18:38:49,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {12896#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {12896#true} is VALID [2018-11-14 18:38:49,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {12896#true} assume true; {12896#true} is VALID [2018-11-14 18:38:49,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {12896#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {12940#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:49,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {12940#(<= main_~i~0 1)} assume true; {12940#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:49,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {12940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12940#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:49,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {12940#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12940#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:49,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {12940#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {12899#(<= main_~i~0 2)} assume true; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {12899#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {12899#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12899#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:49,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {12899#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {12900#(<= main_~i~0 3)} assume true; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {12900#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {12900#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12900#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:49,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {12900#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {12901#(<= main_~i~0 4)} assume true; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {12901#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {12901#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12901#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:49,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {12901#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {12902#(<= main_~i~0 5)} assume true; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {12902#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {12902#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12902#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:49,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {12902#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,590 INFO L273 TraceCheckUtils]: 28: Hoare triple {12903#(<= main_~i~0 6)} assume true; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {12903#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {12903#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12903#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:49,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {12903#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {12904#(<= main_~i~0 7)} assume true; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {12904#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {12904#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12904#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:49,594 INFO L273 TraceCheckUtils]: 35: Hoare triple {12904#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {12905#(<= main_~i~0 8)} assume true; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {12905#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {12905#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12905#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:49,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {12905#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {12906#(<= main_~i~0 9)} assume true; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {12906#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {12906#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12906#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:49,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {12906#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {12907#(<= main_~i~0 10)} assume true; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {12907#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {12907#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12907#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:49,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {12907#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {12908#(<= main_~i~0 11)} assume true; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {12908#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {12908#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12908#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:49,603 INFO L273 TraceCheckUtils]: 51: Hoare triple {12908#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {12909#(<= main_~i~0 12)} assume true; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {12909#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {12909#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12909#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:49,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {12909#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {12910#(<= main_~i~0 13)} assume true; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {12910#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {12910#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12910#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:49,608 INFO L273 TraceCheckUtils]: 59: Hoare triple {12910#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {12911#(<= main_~i~0 14)} assume true; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {12911#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {12911#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12911#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:49,610 INFO L273 TraceCheckUtils]: 63: Hoare triple {12911#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {12912#(<= main_~i~0 15)} assume true; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {12912#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {12912#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12912#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:49,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {12912#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,613 INFO L273 TraceCheckUtils]: 68: Hoare triple {12913#(<= main_~i~0 16)} assume true; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {12913#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {12913#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12913#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:49,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {12913#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {12914#(<= main_~i~0 17)} assume true; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,616 INFO L273 TraceCheckUtils]: 73: Hoare triple {12914#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {12914#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12914#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:49,617 INFO L273 TraceCheckUtils]: 75: Hoare triple {12914#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {12915#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:49,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {12915#(<= main_~i~0 18)} assume true; {12915#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:49,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {12915#(<= main_~i~0 18)} assume !(~i~0 < 100000); {12897#false} is VALID [2018-11-14 18:38:49,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {12897#false} assume !(~swapped~0 != 0); {12897#false} is VALID [2018-11-14 18:38:49,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {12897#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {12897#false} is VALID [2018-11-14 18:38:49,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {12897#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {12897#false} is VALID [2018-11-14 18:38:49,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {12897#false} assume true; {12897#false} is VALID [2018-11-14 18:38:49,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {12897#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {12897#false} is VALID [2018-11-14 18:38:49,620 INFO L256 TraceCheckUtils]: 85: Hoare triple {12897#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {12897#false} is VALID [2018-11-14 18:38:49,620 INFO L273 TraceCheckUtils]: 86: Hoare triple {12897#false} ~cond := #in~cond; {12897#false} is VALID [2018-11-14 18:38:49,620 INFO L273 TraceCheckUtils]: 87: Hoare triple {12897#false} assume ~cond == 0; {12897#false} is VALID [2018-11-14 18:38:49,620 INFO L273 TraceCheckUtils]: 88: Hoare triple {12897#false} assume !false; {12897#false} is VALID [2018-11-14 18:38:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 2 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:49,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:49,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:38:49,646 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-11-14 18:38:49,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:49,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:38:49,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:49,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:38:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:38:49,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:38:49,730 INFO L87 Difference]: Start difference. First operand 162 states and 199 transitions. Second operand 21 states. [2018-11-14 18:38:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:50,394 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2018-11-14 18:38:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:38:50,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-11-14 18:38:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:38:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 147 transitions. [2018-11-14 18:38:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:38:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 147 transitions. [2018-11-14 18:38:50,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 147 transitions. [2018-11-14 18:38:50,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:50,535 INFO L225 Difference]: With dead ends: 330 [2018-11-14 18:38:50,535 INFO L226 Difference]: Without dead ends: 174 [2018-11-14 18:38:50,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:38:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-14 18:38:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-11-14 18:38:50,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:50,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 170 states. [2018-11-14 18:38:50,577 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 170 states. [2018-11-14 18:38:50,578 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 170 states. [2018-11-14 18:38:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:50,581 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2018-11-14 18:38:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2018-11-14 18:38:50,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:50,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:50,581 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 174 states. [2018-11-14 18:38:50,581 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 174 states. [2018-11-14 18:38:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:50,584 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2018-11-14 18:38:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2018-11-14 18:38:50,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:50,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:50,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:50,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-14 18:38:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-11-14 18:38:50,588 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 89 [2018-11-14 18:38:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:50,588 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-14 18:38:50,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:38:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-14 18:38:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 18:38:50,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:50,589 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:50,589 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:50,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1284462284, now seen corresponding path program 18 times [2018-11-14 18:38:50,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:50,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:50,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:50,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:50,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {14166#true} call ULTIMATE.init(); {14166#true} is VALID [2018-11-14 18:38:50,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {14166#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14166#true} is VALID [2018-11-14 18:38:50,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {14166#true} assume true; {14166#true} is VALID [2018-11-14 18:38:50,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14166#true} {14166#true} #83#return; {14166#true} is VALID [2018-11-14 18:38:50,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {14166#true} call #t~ret8 := main(); {14166#true} is VALID [2018-11-14 18:38:50,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {14166#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {14166#true} is VALID [2018-11-14 18:38:50,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {14166#true} assume true; {14166#true} is VALID [2018-11-14 18:38:50,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {14166#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {14168#(= main_~i~0 1)} is VALID [2018-11-14 18:38:50,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {14168#(= main_~i~0 1)} assume true; {14168#(= main_~i~0 1)} is VALID [2018-11-14 18:38:50,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {14168#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14168#(= main_~i~0 1)} is VALID [2018-11-14 18:38:50,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {14168#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14168#(= main_~i~0 1)} is VALID [2018-11-14 18:38:50,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {14168#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:50,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {14169#(<= main_~i~0 2)} assume true; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:50,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {14169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:50,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {14169#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:50,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {14169#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:50,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {14170#(<= main_~i~0 3)} assume true; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:50,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {14170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:50,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {14170#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:50,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {14170#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:50,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {14171#(<= main_~i~0 4)} assume true; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:50,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {14171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:50,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {14171#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:50,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {14171#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:50,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {14172#(<= main_~i~0 5)} assume true; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:50,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {14172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:50,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {14172#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:50,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {14172#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:50,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {14173#(<= main_~i~0 6)} assume true; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:50,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {14173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:50,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {14173#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:50,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {14173#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:50,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {14174#(<= main_~i~0 7)} assume true; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:50,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {14174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:50,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {14174#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:50,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {14174#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:50,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {14175#(<= main_~i~0 8)} assume true; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:50,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {14175#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:50,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {14175#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:50,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {14175#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:50,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {14176#(<= main_~i~0 9)} assume true; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:50,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {14176#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:50,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {14176#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:50,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {14176#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:50,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {14177#(<= main_~i~0 10)} assume true; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:50,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {14177#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:50,987 INFO L273 TraceCheckUtils]: 46: Hoare triple {14177#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:50,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {14177#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:50,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {14178#(<= main_~i~0 11)} assume true; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:50,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {14178#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:50,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {14178#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:50,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {14178#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:50,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {14179#(<= main_~i~0 12)} assume true; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:50,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {14179#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:50,992 INFO L273 TraceCheckUtils]: 54: Hoare triple {14179#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:50,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {14179#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:50,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {14180#(<= main_~i~0 13)} assume true; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:50,993 INFO L273 TraceCheckUtils]: 57: Hoare triple {14180#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:50,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {14180#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:50,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {14180#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:50,995 INFO L273 TraceCheckUtils]: 60: Hoare triple {14181#(<= main_~i~0 14)} assume true; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:50,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {14181#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:50,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {14181#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:50,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {14181#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:50,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {14182#(<= main_~i~0 15)} assume true; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:50,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {14182#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:50,998 INFO L273 TraceCheckUtils]: 66: Hoare triple {14182#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:50,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {14182#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {14183#(<= main_~i~0 16)} assume true; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,000 INFO L273 TraceCheckUtils]: 69: Hoare triple {14183#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {14183#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,001 INFO L273 TraceCheckUtils]: 71: Hoare triple {14183#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {14184#(<= main_~i~0 17)} assume true; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,002 INFO L273 TraceCheckUtils]: 73: Hoare triple {14184#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {14184#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {14184#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {14185#(<= main_~i~0 18)} assume true; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {14185#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,005 INFO L273 TraceCheckUtils]: 78: Hoare triple {14185#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,006 INFO L273 TraceCheckUtils]: 79: Hoare triple {14185#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14186#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:51,006 INFO L273 TraceCheckUtils]: 80: Hoare triple {14186#(<= main_~i~0 19)} assume true; {14186#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:51,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {14186#(<= main_~i~0 19)} assume !(~i~0 < 100000); {14167#false} is VALID [2018-11-14 18:38:51,007 INFO L273 TraceCheckUtils]: 82: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {14167#false} assume !(~swapped~0 != 0); {14167#false} is VALID [2018-11-14 18:38:51,008 INFO L273 TraceCheckUtils]: 84: Hoare triple {14167#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {14167#false} is VALID [2018-11-14 18:38:51,008 INFO L273 TraceCheckUtils]: 85: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,008 INFO L273 TraceCheckUtils]: 86: Hoare triple {14167#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {14167#false} is VALID [2018-11-14 18:38:51,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,009 INFO L273 TraceCheckUtils]: 88: Hoare triple {14167#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {14167#false} is VALID [2018-11-14 18:38:51,009 INFO L256 TraceCheckUtils]: 89: Hoare triple {14167#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {14167#false} is VALID [2018-11-14 18:38:51,009 INFO L273 TraceCheckUtils]: 90: Hoare triple {14167#false} ~cond := #in~cond; {14167#false} is VALID [2018-11-14 18:38:51,009 INFO L273 TraceCheckUtils]: 91: Hoare triple {14167#false} assume ~cond == 0; {14167#false} is VALID [2018-11-14 18:38:51,009 INFO L273 TraceCheckUtils]: 92: Hoare triple {14167#false} assume !false; {14167#false} is VALID [2018-11-14 18:38:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 2 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:51,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:51,037 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:38:51,103 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-14 18:38:51,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:51,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:51,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {14166#true} call ULTIMATE.init(); {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {14166#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {14166#true} assume true; {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14166#true} {14166#true} #83#return; {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {14166#true} call #t~ret8 := main(); {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {14166#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {14166#true} is VALID [2018-11-14 18:38:51,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {14166#true} assume true; {14166#true} is VALID [2018-11-14 18:38:51,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {14166#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {14211#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:51,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {14211#(<= main_~i~0 1)} assume true; {14211#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:51,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {14211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14211#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:51,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {14211#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14211#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:51,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {14211#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:51,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {14169#(<= main_~i~0 2)} assume true; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:51,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {14169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:51,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {14169#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14169#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:51,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {14169#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:51,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {14170#(<= main_~i~0 3)} assume true; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:51,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {14170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:51,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {14170#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14170#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:51,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {14170#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:51,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {14171#(<= main_~i~0 4)} assume true; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:51,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {14171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:51,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {14171#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14171#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:51,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {14171#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:51,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {14172#(<= main_~i~0 5)} assume true; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:51,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {14172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:51,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {14172#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14172#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:51,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {14172#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:51,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {14173#(<= main_~i~0 6)} assume true; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:51,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {14173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:51,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {14173#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14173#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:51,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {14173#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:51,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {14174#(<= main_~i~0 7)} assume true; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:51,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {14174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:51,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {14174#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14174#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:51,333 INFO L273 TraceCheckUtils]: 35: Hoare triple {14174#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:51,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {14175#(<= main_~i~0 8)} assume true; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:51,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {14175#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:51,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {14175#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14175#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:51,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {14175#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:51,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {14176#(<= main_~i~0 9)} assume true; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:51,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {14176#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:51,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {14176#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14176#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:51,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {14176#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:51,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {14177#(<= main_~i~0 10)} assume true; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:51,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {14177#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:51,339 INFO L273 TraceCheckUtils]: 46: Hoare triple {14177#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14177#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:51,339 INFO L273 TraceCheckUtils]: 47: Hoare triple {14177#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:51,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {14178#(<= main_~i~0 11)} assume true; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:51,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {14178#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:51,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {14178#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14178#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:51,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {14178#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:51,342 INFO L273 TraceCheckUtils]: 52: Hoare triple {14179#(<= main_~i~0 12)} assume true; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:51,342 INFO L273 TraceCheckUtils]: 53: Hoare triple {14179#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:51,343 INFO L273 TraceCheckUtils]: 54: Hoare triple {14179#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14179#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:51,344 INFO L273 TraceCheckUtils]: 55: Hoare triple {14179#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:51,344 INFO L273 TraceCheckUtils]: 56: Hoare triple {14180#(<= main_~i~0 13)} assume true; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:51,345 INFO L273 TraceCheckUtils]: 57: Hoare triple {14180#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:51,345 INFO L273 TraceCheckUtils]: 58: Hoare triple {14180#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14180#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:51,346 INFO L273 TraceCheckUtils]: 59: Hoare triple {14180#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:51,346 INFO L273 TraceCheckUtils]: 60: Hoare triple {14181#(<= main_~i~0 14)} assume true; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:51,347 INFO L273 TraceCheckUtils]: 61: Hoare triple {14181#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:51,347 INFO L273 TraceCheckUtils]: 62: Hoare triple {14181#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14181#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:51,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {14181#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:51,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {14182#(<= main_~i~0 15)} assume true; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:51,349 INFO L273 TraceCheckUtils]: 65: Hoare triple {14182#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:51,349 INFO L273 TraceCheckUtils]: 66: Hoare triple {14182#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14182#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:51,350 INFO L273 TraceCheckUtils]: 67: Hoare triple {14182#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,351 INFO L273 TraceCheckUtils]: 68: Hoare triple {14183#(<= main_~i~0 16)} assume true; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {14183#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,352 INFO L273 TraceCheckUtils]: 70: Hoare triple {14183#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14183#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:51,352 INFO L273 TraceCheckUtils]: 71: Hoare triple {14183#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,353 INFO L273 TraceCheckUtils]: 72: Hoare triple {14184#(<= main_~i~0 17)} assume true; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {14184#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,354 INFO L273 TraceCheckUtils]: 74: Hoare triple {14184#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14184#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:51,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {14184#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,355 INFO L273 TraceCheckUtils]: 76: Hoare triple {14185#(<= main_~i~0 18)} assume true; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,355 INFO L273 TraceCheckUtils]: 77: Hoare triple {14185#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,356 INFO L273 TraceCheckUtils]: 78: Hoare triple {14185#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14185#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:51,357 INFO L273 TraceCheckUtils]: 79: Hoare triple {14185#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14186#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:51,357 INFO L273 TraceCheckUtils]: 80: Hoare triple {14186#(<= main_~i~0 19)} assume true; {14186#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:51,358 INFO L273 TraceCheckUtils]: 81: Hoare triple {14186#(<= main_~i~0 19)} assume !(~i~0 < 100000); {14167#false} is VALID [2018-11-14 18:38:51,358 INFO L273 TraceCheckUtils]: 82: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,358 INFO L273 TraceCheckUtils]: 83: Hoare triple {14167#false} assume !(~swapped~0 != 0); {14167#false} is VALID [2018-11-14 18:38:51,358 INFO L273 TraceCheckUtils]: 84: Hoare triple {14167#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {14167#false} is VALID [2018-11-14 18:38:51,358 INFO L273 TraceCheckUtils]: 85: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,359 INFO L273 TraceCheckUtils]: 86: Hoare triple {14167#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {14167#false} is VALID [2018-11-14 18:38:51,359 INFO L273 TraceCheckUtils]: 87: Hoare triple {14167#false} assume true; {14167#false} is VALID [2018-11-14 18:38:51,359 INFO L273 TraceCheckUtils]: 88: Hoare triple {14167#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {14167#false} is VALID [2018-11-14 18:38:51,359 INFO L256 TraceCheckUtils]: 89: Hoare triple {14167#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {14167#false} is VALID [2018-11-14 18:38:51,359 INFO L273 TraceCheckUtils]: 90: Hoare triple {14167#false} ~cond := #in~cond; {14167#false} is VALID [2018-11-14 18:38:51,360 INFO L273 TraceCheckUtils]: 91: Hoare triple {14167#false} assume ~cond == 0; {14167#false} is VALID [2018-11-14 18:38:51,360 INFO L273 TraceCheckUtils]: 92: Hoare triple {14167#false} assume !false; {14167#false} is VALID [2018-11-14 18:38:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 2 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:51,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:51,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 18:38:51,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-14 18:38:51,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:51,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:38:51,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:38:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:38:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:38:51,502 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand 22 states. [2018-11-14 18:38:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:52,229 INFO L93 Difference]: Finished difference Result 346 states and 430 transitions. [2018-11-14 18:38:52,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:38:52,229 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2018-11-14 18:38:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:38:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2018-11-14 18:38:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:38:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 152 transitions. [2018-11-14 18:38:52,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 152 transitions. [2018-11-14 18:38:52,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:52,607 INFO L225 Difference]: With dead ends: 346 [2018-11-14 18:38:52,607 INFO L226 Difference]: Without dead ends: 182 [2018-11-14 18:38:52,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:38:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-14 18:38:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-11-14 18:38:52,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:52,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 178 states. [2018-11-14 18:38:52,666 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 178 states. [2018-11-14 18:38:52,666 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 178 states. [2018-11-14 18:38:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:52,669 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-14 18:38:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2018-11-14 18:38:52,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:52,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:52,670 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 182 states. [2018-11-14 18:38:52,670 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 182 states. [2018-11-14 18:38:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:52,674 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-14 18:38:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2018-11-14 18:38:52,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:52,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:52,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:52,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-14 18:38:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2018-11-14 18:38:52,678 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 93 [2018-11-14 18:38:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:52,678 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2018-11-14 18:38:52,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:38:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2018-11-14 18:38:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 18:38:52,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:52,679 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:52,680 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -930768500, now seen corresponding path program 19 times [2018-11-14 18:38:52,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:52,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:53,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {15495#true} call ULTIMATE.init(); {15495#true} is VALID [2018-11-14 18:38:53,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {15495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15495#true} is VALID [2018-11-14 18:38:53,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 18:38:53,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15495#true} {15495#true} #83#return; {15495#true} is VALID [2018-11-14 18:38:53,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {15495#true} call #t~ret8 := main(); {15495#true} is VALID [2018-11-14 18:38:53,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {15495#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {15495#true} is VALID [2018-11-14 18:38:53,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 18:38:53,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {15495#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {15497#(= main_~i~0 1)} is VALID [2018-11-14 18:38:53,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {15497#(= main_~i~0 1)} assume true; {15497#(= main_~i~0 1)} is VALID [2018-11-14 18:38:53,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {15497#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15497#(= main_~i~0 1)} is VALID [2018-11-14 18:38:53,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {15497#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15497#(= main_~i~0 1)} is VALID [2018-11-14 18:38:53,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {15497#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {15498#(<= main_~i~0 2)} assume true; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {15498#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {15498#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {15498#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {15499#(<= main_~i~0 3)} assume true; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {15499#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {15499#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {15499#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {15500#(<= main_~i~0 4)} assume true; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {15500#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {15500#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {15500#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {15501#(<= main_~i~0 5)} assume true; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {15501#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {15501#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {15501#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {15502#(<= main_~i~0 6)} assume true; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {15502#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {15502#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {15502#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,055 INFO L273 TraceCheckUtils]: 32: Hoare triple {15503#(<= main_~i~0 7)} assume true; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {15503#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {15503#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {15503#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {15504#(<= main_~i~0 8)} assume true; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,062 INFO L273 TraceCheckUtils]: 37: Hoare triple {15504#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {15504#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {15504#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {15505#(<= main_~i~0 9)} assume true; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {15505#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {15505#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {15505#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {15506#(<= main_~i~0 10)} assume true; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {15506#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {15506#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {15506#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {15507#(<= main_~i~0 11)} assume true; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {15507#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {15507#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {15507#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {15508#(<= main_~i~0 12)} assume true; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,080 INFO L273 TraceCheckUtils]: 53: Hoare triple {15508#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {15508#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {15508#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,082 INFO L273 TraceCheckUtils]: 56: Hoare triple {15509#(<= main_~i~0 13)} assume true; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,084 INFO L273 TraceCheckUtils]: 57: Hoare triple {15509#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,084 INFO L273 TraceCheckUtils]: 58: Hoare triple {15509#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,087 INFO L273 TraceCheckUtils]: 59: Hoare triple {15509#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,087 INFO L273 TraceCheckUtils]: 60: Hoare triple {15510#(<= main_~i~0 14)} assume true; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {15510#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {15510#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,091 INFO L273 TraceCheckUtils]: 63: Hoare triple {15510#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,091 INFO L273 TraceCheckUtils]: 64: Hoare triple {15511#(<= main_~i~0 15)} assume true; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,093 INFO L273 TraceCheckUtils]: 65: Hoare triple {15511#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,093 INFO L273 TraceCheckUtils]: 66: Hoare triple {15511#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {15511#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,095 INFO L273 TraceCheckUtils]: 68: Hoare triple {15512#(<= main_~i~0 16)} assume true; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,097 INFO L273 TraceCheckUtils]: 69: Hoare triple {15512#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {15512#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {15512#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {15513#(<= main_~i~0 17)} assume true; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,101 INFO L273 TraceCheckUtils]: 73: Hoare triple {15513#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {15513#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {15513#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {15514#(<= main_~i~0 18)} assume true; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {15514#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,106 INFO L273 TraceCheckUtils]: 78: Hoare triple {15514#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,106 INFO L273 TraceCheckUtils]: 79: Hoare triple {15514#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,108 INFO L273 TraceCheckUtils]: 80: Hoare triple {15515#(<= main_~i~0 19)} assume true; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,108 INFO L273 TraceCheckUtils]: 81: Hoare triple {15515#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,110 INFO L273 TraceCheckUtils]: 82: Hoare triple {15515#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,110 INFO L273 TraceCheckUtils]: 83: Hoare triple {15515#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {15516#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:53,112 INFO L273 TraceCheckUtils]: 84: Hoare triple {15516#(<= main_~i~0 20)} assume true; {15516#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:53,112 INFO L273 TraceCheckUtils]: 85: Hoare triple {15516#(<= main_~i~0 20)} assume !(~i~0 < 100000); {15496#false} is VALID [2018-11-14 18:38:53,112 INFO L273 TraceCheckUtils]: 86: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,112 INFO L273 TraceCheckUtils]: 87: Hoare triple {15496#false} assume !(~swapped~0 != 0); {15496#false} is VALID [2018-11-14 18:38:53,112 INFO L273 TraceCheckUtils]: 88: Hoare triple {15496#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 89: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 90: Hoare triple {15496#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 91: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 92: Hoare triple {15496#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L256 TraceCheckUtils]: 93: Hoare triple {15496#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 94: Hoare triple {15496#false} ~cond := #in~cond; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {15496#false} assume ~cond == 0; {15496#false} is VALID [2018-11-14 18:38:53,113 INFO L273 TraceCheckUtils]: 96: Hoare triple {15496#false} assume !false; {15496#false} is VALID [2018-11-14 18:38:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 2 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:53,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:53,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:53,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {15495#true} call ULTIMATE.init(); {15495#true} is VALID [2018-11-14 18:38:53,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {15495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15495#true} is VALID [2018-11-14 18:38:53,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 18:38:53,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15495#true} {15495#true} #83#return; {15495#true} is VALID [2018-11-14 18:38:53,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {15495#true} call #t~ret8 := main(); {15495#true} is VALID [2018-11-14 18:38:53,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {15495#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {15495#true} is VALID [2018-11-14 18:38:53,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {15495#true} assume true; {15495#true} is VALID [2018-11-14 18:38:53,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {15495#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {15541#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:53,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {15541#(<= main_~i~0 1)} assume true; {15541#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:53,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {15541#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15541#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:53,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {15541#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15541#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:53,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {15541#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {15498#(<= main_~i~0 2)} assume true; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {15498#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {15498#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15498#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:53,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {15498#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {15499#(<= main_~i~0 3)} assume true; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {15499#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {15499#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15499#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:53,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {15499#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {15500#(<= main_~i~0 4)} assume true; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {15500#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {15500#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15500#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:53,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {15500#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {15501#(<= main_~i~0 5)} assume true; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {15501#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {15501#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15501#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:53,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {15501#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {15502#(<= main_~i~0 6)} assume true; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {15502#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {15502#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15502#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:53,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {15502#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {15503#(<= main_~i~0 7)} assume true; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,581 INFO L273 TraceCheckUtils]: 33: Hoare triple {15503#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {15503#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15503#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:53,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {15503#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {15504#(<= main_~i~0 8)} assume true; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,583 INFO L273 TraceCheckUtils]: 37: Hoare triple {15504#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {15504#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15504#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:53,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {15504#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {15505#(<= main_~i~0 9)} assume true; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {15505#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {15505#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15505#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:53,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {15505#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {15506#(<= main_~i~0 10)} assume true; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {15506#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {15506#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15506#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:53,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {15506#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {15507#(<= main_~i~0 11)} assume true; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {15507#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {15507#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15507#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:53,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {15507#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {15508#(<= main_~i~0 12)} assume true; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,592 INFO L273 TraceCheckUtils]: 53: Hoare triple {15508#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {15508#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15508#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:53,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {15508#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {15509#(<= main_~i~0 13)} assume true; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {15509#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,595 INFO L273 TraceCheckUtils]: 58: Hoare triple {15509#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15509#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:53,596 INFO L273 TraceCheckUtils]: 59: Hoare triple {15509#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {15510#(<= main_~i~0 14)} assume true; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,597 INFO L273 TraceCheckUtils]: 61: Hoare triple {15510#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,598 INFO L273 TraceCheckUtils]: 62: Hoare triple {15510#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15510#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:53,598 INFO L273 TraceCheckUtils]: 63: Hoare triple {15510#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {15511#(<= main_~i~0 15)} assume true; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {15511#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,600 INFO L273 TraceCheckUtils]: 66: Hoare triple {15511#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15511#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:53,601 INFO L273 TraceCheckUtils]: 67: Hoare triple {15511#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,601 INFO L273 TraceCheckUtils]: 68: Hoare triple {15512#(<= main_~i~0 16)} assume true; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,602 INFO L273 TraceCheckUtils]: 69: Hoare triple {15512#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,602 INFO L273 TraceCheckUtils]: 70: Hoare triple {15512#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15512#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:53,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {15512#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,604 INFO L273 TraceCheckUtils]: 72: Hoare triple {15513#(<= main_~i~0 17)} assume true; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {15513#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,605 INFO L273 TraceCheckUtils]: 74: Hoare triple {15513#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15513#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:53,605 INFO L273 TraceCheckUtils]: 75: Hoare triple {15513#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,606 INFO L273 TraceCheckUtils]: 76: Hoare triple {15514#(<= main_~i~0 18)} assume true; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,606 INFO L273 TraceCheckUtils]: 77: Hoare triple {15514#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,607 INFO L273 TraceCheckUtils]: 78: Hoare triple {15514#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15514#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:53,608 INFO L273 TraceCheckUtils]: 79: Hoare triple {15514#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,608 INFO L273 TraceCheckUtils]: 80: Hoare triple {15515#(<= main_~i~0 19)} assume true; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,609 INFO L273 TraceCheckUtils]: 81: Hoare triple {15515#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,609 INFO L273 TraceCheckUtils]: 82: Hoare triple {15515#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15515#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:53,610 INFO L273 TraceCheckUtils]: 83: Hoare triple {15515#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {15516#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:53,611 INFO L273 TraceCheckUtils]: 84: Hoare triple {15516#(<= main_~i~0 20)} assume true; {15516#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:53,611 INFO L273 TraceCheckUtils]: 85: Hoare triple {15516#(<= main_~i~0 20)} assume !(~i~0 < 100000); {15496#false} is VALID [2018-11-14 18:38:53,611 INFO L273 TraceCheckUtils]: 86: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,612 INFO L273 TraceCheckUtils]: 87: Hoare triple {15496#false} assume !(~swapped~0 != 0); {15496#false} is VALID [2018-11-14 18:38:53,612 INFO L273 TraceCheckUtils]: 88: Hoare triple {15496#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {15496#false} is VALID [2018-11-14 18:38:53,612 INFO L273 TraceCheckUtils]: 89: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,612 INFO L273 TraceCheckUtils]: 90: Hoare triple {15496#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {15496#false} is VALID [2018-11-14 18:38:53,613 INFO L273 TraceCheckUtils]: 91: Hoare triple {15496#false} assume true; {15496#false} is VALID [2018-11-14 18:38:53,613 INFO L273 TraceCheckUtils]: 92: Hoare triple {15496#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {15496#false} is VALID [2018-11-14 18:38:53,613 INFO L256 TraceCheckUtils]: 93: Hoare triple {15496#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {15496#false} is VALID [2018-11-14 18:38:53,613 INFO L273 TraceCheckUtils]: 94: Hoare triple {15496#false} ~cond := #in~cond; {15496#false} is VALID [2018-11-14 18:38:53,613 INFO L273 TraceCheckUtils]: 95: Hoare triple {15496#false} assume ~cond == 0; {15496#false} is VALID [2018-11-14 18:38:53,614 INFO L273 TraceCheckUtils]: 96: Hoare triple {15496#false} assume !false; {15496#false} is VALID [2018-11-14 18:38:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 2 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:53,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:38:53,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-11-14 18:38:53,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:53,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:38:53,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:38:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:38:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:38:53,738 INFO L87 Difference]: Start difference. First operand 178 states and 219 transitions. Second operand 23 states. [2018-11-14 18:38:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:54,391 INFO L93 Difference]: Finished difference Result 362 states and 450 transitions. [2018-11-14 18:38:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:38:54,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-11-14 18:38:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:38:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2018-11-14 18:38:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:38:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2018-11-14 18:38:54,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 157 transitions. [2018-11-14 18:38:54,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:54,541 INFO L225 Difference]: With dead ends: 362 [2018-11-14 18:38:54,541 INFO L226 Difference]: Without dead ends: 190 [2018-11-14 18:38:54,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:38:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-14 18:38:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-11-14 18:38:54,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:54,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 186 states. [2018-11-14 18:38:54,604 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 186 states. [2018-11-14 18:38:54,604 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 186 states. [2018-11-14 18:38:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:54,607 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2018-11-14 18:38:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 235 transitions. [2018-11-14 18:38:54,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:54,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:54,608 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 190 states. [2018-11-14 18:38:54,608 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 190 states. [2018-11-14 18:38:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:54,611 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2018-11-14 18:38:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 235 transitions. [2018-11-14 18:38:54,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:54,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:54,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:54,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-14 18:38:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2018-11-14 18:38:54,615 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 97 [2018-11-14 18:38:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:54,616 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2018-11-14 18:38:54,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:38:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2018-11-14 18:38:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-14 18:38:54,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:54,617 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:54,617 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:54,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1853529572, now seen corresponding path program 20 times [2018-11-14 18:38:54,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:38:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:55,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {16883#true} call ULTIMATE.init(); {16883#true} is VALID [2018-11-14 18:38:55,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {16883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16883#true} is VALID [2018-11-14 18:38:55,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {16883#true} assume true; {16883#true} is VALID [2018-11-14 18:38:55,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16883#true} {16883#true} #83#return; {16883#true} is VALID [2018-11-14 18:38:55,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {16883#true} call #t~ret8 := main(); {16883#true} is VALID [2018-11-14 18:38:55,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {16883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {16883#true} is VALID [2018-11-14 18:38:55,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {16883#true} assume true; {16883#true} is VALID [2018-11-14 18:38:55,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {16883#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {16885#(= main_~i~0 1)} is VALID [2018-11-14 18:38:55,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {16885#(= main_~i~0 1)} assume true; {16885#(= main_~i~0 1)} is VALID [2018-11-14 18:38:55,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {16885#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16885#(= main_~i~0 1)} is VALID [2018-11-14 18:38:55,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {16885#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16885#(= main_~i~0 1)} is VALID [2018-11-14 18:38:55,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {16885#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {16886#(<= main_~i~0 2)} assume true; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {16886#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {16886#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {16886#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {16887#(<= main_~i~0 3)} assume true; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {16887#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {16887#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {16887#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {16888#(<= main_~i~0 4)} assume true; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {16888#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {16888#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {16888#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {16889#(<= main_~i~0 5)} assume true; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {16889#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {16889#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {16889#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {16890#(<= main_~i~0 6)} assume true; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {16890#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {16890#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {16890#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {16891#(<= main_~i~0 7)} assume true; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {16891#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {16891#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {16891#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {16892#(<= main_~i~0 8)} assume true; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {16892#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {16892#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {16892#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {16893#(<= main_~i~0 9)} assume true; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {16893#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {16893#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {16893#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {16894#(<= main_~i~0 10)} assume true; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {16894#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {16894#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,031 INFO L273 TraceCheckUtils]: 47: Hoare triple {16894#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {16895#(<= main_~i~0 11)} assume true; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,032 INFO L273 TraceCheckUtils]: 49: Hoare triple {16895#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {16895#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,034 INFO L273 TraceCheckUtils]: 51: Hoare triple {16895#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {16896#(<= main_~i~0 12)} assume true; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,035 INFO L273 TraceCheckUtils]: 53: Hoare triple {16896#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {16896#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {16896#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {16897#(<= main_~i~0 13)} assume true; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,037 INFO L273 TraceCheckUtils]: 57: Hoare triple {16897#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,037 INFO L273 TraceCheckUtils]: 58: Hoare triple {16897#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,038 INFO L273 TraceCheckUtils]: 59: Hoare triple {16897#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,039 INFO L273 TraceCheckUtils]: 60: Hoare triple {16898#(<= main_~i~0 14)} assume true; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,039 INFO L273 TraceCheckUtils]: 61: Hoare triple {16898#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {16898#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {16898#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,041 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#(<= main_~i~0 15)} assume true; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,041 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,042 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,043 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#(<= main_~i~0 16)} assume true; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,044 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,044 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,045 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,046 INFO L273 TraceCheckUtils]: 72: Hoare triple {16901#(<= main_~i~0 17)} assume true; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,046 INFO L273 TraceCheckUtils]: 73: Hoare triple {16901#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,047 INFO L273 TraceCheckUtils]: 74: Hoare triple {16901#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,047 INFO L273 TraceCheckUtils]: 75: Hoare triple {16901#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {16902#(<= main_~i~0 18)} assume true; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,048 INFO L273 TraceCheckUtils]: 77: Hoare triple {16902#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,049 INFO L273 TraceCheckUtils]: 78: Hoare triple {16902#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,050 INFO L273 TraceCheckUtils]: 79: Hoare triple {16902#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,050 INFO L273 TraceCheckUtils]: 80: Hoare triple {16903#(<= main_~i~0 19)} assume true; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,051 INFO L273 TraceCheckUtils]: 81: Hoare triple {16903#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,051 INFO L273 TraceCheckUtils]: 82: Hoare triple {16903#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,052 INFO L273 TraceCheckUtils]: 83: Hoare triple {16903#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,053 INFO L273 TraceCheckUtils]: 84: Hoare triple {16904#(<= main_~i~0 20)} assume true; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,053 INFO L273 TraceCheckUtils]: 85: Hoare triple {16904#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,054 INFO L273 TraceCheckUtils]: 86: Hoare triple {16904#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,054 INFO L273 TraceCheckUtils]: 87: Hoare triple {16904#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {16905#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:55,055 INFO L273 TraceCheckUtils]: 88: Hoare triple {16905#(<= main_~i~0 21)} assume true; {16905#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:55,056 INFO L273 TraceCheckUtils]: 89: Hoare triple {16905#(<= main_~i~0 21)} assume !(~i~0 < 100000); {16884#false} is VALID [2018-11-14 18:38:55,056 INFO L273 TraceCheckUtils]: 90: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,056 INFO L273 TraceCheckUtils]: 91: Hoare triple {16884#false} assume !(~swapped~0 != 0); {16884#false} is VALID [2018-11-14 18:38:55,056 INFO L273 TraceCheckUtils]: 92: Hoare triple {16884#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {16884#false} is VALID [2018-11-14 18:38:55,056 INFO L273 TraceCheckUtils]: 93: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,057 INFO L273 TraceCheckUtils]: 94: Hoare triple {16884#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {16884#false} is VALID [2018-11-14 18:38:55,057 INFO L273 TraceCheckUtils]: 95: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,057 INFO L273 TraceCheckUtils]: 96: Hoare triple {16884#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {16884#false} is VALID [2018-11-14 18:38:55,057 INFO L256 TraceCheckUtils]: 97: Hoare triple {16884#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {16884#false} is VALID [2018-11-14 18:38:55,057 INFO L273 TraceCheckUtils]: 98: Hoare triple {16884#false} ~cond := #in~cond; {16884#false} is VALID [2018-11-14 18:38:55,058 INFO L273 TraceCheckUtils]: 99: Hoare triple {16884#false} assume ~cond == 0; {16884#false} is VALID [2018-11-14 18:38:55,058 INFO L273 TraceCheckUtils]: 100: Hoare triple {16884#false} assume !false; {16884#false} is VALID [2018-11-14 18:38:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 2 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:55,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:55,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:38:55,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:38:55,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:55,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:55,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {16883#true} call ULTIMATE.init(); {16883#true} is VALID [2018-11-14 18:38:55,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {16883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16883#true} is VALID [2018-11-14 18:38:55,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {16883#true} assume true; {16883#true} is VALID [2018-11-14 18:38:55,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16883#true} {16883#true} #83#return; {16883#true} is VALID [2018-11-14 18:38:55,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {16883#true} call #t~ret8 := main(); {16883#true} is VALID [2018-11-14 18:38:55,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {16883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {16883#true} is VALID [2018-11-14 18:38:55,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {16883#true} assume true; {16883#true} is VALID [2018-11-14 18:38:55,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {16883#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {16930#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:55,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {16930#(<= main_~i~0 1)} assume true; {16930#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:55,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {16930#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16930#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:55,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {16930#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16930#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:55,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {16930#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {16886#(<= main_~i~0 2)} assume true; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {16886#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {16886#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16886#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:55,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {16886#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {16887#(<= main_~i~0 3)} assume true; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {16887#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {16887#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16887#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:55,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {16887#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {16888#(<= main_~i~0 4)} assume true; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {16888#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {16888#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16888#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:55,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {16888#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {16889#(<= main_~i~0 5)} assume true; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {16889#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {16889#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16889#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:55,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {16889#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {16890#(<= main_~i~0 6)} assume true; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {16890#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,428 INFO L273 TraceCheckUtils]: 30: Hoare triple {16890#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16890#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:55,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {16890#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {16891#(<= main_~i~0 7)} assume true; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {16891#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {16891#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16891#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:55,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {16891#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {16892#(<= main_~i~0 8)} assume true; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {16892#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {16892#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16892#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:55,433 INFO L273 TraceCheckUtils]: 39: Hoare triple {16892#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {16893#(<= main_~i~0 9)} assume true; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {16893#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {16893#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16893#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:55,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {16893#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {16894#(<= main_~i~0 10)} assume true; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {16894#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {16894#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16894#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:55,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {16894#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {16895#(<= main_~i~0 11)} assume true; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {16895#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {16895#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16895#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:55,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {16895#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,440 INFO L273 TraceCheckUtils]: 52: Hoare triple {16896#(<= main_~i~0 12)} assume true; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {16896#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,441 INFO L273 TraceCheckUtils]: 54: Hoare triple {16896#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16896#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:55,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {16896#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,442 INFO L273 TraceCheckUtils]: 56: Hoare triple {16897#(<= main_~i~0 13)} assume true; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {16897#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {16897#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16897#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:55,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {16897#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {16898#(<= main_~i~0 14)} assume true; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {16898#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {16898#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16898#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:55,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {16898#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#(<= main_~i~0 15)} assume true; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16899#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:55,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#(<= main_~i~0 16)} assume true; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16900#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:55,451 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {16901#(<= main_~i~0 17)} assume true; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,452 INFO L273 TraceCheckUtils]: 73: Hoare triple {16901#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {16901#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16901#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:55,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {16901#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {16902#(<= main_~i~0 18)} assume true; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {16902#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {16902#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16902#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:55,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {16902#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,455 INFO L273 TraceCheckUtils]: 80: Hoare triple {16903#(<= main_~i~0 19)} assume true; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,456 INFO L273 TraceCheckUtils]: 81: Hoare triple {16903#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,456 INFO L273 TraceCheckUtils]: 82: Hoare triple {16903#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16903#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:55,457 INFO L273 TraceCheckUtils]: 83: Hoare triple {16903#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,458 INFO L273 TraceCheckUtils]: 84: Hoare triple {16904#(<= main_~i~0 20)} assume true; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,458 INFO L273 TraceCheckUtils]: 85: Hoare triple {16904#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {16904#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16904#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:55,459 INFO L273 TraceCheckUtils]: 87: Hoare triple {16904#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {16905#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:55,460 INFO L273 TraceCheckUtils]: 88: Hoare triple {16905#(<= main_~i~0 21)} assume true; {16905#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:55,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {16905#(<= main_~i~0 21)} assume !(~i~0 < 100000); {16884#false} is VALID [2018-11-14 18:38:55,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {16884#false} assume !(~swapped~0 != 0); {16884#false} is VALID [2018-11-14 18:38:55,461 INFO L273 TraceCheckUtils]: 92: Hoare triple {16884#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {16884#false} is VALID [2018-11-14 18:38:55,461 INFO L273 TraceCheckUtils]: 93: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,461 INFO L273 TraceCheckUtils]: 94: Hoare triple {16884#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L273 TraceCheckUtils]: 95: Hoare triple {16884#false} assume true; {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L273 TraceCheckUtils]: 96: Hoare triple {16884#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L256 TraceCheckUtils]: 97: Hoare triple {16884#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L273 TraceCheckUtils]: 98: Hoare triple {16884#false} ~cond := #in~cond; {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {16884#false} assume ~cond == 0; {16884#false} is VALID [2018-11-14 18:38:55,462 INFO L273 TraceCheckUtils]: 100: Hoare triple {16884#false} assume !false; {16884#false} is VALID [2018-11-14 18:38:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 2 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:55,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:55,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:38:55,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 18:38:55,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:55,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:38:55,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:55,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:38:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:38:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:38:55,586 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand 24 states. [2018-11-14 18:38:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:56,053 INFO L93 Difference]: Finished difference Result 378 states and 470 transitions. [2018-11-14 18:38:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:38:56,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-11-14 18:38:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:38:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 162 transitions. [2018-11-14 18:38:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:38:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 162 transitions. [2018-11-14 18:38:56,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 162 transitions. [2018-11-14 18:38:56,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:56,211 INFO L225 Difference]: With dead ends: 378 [2018-11-14 18:38:56,211 INFO L226 Difference]: Without dead ends: 198 [2018-11-14 18:38:56,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:38:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-14 18:38:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2018-11-14 18:38:56,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:56,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 194 states. [2018-11-14 18:38:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 194 states. [2018-11-14 18:38:56,280 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 194 states. [2018-11-14 18:38:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:56,284 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2018-11-14 18:38:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2018-11-14 18:38:56,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:56,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:56,285 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 198 states. [2018-11-14 18:38:56,285 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 198 states. [2018-11-14 18:38:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:56,289 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2018-11-14 18:38:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2018-11-14 18:38:56,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:56,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:56,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:56,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-14 18:38:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-11-14 18:38:56,293 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 101 [2018-11-14 18:38:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:56,294 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-11-14 18:38:56,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:38:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-11-14 18:38:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 18:38:56,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:56,295 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:56,295 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:56,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1327871548, now seen corresponding path program 21 times [2018-11-14 18:38:56,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:56,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:56,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:56,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {18330#true} call ULTIMATE.init(); {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {18330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {18330#true} assume true; {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18330#true} {18330#true} #83#return; {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {18330#true} call #t~ret8 := main(); {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {18330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {18330#true} is VALID [2018-11-14 18:38:56,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {18330#true} assume true; {18330#true} is VALID [2018-11-14 18:38:56,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {18330#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {18332#(= main_~i~0 1)} is VALID [2018-11-14 18:38:56,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {18332#(= main_~i~0 1)} assume true; {18332#(= main_~i~0 1)} is VALID [2018-11-14 18:38:56,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {18332#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18332#(= main_~i~0 1)} is VALID [2018-11-14 18:38:56,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {18332#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18332#(= main_~i~0 1)} is VALID [2018-11-14 18:38:56,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {18332#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:56,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {18333#(<= main_~i~0 2)} assume true; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:56,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {18333#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:56,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {18333#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:56,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {18333#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:56,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {18334#(<= main_~i~0 3)} assume true; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:56,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {18334#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:56,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {18334#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:56,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {18334#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:56,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {18335#(<= main_~i~0 4)} assume true; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:56,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {18335#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:56,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {18335#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:56,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {18335#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:56,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {18336#(<= main_~i~0 5)} assume true; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:56,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {18336#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:56,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {18336#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:56,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {18336#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:56,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {18337#(<= main_~i~0 6)} assume true; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:56,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {18337#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:56,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {18337#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:56,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {18337#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:56,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {18338#(<= main_~i~0 7)} assume true; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:56,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {18338#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:56,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {18338#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:56,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {18338#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:56,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {18339#(<= main_~i~0 8)} assume true; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:56,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {18339#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:56,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {18339#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:56,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {18339#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:56,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {18340#(<= main_~i~0 9)} assume true; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:56,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {18340#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:56,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {18340#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:56,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {18340#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:56,732 INFO L273 TraceCheckUtils]: 44: Hoare triple {18341#(<= main_~i~0 10)} assume true; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:56,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {18341#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:56,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {18341#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:56,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {18341#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:56,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {18342#(<= main_~i~0 11)} assume true; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:56,735 INFO L273 TraceCheckUtils]: 49: Hoare triple {18342#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:56,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {18342#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:56,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {18342#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:56,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {18343#(<= main_~i~0 12)} assume true; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:56,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {18343#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:56,737 INFO L273 TraceCheckUtils]: 54: Hoare triple {18343#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:56,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {18343#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:56,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {18344#(<= main_~i~0 13)} assume true; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:56,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {18344#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:56,739 INFO L273 TraceCheckUtils]: 58: Hoare triple {18344#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:56,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {18344#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:56,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {18345#(<= main_~i~0 14)} assume true; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:56,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {18345#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:56,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {18345#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:56,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {18345#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:56,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {18346#(<= main_~i~0 15)} assume true; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:56,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {18346#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:56,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {18346#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:56,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {18346#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:56,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {18347#(<= main_~i~0 16)} assume true; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:56,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {18347#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:56,752 INFO L273 TraceCheckUtils]: 70: Hoare triple {18347#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:56,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {18347#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:56,753 INFO L273 TraceCheckUtils]: 72: Hoare triple {18348#(<= main_~i~0 17)} assume true; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:56,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {18348#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:56,754 INFO L273 TraceCheckUtils]: 74: Hoare triple {18348#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:56,755 INFO L273 TraceCheckUtils]: 75: Hoare triple {18348#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:56,755 INFO L273 TraceCheckUtils]: 76: Hoare triple {18349#(<= main_~i~0 18)} assume true; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:56,756 INFO L273 TraceCheckUtils]: 77: Hoare triple {18349#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:56,756 INFO L273 TraceCheckUtils]: 78: Hoare triple {18349#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:56,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {18349#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:56,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {18350#(<= main_~i~0 19)} assume true; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:56,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {18350#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:56,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {18350#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:56,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {18350#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:56,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {18351#(<= main_~i~0 20)} assume true; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:56,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {18351#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:56,762 INFO L273 TraceCheckUtils]: 86: Hoare triple {18351#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:56,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {18351#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:56,763 INFO L273 TraceCheckUtils]: 88: Hoare triple {18352#(<= main_~i~0 21)} assume true; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:56,764 INFO L273 TraceCheckUtils]: 89: Hoare triple {18352#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:56,764 INFO L273 TraceCheckUtils]: 90: Hoare triple {18352#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:56,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {18352#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {18353#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:56,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {18353#(<= main_~i~0 22)} assume true; {18353#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:56,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {18353#(<= main_~i~0 22)} assume !(~i~0 < 100000); {18331#false} is VALID [2018-11-14 18:38:56,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:56,767 INFO L273 TraceCheckUtils]: 95: Hoare triple {18331#false} assume !(~swapped~0 != 0); {18331#false} is VALID [2018-11-14 18:38:56,767 INFO L273 TraceCheckUtils]: 96: Hoare triple {18331#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {18331#false} is VALID [2018-11-14 18:38:56,767 INFO L273 TraceCheckUtils]: 97: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:56,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {18331#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {18331#false} is VALID [2018-11-14 18:38:56,768 INFO L273 TraceCheckUtils]: 99: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:56,768 INFO L273 TraceCheckUtils]: 100: Hoare triple {18331#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {18331#false} is VALID [2018-11-14 18:38:56,769 INFO L256 TraceCheckUtils]: 101: Hoare triple {18331#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {18331#false} is VALID [2018-11-14 18:38:56,769 INFO L273 TraceCheckUtils]: 102: Hoare triple {18331#false} ~cond := #in~cond; {18331#false} is VALID [2018-11-14 18:38:56,769 INFO L273 TraceCheckUtils]: 103: Hoare triple {18331#false} assume ~cond == 0; {18331#false} is VALID [2018-11-14 18:38:56,769 INFO L273 TraceCheckUtils]: 104: Hoare triple {18331#false} assume !false; {18331#false} is VALID [2018-11-14 18:38:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 2 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:56,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:56,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:56,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:38:56,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-14 18:38:56,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:56,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:57,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {18330#true} call ULTIMATE.init(); {18330#true} is VALID [2018-11-14 18:38:57,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {18330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18330#true} is VALID [2018-11-14 18:38:57,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {18330#true} assume true; {18330#true} is VALID [2018-11-14 18:38:57,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18330#true} {18330#true} #83#return; {18330#true} is VALID [2018-11-14 18:38:57,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {18330#true} call #t~ret8 := main(); {18330#true} is VALID [2018-11-14 18:38:57,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {18330#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {18330#true} is VALID [2018-11-14 18:38:57,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {18330#true} assume true; {18330#true} is VALID [2018-11-14 18:38:57,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {18330#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {18378#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:57,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {18378#(<= main_~i~0 1)} assume true; {18378#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:57,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {18378#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18378#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:57,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {18378#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18378#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:57,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {18378#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:57,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {18333#(<= main_~i~0 2)} assume true; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:57,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {18333#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:57,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {18333#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18333#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:57,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {18333#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:57,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {18334#(<= main_~i~0 3)} assume true; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:57,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {18334#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:57,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {18334#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18334#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:57,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {18334#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:57,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {18335#(<= main_~i~0 4)} assume true; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:57,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {18335#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:57,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {18335#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18335#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:57,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {18335#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:57,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {18336#(<= main_~i~0 5)} assume true; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:57,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {18336#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:57,167 INFO L273 TraceCheckUtils]: 26: Hoare triple {18336#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18336#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:57,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {18336#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:57,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {18337#(<= main_~i~0 6)} assume true; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:57,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {18337#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:57,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {18337#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18337#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:57,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {18337#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:57,171 INFO L273 TraceCheckUtils]: 32: Hoare triple {18338#(<= main_~i~0 7)} assume true; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:57,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {18338#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:57,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {18338#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18338#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:57,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {18338#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:57,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {18339#(<= main_~i~0 8)} assume true; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:57,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {18339#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:57,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {18339#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18339#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:57,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {18339#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:57,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {18340#(<= main_~i~0 9)} assume true; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:57,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {18340#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:57,177 INFO L273 TraceCheckUtils]: 42: Hoare triple {18340#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18340#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:57,178 INFO L273 TraceCheckUtils]: 43: Hoare triple {18340#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:57,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {18341#(<= main_~i~0 10)} assume true; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:57,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {18341#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:57,179 INFO L273 TraceCheckUtils]: 46: Hoare triple {18341#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18341#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:57,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {18341#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:57,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {18342#(<= main_~i~0 11)} assume true; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:57,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {18342#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:57,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {18342#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18342#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:57,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {18342#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:57,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {18343#(<= main_~i~0 12)} assume true; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:57,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {18343#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:57,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {18343#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18343#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:57,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {18343#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:57,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {18344#(<= main_~i~0 13)} assume true; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:57,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {18344#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:57,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {18344#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18344#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:57,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {18344#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:57,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {18345#(<= main_~i~0 14)} assume true; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:57,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {18345#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:57,189 INFO L273 TraceCheckUtils]: 62: Hoare triple {18345#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18345#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:57,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {18345#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:57,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {18346#(<= main_~i~0 15)} assume true; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:57,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {18346#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:57,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {18346#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18346#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:57,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {18346#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:57,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {18347#(<= main_~i~0 16)} assume true; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:57,194 INFO L273 TraceCheckUtils]: 69: Hoare triple {18347#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:57,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {18347#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18347#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:57,195 INFO L273 TraceCheckUtils]: 71: Hoare triple {18347#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:57,196 INFO L273 TraceCheckUtils]: 72: Hoare triple {18348#(<= main_~i~0 17)} assume true; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:57,198 INFO L273 TraceCheckUtils]: 73: Hoare triple {18348#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:57,199 INFO L273 TraceCheckUtils]: 74: Hoare triple {18348#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18348#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:57,200 INFO L273 TraceCheckUtils]: 75: Hoare triple {18348#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:57,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {18349#(<= main_~i~0 18)} assume true; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:57,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {18349#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:57,203 INFO L273 TraceCheckUtils]: 78: Hoare triple {18349#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18349#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:57,204 INFO L273 TraceCheckUtils]: 79: Hoare triple {18349#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:57,204 INFO L273 TraceCheckUtils]: 80: Hoare triple {18350#(<= main_~i~0 19)} assume true; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:57,204 INFO L273 TraceCheckUtils]: 81: Hoare triple {18350#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:57,205 INFO L273 TraceCheckUtils]: 82: Hoare triple {18350#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18350#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:57,205 INFO L273 TraceCheckUtils]: 83: Hoare triple {18350#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:57,205 INFO L273 TraceCheckUtils]: 84: Hoare triple {18351#(<= main_~i~0 20)} assume true; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:57,206 INFO L273 TraceCheckUtils]: 85: Hoare triple {18351#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:57,206 INFO L273 TraceCheckUtils]: 86: Hoare triple {18351#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18351#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:57,207 INFO L273 TraceCheckUtils]: 87: Hoare triple {18351#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:57,208 INFO L273 TraceCheckUtils]: 88: Hoare triple {18352#(<= main_~i~0 21)} assume true; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:57,208 INFO L273 TraceCheckUtils]: 89: Hoare triple {18352#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:57,209 INFO L273 TraceCheckUtils]: 90: Hoare triple {18352#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18352#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:57,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {18352#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {18353#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:57,210 INFO L273 TraceCheckUtils]: 92: Hoare triple {18353#(<= main_~i~0 22)} assume true; {18353#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:57,211 INFO L273 TraceCheckUtils]: 93: Hoare triple {18353#(<= main_~i~0 22)} assume !(~i~0 < 100000); {18331#false} is VALID [2018-11-14 18:38:57,211 INFO L273 TraceCheckUtils]: 94: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:57,212 INFO L273 TraceCheckUtils]: 95: Hoare triple {18331#false} assume !(~swapped~0 != 0); {18331#false} is VALID [2018-11-14 18:38:57,212 INFO L273 TraceCheckUtils]: 96: Hoare triple {18331#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {18331#false} is VALID [2018-11-14 18:38:57,212 INFO L273 TraceCheckUtils]: 97: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:57,212 INFO L273 TraceCheckUtils]: 98: Hoare triple {18331#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {18331#false} is VALID [2018-11-14 18:38:57,212 INFO L273 TraceCheckUtils]: 99: Hoare triple {18331#false} assume true; {18331#false} is VALID [2018-11-14 18:38:57,213 INFO L273 TraceCheckUtils]: 100: Hoare triple {18331#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {18331#false} is VALID [2018-11-14 18:38:57,213 INFO L256 TraceCheckUtils]: 101: Hoare triple {18331#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {18331#false} is VALID [2018-11-14 18:38:57,213 INFO L273 TraceCheckUtils]: 102: Hoare triple {18331#false} ~cond := #in~cond; {18331#false} is VALID [2018-11-14 18:38:57,213 INFO L273 TraceCheckUtils]: 103: Hoare triple {18331#false} assume ~cond == 0; {18331#false} is VALID [2018-11-14 18:38:57,214 INFO L273 TraceCheckUtils]: 104: Hoare triple {18331#false} assume !false; {18331#false} is VALID [2018-11-14 18:38:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 2 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:57,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 18:38:57,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-11-14 18:38:57,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:57,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:38:57,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:57,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:38:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:38:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:38:57,374 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 25 states. [2018-11-14 18:38:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:58,011 INFO L93 Difference]: Finished difference Result 394 states and 490 transitions. [2018-11-14 18:38:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:38:58,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-11-14 18:38:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:38:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:38:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 167 transitions. [2018-11-14 18:38:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:38:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 167 transitions. [2018-11-14 18:38:58,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 167 transitions. [2018-11-14 18:38:58,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:58,180 INFO L225 Difference]: With dead ends: 394 [2018-11-14 18:38:58,180 INFO L226 Difference]: Without dead ends: 206 [2018-11-14 18:38:58,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:38:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-14 18:38:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2018-11-14 18:38:58,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:38:58,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 202 states. [2018-11-14 18:38:58,439 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 202 states. [2018-11-14 18:38:58,439 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 202 states. [2018-11-14 18:38:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:58,443 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-14 18:38:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2018-11-14 18:38:58,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:58,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:58,444 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 206 states. [2018-11-14 18:38:58,444 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 206 states. [2018-11-14 18:38:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:38:58,447 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-14 18:38:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2018-11-14 18:38:58,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:38:58,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:38:58,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:38:58,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:38:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-14 18:38:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 249 transitions. [2018-11-14 18:38:58,452 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 249 transitions. Word has length 105 [2018-11-14 18:38:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:38:58,453 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 249 transitions. [2018-11-14 18:38:58,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:38:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2018-11-14 18:38:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 18:38:58,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:38:58,454 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:38:58,454 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:38:58,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:38:58,455 INFO L82 PathProgramCache]: Analyzing trace with hash 962388628, now seen corresponding path program 22 times [2018-11-14 18:38:58,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:38:58,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:38:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:58,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:38:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:38:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:58,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {19836#true} call ULTIMATE.init(); {19836#true} is VALID [2018-11-14 18:38:58,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {19836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19836#true} is VALID [2018-11-14 18:38:58,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {19836#true} assume true; {19836#true} is VALID [2018-11-14 18:38:58,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19836#true} {19836#true} #83#return; {19836#true} is VALID [2018-11-14 18:38:58,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {19836#true} call #t~ret8 := main(); {19836#true} is VALID [2018-11-14 18:38:58,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {19836#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {19836#true} is VALID [2018-11-14 18:38:58,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {19836#true} assume true; {19836#true} is VALID [2018-11-14 18:38:58,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {19836#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {19838#(= main_~i~0 1)} is VALID [2018-11-14 18:38:58,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {19838#(= main_~i~0 1)} assume true; {19838#(= main_~i~0 1)} is VALID [2018-11-14 18:38:58,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {19838#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19838#(= main_~i~0 1)} is VALID [2018-11-14 18:38:58,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {19838#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19838#(= main_~i~0 1)} is VALID [2018-11-14 18:38:58,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {19838#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:58,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {19839#(<= main_~i~0 2)} assume true; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:58,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {19839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:58,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {19839#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:58,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {19839#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:58,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {19840#(<= main_~i~0 3)} assume true; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:58,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {19840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:58,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {19840#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:58,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {19840#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:58,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {19841#(<= main_~i~0 4)} assume true; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:58,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {19841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:58,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {19841#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:58,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {19841#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:58,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {19842#(<= main_~i~0 5)} assume true; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:58,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {19842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:58,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {19842#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:58,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {19842#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:58,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {19843#(<= main_~i~0 6)} assume true; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:58,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {19843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:58,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {19843#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:58,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {19843#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:58,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {19844#(<= main_~i~0 7)} assume true; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:58,894 INFO L273 TraceCheckUtils]: 33: Hoare triple {19844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:58,895 INFO L273 TraceCheckUtils]: 34: Hoare triple {19844#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:58,895 INFO L273 TraceCheckUtils]: 35: Hoare triple {19844#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:58,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {19845#(<= main_~i~0 8)} assume true; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:58,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {19845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:58,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {19845#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:58,898 INFO L273 TraceCheckUtils]: 39: Hoare triple {19845#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:58,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {19846#(<= main_~i~0 9)} assume true; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:58,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {19846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:58,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {19846#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:58,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {19846#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:58,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {19847#(<= main_~i~0 10)} assume true; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:58,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {19847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:58,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {19847#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:58,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {19847#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:58,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {19848#(<= main_~i~0 11)} assume true; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:58,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {19848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:58,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {19848#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:58,905 INFO L273 TraceCheckUtils]: 51: Hoare triple {19848#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:58,905 INFO L273 TraceCheckUtils]: 52: Hoare triple {19849#(<= main_~i~0 12)} assume true; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:58,906 INFO L273 TraceCheckUtils]: 53: Hoare triple {19849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:58,906 INFO L273 TraceCheckUtils]: 54: Hoare triple {19849#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:58,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {19849#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:58,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {19850#(<= main_~i~0 13)} assume true; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:58,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {19850#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:58,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {19850#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:58,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {19850#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:58,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {19851#(<= main_~i~0 14)} assume true; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:58,910 INFO L273 TraceCheckUtils]: 61: Hoare triple {19851#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:58,910 INFO L273 TraceCheckUtils]: 62: Hoare triple {19851#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:58,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {19851#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:58,912 INFO L273 TraceCheckUtils]: 64: Hoare triple {19852#(<= main_~i~0 15)} assume true; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:58,912 INFO L273 TraceCheckUtils]: 65: Hoare triple {19852#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:58,913 INFO L273 TraceCheckUtils]: 66: Hoare triple {19852#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:58,913 INFO L273 TraceCheckUtils]: 67: Hoare triple {19852#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:58,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {19853#(<= main_~i~0 16)} assume true; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:58,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {19853#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:58,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {19853#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:58,916 INFO L273 TraceCheckUtils]: 71: Hoare triple {19853#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:58,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {19854#(<= main_~i~0 17)} assume true; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:58,917 INFO L273 TraceCheckUtils]: 73: Hoare triple {19854#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:58,917 INFO L273 TraceCheckUtils]: 74: Hoare triple {19854#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:58,918 INFO L273 TraceCheckUtils]: 75: Hoare triple {19854#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:58,918 INFO L273 TraceCheckUtils]: 76: Hoare triple {19855#(<= main_~i~0 18)} assume true; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:58,919 INFO L273 TraceCheckUtils]: 77: Hoare triple {19855#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:58,919 INFO L273 TraceCheckUtils]: 78: Hoare triple {19855#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:58,920 INFO L273 TraceCheckUtils]: 79: Hoare triple {19855#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:58,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {19856#(<= main_~i~0 19)} assume true; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:58,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {19856#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:58,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {19856#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:58,922 INFO L273 TraceCheckUtils]: 83: Hoare triple {19856#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:58,923 INFO L273 TraceCheckUtils]: 84: Hoare triple {19857#(<= main_~i~0 20)} assume true; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:58,923 INFO L273 TraceCheckUtils]: 85: Hoare triple {19857#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:58,924 INFO L273 TraceCheckUtils]: 86: Hoare triple {19857#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:58,925 INFO L273 TraceCheckUtils]: 87: Hoare triple {19857#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:58,925 INFO L273 TraceCheckUtils]: 88: Hoare triple {19858#(<= main_~i~0 21)} assume true; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:58,926 INFO L273 TraceCheckUtils]: 89: Hoare triple {19858#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:58,926 INFO L273 TraceCheckUtils]: 90: Hoare triple {19858#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:58,927 INFO L273 TraceCheckUtils]: 91: Hoare triple {19858#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:58,927 INFO L273 TraceCheckUtils]: 92: Hoare triple {19859#(<= main_~i~0 22)} assume true; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:58,928 INFO L273 TraceCheckUtils]: 93: Hoare triple {19859#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:58,928 INFO L273 TraceCheckUtils]: 94: Hoare triple {19859#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:58,929 INFO L273 TraceCheckUtils]: 95: Hoare triple {19859#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {19860#(<= main_~i~0 23)} is VALID [2018-11-14 18:38:58,929 INFO L273 TraceCheckUtils]: 96: Hoare triple {19860#(<= main_~i~0 23)} assume true; {19860#(<= main_~i~0 23)} is VALID [2018-11-14 18:38:58,930 INFO L273 TraceCheckUtils]: 97: Hoare triple {19860#(<= main_~i~0 23)} assume !(~i~0 < 100000); {19837#false} is VALID [2018-11-14 18:38:58,930 INFO L273 TraceCheckUtils]: 98: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:58,930 INFO L273 TraceCheckUtils]: 99: Hoare triple {19837#false} assume !(~swapped~0 != 0); {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L273 TraceCheckUtils]: 100: Hoare triple {19837#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L273 TraceCheckUtils]: 101: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L273 TraceCheckUtils]: 102: Hoare triple {19837#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L273 TraceCheckUtils]: 103: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L273 TraceCheckUtils]: 104: Hoare triple {19837#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {19837#false} is VALID [2018-11-14 18:38:58,931 INFO L256 TraceCheckUtils]: 105: Hoare triple {19837#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {19837#false} is VALID [2018-11-14 18:38:58,932 INFO L273 TraceCheckUtils]: 106: Hoare triple {19837#false} ~cond := #in~cond; {19837#false} is VALID [2018-11-14 18:38:58,932 INFO L273 TraceCheckUtils]: 107: Hoare triple {19837#false} assume ~cond == 0; {19837#false} is VALID [2018-11-14 18:38:58,932 INFO L273 TraceCheckUtils]: 108: Hoare triple {19837#false} assume !false; {19837#false} is VALID [2018-11-14 18:38:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 2 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:58,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:38:58,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:38:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:38:58,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:38:58,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:38:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:38:59,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:38:59,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {19836#true} call ULTIMATE.init(); {19836#true} is VALID [2018-11-14 18:38:59,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {19836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19836#true} is VALID [2018-11-14 18:38:59,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {19836#true} assume true; {19836#true} is VALID [2018-11-14 18:38:59,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19836#true} {19836#true} #83#return; {19836#true} is VALID [2018-11-14 18:38:59,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {19836#true} call #t~ret8 := main(); {19836#true} is VALID [2018-11-14 18:38:59,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {19836#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {19836#true} is VALID [2018-11-14 18:38:59,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {19836#true} assume true; {19836#true} is VALID [2018-11-14 18:38:59,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {19836#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {19885#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:59,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {19885#(<= main_~i~0 1)} assume true; {19885#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:59,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {19885#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19885#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:59,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {19885#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19885#(<= main_~i~0 1)} is VALID [2018-11-14 18:38:59,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {19885#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:59,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {19839#(<= main_~i~0 2)} assume true; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:59,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {19839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:59,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {19839#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19839#(<= main_~i~0 2)} is VALID [2018-11-14 18:38:59,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {19839#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:59,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {19840#(<= main_~i~0 3)} assume true; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:59,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {19840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:59,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {19840#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19840#(<= main_~i~0 3)} is VALID [2018-11-14 18:38:59,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {19840#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:59,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {19841#(<= main_~i~0 4)} assume true; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:59,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {19841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:59,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {19841#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19841#(<= main_~i~0 4)} is VALID [2018-11-14 18:38:59,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {19841#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:59,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {19842#(<= main_~i~0 5)} assume true; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:59,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {19842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:59,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {19842#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19842#(<= main_~i~0 5)} is VALID [2018-11-14 18:38:59,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {19842#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:59,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {19843#(<= main_~i~0 6)} assume true; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:59,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {19843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:59,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {19843#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19843#(<= main_~i~0 6)} is VALID [2018-11-14 18:38:59,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {19843#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:59,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {19844#(<= main_~i~0 7)} assume true; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:59,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {19844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:59,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {19844#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19844#(<= main_~i~0 7)} is VALID [2018-11-14 18:38:59,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {19844#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:59,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {19845#(<= main_~i~0 8)} assume true; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:59,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {19845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:59,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {19845#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19845#(<= main_~i~0 8)} is VALID [2018-11-14 18:38:59,275 INFO L273 TraceCheckUtils]: 39: Hoare triple {19845#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:59,276 INFO L273 TraceCheckUtils]: 40: Hoare triple {19846#(<= main_~i~0 9)} assume true; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:59,276 INFO L273 TraceCheckUtils]: 41: Hoare triple {19846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:59,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {19846#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19846#(<= main_~i~0 9)} is VALID [2018-11-14 18:38:59,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {19846#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:59,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {19847#(<= main_~i~0 10)} assume true; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:59,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {19847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:59,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {19847#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19847#(<= main_~i~0 10)} is VALID [2018-11-14 18:38:59,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {19847#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:59,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {19848#(<= main_~i~0 11)} assume true; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:59,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {19848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:59,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {19848#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19848#(<= main_~i~0 11)} is VALID [2018-11-14 18:38:59,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {19848#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:59,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {19849#(<= main_~i~0 12)} assume true; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:59,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {19849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:59,284 INFO L273 TraceCheckUtils]: 54: Hoare triple {19849#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19849#(<= main_~i~0 12)} is VALID [2018-11-14 18:38:59,284 INFO L273 TraceCheckUtils]: 55: Hoare triple {19849#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:59,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {19850#(<= main_~i~0 13)} assume true; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:59,286 INFO L273 TraceCheckUtils]: 57: Hoare triple {19850#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:59,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {19850#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19850#(<= main_~i~0 13)} is VALID [2018-11-14 18:38:59,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {19850#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:59,287 INFO L273 TraceCheckUtils]: 60: Hoare triple {19851#(<= main_~i~0 14)} assume true; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:59,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {19851#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:59,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {19851#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19851#(<= main_~i~0 14)} is VALID [2018-11-14 18:38:59,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {19851#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:59,290 INFO L273 TraceCheckUtils]: 64: Hoare triple {19852#(<= main_~i~0 15)} assume true; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:59,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {19852#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:59,291 INFO L273 TraceCheckUtils]: 66: Hoare triple {19852#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19852#(<= main_~i~0 15)} is VALID [2018-11-14 18:38:59,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {19852#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:59,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {19853#(<= main_~i~0 16)} assume true; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:59,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {19853#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:59,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {19853#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19853#(<= main_~i~0 16)} is VALID [2018-11-14 18:38:59,294 INFO L273 TraceCheckUtils]: 71: Hoare triple {19853#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:59,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {19854#(<= main_~i~0 17)} assume true; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:59,295 INFO L273 TraceCheckUtils]: 73: Hoare triple {19854#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:59,295 INFO L273 TraceCheckUtils]: 74: Hoare triple {19854#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19854#(<= main_~i~0 17)} is VALID [2018-11-14 18:38:59,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {19854#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:59,296 INFO L273 TraceCheckUtils]: 76: Hoare triple {19855#(<= main_~i~0 18)} assume true; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:59,297 INFO L273 TraceCheckUtils]: 77: Hoare triple {19855#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:59,297 INFO L273 TraceCheckUtils]: 78: Hoare triple {19855#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19855#(<= main_~i~0 18)} is VALID [2018-11-14 18:38:59,298 INFO L273 TraceCheckUtils]: 79: Hoare triple {19855#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:59,299 INFO L273 TraceCheckUtils]: 80: Hoare triple {19856#(<= main_~i~0 19)} assume true; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:59,299 INFO L273 TraceCheckUtils]: 81: Hoare triple {19856#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:59,300 INFO L273 TraceCheckUtils]: 82: Hoare triple {19856#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19856#(<= main_~i~0 19)} is VALID [2018-11-14 18:38:59,300 INFO L273 TraceCheckUtils]: 83: Hoare triple {19856#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:59,301 INFO L273 TraceCheckUtils]: 84: Hoare triple {19857#(<= main_~i~0 20)} assume true; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:59,301 INFO L273 TraceCheckUtils]: 85: Hoare triple {19857#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:59,302 INFO L273 TraceCheckUtils]: 86: Hoare triple {19857#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19857#(<= main_~i~0 20)} is VALID [2018-11-14 18:38:59,303 INFO L273 TraceCheckUtils]: 87: Hoare triple {19857#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:59,303 INFO L273 TraceCheckUtils]: 88: Hoare triple {19858#(<= main_~i~0 21)} assume true; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:59,304 INFO L273 TraceCheckUtils]: 89: Hoare triple {19858#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:59,304 INFO L273 TraceCheckUtils]: 90: Hoare triple {19858#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19858#(<= main_~i~0 21)} is VALID [2018-11-14 18:38:59,305 INFO L273 TraceCheckUtils]: 91: Hoare triple {19858#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:59,305 INFO L273 TraceCheckUtils]: 92: Hoare triple {19859#(<= main_~i~0 22)} assume true; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:59,306 INFO L273 TraceCheckUtils]: 93: Hoare triple {19859#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:59,306 INFO L273 TraceCheckUtils]: 94: Hoare triple {19859#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19859#(<= main_~i~0 22)} is VALID [2018-11-14 18:38:59,307 INFO L273 TraceCheckUtils]: 95: Hoare triple {19859#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {19860#(<= main_~i~0 23)} is VALID [2018-11-14 18:38:59,308 INFO L273 TraceCheckUtils]: 96: Hoare triple {19860#(<= main_~i~0 23)} assume true; {19860#(<= main_~i~0 23)} is VALID [2018-11-14 18:38:59,308 INFO L273 TraceCheckUtils]: 97: Hoare triple {19860#(<= main_~i~0 23)} assume !(~i~0 < 100000); {19837#false} is VALID [2018-11-14 18:38:59,309 INFO L273 TraceCheckUtils]: 98: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:59,309 INFO L273 TraceCheckUtils]: 99: Hoare triple {19837#false} assume !(~swapped~0 != 0); {19837#false} is VALID [2018-11-14 18:38:59,309 INFO L273 TraceCheckUtils]: 100: Hoare triple {19837#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {19837#false} is VALID [2018-11-14 18:38:59,309 INFO L273 TraceCheckUtils]: 101: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:59,309 INFO L273 TraceCheckUtils]: 102: Hoare triple {19837#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {19837#false} is VALID [2018-11-14 18:38:59,310 INFO L273 TraceCheckUtils]: 103: Hoare triple {19837#false} assume true; {19837#false} is VALID [2018-11-14 18:38:59,310 INFO L273 TraceCheckUtils]: 104: Hoare triple {19837#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {19837#false} is VALID [2018-11-14 18:38:59,310 INFO L256 TraceCheckUtils]: 105: Hoare triple {19837#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {19837#false} is VALID [2018-11-14 18:38:59,310 INFO L273 TraceCheckUtils]: 106: Hoare triple {19837#false} ~cond := #in~cond; {19837#false} is VALID [2018-11-14 18:38:59,310 INFO L273 TraceCheckUtils]: 107: Hoare triple {19837#false} assume ~cond == 0; {19837#false} is VALID [2018-11-14 18:38:59,311 INFO L273 TraceCheckUtils]: 108: Hoare triple {19837#false} assume !false; {19837#false} is VALID [2018-11-14 18:38:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 2 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:38:59,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:38:59,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 18:38:59,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-14 18:38:59,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:38:59,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:38:59,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:38:59,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:38:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:38:59,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:38:59,522 INFO L87 Difference]: Start difference. First operand 202 states and 249 transitions. Second operand 26 states. [2018-11-14 18:39:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:00,474 INFO L93 Difference]: Finished difference Result 410 states and 510 transitions. [2018-11-14 18:39:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:39:00,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-11-14 18:39:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:39:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 172 transitions. [2018-11-14 18:39:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:39:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 172 transitions. [2018-11-14 18:39:00,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 172 transitions. [2018-11-14 18:39:00,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:00,997 INFO L225 Difference]: With dead ends: 410 [2018-11-14 18:39:00,997 INFO L226 Difference]: Without dead ends: 214 [2018-11-14 18:39:00,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:39:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-14 18:39:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-11-14 18:39:01,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:01,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 210 states. [2018-11-14 18:39:01,363 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 210 states. [2018-11-14 18:39:01,363 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 210 states. [2018-11-14 18:39:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:01,366 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2018-11-14 18:39:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2018-11-14 18:39:01,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:01,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:01,367 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 214 states. [2018-11-14 18:39:01,367 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 214 states. [2018-11-14 18:39:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:01,370 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2018-11-14 18:39:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2018-11-14 18:39:01,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:01,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:01,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:01,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-14 18:39:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2018-11-14 18:39:01,374 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 109 [2018-11-14 18:39:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:01,375 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2018-11-14 18:39:01,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:39:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-14 18:39:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-14 18:39:01,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:01,376 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:01,376 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:01,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1594481940, now seen corresponding path program 23 times [2018-11-14 18:39:01,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:01,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:01,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:01,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {21401#true} call ULTIMATE.init(); {21401#true} is VALID [2018-11-14 18:39:01,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {21401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21401#true} is VALID [2018-11-14 18:39:01,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {21401#true} assume true; {21401#true} is VALID [2018-11-14 18:39:01,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21401#true} {21401#true} #83#return; {21401#true} is VALID [2018-11-14 18:39:01,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {21401#true} call #t~ret8 := main(); {21401#true} is VALID [2018-11-14 18:39:01,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {21401#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {21401#true} is VALID [2018-11-14 18:39:01,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {21401#true} assume true; {21401#true} is VALID [2018-11-14 18:39:01,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {21401#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {21403#(= main_~i~0 1)} is VALID [2018-11-14 18:39:01,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {21403#(= main_~i~0 1)} assume true; {21403#(= main_~i~0 1)} is VALID [2018-11-14 18:39:01,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {21403#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21403#(= main_~i~0 1)} is VALID [2018-11-14 18:39:01,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {21403#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21403#(= main_~i~0 1)} is VALID [2018-11-14 18:39:01,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {21403#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:01,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {21404#(<= main_~i~0 2)} assume true; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:01,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {21404#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:01,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {21404#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:01,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {21404#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:01,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {21405#(<= main_~i~0 3)} assume true; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:01,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {21405#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:01,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {21405#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:01,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {21405#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:01,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {21406#(<= main_~i~0 4)} assume true; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:01,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {21406#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:01,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {21406#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:01,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {21406#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:01,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {21407#(<= main_~i~0 5)} assume true; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:01,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {21407#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:01,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {21407#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:01,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {21407#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:01,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {21408#(<= main_~i~0 6)} assume true; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:01,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {21408#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:01,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {21408#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:01,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {21408#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:01,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {21409#(<= main_~i~0 7)} assume true; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:01,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {21409#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:01,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {21409#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:01,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {21409#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:01,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {21410#(<= main_~i~0 8)} assume true; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:01,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {21410#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:01,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {21410#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:01,822 INFO L273 TraceCheckUtils]: 39: Hoare triple {21410#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:01,822 INFO L273 TraceCheckUtils]: 40: Hoare triple {21411#(<= main_~i~0 9)} assume true; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:01,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {21411#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:01,823 INFO L273 TraceCheckUtils]: 42: Hoare triple {21411#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:01,824 INFO L273 TraceCheckUtils]: 43: Hoare triple {21411#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:01,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {21412#(<= main_~i~0 10)} assume true; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:01,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {21412#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:01,826 INFO L273 TraceCheckUtils]: 46: Hoare triple {21412#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:01,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {21412#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:01,827 INFO L273 TraceCheckUtils]: 48: Hoare triple {21413#(<= main_~i~0 11)} assume true; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:01,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {21413#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:01,828 INFO L273 TraceCheckUtils]: 50: Hoare triple {21413#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:01,829 INFO L273 TraceCheckUtils]: 51: Hoare triple {21413#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:01,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {21414#(<= main_~i~0 12)} assume true; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:01,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {21414#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:01,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {21414#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:01,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {21414#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:01,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {21415#(<= main_~i~0 13)} assume true; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:01,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {21415#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:01,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {21415#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:01,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {21415#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:01,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {21416#(<= main_~i~0 14)} assume true; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:01,834 INFO L273 TraceCheckUtils]: 61: Hoare triple {21416#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:01,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {21416#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:01,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {21416#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:01,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {21417#(<= main_~i~0 15)} assume true; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:01,837 INFO L273 TraceCheckUtils]: 65: Hoare triple {21417#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:01,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {21417#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:01,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {21417#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:01,838 INFO L273 TraceCheckUtils]: 68: Hoare triple {21418#(<= main_~i~0 16)} assume true; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:01,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {21418#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:01,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {21418#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:01,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {21418#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:01,841 INFO L273 TraceCheckUtils]: 72: Hoare triple {21419#(<= main_~i~0 17)} assume true; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:01,841 INFO L273 TraceCheckUtils]: 73: Hoare triple {21419#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:01,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {21419#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:01,842 INFO L273 TraceCheckUtils]: 75: Hoare triple {21419#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:01,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {21420#(<= main_~i~0 18)} assume true; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:01,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {21420#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:01,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {21420#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:01,845 INFO L273 TraceCheckUtils]: 79: Hoare triple {21420#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:01,845 INFO L273 TraceCheckUtils]: 80: Hoare triple {21421#(<= main_~i~0 19)} assume true; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:01,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {21421#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:01,846 INFO L273 TraceCheckUtils]: 82: Hoare triple {21421#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:01,847 INFO L273 TraceCheckUtils]: 83: Hoare triple {21421#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:01,847 INFO L273 TraceCheckUtils]: 84: Hoare triple {21422#(<= main_~i~0 20)} assume true; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:01,848 INFO L273 TraceCheckUtils]: 85: Hoare triple {21422#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:01,848 INFO L273 TraceCheckUtils]: 86: Hoare triple {21422#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:01,849 INFO L273 TraceCheckUtils]: 87: Hoare triple {21422#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:01,850 INFO L273 TraceCheckUtils]: 88: Hoare triple {21423#(<= main_~i~0 21)} assume true; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:01,850 INFO L273 TraceCheckUtils]: 89: Hoare triple {21423#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:01,851 INFO L273 TraceCheckUtils]: 90: Hoare triple {21423#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:01,851 INFO L273 TraceCheckUtils]: 91: Hoare triple {21423#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:01,852 INFO L273 TraceCheckUtils]: 92: Hoare triple {21424#(<= main_~i~0 22)} assume true; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:01,852 INFO L273 TraceCheckUtils]: 93: Hoare triple {21424#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:01,853 INFO L273 TraceCheckUtils]: 94: Hoare triple {21424#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:01,854 INFO L273 TraceCheckUtils]: 95: Hoare triple {21424#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:01,854 INFO L273 TraceCheckUtils]: 96: Hoare triple {21425#(<= main_~i~0 23)} assume true; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:01,855 INFO L273 TraceCheckUtils]: 97: Hoare triple {21425#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:01,855 INFO L273 TraceCheckUtils]: 98: Hoare triple {21425#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:01,856 INFO L273 TraceCheckUtils]: 99: Hoare triple {21425#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {21426#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:01,856 INFO L273 TraceCheckUtils]: 100: Hoare triple {21426#(<= main_~i~0 24)} assume true; {21426#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:01,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {21426#(<= main_~i~0 24)} assume !(~i~0 < 100000); {21402#false} is VALID [2018-11-14 18:39:01,857 INFO L273 TraceCheckUtils]: 102: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:01,858 INFO L273 TraceCheckUtils]: 103: Hoare triple {21402#false} assume !(~swapped~0 != 0); {21402#false} is VALID [2018-11-14 18:39:01,858 INFO L273 TraceCheckUtils]: 104: Hoare triple {21402#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {21402#false} is VALID [2018-11-14 18:39:01,858 INFO L273 TraceCheckUtils]: 105: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:01,858 INFO L273 TraceCheckUtils]: 106: Hoare triple {21402#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {21402#false} is VALID [2018-11-14 18:39:01,858 INFO L273 TraceCheckUtils]: 107: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:01,859 INFO L273 TraceCheckUtils]: 108: Hoare triple {21402#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {21402#false} is VALID [2018-11-14 18:39:01,859 INFO L256 TraceCheckUtils]: 109: Hoare triple {21402#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {21402#false} is VALID [2018-11-14 18:39:01,859 INFO L273 TraceCheckUtils]: 110: Hoare triple {21402#false} ~cond := #in~cond; {21402#false} is VALID [2018-11-14 18:39:01,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {21402#false} assume ~cond == 0; {21402#false} is VALID [2018-11-14 18:39:01,859 INFO L273 TraceCheckUtils]: 112: Hoare triple {21402#false} assume !false; {21402#false} is VALID [2018-11-14 18:39:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 2 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:01,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:01,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:39:01,957 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 18:39:01,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:01,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:02,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {21401#true} call ULTIMATE.init(); {21401#true} is VALID [2018-11-14 18:39:02,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {21401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21401#true} is VALID [2018-11-14 18:39:02,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {21401#true} assume true; {21401#true} is VALID [2018-11-14 18:39:02,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21401#true} {21401#true} #83#return; {21401#true} is VALID [2018-11-14 18:39:02,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {21401#true} call #t~ret8 := main(); {21401#true} is VALID [2018-11-14 18:39:02,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {21401#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {21401#true} is VALID [2018-11-14 18:39:02,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {21401#true} assume true; {21401#true} is VALID [2018-11-14 18:39:02,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {21401#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {21451#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:02,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {21451#(<= main_~i~0 1)} assume true; {21451#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:02,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {21451#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21451#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:02,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {21451#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21451#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:02,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {21451#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:02,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {21404#(<= main_~i~0 2)} assume true; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:02,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {21404#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:02,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {21404#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21404#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:02,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {21404#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:02,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {21405#(<= main_~i~0 3)} assume true; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:02,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {21405#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:02,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {21405#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21405#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:02,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {21405#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:02,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {21406#(<= main_~i~0 4)} assume true; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:02,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {21406#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:02,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {21406#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21406#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:02,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {21406#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:02,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {21407#(<= main_~i~0 5)} assume true; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:02,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {21407#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:02,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {21407#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21407#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:02,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {21407#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:02,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {21408#(<= main_~i~0 6)} assume true; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:02,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {21408#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:02,239 INFO L273 TraceCheckUtils]: 30: Hoare triple {21408#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21408#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:02,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {21408#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:02,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {21409#(<= main_~i~0 7)} assume true; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:02,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {21409#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:02,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {21409#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21409#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:02,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {21409#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:02,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {21410#(<= main_~i~0 8)} assume true; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:02,243 INFO L273 TraceCheckUtils]: 37: Hoare triple {21410#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:02,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {21410#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21410#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:02,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {21410#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:02,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {21411#(<= main_~i~0 9)} assume true; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:02,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {21411#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:02,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {21411#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21411#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:02,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {21411#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:02,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {21412#(<= main_~i~0 10)} assume true; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:02,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {21412#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:02,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {21412#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21412#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:02,249 INFO L273 TraceCheckUtils]: 47: Hoare triple {21412#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:02,253 INFO L273 TraceCheckUtils]: 48: Hoare triple {21413#(<= main_~i~0 11)} assume true; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:02,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {21413#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:02,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {21413#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21413#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:02,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {21413#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:02,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {21414#(<= main_~i~0 12)} assume true; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:02,255 INFO L273 TraceCheckUtils]: 53: Hoare triple {21414#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:02,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {21414#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21414#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:02,256 INFO L273 TraceCheckUtils]: 55: Hoare triple {21414#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:02,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {21415#(<= main_~i~0 13)} assume true; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:02,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {21415#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:02,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {21415#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21415#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:02,257 INFO L273 TraceCheckUtils]: 59: Hoare triple {21415#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:02,258 INFO L273 TraceCheckUtils]: 60: Hoare triple {21416#(<= main_~i~0 14)} assume true; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:02,258 INFO L273 TraceCheckUtils]: 61: Hoare triple {21416#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:02,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {21416#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21416#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:02,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {21416#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:02,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {21417#(<= main_~i~0 15)} assume true; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:02,260 INFO L273 TraceCheckUtils]: 65: Hoare triple {21417#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:02,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {21417#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21417#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:02,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {21417#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:02,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {21418#(<= main_~i~0 16)} assume true; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:02,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {21418#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:02,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {21418#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21418#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:02,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {21418#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:02,264 INFO L273 TraceCheckUtils]: 72: Hoare triple {21419#(<= main_~i~0 17)} assume true; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:02,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {21419#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:02,265 INFO L273 TraceCheckUtils]: 74: Hoare triple {21419#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21419#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:02,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {21419#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:02,267 INFO L273 TraceCheckUtils]: 76: Hoare triple {21420#(<= main_~i~0 18)} assume true; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:02,267 INFO L273 TraceCheckUtils]: 77: Hoare triple {21420#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:02,268 INFO L273 TraceCheckUtils]: 78: Hoare triple {21420#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21420#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:02,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {21420#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:02,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {21421#(<= main_~i~0 19)} assume true; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:02,270 INFO L273 TraceCheckUtils]: 81: Hoare triple {21421#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:02,270 INFO L273 TraceCheckUtils]: 82: Hoare triple {21421#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21421#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:02,271 INFO L273 TraceCheckUtils]: 83: Hoare triple {21421#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:02,271 INFO L273 TraceCheckUtils]: 84: Hoare triple {21422#(<= main_~i~0 20)} assume true; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:02,272 INFO L273 TraceCheckUtils]: 85: Hoare triple {21422#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:02,272 INFO L273 TraceCheckUtils]: 86: Hoare triple {21422#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21422#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:02,273 INFO L273 TraceCheckUtils]: 87: Hoare triple {21422#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:02,274 INFO L273 TraceCheckUtils]: 88: Hoare triple {21423#(<= main_~i~0 21)} assume true; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:02,274 INFO L273 TraceCheckUtils]: 89: Hoare triple {21423#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:02,275 INFO L273 TraceCheckUtils]: 90: Hoare triple {21423#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21423#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:02,275 INFO L273 TraceCheckUtils]: 91: Hoare triple {21423#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:02,276 INFO L273 TraceCheckUtils]: 92: Hoare triple {21424#(<= main_~i~0 22)} assume true; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:02,276 INFO L273 TraceCheckUtils]: 93: Hoare triple {21424#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:02,277 INFO L273 TraceCheckUtils]: 94: Hoare triple {21424#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21424#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:02,278 INFO L273 TraceCheckUtils]: 95: Hoare triple {21424#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:02,278 INFO L273 TraceCheckUtils]: 96: Hoare triple {21425#(<= main_~i~0 23)} assume true; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:02,279 INFO L273 TraceCheckUtils]: 97: Hoare triple {21425#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:02,279 INFO L273 TraceCheckUtils]: 98: Hoare triple {21425#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21425#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:02,280 INFO L273 TraceCheckUtils]: 99: Hoare triple {21425#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {21426#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:02,280 INFO L273 TraceCheckUtils]: 100: Hoare triple {21426#(<= main_~i~0 24)} assume true; {21426#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:02,281 INFO L273 TraceCheckUtils]: 101: Hoare triple {21426#(<= main_~i~0 24)} assume !(~i~0 < 100000); {21402#false} is VALID [2018-11-14 18:39:02,281 INFO L273 TraceCheckUtils]: 102: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:02,282 INFO L273 TraceCheckUtils]: 103: Hoare triple {21402#false} assume !(~swapped~0 != 0); {21402#false} is VALID [2018-11-14 18:39:02,282 INFO L273 TraceCheckUtils]: 104: Hoare triple {21402#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {21402#false} is VALID [2018-11-14 18:39:02,282 INFO L273 TraceCheckUtils]: 105: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:02,282 INFO L273 TraceCheckUtils]: 106: Hoare triple {21402#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {21402#false} is VALID [2018-11-14 18:39:02,282 INFO L273 TraceCheckUtils]: 107: Hoare triple {21402#false} assume true; {21402#false} is VALID [2018-11-14 18:39:02,283 INFO L273 TraceCheckUtils]: 108: Hoare triple {21402#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {21402#false} is VALID [2018-11-14 18:39:02,283 INFO L256 TraceCheckUtils]: 109: Hoare triple {21402#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {21402#false} is VALID [2018-11-14 18:39:02,283 INFO L273 TraceCheckUtils]: 110: Hoare triple {21402#false} ~cond := #in~cond; {21402#false} is VALID [2018-11-14 18:39:02,283 INFO L273 TraceCheckUtils]: 111: Hoare triple {21402#false} assume ~cond == 0; {21402#false} is VALID [2018-11-14 18:39:02,283 INFO L273 TraceCheckUtils]: 112: Hoare triple {21402#false} assume !false; {21402#false} is VALID [2018-11-14 18:39:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 2 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:02,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:02,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 18:39:02,312 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2018-11-14 18:39:02,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:02,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:39:02,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:02,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:39:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:39:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:39:02,441 INFO L87 Difference]: Start difference. First operand 210 states and 259 transitions. Second operand 27 states. [2018-11-14 18:39:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:03,190 INFO L93 Difference]: Finished difference Result 426 states and 530 transitions. [2018-11-14 18:39:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:39:03,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2018-11-14 18:39:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:39:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 177 transitions. [2018-11-14 18:39:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:39:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 177 transitions. [2018-11-14 18:39:03,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 177 transitions. [2018-11-14 18:39:03,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:03,388 INFO L225 Difference]: With dead ends: 426 [2018-11-14 18:39:03,388 INFO L226 Difference]: Without dead ends: 222 [2018-11-14 18:39:03,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:39:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-14 18:39:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2018-11-14 18:39:03,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:03,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 218 states. [2018-11-14 18:39:03,573 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 218 states. [2018-11-14 18:39:03,573 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 218 states. [2018-11-14 18:39:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:03,577 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2018-11-14 18:39:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 275 transitions. [2018-11-14 18:39:03,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:03,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:03,578 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 222 states. [2018-11-14 18:39:03,578 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 222 states. [2018-11-14 18:39:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:03,581 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2018-11-14 18:39:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 275 transitions. [2018-11-14 18:39:03,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:03,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:03,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:03,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-14 18:39:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2018-11-14 18:39:03,585 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 113 [2018-11-14 18:39:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:03,586 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2018-11-14 18:39:03,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:39:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2018-11-14 18:39:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 18:39:03,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:03,587 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:03,587 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:03,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash 516388676, now seen corresponding path program 24 times [2018-11-14 18:39:03,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:03,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:03,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:04,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {23025#true} call ULTIMATE.init(); {23025#true} is VALID [2018-11-14 18:39:04,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {23025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23025#true} is VALID [2018-11-14 18:39:04,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {23025#true} assume true; {23025#true} is VALID [2018-11-14 18:39:04,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23025#true} {23025#true} #83#return; {23025#true} is VALID [2018-11-14 18:39:04,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {23025#true} call #t~ret8 := main(); {23025#true} is VALID [2018-11-14 18:39:04,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {23025#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {23025#true} is VALID [2018-11-14 18:39:04,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {23025#true} assume true; {23025#true} is VALID [2018-11-14 18:39:04,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {23025#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {23027#(= main_~i~0 1)} is VALID [2018-11-14 18:39:04,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {23027#(= main_~i~0 1)} assume true; {23027#(= main_~i~0 1)} is VALID [2018-11-14 18:39:04,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {23027#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23027#(= main_~i~0 1)} is VALID [2018-11-14 18:39:04,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {23027#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23027#(= main_~i~0 1)} is VALID [2018-11-14 18:39:04,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {23027#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:04,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {23028#(<= main_~i~0 2)} assume true; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:04,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {23028#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:04,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {23028#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:04,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {23028#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:04,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {23029#(<= main_~i~0 3)} assume true; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:04,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {23029#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:04,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {23029#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:04,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {23029#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:04,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {23030#(<= main_~i~0 4)} assume true; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:04,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {23030#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:04,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {23030#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:04,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {23030#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:04,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {23031#(<= main_~i~0 5)} assume true; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:04,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {23031#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:04,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {23031#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:04,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {23031#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:04,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {23032#(<= main_~i~0 6)} assume true; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:04,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {23032#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:04,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {23032#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:04,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {23032#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:04,693 INFO L273 TraceCheckUtils]: 32: Hoare triple {23033#(<= main_~i~0 7)} assume true; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:04,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {23033#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:04,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {23033#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:04,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {23033#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:04,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {23034#(<= main_~i~0 8)} assume true; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:04,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {23034#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:04,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {23034#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:04,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {23034#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:04,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {23035#(<= main_~i~0 9)} assume true; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:04,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {23035#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:04,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {23035#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:04,700 INFO L273 TraceCheckUtils]: 43: Hoare triple {23035#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:04,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {23036#(<= main_~i~0 10)} assume true; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:04,701 INFO L273 TraceCheckUtils]: 45: Hoare triple {23036#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:04,701 INFO L273 TraceCheckUtils]: 46: Hoare triple {23036#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:04,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {23036#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:04,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {23037#(<= main_~i~0 11)} assume true; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:04,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {23037#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:04,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {23037#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:04,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {23037#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:04,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {23038#(<= main_~i~0 12)} assume true; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:04,789 INFO L273 TraceCheckUtils]: 53: Hoare triple {23038#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:04,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {23038#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:04,814 INFO L273 TraceCheckUtils]: 55: Hoare triple {23038#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:04,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {23039#(<= main_~i~0 13)} assume true; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:04,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {23039#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:04,850 INFO L273 TraceCheckUtils]: 58: Hoare triple {23039#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:04,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {23039#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:04,871 INFO L273 TraceCheckUtils]: 60: Hoare triple {23040#(<= main_~i~0 14)} assume true; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:04,885 INFO L273 TraceCheckUtils]: 61: Hoare triple {23040#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:04,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {23040#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:04,906 INFO L273 TraceCheckUtils]: 63: Hoare triple {23040#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:04,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {23041#(<= main_~i~0 15)} assume true; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:04,931 INFO L273 TraceCheckUtils]: 65: Hoare triple {23041#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:04,932 INFO L273 TraceCheckUtils]: 66: Hoare triple {23041#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:04,933 INFO L273 TraceCheckUtils]: 67: Hoare triple {23041#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:04,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {23042#(<= main_~i~0 16)} assume true; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:04,940 INFO L273 TraceCheckUtils]: 69: Hoare triple {23042#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:04,940 INFO L273 TraceCheckUtils]: 70: Hoare triple {23042#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:04,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {23042#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:04,941 INFO L273 TraceCheckUtils]: 72: Hoare triple {23043#(<= main_~i~0 17)} assume true; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:04,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {23043#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:04,941 INFO L273 TraceCheckUtils]: 74: Hoare triple {23043#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:04,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {23043#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:04,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {23044#(<= main_~i~0 18)} assume true; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:04,942 INFO L273 TraceCheckUtils]: 77: Hoare triple {23044#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:04,943 INFO L273 TraceCheckUtils]: 78: Hoare triple {23044#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:04,943 INFO L273 TraceCheckUtils]: 79: Hoare triple {23044#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:04,943 INFO L273 TraceCheckUtils]: 80: Hoare triple {23045#(<= main_~i~0 19)} assume true; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:04,944 INFO L273 TraceCheckUtils]: 81: Hoare triple {23045#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:04,944 INFO L273 TraceCheckUtils]: 82: Hoare triple {23045#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:04,945 INFO L273 TraceCheckUtils]: 83: Hoare triple {23045#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:04,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {23046#(<= main_~i~0 20)} assume true; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:04,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {23046#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:04,947 INFO L273 TraceCheckUtils]: 86: Hoare triple {23046#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:04,947 INFO L273 TraceCheckUtils]: 87: Hoare triple {23046#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:04,948 INFO L273 TraceCheckUtils]: 88: Hoare triple {23047#(<= main_~i~0 21)} assume true; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:04,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {23047#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:04,949 INFO L273 TraceCheckUtils]: 90: Hoare triple {23047#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:04,950 INFO L273 TraceCheckUtils]: 91: Hoare triple {23047#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:04,950 INFO L273 TraceCheckUtils]: 92: Hoare triple {23048#(<= main_~i~0 22)} assume true; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:04,951 INFO L273 TraceCheckUtils]: 93: Hoare triple {23048#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:04,951 INFO L273 TraceCheckUtils]: 94: Hoare triple {23048#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:04,952 INFO L273 TraceCheckUtils]: 95: Hoare triple {23048#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:04,952 INFO L273 TraceCheckUtils]: 96: Hoare triple {23049#(<= main_~i~0 23)} assume true; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:04,953 INFO L273 TraceCheckUtils]: 97: Hoare triple {23049#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:04,953 INFO L273 TraceCheckUtils]: 98: Hoare triple {23049#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:04,954 INFO L273 TraceCheckUtils]: 99: Hoare triple {23049#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:04,955 INFO L273 TraceCheckUtils]: 100: Hoare triple {23050#(<= main_~i~0 24)} assume true; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:04,955 INFO L273 TraceCheckUtils]: 101: Hoare triple {23050#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:04,956 INFO L273 TraceCheckUtils]: 102: Hoare triple {23050#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:04,956 INFO L273 TraceCheckUtils]: 103: Hoare triple {23050#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {23051#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:04,957 INFO L273 TraceCheckUtils]: 104: Hoare triple {23051#(<= main_~i~0 25)} assume true; {23051#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:04,958 INFO L273 TraceCheckUtils]: 105: Hoare triple {23051#(<= main_~i~0 25)} assume !(~i~0 < 100000); {23026#false} is VALID [2018-11-14 18:39:04,958 INFO L273 TraceCheckUtils]: 106: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:04,958 INFO L273 TraceCheckUtils]: 107: Hoare triple {23026#false} assume !(~swapped~0 != 0); {23026#false} is VALID [2018-11-14 18:39:04,958 INFO L273 TraceCheckUtils]: 108: Hoare triple {23026#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {23026#false} is VALID [2018-11-14 18:39:04,958 INFO L273 TraceCheckUtils]: 109: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:04,959 INFO L273 TraceCheckUtils]: 110: Hoare triple {23026#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {23026#false} is VALID [2018-11-14 18:39:04,959 INFO L273 TraceCheckUtils]: 111: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:04,959 INFO L273 TraceCheckUtils]: 112: Hoare triple {23026#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {23026#false} is VALID [2018-11-14 18:39:04,959 INFO L256 TraceCheckUtils]: 113: Hoare triple {23026#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {23026#false} is VALID [2018-11-14 18:39:04,959 INFO L273 TraceCheckUtils]: 114: Hoare triple {23026#false} ~cond := #in~cond; {23026#false} is VALID [2018-11-14 18:39:04,960 INFO L273 TraceCheckUtils]: 115: Hoare triple {23026#false} assume ~cond == 0; {23026#false} is VALID [2018-11-14 18:39:04,960 INFO L273 TraceCheckUtils]: 116: Hoare triple {23026#false} assume !false; {23026#false} is VALID [2018-11-14 18:39:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 2 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:04,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:04,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:39:05,056 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-11-14 18:39:05,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:05,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:05,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {23025#true} call ULTIMATE.init(); {23025#true} is VALID [2018-11-14 18:39:05,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {23025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23025#true} is VALID [2018-11-14 18:39:05,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {23025#true} assume true; {23025#true} is VALID [2018-11-14 18:39:05,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23025#true} {23025#true} #83#return; {23025#true} is VALID [2018-11-14 18:39:05,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {23025#true} call #t~ret8 := main(); {23025#true} is VALID [2018-11-14 18:39:05,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {23025#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {23025#true} is VALID [2018-11-14 18:39:05,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {23025#true} assume true; {23025#true} is VALID [2018-11-14 18:39:05,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {23025#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {23076#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:05,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {23076#(<= main_~i~0 1)} assume true; {23076#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:05,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {23076#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23076#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:05,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {23076#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23076#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:05,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {23076#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:05,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {23028#(<= main_~i~0 2)} assume true; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:05,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {23028#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:05,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {23028#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23028#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:05,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {23028#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:05,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {23029#(<= main_~i~0 3)} assume true; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:05,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {23029#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:05,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {23029#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23029#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:05,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {23029#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:05,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {23030#(<= main_~i~0 4)} assume true; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:05,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {23030#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:05,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {23030#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23030#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:05,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {23030#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:05,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {23031#(<= main_~i~0 5)} assume true; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:05,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {23031#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:05,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {23031#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23031#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:05,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {23031#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:05,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {23032#(<= main_~i~0 6)} assume true; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:05,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {23032#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:05,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {23032#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23032#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:05,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {23032#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:05,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {23033#(<= main_~i~0 7)} assume true; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:05,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {23033#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:05,294 INFO L273 TraceCheckUtils]: 34: Hoare triple {23033#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23033#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:05,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {23033#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:05,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {23034#(<= main_~i~0 8)} assume true; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:05,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {23034#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:05,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {23034#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23034#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:05,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {23034#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:05,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {23035#(<= main_~i~0 9)} assume true; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:05,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {23035#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:05,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {23035#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23035#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:05,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {23035#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:05,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {23036#(<= main_~i~0 10)} assume true; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:05,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {23036#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:05,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {23036#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23036#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:05,301 INFO L273 TraceCheckUtils]: 47: Hoare triple {23036#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:05,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {23037#(<= main_~i~0 11)} assume true; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:05,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {23037#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:05,320 INFO L273 TraceCheckUtils]: 50: Hoare triple {23037#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23037#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:05,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {23037#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:05,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {23038#(<= main_~i~0 12)} assume true; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:05,340 INFO L273 TraceCheckUtils]: 53: Hoare triple {23038#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:05,341 INFO L273 TraceCheckUtils]: 54: Hoare triple {23038#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23038#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:05,341 INFO L273 TraceCheckUtils]: 55: Hoare triple {23038#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:05,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {23039#(<= main_~i~0 13)} assume true; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:05,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {23039#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:05,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {23039#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23039#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:05,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {23039#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:05,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {23040#(<= main_~i~0 14)} assume true; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:05,343 INFO L273 TraceCheckUtils]: 61: Hoare triple {23040#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:05,343 INFO L273 TraceCheckUtils]: 62: Hoare triple {23040#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23040#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:05,344 INFO L273 TraceCheckUtils]: 63: Hoare triple {23040#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:05,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {23041#(<= main_~i~0 15)} assume true; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:05,345 INFO L273 TraceCheckUtils]: 65: Hoare triple {23041#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:05,346 INFO L273 TraceCheckUtils]: 66: Hoare triple {23041#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23041#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:05,346 INFO L273 TraceCheckUtils]: 67: Hoare triple {23041#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:05,347 INFO L273 TraceCheckUtils]: 68: Hoare triple {23042#(<= main_~i~0 16)} assume true; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:05,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {23042#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:05,348 INFO L273 TraceCheckUtils]: 70: Hoare triple {23042#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23042#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:05,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {23042#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:05,349 INFO L273 TraceCheckUtils]: 72: Hoare triple {23043#(<= main_~i~0 17)} assume true; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:05,350 INFO L273 TraceCheckUtils]: 73: Hoare triple {23043#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:05,350 INFO L273 TraceCheckUtils]: 74: Hoare triple {23043#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23043#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:05,351 INFO L273 TraceCheckUtils]: 75: Hoare triple {23043#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:05,351 INFO L273 TraceCheckUtils]: 76: Hoare triple {23044#(<= main_~i~0 18)} assume true; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:05,352 INFO L273 TraceCheckUtils]: 77: Hoare triple {23044#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:05,352 INFO L273 TraceCheckUtils]: 78: Hoare triple {23044#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23044#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:05,353 INFO L273 TraceCheckUtils]: 79: Hoare triple {23044#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:05,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {23045#(<= main_~i~0 19)} assume true; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:05,354 INFO L273 TraceCheckUtils]: 81: Hoare triple {23045#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:05,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {23045#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23045#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:05,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {23045#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:05,356 INFO L273 TraceCheckUtils]: 84: Hoare triple {23046#(<= main_~i~0 20)} assume true; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:05,356 INFO L273 TraceCheckUtils]: 85: Hoare triple {23046#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:05,357 INFO L273 TraceCheckUtils]: 86: Hoare triple {23046#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23046#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:05,358 INFO L273 TraceCheckUtils]: 87: Hoare triple {23046#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:05,358 INFO L273 TraceCheckUtils]: 88: Hoare triple {23047#(<= main_~i~0 21)} assume true; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:05,359 INFO L273 TraceCheckUtils]: 89: Hoare triple {23047#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:05,359 INFO L273 TraceCheckUtils]: 90: Hoare triple {23047#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23047#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:05,360 INFO L273 TraceCheckUtils]: 91: Hoare triple {23047#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:05,360 INFO L273 TraceCheckUtils]: 92: Hoare triple {23048#(<= main_~i~0 22)} assume true; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:05,361 INFO L273 TraceCheckUtils]: 93: Hoare triple {23048#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:05,361 INFO L273 TraceCheckUtils]: 94: Hoare triple {23048#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23048#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:05,362 INFO L273 TraceCheckUtils]: 95: Hoare triple {23048#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:05,363 INFO L273 TraceCheckUtils]: 96: Hoare triple {23049#(<= main_~i~0 23)} assume true; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:05,363 INFO L273 TraceCheckUtils]: 97: Hoare triple {23049#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:05,364 INFO L273 TraceCheckUtils]: 98: Hoare triple {23049#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23049#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:05,364 INFO L273 TraceCheckUtils]: 99: Hoare triple {23049#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:05,365 INFO L273 TraceCheckUtils]: 100: Hoare triple {23050#(<= main_~i~0 24)} assume true; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:05,365 INFO L273 TraceCheckUtils]: 101: Hoare triple {23050#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:05,366 INFO L273 TraceCheckUtils]: 102: Hoare triple {23050#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23050#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:05,367 INFO L273 TraceCheckUtils]: 103: Hoare triple {23050#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {23051#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:05,367 INFO L273 TraceCheckUtils]: 104: Hoare triple {23051#(<= main_~i~0 25)} assume true; {23051#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:05,368 INFO L273 TraceCheckUtils]: 105: Hoare triple {23051#(<= main_~i~0 25)} assume !(~i~0 < 100000); {23026#false} is VALID [2018-11-14 18:39:05,368 INFO L273 TraceCheckUtils]: 106: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:05,368 INFO L273 TraceCheckUtils]: 107: Hoare triple {23026#false} assume !(~swapped~0 != 0); {23026#false} is VALID [2018-11-14 18:39:05,368 INFO L273 TraceCheckUtils]: 108: Hoare triple {23026#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L273 TraceCheckUtils]: 109: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L273 TraceCheckUtils]: 110: Hoare triple {23026#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L273 TraceCheckUtils]: 111: Hoare triple {23026#false} assume true; {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L273 TraceCheckUtils]: 112: Hoare triple {23026#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L256 TraceCheckUtils]: 113: Hoare triple {23026#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {23026#false} is VALID [2018-11-14 18:39:05,369 INFO L273 TraceCheckUtils]: 114: Hoare triple {23026#false} ~cond := #in~cond; {23026#false} is VALID [2018-11-14 18:39:05,370 INFO L273 TraceCheckUtils]: 115: Hoare triple {23026#false} assume ~cond == 0; {23026#false} is VALID [2018-11-14 18:39:05,370 INFO L273 TraceCheckUtils]: 116: Hoare triple {23026#false} assume !false; {23026#false} is VALID [2018-11-14 18:39:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 2 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:05,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:05,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 18:39:05,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-14 18:39:05,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:05,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:39:05,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:05,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:39:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:39:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:39:05,542 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand 28 states. [2018-11-14 18:39:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:06,096 INFO L93 Difference]: Finished difference Result 442 states and 550 transitions. [2018-11-14 18:39:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:39:06,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-14 18:39:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:39:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 182 transitions. [2018-11-14 18:39:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:39:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 182 transitions. [2018-11-14 18:39:06,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 182 transitions. [2018-11-14 18:39:06,257 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 18:39:06,262 INFO L225 Difference]: With dead ends: 442 [2018-11-14 18:39:06,262 INFO L226 Difference]: Without dead ends: 230 [2018-11-14 18:39:06,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:39:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-14 18:39:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2018-11-14 18:39:06,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:06,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand 226 states. [2018-11-14 18:39:06,319 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 226 states. [2018-11-14 18:39:06,319 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 226 states. [2018-11-14 18:39:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:06,323 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-11-14 18:39:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2018-11-14 18:39:06,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:06,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:06,324 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 230 states. [2018-11-14 18:39:06,324 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 230 states. [2018-11-14 18:39:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:06,328 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-11-14 18:39:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 285 transitions. [2018-11-14 18:39:06,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:06,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:06,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:06,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-14 18:39:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 279 transitions. [2018-11-14 18:39:06,334 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 279 transitions. Word has length 117 [2018-11-14 18:39:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:06,334 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 279 transitions. [2018-11-14 18:39:06,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:39:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2018-11-14 18:39:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-14 18:39:06,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:06,335 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:06,335 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:06,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash -257499236, now seen corresponding path program 25 times [2018-11-14 18:39:06,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:06,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:07,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {24708#true} call ULTIMATE.init(); {24708#true} is VALID [2018-11-14 18:39:07,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {24708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24708#true} is VALID [2018-11-14 18:39:07,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {24708#true} assume true; {24708#true} is VALID [2018-11-14 18:39:07,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24708#true} {24708#true} #83#return; {24708#true} is VALID [2018-11-14 18:39:07,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {24708#true} call #t~ret8 := main(); {24708#true} is VALID [2018-11-14 18:39:07,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {24708#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {24708#true} is VALID [2018-11-14 18:39:07,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {24708#true} assume true; {24708#true} is VALID [2018-11-14 18:39:07,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {24708#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {24710#(= main_~i~0 1)} is VALID [2018-11-14 18:39:07,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {24710#(= main_~i~0 1)} assume true; {24710#(= main_~i~0 1)} is VALID [2018-11-14 18:39:07,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {24710#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24710#(= main_~i~0 1)} is VALID [2018-11-14 18:39:07,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {24710#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24710#(= main_~i~0 1)} is VALID [2018-11-14 18:39:07,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {24710#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {24711#(<= main_~i~0 2)} assume true; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {24711#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {24711#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {24711#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {24712#(<= main_~i~0 3)} assume true; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {24712#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {24712#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {24712#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {24713#(<= main_~i~0 4)} assume true; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {24713#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {24713#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {24713#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {24714#(<= main_~i~0 5)} assume true; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {24714#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {24714#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {24714#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {24715#(<= main_~i~0 6)} assume true; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {24715#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {24715#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {24715#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {24716#(<= main_~i~0 7)} assume true; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {24716#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {24716#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {24716#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {24717#(<= main_~i~0 8)} assume true; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {24717#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {24717#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {24717#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {24718#(<= main_~i~0 9)} assume true; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {24718#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {24718#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {24718#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {24719#(<= main_~i~0 10)} assume true; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {24719#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {24719#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {24719#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {24720#(<= main_~i~0 11)} assume true; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {24720#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {24720#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {24720#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {24721#(<= main_~i~0 12)} assume true; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,378 INFO L273 TraceCheckUtils]: 53: Hoare triple {24721#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {24721#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {24721#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {24722#(<= main_~i~0 13)} assume true; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {24722#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {24722#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {24722#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {24723#(<= main_~i~0 14)} assume true; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {24723#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,383 INFO L273 TraceCheckUtils]: 62: Hoare triple {24723#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,384 INFO L273 TraceCheckUtils]: 63: Hoare triple {24723#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,384 INFO L273 TraceCheckUtils]: 64: Hoare triple {24724#(<= main_~i~0 15)} assume true; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,385 INFO L273 TraceCheckUtils]: 65: Hoare triple {24724#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,385 INFO L273 TraceCheckUtils]: 66: Hoare triple {24724#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,386 INFO L273 TraceCheckUtils]: 67: Hoare triple {24724#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,386 INFO L273 TraceCheckUtils]: 68: Hoare triple {24725#(<= main_~i~0 16)} assume true; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,387 INFO L273 TraceCheckUtils]: 69: Hoare triple {24725#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,387 INFO L273 TraceCheckUtils]: 70: Hoare triple {24725#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,388 INFO L273 TraceCheckUtils]: 71: Hoare triple {24725#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,389 INFO L273 TraceCheckUtils]: 72: Hoare triple {24726#(<= main_~i~0 17)} assume true; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,389 INFO L273 TraceCheckUtils]: 73: Hoare triple {24726#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,390 INFO L273 TraceCheckUtils]: 74: Hoare triple {24726#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,390 INFO L273 TraceCheckUtils]: 75: Hoare triple {24726#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,391 INFO L273 TraceCheckUtils]: 76: Hoare triple {24727#(<= main_~i~0 18)} assume true; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {24727#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,392 INFO L273 TraceCheckUtils]: 78: Hoare triple {24727#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,392 INFO L273 TraceCheckUtils]: 79: Hoare triple {24727#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,393 INFO L273 TraceCheckUtils]: 80: Hoare triple {24728#(<= main_~i~0 19)} assume true; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,393 INFO L273 TraceCheckUtils]: 81: Hoare triple {24728#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,394 INFO L273 TraceCheckUtils]: 82: Hoare triple {24728#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,395 INFO L273 TraceCheckUtils]: 83: Hoare triple {24728#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,395 INFO L273 TraceCheckUtils]: 84: Hoare triple {24729#(<= main_~i~0 20)} assume true; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,395 INFO L273 TraceCheckUtils]: 85: Hoare triple {24729#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,396 INFO L273 TraceCheckUtils]: 86: Hoare triple {24729#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,397 INFO L273 TraceCheckUtils]: 87: Hoare triple {24729#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,397 INFO L273 TraceCheckUtils]: 88: Hoare triple {24730#(<= main_~i~0 21)} assume true; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,398 INFO L273 TraceCheckUtils]: 89: Hoare triple {24730#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,398 INFO L273 TraceCheckUtils]: 90: Hoare triple {24730#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,399 INFO L273 TraceCheckUtils]: 91: Hoare triple {24730#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,399 INFO L273 TraceCheckUtils]: 92: Hoare triple {24731#(<= main_~i~0 22)} assume true; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,400 INFO L273 TraceCheckUtils]: 93: Hoare triple {24731#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,411 INFO L273 TraceCheckUtils]: 94: Hoare triple {24731#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,412 INFO L273 TraceCheckUtils]: 95: Hoare triple {24731#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,412 INFO L273 TraceCheckUtils]: 96: Hoare triple {24732#(<= main_~i~0 23)} assume true; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,412 INFO L273 TraceCheckUtils]: 97: Hoare triple {24732#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,413 INFO L273 TraceCheckUtils]: 98: Hoare triple {24732#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,413 INFO L273 TraceCheckUtils]: 99: Hoare triple {24732#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,413 INFO L273 TraceCheckUtils]: 100: Hoare triple {24733#(<= main_~i~0 24)} assume true; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,414 INFO L273 TraceCheckUtils]: 101: Hoare triple {24733#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,414 INFO L273 TraceCheckUtils]: 102: Hoare triple {24733#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,414 INFO L273 TraceCheckUtils]: 103: Hoare triple {24733#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,415 INFO L273 TraceCheckUtils]: 104: Hoare triple {24734#(<= main_~i~0 25)} assume true; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,415 INFO L273 TraceCheckUtils]: 105: Hoare triple {24734#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,415 INFO L273 TraceCheckUtils]: 106: Hoare triple {24734#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,416 INFO L273 TraceCheckUtils]: 107: Hoare triple {24734#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {24735#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:07,416 INFO L273 TraceCheckUtils]: 108: Hoare triple {24735#(<= main_~i~0 26)} assume true; {24735#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 109: Hoare triple {24735#(<= main_~i~0 26)} assume !(~i~0 < 100000); {24709#false} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 110: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 111: Hoare triple {24709#false} assume !(~swapped~0 != 0); {24709#false} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 112: Hoare triple {24709#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {24709#false} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 113: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,417 INFO L273 TraceCheckUtils]: 114: Hoare triple {24709#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {24709#false} is VALID [2018-11-14 18:39:07,418 INFO L273 TraceCheckUtils]: 115: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,418 INFO L273 TraceCheckUtils]: 116: Hoare triple {24709#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {24709#false} is VALID [2018-11-14 18:39:07,418 INFO L256 TraceCheckUtils]: 117: Hoare triple {24709#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {24709#false} is VALID [2018-11-14 18:39:07,418 INFO L273 TraceCheckUtils]: 118: Hoare triple {24709#false} ~cond := #in~cond; {24709#false} is VALID [2018-11-14 18:39:07,418 INFO L273 TraceCheckUtils]: 119: Hoare triple {24709#false} assume ~cond == 0; {24709#false} is VALID [2018-11-14 18:39:07,419 INFO L273 TraceCheckUtils]: 120: Hoare triple {24709#false} assume !false; {24709#false} is VALID [2018-11-14 18:39:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 2 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:07,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:07,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:07,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:07,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:07,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {24708#true} call ULTIMATE.init(); {24708#true} is VALID [2018-11-14 18:39:07,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {24708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24708#true} is VALID [2018-11-14 18:39:07,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {24708#true} assume true; {24708#true} is VALID [2018-11-14 18:39:07,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24708#true} {24708#true} #83#return; {24708#true} is VALID [2018-11-14 18:39:07,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {24708#true} call #t~ret8 := main(); {24708#true} is VALID [2018-11-14 18:39:07,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {24708#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {24708#true} is VALID [2018-11-14 18:39:07,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {24708#true} assume true; {24708#true} is VALID [2018-11-14 18:39:07,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {24708#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {24760#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:07,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {24760#(<= main_~i~0 1)} assume true; {24760#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:07,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {24760#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24760#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:07,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {24760#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24760#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:07,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {24760#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {24711#(<= main_~i~0 2)} assume true; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {24711#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {24711#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24711#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:07,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {24711#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {24712#(<= main_~i~0 3)} assume true; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {24712#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {24712#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24712#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:07,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {24712#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {24713#(<= main_~i~0 4)} assume true; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {24713#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {24713#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24713#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:07,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {24713#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {24714#(<= main_~i~0 5)} assume true; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {24714#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {24714#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24714#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:07,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {24714#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {24715#(<= main_~i~0 6)} assume true; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {24715#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {24715#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24715#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:07,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {24715#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {24716#(<= main_~i~0 7)} assume true; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {24716#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {24716#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24716#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:07,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {24716#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {24717#(<= main_~i~0 8)} assume true; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {24717#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {24717#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24717#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:07,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {24717#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {24718#(<= main_~i~0 9)} assume true; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {24718#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {24718#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24718#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:07,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {24718#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,732 INFO L273 TraceCheckUtils]: 44: Hoare triple {24719#(<= main_~i~0 10)} assume true; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {24719#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {24719#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24719#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:07,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {24719#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {24720#(<= main_~i~0 11)} assume true; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,735 INFO L273 TraceCheckUtils]: 49: Hoare triple {24720#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {24720#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24720#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:07,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {24720#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {24721#(<= main_~i~0 12)} assume true; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {24721#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,737 INFO L273 TraceCheckUtils]: 54: Hoare triple {24721#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24721#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:07,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {24721#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {24722#(<= main_~i~0 13)} assume true; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {24722#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {24722#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24722#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:07,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {24722#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {24723#(<= main_~i~0 14)} assume true; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {24723#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {24723#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24723#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:07,743 INFO L273 TraceCheckUtils]: 63: Hoare triple {24723#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,743 INFO L273 TraceCheckUtils]: 64: Hoare triple {24724#(<= main_~i~0 15)} assume true; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,744 INFO L273 TraceCheckUtils]: 65: Hoare triple {24724#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {24724#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24724#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:07,745 INFO L273 TraceCheckUtils]: 67: Hoare triple {24724#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {24725#(<= main_~i~0 16)} assume true; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {24725#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {24725#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24725#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:07,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {24725#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {24726#(<= main_~i~0 17)} assume true; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {24726#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {24726#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24726#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:07,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {24726#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {24727#(<= main_~i~0 18)} assume true; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {24727#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {24727#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24727#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:07,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {24727#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {24728#(<= main_~i~0 19)} assume true; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {24728#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,753 INFO L273 TraceCheckUtils]: 82: Hoare triple {24728#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24728#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:07,754 INFO L273 TraceCheckUtils]: 83: Hoare triple {24728#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,754 INFO L273 TraceCheckUtils]: 84: Hoare triple {24729#(<= main_~i~0 20)} assume true; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,754 INFO L273 TraceCheckUtils]: 85: Hoare triple {24729#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,755 INFO L273 TraceCheckUtils]: 86: Hoare triple {24729#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24729#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:07,756 INFO L273 TraceCheckUtils]: 87: Hoare triple {24729#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,756 INFO L273 TraceCheckUtils]: 88: Hoare triple {24730#(<= main_~i~0 21)} assume true; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,757 INFO L273 TraceCheckUtils]: 89: Hoare triple {24730#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,757 INFO L273 TraceCheckUtils]: 90: Hoare triple {24730#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24730#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:07,758 INFO L273 TraceCheckUtils]: 91: Hoare triple {24730#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,758 INFO L273 TraceCheckUtils]: 92: Hoare triple {24731#(<= main_~i~0 22)} assume true; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,759 INFO L273 TraceCheckUtils]: 93: Hoare triple {24731#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,760 INFO L273 TraceCheckUtils]: 94: Hoare triple {24731#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24731#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:07,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {24731#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,761 INFO L273 TraceCheckUtils]: 96: Hoare triple {24732#(<= main_~i~0 23)} assume true; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {24732#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,762 INFO L273 TraceCheckUtils]: 98: Hoare triple {24732#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24732#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:07,763 INFO L273 TraceCheckUtils]: 99: Hoare triple {24732#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,763 INFO L273 TraceCheckUtils]: 100: Hoare triple {24733#(<= main_~i~0 24)} assume true; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,764 INFO L273 TraceCheckUtils]: 101: Hoare triple {24733#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,764 INFO L273 TraceCheckUtils]: 102: Hoare triple {24733#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24733#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:07,765 INFO L273 TraceCheckUtils]: 103: Hoare triple {24733#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,765 INFO L273 TraceCheckUtils]: 104: Hoare triple {24734#(<= main_~i~0 25)} assume true; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,766 INFO L273 TraceCheckUtils]: 105: Hoare triple {24734#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,766 INFO L273 TraceCheckUtils]: 106: Hoare triple {24734#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24734#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:07,767 INFO L273 TraceCheckUtils]: 107: Hoare triple {24734#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {24735#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:07,768 INFO L273 TraceCheckUtils]: 108: Hoare triple {24735#(<= main_~i~0 26)} assume true; {24735#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:07,768 INFO L273 TraceCheckUtils]: 109: Hoare triple {24735#(<= main_~i~0 26)} assume !(~i~0 < 100000); {24709#false} is VALID [2018-11-14 18:39:07,768 INFO L273 TraceCheckUtils]: 110: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,769 INFO L273 TraceCheckUtils]: 111: Hoare triple {24709#false} assume !(~swapped~0 != 0); {24709#false} is VALID [2018-11-14 18:39:07,769 INFO L273 TraceCheckUtils]: 112: Hoare triple {24709#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {24709#false} is VALID [2018-11-14 18:39:07,769 INFO L273 TraceCheckUtils]: 113: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,769 INFO L273 TraceCheckUtils]: 114: Hoare triple {24709#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {24709#false} is VALID [2018-11-14 18:39:07,769 INFO L273 TraceCheckUtils]: 115: Hoare triple {24709#false} assume true; {24709#false} is VALID [2018-11-14 18:39:07,770 INFO L273 TraceCheckUtils]: 116: Hoare triple {24709#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {24709#false} is VALID [2018-11-14 18:39:07,770 INFO L256 TraceCheckUtils]: 117: Hoare triple {24709#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {24709#false} is VALID [2018-11-14 18:39:07,770 INFO L273 TraceCheckUtils]: 118: Hoare triple {24709#false} ~cond := #in~cond; {24709#false} is VALID [2018-11-14 18:39:07,770 INFO L273 TraceCheckUtils]: 119: Hoare triple {24709#false} assume ~cond == 0; {24709#false} is VALID [2018-11-14 18:39:07,770 INFO L273 TraceCheckUtils]: 120: Hoare triple {24709#false} assume !false; {24709#false} is VALID [2018-11-14 18:39:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 2 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:07,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:07,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 18:39:07,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-11-14 18:39:07,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:07,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:39:07,915 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 18:39:07,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:39:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:39:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:39:07,916 INFO L87 Difference]: Start difference. First operand 226 states and 279 transitions. Second operand 29 states. [2018-11-14 18:39:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:08,894 INFO L93 Difference]: Finished difference Result 458 states and 570 transitions. [2018-11-14 18:39:08,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:39:08,895 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-11-14 18:39:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:39:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 187 transitions. [2018-11-14 18:39:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:39:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 187 transitions. [2018-11-14 18:39:08,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 187 transitions. [2018-11-14 18:39:09,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:09,073 INFO L225 Difference]: With dead ends: 458 [2018-11-14 18:39:09,073 INFO L226 Difference]: Without dead ends: 238 [2018-11-14 18:39:09,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:39:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-14 18:39:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2018-11-14 18:39:09,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:09,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 234 states. [2018-11-14 18:39:09,133 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 234 states. [2018-11-14 18:39:09,133 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 234 states. [2018-11-14 18:39:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:09,138 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2018-11-14 18:39:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 295 transitions. [2018-11-14 18:39:09,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:09,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:09,139 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 238 states. [2018-11-14 18:39:09,139 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 238 states. [2018-11-14 18:39:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:09,143 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2018-11-14 18:39:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 295 transitions. [2018-11-14 18:39:09,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:09,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:09,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:09,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-14 18:39:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2018-11-14 18:39:09,148 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 121 [2018-11-14 18:39:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:09,149 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2018-11-14 18:39:09,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:39:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2018-11-14 18:39:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-14 18:39:09,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:09,150 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:09,150 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:09,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2037013492, now seen corresponding path program 26 times [2018-11-14 18:39:09,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:09,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:09,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:09,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:09,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:11,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {26450#true} call ULTIMATE.init(); {26450#true} is VALID [2018-11-14 18:39:11,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {26450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26450#true} is VALID [2018-11-14 18:39:11,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {26450#true} assume true; {26450#true} is VALID [2018-11-14 18:39:11,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26450#true} {26450#true} #83#return; {26450#true} is VALID [2018-11-14 18:39:11,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {26450#true} call #t~ret8 := main(); {26450#true} is VALID [2018-11-14 18:39:11,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {26450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {26450#true} is VALID [2018-11-14 18:39:11,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {26450#true} assume true; {26450#true} is VALID [2018-11-14 18:39:11,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {26450#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {26452#(= main_~i~0 1)} is VALID [2018-11-14 18:39:11,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {26452#(= main_~i~0 1)} assume true; {26452#(= main_~i~0 1)} is VALID [2018-11-14 18:39:11,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {26452#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26452#(= main_~i~0 1)} is VALID [2018-11-14 18:39:11,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {26452#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26452#(= main_~i~0 1)} is VALID [2018-11-14 18:39:11,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {26452#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {26453#(<= main_~i~0 2)} assume true; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {26453#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {26453#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {26453#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {26454#(<= main_~i~0 3)} assume true; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {26454#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {26454#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {26454#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {26455#(<= main_~i~0 4)} assume true; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {26455#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {26455#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {26455#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {26456#(<= main_~i~0 5)} assume true; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {26456#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {26456#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {26456#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {26457#(<= main_~i~0 6)} assume true; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {26457#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {26457#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {26457#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {26458#(<= main_~i~0 7)} assume true; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {26458#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {26458#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {26458#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {26459#(<= main_~i~0 8)} assume true; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {26459#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {26459#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {26459#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,129 INFO L273 TraceCheckUtils]: 40: Hoare triple {26460#(<= main_~i~0 9)} assume true; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {26460#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,130 INFO L273 TraceCheckUtils]: 42: Hoare triple {26460#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,131 INFO L273 TraceCheckUtils]: 43: Hoare triple {26460#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {26461#(<= main_~i~0 10)} assume true; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,132 INFO L273 TraceCheckUtils]: 45: Hoare triple {26461#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,132 INFO L273 TraceCheckUtils]: 46: Hoare triple {26461#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,133 INFO L273 TraceCheckUtils]: 47: Hoare triple {26461#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,133 INFO L273 TraceCheckUtils]: 48: Hoare triple {26462#(<= main_~i~0 11)} assume true; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,134 INFO L273 TraceCheckUtils]: 49: Hoare triple {26462#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {26462#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {26462#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {26463#(<= main_~i~0 12)} assume true; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {26463#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {26463#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {26463#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,138 INFO L273 TraceCheckUtils]: 56: Hoare triple {26464#(<= main_~i~0 13)} assume true; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {26464#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,139 INFO L273 TraceCheckUtils]: 58: Hoare triple {26464#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,139 INFO L273 TraceCheckUtils]: 59: Hoare triple {26464#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {26465#(<= main_~i~0 14)} assume true; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,140 INFO L273 TraceCheckUtils]: 61: Hoare triple {26465#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,141 INFO L273 TraceCheckUtils]: 62: Hoare triple {26465#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,141 INFO L273 TraceCheckUtils]: 63: Hoare triple {26465#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,142 INFO L273 TraceCheckUtils]: 64: Hoare triple {26466#(<= main_~i~0 15)} assume true; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,142 INFO L273 TraceCheckUtils]: 65: Hoare triple {26466#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,143 INFO L273 TraceCheckUtils]: 66: Hoare triple {26466#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,143 INFO L273 TraceCheckUtils]: 67: Hoare triple {26466#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {26467#(<= main_~i~0 16)} assume true; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,145 INFO L273 TraceCheckUtils]: 69: Hoare triple {26467#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,146 INFO L273 TraceCheckUtils]: 70: Hoare triple {26467#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {26467#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,147 INFO L273 TraceCheckUtils]: 72: Hoare triple {26468#(<= main_~i~0 17)} assume true; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,147 INFO L273 TraceCheckUtils]: 73: Hoare triple {26468#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,148 INFO L273 TraceCheckUtils]: 74: Hoare triple {26468#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,149 INFO L273 TraceCheckUtils]: 75: Hoare triple {26468#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {26469#(<= main_~i~0 18)} assume true; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,150 INFO L273 TraceCheckUtils]: 77: Hoare triple {26469#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,150 INFO L273 TraceCheckUtils]: 78: Hoare triple {26469#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,151 INFO L273 TraceCheckUtils]: 79: Hoare triple {26469#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,151 INFO L273 TraceCheckUtils]: 80: Hoare triple {26470#(<= main_~i~0 19)} assume true; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,152 INFO L273 TraceCheckUtils]: 81: Hoare triple {26470#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,152 INFO L273 TraceCheckUtils]: 82: Hoare triple {26470#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {26470#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {26471#(<= main_~i~0 20)} assume true; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {26471#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,154 INFO L273 TraceCheckUtils]: 86: Hoare triple {26471#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,155 INFO L273 TraceCheckUtils]: 87: Hoare triple {26471#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,155 INFO L273 TraceCheckUtils]: 88: Hoare triple {26472#(<= main_~i~0 21)} assume true; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,156 INFO L273 TraceCheckUtils]: 89: Hoare triple {26472#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,156 INFO L273 TraceCheckUtils]: 90: Hoare triple {26472#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,157 INFO L273 TraceCheckUtils]: 91: Hoare triple {26472#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,158 INFO L273 TraceCheckUtils]: 92: Hoare triple {26473#(<= main_~i~0 22)} assume true; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,158 INFO L273 TraceCheckUtils]: 93: Hoare triple {26473#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {26473#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,159 INFO L273 TraceCheckUtils]: 95: Hoare triple {26473#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,160 INFO L273 TraceCheckUtils]: 96: Hoare triple {26474#(<= main_~i~0 23)} assume true; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {26474#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,161 INFO L273 TraceCheckUtils]: 98: Hoare triple {26474#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {26474#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,162 INFO L273 TraceCheckUtils]: 100: Hoare triple {26475#(<= main_~i~0 24)} assume true; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,162 INFO L273 TraceCheckUtils]: 101: Hoare triple {26475#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,163 INFO L273 TraceCheckUtils]: 102: Hoare triple {26475#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,163 INFO L273 TraceCheckUtils]: 103: Hoare triple {26475#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,164 INFO L273 TraceCheckUtils]: 104: Hoare triple {26476#(<= main_~i~0 25)} assume true; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,164 INFO L273 TraceCheckUtils]: 105: Hoare triple {26476#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,165 INFO L273 TraceCheckUtils]: 106: Hoare triple {26476#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,165 INFO L273 TraceCheckUtils]: 107: Hoare triple {26476#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,166 INFO L273 TraceCheckUtils]: 108: Hoare triple {26477#(<= main_~i~0 26)} assume true; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {26477#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,167 INFO L273 TraceCheckUtils]: 110: Hoare triple {26477#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,168 INFO L273 TraceCheckUtils]: 111: Hoare triple {26477#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {26478#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:11,168 INFO L273 TraceCheckUtils]: 112: Hoare triple {26478#(<= main_~i~0 27)} assume true; {26478#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:11,169 INFO L273 TraceCheckUtils]: 113: Hoare triple {26478#(<= main_~i~0 27)} assume !(~i~0 < 100000); {26451#false} is VALID [2018-11-14 18:39:11,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {26451#false} assume !(~swapped~0 != 0); {26451#false} is VALID [2018-11-14 18:39:11,169 INFO L273 TraceCheckUtils]: 116: Hoare triple {26451#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {26451#false} is VALID [2018-11-14 18:39:11,169 INFO L273 TraceCheckUtils]: 117: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {26451#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {26451#false} is VALID [2018-11-14 18:39:11,170 INFO L273 TraceCheckUtils]: 119: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,170 INFO L273 TraceCheckUtils]: 120: Hoare triple {26451#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {26451#false} is VALID [2018-11-14 18:39:11,170 INFO L256 TraceCheckUtils]: 121: Hoare triple {26451#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {26451#false} is VALID [2018-11-14 18:39:11,170 INFO L273 TraceCheckUtils]: 122: Hoare triple {26451#false} ~cond := #in~cond; {26451#false} is VALID [2018-11-14 18:39:11,171 INFO L273 TraceCheckUtils]: 123: Hoare triple {26451#false} assume ~cond == 0; {26451#false} is VALID [2018-11-14 18:39:11,171 INFO L273 TraceCheckUtils]: 124: Hoare triple {26451#false} assume !false; {26451#false} is VALID [2018-11-14 18:39:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 2 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:11,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:39:11,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:39:11,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:11,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:11,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {26450#true} call ULTIMATE.init(); {26450#true} is VALID [2018-11-14 18:39:11,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {26450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26450#true} is VALID [2018-11-14 18:39:11,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {26450#true} assume true; {26450#true} is VALID [2018-11-14 18:39:11,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26450#true} {26450#true} #83#return; {26450#true} is VALID [2018-11-14 18:39:11,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {26450#true} call #t~ret8 := main(); {26450#true} is VALID [2018-11-14 18:39:11,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {26450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {26450#true} is VALID [2018-11-14 18:39:11,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {26450#true} assume true; {26450#true} is VALID [2018-11-14 18:39:11,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {26450#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {26503#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:11,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {26503#(<= main_~i~0 1)} assume true; {26503#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:11,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {26503#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26503#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:11,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {26503#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26503#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:11,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {26503#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {26453#(<= main_~i~0 2)} assume true; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {26453#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {26453#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26453#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:11,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {26453#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {26454#(<= main_~i~0 3)} assume true; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {26454#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {26454#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26454#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:11,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {26454#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {26455#(<= main_~i~0 4)} assume true; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {26455#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {26455#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26455#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:11,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {26455#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,520 INFO L273 TraceCheckUtils]: 24: Hoare triple {26456#(<= main_~i~0 5)} assume true; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {26456#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {26456#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26456#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:11,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {26456#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {26457#(<= main_~i~0 6)} assume true; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {26457#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {26457#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26457#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:11,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {26457#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {26458#(<= main_~i~0 7)} assume true; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {26458#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {26458#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26458#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:11,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {26458#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {26459#(<= main_~i~0 8)} assume true; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {26459#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {26459#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26459#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:11,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {26459#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {26460#(<= main_~i~0 9)} assume true; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {26460#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {26460#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26460#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:11,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {26460#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {26461#(<= main_~i~0 10)} assume true; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {26461#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {26461#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26461#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:11,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {26461#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {26462#(<= main_~i~0 11)} assume true; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {26462#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {26462#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26462#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:11,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {26462#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {26463#(<= main_~i~0 12)} assume true; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {26463#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {26463#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26463#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:11,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {26463#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,538 INFO L273 TraceCheckUtils]: 56: Hoare triple {26464#(<= main_~i~0 13)} assume true; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {26464#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {26464#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26464#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:11,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {26464#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {26465#(<= main_~i~0 14)} assume true; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {26465#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {26465#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26465#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:11,544 INFO L273 TraceCheckUtils]: 63: Hoare triple {26465#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,545 INFO L273 TraceCheckUtils]: 64: Hoare triple {26466#(<= main_~i~0 15)} assume true; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,545 INFO L273 TraceCheckUtils]: 65: Hoare triple {26466#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {26466#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26466#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:11,546 INFO L273 TraceCheckUtils]: 67: Hoare triple {26466#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {26467#(<= main_~i~0 16)} assume true; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,547 INFO L273 TraceCheckUtils]: 69: Hoare triple {26467#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {26467#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26467#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:11,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {26467#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,548 INFO L273 TraceCheckUtils]: 72: Hoare triple {26468#(<= main_~i~0 17)} assume true; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {26468#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {26468#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26468#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:11,550 INFO L273 TraceCheckUtils]: 75: Hoare triple {26468#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,551 INFO L273 TraceCheckUtils]: 76: Hoare triple {26469#(<= main_~i~0 18)} assume true; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,551 INFO L273 TraceCheckUtils]: 77: Hoare triple {26469#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,552 INFO L273 TraceCheckUtils]: 78: Hoare triple {26469#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26469#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:11,552 INFO L273 TraceCheckUtils]: 79: Hoare triple {26469#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,553 INFO L273 TraceCheckUtils]: 80: Hoare triple {26470#(<= main_~i~0 19)} assume true; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {26470#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,554 INFO L273 TraceCheckUtils]: 82: Hoare triple {26470#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26470#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:11,555 INFO L273 TraceCheckUtils]: 83: Hoare triple {26470#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,555 INFO L273 TraceCheckUtils]: 84: Hoare triple {26471#(<= main_~i~0 20)} assume true; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,556 INFO L273 TraceCheckUtils]: 85: Hoare triple {26471#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,556 INFO L273 TraceCheckUtils]: 86: Hoare triple {26471#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26471#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:11,557 INFO L273 TraceCheckUtils]: 87: Hoare triple {26471#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {26472#(<= main_~i~0 21)} assume true; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,558 INFO L273 TraceCheckUtils]: 89: Hoare triple {26472#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,558 INFO L273 TraceCheckUtils]: 90: Hoare triple {26472#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26472#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:11,559 INFO L273 TraceCheckUtils]: 91: Hoare triple {26472#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {26473#(<= main_~i~0 22)} assume true; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,560 INFO L273 TraceCheckUtils]: 93: Hoare triple {26473#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,561 INFO L273 TraceCheckUtils]: 94: Hoare triple {26473#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26473#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:11,561 INFO L273 TraceCheckUtils]: 95: Hoare triple {26473#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,562 INFO L273 TraceCheckUtils]: 96: Hoare triple {26474#(<= main_~i~0 23)} assume true; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,562 INFO L273 TraceCheckUtils]: 97: Hoare triple {26474#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,563 INFO L273 TraceCheckUtils]: 98: Hoare triple {26474#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26474#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:11,564 INFO L273 TraceCheckUtils]: 99: Hoare triple {26474#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,564 INFO L273 TraceCheckUtils]: 100: Hoare triple {26475#(<= main_~i~0 24)} assume true; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,565 INFO L273 TraceCheckUtils]: 101: Hoare triple {26475#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,565 INFO L273 TraceCheckUtils]: 102: Hoare triple {26475#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26475#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:11,566 INFO L273 TraceCheckUtils]: 103: Hoare triple {26475#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,566 INFO L273 TraceCheckUtils]: 104: Hoare triple {26476#(<= main_~i~0 25)} assume true; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,567 INFO L273 TraceCheckUtils]: 105: Hoare triple {26476#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,567 INFO L273 TraceCheckUtils]: 106: Hoare triple {26476#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26476#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:11,568 INFO L273 TraceCheckUtils]: 107: Hoare triple {26476#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,569 INFO L273 TraceCheckUtils]: 108: Hoare triple {26477#(<= main_~i~0 26)} assume true; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {26477#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,570 INFO L273 TraceCheckUtils]: 110: Hoare triple {26477#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26477#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:11,570 INFO L273 TraceCheckUtils]: 111: Hoare triple {26477#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {26478#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:11,571 INFO L273 TraceCheckUtils]: 112: Hoare triple {26478#(<= main_~i~0 27)} assume true; {26478#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:11,571 INFO L273 TraceCheckUtils]: 113: Hoare triple {26478#(<= main_~i~0 27)} assume !(~i~0 < 100000); {26451#false} is VALID [2018-11-14 18:39:11,572 INFO L273 TraceCheckUtils]: 114: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,572 INFO L273 TraceCheckUtils]: 115: Hoare triple {26451#false} assume !(~swapped~0 != 0); {26451#false} is VALID [2018-11-14 18:39:11,572 INFO L273 TraceCheckUtils]: 116: Hoare triple {26451#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {26451#false} is VALID [2018-11-14 18:39:11,572 INFO L273 TraceCheckUtils]: 117: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,572 INFO L273 TraceCheckUtils]: 118: Hoare triple {26451#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {26451#false} is VALID [2018-11-14 18:39:11,573 INFO L273 TraceCheckUtils]: 119: Hoare triple {26451#false} assume true; {26451#false} is VALID [2018-11-14 18:39:11,573 INFO L273 TraceCheckUtils]: 120: Hoare triple {26451#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {26451#false} is VALID [2018-11-14 18:39:11,573 INFO L256 TraceCheckUtils]: 121: Hoare triple {26451#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {26451#false} is VALID [2018-11-14 18:39:11,573 INFO L273 TraceCheckUtils]: 122: Hoare triple {26451#false} ~cond := #in~cond; {26451#false} is VALID [2018-11-14 18:39:11,573 INFO L273 TraceCheckUtils]: 123: Hoare triple {26451#false} assume ~cond == 0; {26451#false} is VALID [2018-11-14 18:39:11,574 INFO L273 TraceCheckUtils]: 124: Hoare triple {26451#false} assume !false; {26451#false} is VALID [2018-11-14 18:39:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 2 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:11,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 18:39:11,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2018-11-14 18:39:11,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:11,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:39:11,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:11,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:39:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:39:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:39:11,724 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand 30 states. [2018-11-14 18:39:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:12,594 INFO L93 Difference]: Finished difference Result 474 states and 590 transitions. [2018-11-14 18:39:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:39:12,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2018-11-14 18:39:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:39:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 192 transitions. [2018-11-14 18:39:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:39:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 192 transitions. [2018-11-14 18:39:12,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 192 transitions. [2018-11-14 18:39:12,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:12,793 INFO L225 Difference]: With dead ends: 474 [2018-11-14 18:39:12,793 INFO L226 Difference]: Without dead ends: 246 [2018-11-14 18:39:12,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:39:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-14 18:39:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2018-11-14 18:39:12,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:12,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 242 states. [2018-11-14 18:39:12,855 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 242 states. [2018-11-14 18:39:12,856 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 242 states. [2018-11-14 18:39:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:12,860 INFO L93 Difference]: Finished difference Result 246 states and 305 transitions. [2018-11-14 18:39:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2018-11-14 18:39:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:12,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:12,861 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 246 states. [2018-11-14 18:39:12,861 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 246 states. [2018-11-14 18:39:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:12,865 INFO L93 Difference]: Finished difference Result 246 states and 305 transitions. [2018-11-14 18:39:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2018-11-14 18:39:12,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:12,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:12,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-14 18:39:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 299 transitions. [2018-11-14 18:39:12,871 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 299 transitions. Word has length 125 [2018-11-14 18:39:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:12,871 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 299 transitions. [2018-11-14 18:39:12,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:39:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2018-11-14 18:39:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-14 18:39:12,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:12,873 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:12,873 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:12,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1058542516, now seen corresponding path program 27 times [2018-11-14 18:39:12,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:12,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:12,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:12,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:12,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:14,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {28251#true} call ULTIMATE.init(); {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {28251#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {28251#true} assume true; {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28251#true} {28251#true} #83#return; {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {28251#true} call #t~ret8 := main(); {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {28251#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {28251#true} is VALID [2018-11-14 18:39:14,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {28251#true} assume true; {28251#true} is VALID [2018-11-14 18:39:14,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {28251#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {28253#(= main_~i~0 1)} is VALID [2018-11-14 18:39:14,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {28253#(= main_~i~0 1)} assume true; {28253#(= main_~i~0 1)} is VALID [2018-11-14 18:39:14,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {28253#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28253#(= main_~i~0 1)} is VALID [2018-11-14 18:39:14,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {28253#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28253#(= main_~i~0 1)} is VALID [2018-11-14 18:39:14,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {28253#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {28254#(<= main_~i~0 2)} assume true; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {28254#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {28254#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {28254#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {28255#(<= main_~i~0 3)} assume true; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {28255#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {28255#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {28255#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {28256#(<= main_~i~0 4)} assume true; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {28256#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {28256#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {28256#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {28257#(<= main_~i~0 5)} assume true; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {28257#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {28257#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,052 INFO L273 TraceCheckUtils]: 27: Hoare triple {28257#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,052 INFO L273 TraceCheckUtils]: 28: Hoare triple {28258#(<= main_~i~0 6)} assume true; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,053 INFO L273 TraceCheckUtils]: 29: Hoare triple {28258#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {28258#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,054 INFO L273 TraceCheckUtils]: 31: Hoare triple {28258#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,054 INFO L273 TraceCheckUtils]: 32: Hoare triple {28259#(<= main_~i~0 7)} assume true; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,055 INFO L273 TraceCheckUtils]: 33: Hoare triple {28259#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,055 INFO L273 TraceCheckUtils]: 34: Hoare triple {28259#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,056 INFO L273 TraceCheckUtils]: 35: Hoare triple {28259#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,057 INFO L273 TraceCheckUtils]: 36: Hoare triple {28260#(<= main_~i~0 8)} assume true; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,057 INFO L273 TraceCheckUtils]: 37: Hoare triple {28260#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {28260#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {28260#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,059 INFO L273 TraceCheckUtils]: 40: Hoare triple {28261#(<= main_~i~0 9)} assume true; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,059 INFO L273 TraceCheckUtils]: 41: Hoare triple {28261#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,060 INFO L273 TraceCheckUtils]: 42: Hoare triple {28261#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,060 INFO L273 TraceCheckUtils]: 43: Hoare triple {28261#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,061 INFO L273 TraceCheckUtils]: 44: Hoare triple {28262#(<= main_~i~0 10)} assume true; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,061 INFO L273 TraceCheckUtils]: 45: Hoare triple {28262#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {28262#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {28262#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,067 INFO L273 TraceCheckUtils]: 48: Hoare triple {28263#(<= main_~i~0 11)} assume true; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,067 INFO L273 TraceCheckUtils]: 49: Hoare triple {28263#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,067 INFO L273 TraceCheckUtils]: 50: Hoare triple {28263#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,068 INFO L273 TraceCheckUtils]: 51: Hoare triple {28263#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,068 INFO L273 TraceCheckUtils]: 52: Hoare triple {28264#(<= main_~i~0 12)} assume true; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {28264#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,069 INFO L273 TraceCheckUtils]: 54: Hoare triple {28264#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {28264#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {28265#(<= main_~i~0 13)} assume true; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {28265#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,070 INFO L273 TraceCheckUtils]: 58: Hoare triple {28265#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,070 INFO L273 TraceCheckUtils]: 59: Hoare triple {28265#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,071 INFO L273 TraceCheckUtils]: 60: Hoare triple {28266#(<= main_~i~0 14)} assume true; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,071 INFO L273 TraceCheckUtils]: 61: Hoare triple {28266#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {28266#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {28266#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,073 INFO L273 TraceCheckUtils]: 64: Hoare triple {28267#(<= main_~i~0 15)} assume true; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {28267#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,074 INFO L273 TraceCheckUtils]: 66: Hoare triple {28267#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,074 INFO L273 TraceCheckUtils]: 67: Hoare triple {28267#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,075 INFO L273 TraceCheckUtils]: 68: Hoare triple {28268#(<= main_~i~0 16)} assume true; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,075 INFO L273 TraceCheckUtils]: 69: Hoare triple {28268#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,076 INFO L273 TraceCheckUtils]: 70: Hoare triple {28268#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,077 INFO L273 TraceCheckUtils]: 71: Hoare triple {28268#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,077 INFO L273 TraceCheckUtils]: 72: Hoare triple {28269#(<= main_~i~0 17)} assume true; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,078 INFO L273 TraceCheckUtils]: 73: Hoare triple {28269#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,078 INFO L273 TraceCheckUtils]: 74: Hoare triple {28269#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,079 INFO L273 TraceCheckUtils]: 75: Hoare triple {28269#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,079 INFO L273 TraceCheckUtils]: 76: Hoare triple {28270#(<= main_~i~0 18)} assume true; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,080 INFO L273 TraceCheckUtils]: 77: Hoare triple {28270#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {28270#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {28270#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {28271#(<= main_~i~0 19)} assume true; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,082 INFO L273 TraceCheckUtils]: 81: Hoare triple {28271#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {28271#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,083 INFO L273 TraceCheckUtils]: 83: Hoare triple {28271#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,084 INFO L273 TraceCheckUtils]: 84: Hoare triple {28272#(<= main_~i~0 20)} assume true; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {28272#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,085 INFO L273 TraceCheckUtils]: 86: Hoare triple {28272#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {28272#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,086 INFO L273 TraceCheckUtils]: 88: Hoare triple {28273#(<= main_~i~0 21)} assume true; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,086 INFO L273 TraceCheckUtils]: 89: Hoare triple {28273#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,087 INFO L273 TraceCheckUtils]: 90: Hoare triple {28273#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,088 INFO L273 TraceCheckUtils]: 91: Hoare triple {28273#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,088 INFO L273 TraceCheckUtils]: 92: Hoare triple {28274#(<= main_~i~0 22)} assume true; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,089 INFO L273 TraceCheckUtils]: 93: Hoare triple {28274#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,089 INFO L273 TraceCheckUtils]: 94: Hoare triple {28274#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,090 INFO L273 TraceCheckUtils]: 95: Hoare triple {28274#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {28275#(<= main_~i~0 23)} assume true; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,091 INFO L273 TraceCheckUtils]: 97: Hoare triple {28275#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,091 INFO L273 TraceCheckUtils]: 98: Hoare triple {28275#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,092 INFO L273 TraceCheckUtils]: 99: Hoare triple {28275#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,092 INFO L273 TraceCheckUtils]: 100: Hoare triple {28276#(<= main_~i~0 24)} assume true; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,093 INFO L273 TraceCheckUtils]: 101: Hoare triple {28276#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,093 INFO L273 TraceCheckUtils]: 102: Hoare triple {28276#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,094 INFO L273 TraceCheckUtils]: 103: Hoare triple {28276#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,094 INFO L273 TraceCheckUtils]: 104: Hoare triple {28277#(<= main_~i~0 25)} assume true; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,095 INFO L273 TraceCheckUtils]: 105: Hoare triple {28277#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,095 INFO L273 TraceCheckUtils]: 106: Hoare triple {28277#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,096 INFO L273 TraceCheckUtils]: 107: Hoare triple {28277#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,097 INFO L273 TraceCheckUtils]: 108: Hoare triple {28278#(<= main_~i~0 26)} assume true; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,097 INFO L273 TraceCheckUtils]: 109: Hoare triple {28278#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,097 INFO L273 TraceCheckUtils]: 110: Hoare triple {28278#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,098 INFO L273 TraceCheckUtils]: 111: Hoare triple {28278#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,099 INFO L273 TraceCheckUtils]: 112: Hoare triple {28279#(<= main_~i~0 27)} assume true; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,099 INFO L273 TraceCheckUtils]: 113: Hoare triple {28279#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,100 INFO L273 TraceCheckUtils]: 114: Hoare triple {28279#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,100 INFO L273 TraceCheckUtils]: 115: Hoare triple {28279#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {28280#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:14,101 INFO L273 TraceCheckUtils]: 116: Hoare triple {28280#(<= main_~i~0 28)} assume true; {28280#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:14,101 INFO L273 TraceCheckUtils]: 117: Hoare triple {28280#(<= main_~i~0 28)} assume !(~i~0 < 100000); {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 118: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 119: Hoare triple {28252#false} assume !(~swapped~0 != 0); {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 120: Hoare triple {28252#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 121: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 122: Hoare triple {28252#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {28252#false} is VALID [2018-11-14 18:39:14,102 INFO L273 TraceCheckUtils]: 123: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,103 INFO L273 TraceCheckUtils]: 124: Hoare triple {28252#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {28252#false} is VALID [2018-11-14 18:39:14,103 INFO L256 TraceCheckUtils]: 125: Hoare triple {28252#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {28252#false} is VALID [2018-11-14 18:39:14,103 INFO L273 TraceCheckUtils]: 126: Hoare triple {28252#false} ~cond := #in~cond; {28252#false} is VALID [2018-11-14 18:39:14,103 INFO L273 TraceCheckUtils]: 127: Hoare triple {28252#false} assume ~cond == 0; {28252#false} is VALID [2018-11-14 18:39:14,103 INFO L273 TraceCheckUtils]: 128: Hoare triple {28252#false} assume !false; {28252#false} is VALID [2018-11-14 18:39:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 2 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:14,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:14,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:39:14,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-14 18:39:14,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:14,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:14,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {28251#true} call ULTIMATE.init(); {28251#true} is VALID [2018-11-14 18:39:14,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {28251#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28251#true} is VALID [2018-11-14 18:39:14,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {28251#true} assume true; {28251#true} is VALID [2018-11-14 18:39:14,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28251#true} {28251#true} #83#return; {28251#true} is VALID [2018-11-14 18:39:14,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {28251#true} call #t~ret8 := main(); {28251#true} is VALID [2018-11-14 18:39:14,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {28251#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {28251#true} is VALID [2018-11-14 18:39:14,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {28251#true} assume true; {28251#true} is VALID [2018-11-14 18:39:14,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {28251#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {28305#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:14,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {28305#(<= main_~i~0 1)} assume true; {28305#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:14,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {28305#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28305#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:14,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {28305#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28305#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:14,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {28305#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {28254#(<= main_~i~0 2)} assume true; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {28254#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {28254#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28254#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:14,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {28254#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {28255#(<= main_~i~0 3)} assume true; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {28255#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {28255#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28255#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:14,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {28255#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {28256#(<= main_~i~0 4)} assume true; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {28256#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {28256#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28256#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:14,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {28256#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {28257#(<= main_~i~0 5)} assume true; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {28257#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {28257#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28257#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:14,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {28257#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {28258#(<= main_~i~0 6)} assume true; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {28258#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {28258#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28258#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:14,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {28258#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {28259#(<= main_~i~0 7)} assume true; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {28259#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {28259#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28259#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:14,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {28259#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {28260#(<= main_~i~0 8)} assume true; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {28260#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {28260#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28260#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:14,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {28260#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {28261#(<= main_~i~0 9)} assume true; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {28261#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {28261#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28261#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:14,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {28261#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,516 INFO L273 TraceCheckUtils]: 44: Hoare triple {28262#(<= main_~i~0 10)} assume true; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {28262#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {28262#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28262#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:14,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {28262#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {28263#(<= main_~i~0 11)} assume true; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {28263#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,520 INFO L273 TraceCheckUtils]: 50: Hoare triple {28263#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28263#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:14,520 INFO L273 TraceCheckUtils]: 51: Hoare triple {28263#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {28264#(<= main_~i~0 12)} assume true; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {28264#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {28264#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28264#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:14,522 INFO L273 TraceCheckUtils]: 55: Hoare triple {28264#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {28265#(<= main_~i~0 13)} assume true; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,523 INFO L273 TraceCheckUtils]: 57: Hoare triple {28265#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,524 INFO L273 TraceCheckUtils]: 58: Hoare triple {28265#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28265#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:14,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {28265#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {28266#(<= main_~i~0 14)} assume true; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {28266#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {28266#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28266#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:14,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {28266#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {28267#(<= main_~i~0 15)} assume true; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {28267#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {28267#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28267#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:14,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {28267#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,530 INFO L273 TraceCheckUtils]: 68: Hoare triple {28268#(<= main_~i~0 16)} assume true; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,530 INFO L273 TraceCheckUtils]: 69: Hoare triple {28268#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,531 INFO L273 TraceCheckUtils]: 70: Hoare triple {28268#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28268#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:14,531 INFO L273 TraceCheckUtils]: 71: Hoare triple {28268#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,532 INFO L273 TraceCheckUtils]: 72: Hoare triple {28269#(<= main_~i~0 17)} assume true; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,533 INFO L273 TraceCheckUtils]: 73: Hoare triple {28269#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,533 INFO L273 TraceCheckUtils]: 74: Hoare triple {28269#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28269#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:14,534 INFO L273 TraceCheckUtils]: 75: Hoare triple {28269#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,534 INFO L273 TraceCheckUtils]: 76: Hoare triple {28270#(<= main_~i~0 18)} assume true; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,535 INFO L273 TraceCheckUtils]: 77: Hoare triple {28270#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {28270#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28270#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:14,536 INFO L273 TraceCheckUtils]: 79: Hoare triple {28270#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,536 INFO L273 TraceCheckUtils]: 80: Hoare triple {28271#(<= main_~i~0 19)} assume true; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,537 INFO L273 TraceCheckUtils]: 81: Hoare triple {28271#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,537 INFO L273 TraceCheckUtils]: 82: Hoare triple {28271#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28271#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:14,538 INFO L273 TraceCheckUtils]: 83: Hoare triple {28271#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,539 INFO L273 TraceCheckUtils]: 84: Hoare triple {28272#(<= main_~i~0 20)} assume true; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,539 INFO L273 TraceCheckUtils]: 85: Hoare triple {28272#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,540 INFO L273 TraceCheckUtils]: 86: Hoare triple {28272#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28272#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:14,540 INFO L273 TraceCheckUtils]: 87: Hoare triple {28272#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,541 INFO L273 TraceCheckUtils]: 88: Hoare triple {28273#(<= main_~i~0 21)} assume true; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,541 INFO L273 TraceCheckUtils]: 89: Hoare triple {28273#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,542 INFO L273 TraceCheckUtils]: 90: Hoare triple {28273#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28273#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:14,562 INFO L273 TraceCheckUtils]: 91: Hoare triple {28273#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,571 INFO L273 TraceCheckUtils]: 92: Hoare triple {28274#(<= main_~i~0 22)} assume true; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,585 INFO L273 TraceCheckUtils]: 93: Hoare triple {28274#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {28274#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28274#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:14,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {28274#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {28275#(<= main_~i~0 23)} assume true; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,593 INFO L273 TraceCheckUtils]: 97: Hoare triple {28275#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,594 INFO L273 TraceCheckUtils]: 98: Hoare triple {28275#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28275#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:14,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {28275#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {28276#(<= main_~i~0 24)} assume true; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,595 INFO L273 TraceCheckUtils]: 101: Hoare triple {28276#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,595 INFO L273 TraceCheckUtils]: 102: Hoare triple {28276#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28276#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:14,595 INFO L273 TraceCheckUtils]: 103: Hoare triple {28276#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,596 INFO L273 TraceCheckUtils]: 104: Hoare triple {28277#(<= main_~i~0 25)} assume true; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,596 INFO L273 TraceCheckUtils]: 105: Hoare triple {28277#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,597 INFO L273 TraceCheckUtils]: 106: Hoare triple {28277#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28277#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:14,597 INFO L273 TraceCheckUtils]: 107: Hoare triple {28277#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,598 INFO L273 TraceCheckUtils]: 108: Hoare triple {28278#(<= main_~i~0 26)} assume true; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {28278#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,599 INFO L273 TraceCheckUtils]: 110: Hoare triple {28278#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28278#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:14,599 INFO L273 TraceCheckUtils]: 111: Hoare triple {28278#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,600 INFO L273 TraceCheckUtils]: 112: Hoare triple {28279#(<= main_~i~0 27)} assume true; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,600 INFO L273 TraceCheckUtils]: 113: Hoare triple {28279#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {28279#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28279#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:14,602 INFO L273 TraceCheckUtils]: 115: Hoare triple {28279#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {28280#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:14,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {28280#(<= main_~i~0 28)} assume true; {28280#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:14,603 INFO L273 TraceCheckUtils]: 117: Hoare triple {28280#(<= main_~i~0 28)} assume !(~i~0 < 100000); {28252#false} is VALID [2018-11-14 18:39:14,603 INFO L273 TraceCheckUtils]: 118: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {28252#false} assume !(~swapped~0 != 0); {28252#false} is VALID [2018-11-14 18:39:14,603 INFO L273 TraceCheckUtils]: 120: Hoare triple {28252#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {28252#false} is VALID [2018-11-14 18:39:14,603 INFO L273 TraceCheckUtils]: 121: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L273 TraceCheckUtils]: 122: Hoare triple {28252#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L273 TraceCheckUtils]: 123: Hoare triple {28252#false} assume true; {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L273 TraceCheckUtils]: 124: Hoare triple {28252#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L256 TraceCheckUtils]: 125: Hoare triple {28252#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L273 TraceCheckUtils]: 126: Hoare triple {28252#false} ~cond := #in~cond; {28252#false} is VALID [2018-11-14 18:39:14,604 INFO L273 TraceCheckUtils]: 127: Hoare triple {28252#false} assume ~cond == 0; {28252#false} is VALID [2018-11-14 18:39:14,605 INFO L273 TraceCheckUtils]: 128: Hoare triple {28252#false} assume !false; {28252#false} is VALID [2018-11-14 18:39:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 2 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:14,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:14,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 18:39:14,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-11-14 18:39:14,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:14,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:39:14,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:14,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:39:14,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:39:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:39:14,750 INFO L87 Difference]: Start difference. First operand 242 states and 299 transitions. Second operand 31 states. [2018-11-14 18:39:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:15,636 INFO L93 Difference]: Finished difference Result 490 states and 610 transitions. [2018-11-14 18:39:15,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:39:15,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 129 [2018-11-14 18:39:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:39:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 197 transitions. [2018-11-14 18:39:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:39:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 197 transitions. [2018-11-14 18:39:15,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 197 transitions. [2018-11-14 18:39:15,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:15,819 INFO L225 Difference]: With dead ends: 490 [2018-11-14 18:39:15,820 INFO L226 Difference]: Without dead ends: 254 [2018-11-14 18:39:15,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:39:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-14 18:39:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-11-14 18:39:15,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:15,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand 250 states. [2018-11-14 18:39:15,886 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 250 states. [2018-11-14 18:39:15,886 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 250 states. [2018-11-14 18:39:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:15,891 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2018-11-14 18:39:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 315 transitions. [2018-11-14 18:39:15,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:15,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:15,892 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 254 states. [2018-11-14 18:39:15,892 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 254 states. [2018-11-14 18:39:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:15,897 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2018-11-14 18:39:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 315 transitions. [2018-11-14 18:39:15,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:15,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:15,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:15,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-14 18:39:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 309 transitions. [2018-11-14 18:39:15,903 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 309 transitions. Word has length 129 [2018-11-14 18:39:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:15,903 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 309 transitions. [2018-11-14 18:39:15,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:39:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 309 transitions. [2018-11-14 18:39:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 18:39:15,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:15,904 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:15,905 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:15,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash -202010460, now seen corresponding path program 28 times [2018-11-14 18:39:15,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:15,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:15,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:16,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {30111#true} call ULTIMATE.init(); {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {30111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {30111#true} assume true; {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30111#true} {30111#true} #83#return; {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {30111#true} call #t~ret8 := main(); {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {30111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {30111#true} is VALID [2018-11-14 18:39:16,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {30111#true} assume true; {30111#true} is VALID [2018-11-14 18:39:16,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {30111#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {30113#(= main_~i~0 1)} is VALID [2018-11-14 18:39:16,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {30113#(= main_~i~0 1)} assume true; {30113#(= main_~i~0 1)} is VALID [2018-11-14 18:39:16,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {30113#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30113#(= main_~i~0 1)} is VALID [2018-11-14 18:39:16,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {30113#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30113#(= main_~i~0 1)} is VALID [2018-11-14 18:39:16,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {30113#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:16,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {30114#(<= main_~i~0 2)} assume true; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:16,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {30114#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:16,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {30114#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:16,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {30114#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:16,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {30115#(<= main_~i~0 3)} assume true; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:16,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {30115#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:16,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {30115#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:16,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {30115#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:16,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {30116#(<= main_~i~0 4)} assume true; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:16,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {30116#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:16,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {30116#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:16,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {30116#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:16,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {30117#(<= main_~i~0 5)} assume true; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:16,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {30117#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:16,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {30117#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:16,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {30117#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:16,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {30118#(<= main_~i~0 6)} assume true; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:16,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {30118#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:16,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {30118#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:16,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {30118#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:16,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {30119#(<= main_~i~0 7)} assume true; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:16,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {30119#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:16,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {30119#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:16,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {30119#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:16,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {30120#(<= main_~i~0 8)} assume true; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:16,545 INFO L273 TraceCheckUtils]: 37: Hoare triple {30120#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:16,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {30120#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:16,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {30120#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:16,547 INFO L273 TraceCheckUtils]: 40: Hoare triple {30121#(<= main_~i~0 9)} assume true; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:16,547 INFO L273 TraceCheckUtils]: 41: Hoare triple {30121#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:16,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {30121#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:16,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {30121#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:16,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {30122#(<= main_~i~0 10)} assume true; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:16,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {30122#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:16,550 INFO L273 TraceCheckUtils]: 46: Hoare triple {30122#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:16,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {30122#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:16,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {30123#(<= main_~i~0 11)} assume true; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:16,552 INFO L273 TraceCheckUtils]: 49: Hoare triple {30123#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:16,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {30123#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:16,553 INFO L273 TraceCheckUtils]: 51: Hoare triple {30123#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:16,553 INFO L273 TraceCheckUtils]: 52: Hoare triple {30124#(<= main_~i~0 12)} assume true; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:16,554 INFO L273 TraceCheckUtils]: 53: Hoare triple {30124#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:16,554 INFO L273 TraceCheckUtils]: 54: Hoare triple {30124#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:16,555 INFO L273 TraceCheckUtils]: 55: Hoare triple {30124#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:16,555 INFO L273 TraceCheckUtils]: 56: Hoare triple {30125#(<= main_~i~0 13)} assume true; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:16,556 INFO L273 TraceCheckUtils]: 57: Hoare triple {30125#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:16,556 INFO L273 TraceCheckUtils]: 58: Hoare triple {30125#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:16,557 INFO L273 TraceCheckUtils]: 59: Hoare triple {30125#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:16,557 INFO L273 TraceCheckUtils]: 60: Hoare triple {30126#(<= main_~i~0 14)} assume true; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:16,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {30126#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:16,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {30126#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:16,559 INFO L273 TraceCheckUtils]: 63: Hoare triple {30126#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:16,559 INFO L273 TraceCheckUtils]: 64: Hoare triple {30127#(<= main_~i~0 15)} assume true; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:16,560 INFO L273 TraceCheckUtils]: 65: Hoare triple {30127#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:16,560 INFO L273 TraceCheckUtils]: 66: Hoare triple {30127#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:16,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {30127#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:16,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {30128#(<= main_~i~0 16)} assume true; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:16,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {30128#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:16,562 INFO L273 TraceCheckUtils]: 70: Hoare triple {30128#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:16,563 INFO L273 TraceCheckUtils]: 71: Hoare triple {30128#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:16,564 INFO L273 TraceCheckUtils]: 72: Hoare triple {30129#(<= main_~i~0 17)} assume true; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:16,564 INFO L273 TraceCheckUtils]: 73: Hoare triple {30129#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:16,565 INFO L273 TraceCheckUtils]: 74: Hoare triple {30129#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:16,565 INFO L273 TraceCheckUtils]: 75: Hoare triple {30129#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:16,566 INFO L273 TraceCheckUtils]: 76: Hoare triple {30130#(<= main_~i~0 18)} assume true; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:16,566 INFO L273 TraceCheckUtils]: 77: Hoare triple {30130#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:16,567 INFO L273 TraceCheckUtils]: 78: Hoare triple {30130#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:16,567 INFO L273 TraceCheckUtils]: 79: Hoare triple {30130#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:16,568 INFO L273 TraceCheckUtils]: 80: Hoare triple {30131#(<= main_~i~0 19)} assume true; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:16,568 INFO L273 TraceCheckUtils]: 81: Hoare triple {30131#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:16,569 INFO L273 TraceCheckUtils]: 82: Hoare triple {30131#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:16,569 INFO L273 TraceCheckUtils]: 83: Hoare triple {30131#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:16,570 INFO L273 TraceCheckUtils]: 84: Hoare triple {30132#(<= main_~i~0 20)} assume true; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:16,570 INFO L273 TraceCheckUtils]: 85: Hoare triple {30132#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:16,571 INFO L273 TraceCheckUtils]: 86: Hoare triple {30132#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:16,572 INFO L273 TraceCheckUtils]: 87: Hoare triple {30132#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:16,572 INFO L273 TraceCheckUtils]: 88: Hoare triple {30133#(<= main_~i~0 21)} assume true; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:16,573 INFO L273 TraceCheckUtils]: 89: Hoare triple {30133#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:16,573 INFO L273 TraceCheckUtils]: 90: Hoare triple {30133#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:16,574 INFO L273 TraceCheckUtils]: 91: Hoare triple {30133#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:16,574 INFO L273 TraceCheckUtils]: 92: Hoare triple {30134#(<= main_~i~0 22)} assume true; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:16,575 INFO L273 TraceCheckUtils]: 93: Hoare triple {30134#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:16,575 INFO L273 TraceCheckUtils]: 94: Hoare triple {30134#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:16,576 INFO L273 TraceCheckUtils]: 95: Hoare triple {30134#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:16,576 INFO L273 TraceCheckUtils]: 96: Hoare triple {30135#(<= main_~i~0 23)} assume true; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:16,577 INFO L273 TraceCheckUtils]: 97: Hoare triple {30135#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:16,577 INFO L273 TraceCheckUtils]: 98: Hoare triple {30135#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:16,579 INFO L273 TraceCheckUtils]: 99: Hoare triple {30135#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:16,580 INFO L273 TraceCheckUtils]: 100: Hoare triple {30136#(<= main_~i~0 24)} assume true; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:16,580 INFO L273 TraceCheckUtils]: 101: Hoare triple {30136#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:16,581 INFO L273 TraceCheckUtils]: 102: Hoare triple {30136#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:16,581 INFO L273 TraceCheckUtils]: 103: Hoare triple {30136#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:16,582 INFO L273 TraceCheckUtils]: 104: Hoare triple {30137#(<= main_~i~0 25)} assume true; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:16,582 INFO L273 TraceCheckUtils]: 105: Hoare triple {30137#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:16,583 INFO L273 TraceCheckUtils]: 106: Hoare triple {30137#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:16,583 INFO L273 TraceCheckUtils]: 107: Hoare triple {30137#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:16,584 INFO L273 TraceCheckUtils]: 108: Hoare triple {30138#(<= main_~i~0 26)} assume true; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:16,584 INFO L273 TraceCheckUtils]: 109: Hoare triple {30138#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:16,585 INFO L273 TraceCheckUtils]: 110: Hoare triple {30138#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:16,585 INFO L273 TraceCheckUtils]: 111: Hoare triple {30138#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:16,586 INFO L273 TraceCheckUtils]: 112: Hoare triple {30139#(<= main_~i~0 27)} assume true; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:16,586 INFO L273 TraceCheckUtils]: 113: Hoare triple {30139#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:16,587 INFO L273 TraceCheckUtils]: 114: Hoare triple {30139#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:16,588 INFO L273 TraceCheckUtils]: 115: Hoare triple {30139#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:16,588 INFO L273 TraceCheckUtils]: 116: Hoare triple {30140#(<= main_~i~0 28)} assume true; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:16,588 INFO L273 TraceCheckUtils]: 117: Hoare triple {30140#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:16,589 INFO L273 TraceCheckUtils]: 118: Hoare triple {30140#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:16,590 INFO L273 TraceCheckUtils]: 119: Hoare triple {30140#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {30141#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:16,590 INFO L273 TraceCheckUtils]: 120: Hoare triple {30141#(<= main_~i~0 29)} assume true; {30141#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:16,591 INFO L273 TraceCheckUtils]: 121: Hoare triple {30141#(<= main_~i~0 29)} assume !(~i~0 < 100000); {30112#false} is VALID [2018-11-14 18:39:16,591 INFO L273 TraceCheckUtils]: 122: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:16,591 INFO L273 TraceCheckUtils]: 123: Hoare triple {30112#false} assume !(~swapped~0 != 0); {30112#false} is VALID [2018-11-14 18:39:16,591 INFO L273 TraceCheckUtils]: 124: Hoare triple {30112#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {30112#false} is VALID [2018-11-14 18:39:16,591 INFO L273 TraceCheckUtils]: 125: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L273 TraceCheckUtils]: 126: Hoare triple {30112#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L273 TraceCheckUtils]: 127: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L273 TraceCheckUtils]: 128: Hoare triple {30112#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L256 TraceCheckUtils]: 129: Hoare triple {30112#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L273 TraceCheckUtils]: 130: Hoare triple {30112#false} ~cond := #in~cond; {30112#false} is VALID [2018-11-14 18:39:16,592 INFO L273 TraceCheckUtils]: 131: Hoare triple {30112#false} assume ~cond == 0; {30112#false} is VALID [2018-11-14 18:39:16,593 INFO L273 TraceCheckUtils]: 132: Hoare triple {30112#false} assume !false; {30112#false} is VALID [2018-11-14 18:39:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 2 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:16,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:16,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:39:16,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:39:16,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:16,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:17,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {30111#true} call ULTIMATE.init(); {30111#true} is VALID [2018-11-14 18:39:17,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {30111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30111#true} is VALID [2018-11-14 18:39:17,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {30111#true} assume true; {30111#true} is VALID [2018-11-14 18:39:17,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30111#true} {30111#true} #83#return; {30111#true} is VALID [2018-11-14 18:39:17,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {30111#true} call #t~ret8 := main(); {30111#true} is VALID [2018-11-14 18:39:17,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {30111#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {30111#true} is VALID [2018-11-14 18:39:17,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {30111#true} assume true; {30111#true} is VALID [2018-11-14 18:39:17,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {30111#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {30166#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:17,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {30166#(<= main_~i~0 1)} assume true; {30166#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:17,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {30166#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30166#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:17,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {30166#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30166#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:17,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {30166#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:17,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {30114#(<= main_~i~0 2)} assume true; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:17,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {30114#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:17,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {30114#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30114#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:17,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {30114#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:17,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {30115#(<= main_~i~0 3)} assume true; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:17,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {30115#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:17,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {30115#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30115#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:17,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {30115#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:17,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {30116#(<= main_~i~0 4)} assume true; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:17,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {30116#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:17,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {30116#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30116#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:17,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {30116#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:17,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {30117#(<= main_~i~0 5)} assume true; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:17,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {30117#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:17,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {30117#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30117#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:17,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {30117#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:17,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {30118#(<= main_~i~0 6)} assume true; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:17,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {30118#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:17,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {30118#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30118#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:17,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {30118#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:17,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {30119#(<= main_~i~0 7)} assume true; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:17,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {30119#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:17,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {30119#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30119#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:17,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {30119#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:17,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {30120#(<= main_~i~0 8)} assume true; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:17,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {30120#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:17,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {30120#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30120#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:17,981 INFO L273 TraceCheckUtils]: 39: Hoare triple {30120#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:17,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {30121#(<= main_~i~0 9)} assume true; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:17,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {30121#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:17,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {30121#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30121#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:17,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {30121#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:17,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {30122#(<= main_~i~0 10)} assume true; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:17,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {30122#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:17,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {30122#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30122#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:17,985 INFO L273 TraceCheckUtils]: 47: Hoare triple {30122#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:17,986 INFO L273 TraceCheckUtils]: 48: Hoare triple {30123#(<= main_~i~0 11)} assume true; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:17,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {30123#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:17,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {30123#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30123#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:17,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {30123#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:17,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {30124#(<= main_~i~0 12)} assume true; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:17,988 INFO L273 TraceCheckUtils]: 53: Hoare triple {30124#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:17,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {30124#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30124#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:17,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {30124#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:17,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {30125#(<= main_~i~0 13)} assume true; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:17,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {30125#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:17,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {30125#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30125#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:17,992 INFO L273 TraceCheckUtils]: 59: Hoare triple {30125#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:17,992 INFO L273 TraceCheckUtils]: 60: Hoare triple {30126#(<= main_~i~0 14)} assume true; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:17,993 INFO L273 TraceCheckUtils]: 61: Hoare triple {30126#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:17,993 INFO L273 TraceCheckUtils]: 62: Hoare triple {30126#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30126#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:17,994 INFO L273 TraceCheckUtils]: 63: Hoare triple {30126#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:17,995 INFO L273 TraceCheckUtils]: 64: Hoare triple {30127#(<= main_~i~0 15)} assume true; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:17,995 INFO L273 TraceCheckUtils]: 65: Hoare triple {30127#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:17,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {30127#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30127#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:17,996 INFO L273 TraceCheckUtils]: 67: Hoare triple {30127#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:17,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {30128#(<= main_~i~0 16)} assume true; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:17,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {30128#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:17,998 INFO L273 TraceCheckUtils]: 70: Hoare triple {30128#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30128#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:17,999 INFO L273 TraceCheckUtils]: 71: Hoare triple {30128#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:17,999 INFO L273 TraceCheckUtils]: 72: Hoare triple {30129#(<= main_~i~0 17)} assume true; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:18,000 INFO L273 TraceCheckUtils]: 73: Hoare triple {30129#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:18,000 INFO L273 TraceCheckUtils]: 74: Hoare triple {30129#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30129#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:18,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {30129#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:18,002 INFO L273 TraceCheckUtils]: 76: Hoare triple {30130#(<= main_~i~0 18)} assume true; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:18,002 INFO L273 TraceCheckUtils]: 77: Hoare triple {30130#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:18,003 INFO L273 TraceCheckUtils]: 78: Hoare triple {30130#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30130#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:18,003 INFO L273 TraceCheckUtils]: 79: Hoare triple {30130#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:18,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {30131#(<= main_~i~0 19)} assume true; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:18,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {30131#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:18,005 INFO L273 TraceCheckUtils]: 82: Hoare triple {30131#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30131#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:18,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {30131#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:18,006 INFO L273 TraceCheckUtils]: 84: Hoare triple {30132#(<= main_~i~0 20)} assume true; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:18,007 INFO L273 TraceCheckUtils]: 85: Hoare triple {30132#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:18,007 INFO L273 TraceCheckUtils]: 86: Hoare triple {30132#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30132#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:18,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {30132#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:18,008 INFO L273 TraceCheckUtils]: 88: Hoare triple {30133#(<= main_~i~0 21)} assume true; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:18,009 INFO L273 TraceCheckUtils]: 89: Hoare triple {30133#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:18,009 INFO L273 TraceCheckUtils]: 90: Hoare triple {30133#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30133#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:18,010 INFO L273 TraceCheckUtils]: 91: Hoare triple {30133#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:18,010 INFO L273 TraceCheckUtils]: 92: Hoare triple {30134#(<= main_~i~0 22)} assume true; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:18,011 INFO L273 TraceCheckUtils]: 93: Hoare triple {30134#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:18,011 INFO L273 TraceCheckUtils]: 94: Hoare triple {30134#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30134#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:18,012 INFO L273 TraceCheckUtils]: 95: Hoare triple {30134#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:18,013 INFO L273 TraceCheckUtils]: 96: Hoare triple {30135#(<= main_~i~0 23)} assume true; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:18,013 INFO L273 TraceCheckUtils]: 97: Hoare triple {30135#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:18,014 INFO L273 TraceCheckUtils]: 98: Hoare triple {30135#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30135#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:18,014 INFO L273 TraceCheckUtils]: 99: Hoare triple {30135#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:18,015 INFO L273 TraceCheckUtils]: 100: Hoare triple {30136#(<= main_~i~0 24)} assume true; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:18,015 INFO L273 TraceCheckUtils]: 101: Hoare triple {30136#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:18,016 INFO L273 TraceCheckUtils]: 102: Hoare triple {30136#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30136#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:18,017 INFO L273 TraceCheckUtils]: 103: Hoare triple {30136#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:18,017 INFO L273 TraceCheckUtils]: 104: Hoare triple {30137#(<= main_~i~0 25)} assume true; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:18,018 INFO L273 TraceCheckUtils]: 105: Hoare triple {30137#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:18,018 INFO L273 TraceCheckUtils]: 106: Hoare triple {30137#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30137#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:18,019 INFO L273 TraceCheckUtils]: 107: Hoare triple {30137#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:18,019 INFO L273 TraceCheckUtils]: 108: Hoare triple {30138#(<= main_~i~0 26)} assume true; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:18,020 INFO L273 TraceCheckUtils]: 109: Hoare triple {30138#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:18,020 INFO L273 TraceCheckUtils]: 110: Hoare triple {30138#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30138#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:18,021 INFO L273 TraceCheckUtils]: 111: Hoare triple {30138#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:18,022 INFO L273 TraceCheckUtils]: 112: Hoare triple {30139#(<= main_~i~0 27)} assume true; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:18,022 INFO L273 TraceCheckUtils]: 113: Hoare triple {30139#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:18,023 INFO L273 TraceCheckUtils]: 114: Hoare triple {30139#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30139#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:18,023 INFO L273 TraceCheckUtils]: 115: Hoare triple {30139#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:18,024 INFO L273 TraceCheckUtils]: 116: Hoare triple {30140#(<= main_~i~0 28)} assume true; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:18,024 INFO L273 TraceCheckUtils]: 117: Hoare triple {30140#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:18,025 INFO L273 TraceCheckUtils]: 118: Hoare triple {30140#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30140#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:18,026 INFO L273 TraceCheckUtils]: 119: Hoare triple {30140#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {30141#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:18,026 INFO L273 TraceCheckUtils]: 120: Hoare triple {30141#(<= main_~i~0 29)} assume true; {30141#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:18,027 INFO L273 TraceCheckUtils]: 121: Hoare triple {30141#(<= main_~i~0 29)} assume !(~i~0 < 100000); {30112#false} is VALID [2018-11-14 18:39:18,027 INFO L273 TraceCheckUtils]: 122: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:18,027 INFO L273 TraceCheckUtils]: 123: Hoare triple {30112#false} assume !(~swapped~0 != 0); {30112#false} is VALID [2018-11-14 18:39:18,027 INFO L273 TraceCheckUtils]: 124: Hoare triple {30112#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {30112#false} is VALID [2018-11-14 18:39:18,028 INFO L273 TraceCheckUtils]: 125: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:18,028 INFO L273 TraceCheckUtils]: 126: Hoare triple {30112#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {30112#false} is VALID [2018-11-14 18:39:18,028 INFO L273 TraceCheckUtils]: 127: Hoare triple {30112#false} assume true; {30112#false} is VALID [2018-11-14 18:39:18,028 INFO L273 TraceCheckUtils]: 128: Hoare triple {30112#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {30112#false} is VALID [2018-11-14 18:39:18,028 INFO L256 TraceCheckUtils]: 129: Hoare triple {30112#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {30112#false} is VALID [2018-11-14 18:39:18,029 INFO L273 TraceCheckUtils]: 130: Hoare triple {30112#false} ~cond := #in~cond; {30112#false} is VALID [2018-11-14 18:39:18,029 INFO L273 TraceCheckUtils]: 131: Hoare triple {30112#false} assume ~cond == 0; {30112#false} is VALID [2018-11-14 18:39:18,029 INFO L273 TraceCheckUtils]: 132: Hoare triple {30112#false} assume !false; {30112#false} is VALID [2018-11-14 18:39:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 2 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:18,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 18:39:18,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-11-14 18:39:18,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:18,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:39:18,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:39:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:39:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:39:18,186 INFO L87 Difference]: Start difference. First operand 250 states and 309 transitions. Second operand 32 states. [2018-11-14 18:39:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:19,274 INFO L93 Difference]: Finished difference Result 506 states and 630 transitions. [2018-11-14 18:39:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:39:19,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-11-14 18:39:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:39:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 202 transitions. [2018-11-14 18:39:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:39:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 202 transitions. [2018-11-14 18:39:19,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 202 transitions. [2018-11-14 18:39:19,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:19,488 INFO L225 Difference]: With dead ends: 506 [2018-11-14 18:39:19,488 INFO L226 Difference]: Without dead ends: 262 [2018-11-14 18:39:19,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:39:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-14 18:39:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2018-11-14 18:39:19,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:19,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 258 states. [2018-11-14 18:39:19,570 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 258 states. [2018-11-14 18:39:19,570 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 258 states. [2018-11-14 18:39:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:19,576 INFO L93 Difference]: Finished difference Result 262 states and 325 transitions. [2018-11-14 18:39:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 325 transitions. [2018-11-14 18:39:19,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:19,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:19,577 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 262 states. [2018-11-14 18:39:19,577 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 262 states. [2018-11-14 18:39:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:19,581 INFO L93 Difference]: Finished difference Result 262 states and 325 transitions. [2018-11-14 18:39:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 325 transitions. [2018-11-14 18:39:19,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:19,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:19,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:19,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-14 18:39:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 319 transitions. [2018-11-14 18:39:19,587 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 319 transitions. Word has length 133 [2018-11-14 18:39:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:19,587 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 319 transitions. [2018-11-14 18:39:19,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:39:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2018-11-14 18:39:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-14 18:39:19,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:19,588 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:19,589 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:19,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -462862084, now seen corresponding path program 29 times [2018-11-14 18:39:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:19,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:19,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:20,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {32030#true} call ULTIMATE.init(); {32030#true} is VALID [2018-11-14 18:39:20,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {32030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {32030#true} assume true; {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32030#true} {32030#true} #83#return; {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {32030#true} call #t~ret8 := main(); {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {32030#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {32030#true} assume true; {32030#true} is VALID [2018-11-14 18:39:20,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {32030#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {32032#(= main_~i~0 1)} is VALID [2018-11-14 18:39:20,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {32032#(= main_~i~0 1)} assume true; {32032#(= main_~i~0 1)} is VALID [2018-11-14 18:39:20,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {32032#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32032#(= main_~i~0 1)} is VALID [2018-11-14 18:39:20,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {32032#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32032#(= main_~i~0 1)} is VALID [2018-11-14 18:39:20,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {32032#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {32033#(<= main_~i~0 2)} assume true; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {32033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {32033#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {32033#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {32034#(<= main_~i~0 3)} assume true; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {32034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {32034#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {32034#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {32035#(<= main_~i~0 4)} assume true; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {32035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {32035#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {32035#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,225 INFO L273 TraceCheckUtils]: 24: Hoare triple {32036#(<= main_~i~0 5)} assume true; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {32036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {32036#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {32036#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {32037#(<= main_~i~0 6)} assume true; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {32037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {32037#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {32037#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {32038#(<= main_~i~0 7)} assume true; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {32038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {32038#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {32038#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {32039#(<= main_~i~0 8)} assume true; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {32039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {32039#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {32039#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {32040#(<= main_~i~0 9)} assume true; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {32040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {32040#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {32040#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {32041#(<= main_~i~0 10)} assume true; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {32041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {32041#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {32041#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {32042#(<= main_~i~0 11)} assume true; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {32042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {32042#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {32042#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {32043#(<= main_~i~0 12)} assume true; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {32043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {32043#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {32043#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {32044#(<= main_~i~0 13)} assume true; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {32044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {32044#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {32044#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {32045#(<= main_~i~0 14)} assume true; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {32045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {32045#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {32045#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {32046#(<= main_~i~0 15)} assume true; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {32046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {32046#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {32046#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {32047#(<= main_~i~0 16)} assume true; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {32047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {32047#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {32047#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,250 INFO L273 TraceCheckUtils]: 72: Hoare triple {32048#(<= main_~i~0 17)} assume true; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,251 INFO L273 TraceCheckUtils]: 73: Hoare triple {32048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {32048#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,252 INFO L273 TraceCheckUtils]: 75: Hoare triple {32048#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {32049#(<= main_~i~0 18)} assume true; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,253 INFO L273 TraceCheckUtils]: 77: Hoare triple {32049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {32049#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,254 INFO L273 TraceCheckUtils]: 79: Hoare triple {32049#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,255 INFO L273 TraceCheckUtils]: 80: Hoare triple {32050#(<= main_~i~0 19)} assume true; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,255 INFO L273 TraceCheckUtils]: 81: Hoare triple {32050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,256 INFO L273 TraceCheckUtils]: 82: Hoare triple {32050#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {32050#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,257 INFO L273 TraceCheckUtils]: 84: Hoare triple {32051#(<= main_~i~0 20)} assume true; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,257 INFO L273 TraceCheckUtils]: 85: Hoare triple {32051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,258 INFO L273 TraceCheckUtils]: 86: Hoare triple {32051#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,258 INFO L273 TraceCheckUtils]: 87: Hoare triple {32051#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {32052#(<= main_~i~0 21)} assume true; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,259 INFO L273 TraceCheckUtils]: 89: Hoare triple {32052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {32052#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {32052#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,261 INFO L273 TraceCheckUtils]: 92: Hoare triple {32053#(<= main_~i~0 22)} assume true; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,261 INFO L273 TraceCheckUtils]: 93: Hoare triple {32053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,262 INFO L273 TraceCheckUtils]: 94: Hoare triple {32053#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,263 INFO L273 TraceCheckUtils]: 95: Hoare triple {32053#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,263 INFO L273 TraceCheckUtils]: 96: Hoare triple {32054#(<= main_~i~0 23)} assume true; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,264 INFO L273 TraceCheckUtils]: 97: Hoare triple {32054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,264 INFO L273 TraceCheckUtils]: 98: Hoare triple {32054#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,265 INFO L273 TraceCheckUtils]: 99: Hoare triple {32054#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,265 INFO L273 TraceCheckUtils]: 100: Hoare triple {32055#(<= main_~i~0 24)} assume true; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,266 INFO L273 TraceCheckUtils]: 101: Hoare triple {32055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {32055#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,267 INFO L273 TraceCheckUtils]: 103: Hoare triple {32055#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,267 INFO L273 TraceCheckUtils]: 104: Hoare triple {32056#(<= main_~i~0 25)} assume true; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {32056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,268 INFO L273 TraceCheckUtils]: 106: Hoare triple {32056#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,269 INFO L273 TraceCheckUtils]: 107: Hoare triple {32056#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,269 INFO L273 TraceCheckUtils]: 108: Hoare triple {32057#(<= main_~i~0 26)} assume true; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,270 INFO L273 TraceCheckUtils]: 109: Hoare triple {32057#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,270 INFO L273 TraceCheckUtils]: 110: Hoare triple {32057#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,271 INFO L273 TraceCheckUtils]: 111: Hoare triple {32057#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,272 INFO L273 TraceCheckUtils]: 112: Hoare triple {32058#(<= main_~i~0 27)} assume true; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,272 INFO L273 TraceCheckUtils]: 113: Hoare triple {32058#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {32058#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,273 INFO L273 TraceCheckUtils]: 115: Hoare triple {32058#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,274 INFO L273 TraceCheckUtils]: 116: Hoare triple {32059#(<= main_~i~0 28)} assume true; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,274 INFO L273 TraceCheckUtils]: 117: Hoare triple {32059#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,275 INFO L273 TraceCheckUtils]: 118: Hoare triple {32059#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,275 INFO L273 TraceCheckUtils]: 119: Hoare triple {32059#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,276 INFO L273 TraceCheckUtils]: 120: Hoare triple {32060#(<= main_~i~0 29)} assume true; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,276 INFO L273 TraceCheckUtils]: 121: Hoare triple {32060#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,277 INFO L273 TraceCheckUtils]: 122: Hoare triple {32060#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,277 INFO L273 TraceCheckUtils]: 123: Hoare triple {32060#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {32061#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:20,278 INFO L273 TraceCheckUtils]: 124: Hoare triple {32061#(<= main_~i~0 30)} assume true; {32061#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:20,279 INFO L273 TraceCheckUtils]: 125: Hoare triple {32061#(<= main_~i~0 30)} assume !(~i~0 < 100000); {32031#false} is VALID [2018-11-14 18:39:20,279 INFO L273 TraceCheckUtils]: 126: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,279 INFO L273 TraceCheckUtils]: 127: Hoare triple {32031#false} assume !(~swapped~0 != 0); {32031#false} is VALID [2018-11-14 18:39:20,279 INFO L273 TraceCheckUtils]: 128: Hoare triple {32031#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {32031#false} is VALID [2018-11-14 18:39:20,279 INFO L273 TraceCheckUtils]: 129: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L273 TraceCheckUtils]: 130: Hoare triple {32031#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L273 TraceCheckUtils]: 131: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L273 TraceCheckUtils]: 132: Hoare triple {32031#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L256 TraceCheckUtils]: 133: Hoare triple {32031#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L273 TraceCheckUtils]: 134: Hoare triple {32031#false} ~cond := #in~cond; {32031#false} is VALID [2018-11-14 18:39:20,280 INFO L273 TraceCheckUtils]: 135: Hoare triple {32031#false} assume ~cond == 0; {32031#false} is VALID [2018-11-14 18:39:20,281 INFO L273 TraceCheckUtils]: 136: Hoare triple {32031#false} assume !false; {32031#false} is VALID [2018-11-14 18:39:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 2 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:20,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:20,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:20,301 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:39:20,414 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 18:39:20,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:20,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:20,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {32030#true} call ULTIMATE.init(); {32030#true} is VALID [2018-11-14 18:39:20,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {32030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32030#true} is VALID [2018-11-14 18:39:20,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {32030#true} assume true; {32030#true} is VALID [2018-11-14 18:39:20,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32030#true} {32030#true} #83#return; {32030#true} is VALID [2018-11-14 18:39:20,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {32030#true} call #t~ret8 := main(); {32030#true} is VALID [2018-11-14 18:39:20,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {32030#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {32030#true} is VALID [2018-11-14 18:39:20,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {32030#true} assume true; {32030#true} is VALID [2018-11-14 18:39:20,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {32030#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {32086#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:20,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {32086#(<= main_~i~0 1)} assume true; {32086#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:20,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {32086#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32086#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:20,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {32086#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32086#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:20,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {32086#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {32033#(<= main_~i~0 2)} assume true; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {32033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {32033#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32033#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:20,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {32033#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {32034#(<= main_~i~0 3)} assume true; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {32034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {32034#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32034#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:20,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {32034#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {32035#(<= main_~i~0 4)} assume true; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,702 INFO L273 TraceCheckUtils]: 21: Hoare triple {32035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {32035#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32035#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:20,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {32035#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {32036#(<= main_~i~0 5)} assume true; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {32036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {32036#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32036#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:20,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {32036#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {32037#(<= main_~i~0 6)} assume true; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {32037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {32037#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32037#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:20,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {32037#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {32038#(<= main_~i~0 7)} assume true; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,709 INFO L273 TraceCheckUtils]: 33: Hoare triple {32038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {32038#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32038#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:20,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {32038#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {32039#(<= main_~i~0 8)} assume true; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {32039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {32039#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32039#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:20,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {32039#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {32040#(<= main_~i~0 9)} assume true; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {32040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {32040#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32040#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:20,714 INFO L273 TraceCheckUtils]: 43: Hoare triple {32040#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {32041#(<= main_~i~0 10)} assume true; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {32041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {32041#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32041#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:20,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {32041#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {32042#(<= main_~i~0 11)} assume true; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {32042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {32042#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32042#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:20,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {32042#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,719 INFO L273 TraceCheckUtils]: 52: Hoare triple {32043#(<= main_~i~0 12)} assume true; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,719 INFO L273 TraceCheckUtils]: 53: Hoare triple {32043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {32043#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32043#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:20,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {32043#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,721 INFO L273 TraceCheckUtils]: 56: Hoare triple {32044#(<= main_~i~0 13)} assume true; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,721 INFO L273 TraceCheckUtils]: 57: Hoare triple {32044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {32044#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32044#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:20,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {32044#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {32045#(<= main_~i~0 14)} assume true; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {32045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {32045#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32045#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:20,725 INFO L273 TraceCheckUtils]: 63: Hoare triple {32045#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,725 INFO L273 TraceCheckUtils]: 64: Hoare triple {32046#(<= main_~i~0 15)} assume true; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,725 INFO L273 TraceCheckUtils]: 65: Hoare triple {32046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,726 INFO L273 TraceCheckUtils]: 66: Hoare triple {32046#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32046#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:20,727 INFO L273 TraceCheckUtils]: 67: Hoare triple {32046#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {32047#(<= main_~i~0 16)} assume true; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,728 INFO L273 TraceCheckUtils]: 69: Hoare triple {32047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {32047#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32047#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:20,729 INFO L273 TraceCheckUtils]: 71: Hoare triple {32047#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {32048#(<= main_~i~0 17)} assume true; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,730 INFO L273 TraceCheckUtils]: 73: Hoare triple {32048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,730 INFO L273 TraceCheckUtils]: 74: Hoare triple {32048#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32048#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:20,731 INFO L273 TraceCheckUtils]: 75: Hoare triple {32048#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,731 INFO L273 TraceCheckUtils]: 76: Hoare triple {32049#(<= main_~i~0 18)} assume true; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,732 INFO L273 TraceCheckUtils]: 77: Hoare triple {32049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,732 INFO L273 TraceCheckUtils]: 78: Hoare triple {32049#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32049#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:20,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {32049#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {32050#(<= main_~i~0 19)} assume true; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {32050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {32050#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32050#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:20,735 INFO L273 TraceCheckUtils]: 83: Hoare triple {32050#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {32051#(<= main_~i~0 20)} assume true; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {32051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {32051#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32051#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:20,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {32051#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,738 INFO L273 TraceCheckUtils]: 88: Hoare triple {32052#(<= main_~i~0 21)} assume true; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {32052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,739 INFO L273 TraceCheckUtils]: 90: Hoare triple {32052#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32052#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:20,739 INFO L273 TraceCheckUtils]: 91: Hoare triple {32052#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,740 INFO L273 TraceCheckUtils]: 92: Hoare triple {32053#(<= main_~i~0 22)} assume true; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,740 INFO L273 TraceCheckUtils]: 93: Hoare triple {32053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,741 INFO L273 TraceCheckUtils]: 94: Hoare triple {32053#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32053#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:20,741 INFO L273 TraceCheckUtils]: 95: Hoare triple {32053#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,742 INFO L273 TraceCheckUtils]: 96: Hoare triple {32054#(<= main_~i~0 23)} assume true; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,742 INFO L273 TraceCheckUtils]: 97: Hoare triple {32054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,743 INFO L273 TraceCheckUtils]: 98: Hoare triple {32054#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32054#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:20,743 INFO L273 TraceCheckUtils]: 99: Hoare triple {32054#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,744 INFO L273 TraceCheckUtils]: 100: Hoare triple {32055#(<= main_~i~0 24)} assume true; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {32055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,745 INFO L273 TraceCheckUtils]: 102: Hoare triple {32055#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32055#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:20,745 INFO L273 TraceCheckUtils]: 103: Hoare triple {32055#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,746 INFO L273 TraceCheckUtils]: 104: Hoare triple {32056#(<= main_~i~0 25)} assume true; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,746 INFO L273 TraceCheckUtils]: 105: Hoare triple {32056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,747 INFO L273 TraceCheckUtils]: 106: Hoare triple {32056#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32056#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:20,748 INFO L273 TraceCheckUtils]: 107: Hoare triple {32056#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {32057#(<= main_~i~0 26)} assume true; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,749 INFO L273 TraceCheckUtils]: 109: Hoare triple {32057#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,749 INFO L273 TraceCheckUtils]: 110: Hoare triple {32057#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32057#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:20,750 INFO L273 TraceCheckUtils]: 111: Hoare triple {32057#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,750 INFO L273 TraceCheckUtils]: 112: Hoare triple {32058#(<= main_~i~0 27)} assume true; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,751 INFO L273 TraceCheckUtils]: 113: Hoare triple {32058#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,751 INFO L273 TraceCheckUtils]: 114: Hoare triple {32058#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32058#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:20,752 INFO L273 TraceCheckUtils]: 115: Hoare triple {32058#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,752 INFO L273 TraceCheckUtils]: 116: Hoare triple {32059#(<= main_~i~0 28)} assume true; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,753 INFO L273 TraceCheckUtils]: 117: Hoare triple {32059#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,753 INFO L273 TraceCheckUtils]: 118: Hoare triple {32059#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32059#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:20,754 INFO L273 TraceCheckUtils]: 119: Hoare triple {32059#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,754 INFO L273 TraceCheckUtils]: 120: Hoare triple {32060#(<= main_~i~0 29)} assume true; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,755 INFO L273 TraceCheckUtils]: 121: Hoare triple {32060#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,755 INFO L273 TraceCheckUtils]: 122: Hoare triple {32060#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32060#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:20,756 INFO L273 TraceCheckUtils]: 123: Hoare triple {32060#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {32061#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:20,756 INFO L273 TraceCheckUtils]: 124: Hoare triple {32061#(<= main_~i~0 30)} assume true; {32061#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:20,757 INFO L273 TraceCheckUtils]: 125: Hoare triple {32061#(<= main_~i~0 30)} assume !(~i~0 < 100000); {32031#false} is VALID [2018-11-14 18:39:20,757 INFO L273 TraceCheckUtils]: 126: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,757 INFO L273 TraceCheckUtils]: 127: Hoare triple {32031#false} assume !(~swapped~0 != 0); {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L273 TraceCheckUtils]: 128: Hoare triple {32031#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L273 TraceCheckUtils]: 129: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L273 TraceCheckUtils]: 130: Hoare triple {32031#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L273 TraceCheckUtils]: 131: Hoare triple {32031#false} assume true; {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L273 TraceCheckUtils]: 132: Hoare triple {32031#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {32031#false} is VALID [2018-11-14 18:39:20,758 INFO L256 TraceCheckUtils]: 133: Hoare triple {32031#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {32031#false} is VALID [2018-11-14 18:39:20,759 INFO L273 TraceCheckUtils]: 134: Hoare triple {32031#false} ~cond := #in~cond; {32031#false} is VALID [2018-11-14 18:39:20,759 INFO L273 TraceCheckUtils]: 135: Hoare triple {32031#false} assume ~cond == 0; {32031#false} is VALID [2018-11-14 18:39:20,759 INFO L273 TraceCheckUtils]: 136: Hoare triple {32031#false} assume !false; {32031#false} is VALID [2018-11-14 18:39:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 2 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:20,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:20,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 18:39:20,792 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 137 [2018-11-14 18:39:20,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:20,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 18:39:20,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:20,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 18:39:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 18:39:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:39:20,917 INFO L87 Difference]: Start difference. First operand 258 states and 319 transitions. Second operand 33 states. [2018-11-14 18:39:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:21,819 INFO L93 Difference]: Finished difference Result 522 states and 650 transitions. [2018-11-14 18:39:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:39:21,819 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 137 [2018-11-14 18:39:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:39:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 207 transitions. [2018-11-14 18:39:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:39:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 207 transitions. [2018-11-14 18:39:21,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 207 transitions. [2018-11-14 18:39:22,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:22,021 INFO L225 Difference]: With dead ends: 522 [2018-11-14 18:39:22,021 INFO L226 Difference]: Without dead ends: 270 [2018-11-14 18:39:22,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:39:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-14 18:39:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2018-11-14 18:39:22,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:22,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand 266 states. [2018-11-14 18:39:22,107 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 266 states. [2018-11-14 18:39:22,107 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 266 states. [2018-11-14 18:39:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:22,113 INFO L93 Difference]: Finished difference Result 270 states and 335 transitions. [2018-11-14 18:39:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 335 transitions. [2018-11-14 18:39:22,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:22,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:22,113 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 270 states. [2018-11-14 18:39:22,113 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 270 states. [2018-11-14 18:39:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:22,119 INFO L93 Difference]: Finished difference Result 270 states and 335 transitions. [2018-11-14 18:39:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 335 transitions. [2018-11-14 18:39:22,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:22,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:22,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:22,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-14 18:39:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 329 transitions. [2018-11-14 18:39:22,126 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 329 transitions. Word has length 137 [2018-11-14 18:39:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:22,126 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 329 transitions. [2018-11-14 18:39:22,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 18:39:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 329 transitions. [2018-11-14 18:39:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-14 18:39:22,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:22,127 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:22,127 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:22,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1994844844, now seen corresponding path program 30 times [2018-11-14 18:39:22,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:22,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:22,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {34008#true} call ULTIMATE.init(); {34008#true} is VALID [2018-11-14 18:39:22,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {34008#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34008#true} is VALID [2018-11-14 18:39:22,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {34008#true} assume true; {34008#true} is VALID [2018-11-14 18:39:22,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34008#true} {34008#true} #83#return; {34008#true} is VALID [2018-11-14 18:39:22,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {34008#true} call #t~ret8 := main(); {34008#true} is VALID [2018-11-14 18:39:22,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {34008#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {34008#true} is VALID [2018-11-14 18:39:22,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {34008#true} assume true; {34008#true} is VALID [2018-11-14 18:39:22,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {34008#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {34010#(= main_~i~0 1)} is VALID [2018-11-14 18:39:22,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {34010#(= main_~i~0 1)} assume true; {34010#(= main_~i~0 1)} is VALID [2018-11-14 18:39:22,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {34010#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34010#(= main_~i~0 1)} is VALID [2018-11-14 18:39:22,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {34010#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34010#(= main_~i~0 1)} is VALID [2018-11-14 18:39:22,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {34010#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:22,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {34011#(<= main_~i~0 2)} assume true; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:22,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {34011#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:22,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {34011#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:22,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {34011#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:22,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {34012#(<= main_~i~0 3)} assume true; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:22,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {34012#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:22,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {34012#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:22,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {34012#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:22,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {34013#(<= main_~i~0 4)} assume true; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:22,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {34013#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:22,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {34013#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:22,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {34013#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:22,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {34014#(<= main_~i~0 5)} assume true; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:22,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {34014#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:22,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {34014#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:22,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {34014#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:22,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {34015#(<= main_~i~0 6)} assume true; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:22,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {34015#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:22,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {34015#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:22,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {34015#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:22,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {34016#(<= main_~i~0 7)} assume true; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:22,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {34016#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:22,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {34016#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:22,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {34016#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:22,989 INFO L273 TraceCheckUtils]: 36: Hoare triple {34017#(<= main_~i~0 8)} assume true; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:22,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {34017#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:22,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {34017#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:22,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {34017#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:22,991 INFO L273 TraceCheckUtils]: 40: Hoare triple {34018#(<= main_~i~0 9)} assume true; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:22,992 INFO L273 TraceCheckUtils]: 41: Hoare triple {34018#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:22,992 INFO L273 TraceCheckUtils]: 42: Hoare triple {34018#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:22,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {34018#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:22,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {34019#(<= main_~i~0 10)} assume true; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:22,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {34019#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:22,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {34019#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:22,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {34019#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:22,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {34020#(<= main_~i~0 11)} assume true; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:22,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {34020#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:22,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {34020#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:22,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {34020#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:22,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {34021#(<= main_~i~0 12)} assume true; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:22,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {34021#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:22,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {34021#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:23,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {34021#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {34022#(<= main_~i~0 13)} assume true; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {34022#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {34022#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {34022#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {34023#(<= main_~i~0 14)} assume true; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {34023#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {34023#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,004 INFO L273 TraceCheckUtils]: 63: Hoare triple {34023#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {34024#(<= main_~i~0 15)} assume true; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,005 INFO L273 TraceCheckUtils]: 65: Hoare triple {34024#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {34024#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,006 INFO L273 TraceCheckUtils]: 67: Hoare triple {34024#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {34025#(<= main_~i~0 16)} assume true; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,007 INFO L273 TraceCheckUtils]: 69: Hoare triple {34025#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {34025#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {34025#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,009 INFO L273 TraceCheckUtils]: 72: Hoare triple {34026#(<= main_~i~0 17)} assume true; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {34026#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,010 INFO L273 TraceCheckUtils]: 74: Hoare triple {34026#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {34026#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,011 INFO L273 TraceCheckUtils]: 76: Hoare triple {34027#(<= main_~i~0 18)} assume true; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {34027#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,012 INFO L273 TraceCheckUtils]: 78: Hoare triple {34027#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {34027#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {34028#(<= main_~i~0 19)} assume true; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,014 INFO L273 TraceCheckUtils]: 81: Hoare triple {34028#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {34028#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,015 INFO L273 TraceCheckUtils]: 83: Hoare triple {34028#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,016 INFO L273 TraceCheckUtils]: 84: Hoare triple {34029#(<= main_~i~0 20)} assume true; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,016 INFO L273 TraceCheckUtils]: 85: Hoare triple {34029#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {34029#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,017 INFO L273 TraceCheckUtils]: 87: Hoare triple {34029#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {34030#(<= main_~i~0 21)} assume true; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,019 INFO L273 TraceCheckUtils]: 89: Hoare triple {34030#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,019 INFO L273 TraceCheckUtils]: 90: Hoare triple {34030#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,020 INFO L273 TraceCheckUtils]: 91: Hoare triple {34030#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,020 INFO L273 TraceCheckUtils]: 92: Hoare triple {34031#(<= main_~i~0 22)} assume true; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {34031#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,021 INFO L273 TraceCheckUtils]: 94: Hoare triple {34031#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,022 INFO L273 TraceCheckUtils]: 95: Hoare triple {34031#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,022 INFO L273 TraceCheckUtils]: 96: Hoare triple {34032#(<= main_~i~0 23)} assume true; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,023 INFO L273 TraceCheckUtils]: 97: Hoare triple {34032#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,023 INFO L273 TraceCheckUtils]: 98: Hoare triple {34032#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,024 INFO L273 TraceCheckUtils]: 99: Hoare triple {34032#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,025 INFO L273 TraceCheckUtils]: 100: Hoare triple {34033#(<= main_~i~0 24)} assume true; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {34033#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,026 INFO L273 TraceCheckUtils]: 102: Hoare triple {34033#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,026 INFO L273 TraceCheckUtils]: 103: Hoare triple {34033#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,027 INFO L273 TraceCheckUtils]: 104: Hoare triple {34034#(<= main_~i~0 25)} assume true; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,027 INFO L273 TraceCheckUtils]: 105: Hoare triple {34034#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,028 INFO L273 TraceCheckUtils]: 106: Hoare triple {34034#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,029 INFO L273 TraceCheckUtils]: 107: Hoare triple {34034#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,029 INFO L273 TraceCheckUtils]: 108: Hoare triple {34035#(<= main_~i~0 26)} assume true; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,030 INFO L273 TraceCheckUtils]: 109: Hoare triple {34035#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,030 INFO L273 TraceCheckUtils]: 110: Hoare triple {34035#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,031 INFO L273 TraceCheckUtils]: 111: Hoare triple {34035#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,031 INFO L273 TraceCheckUtils]: 112: Hoare triple {34036#(<= main_~i~0 27)} assume true; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,032 INFO L273 TraceCheckUtils]: 113: Hoare triple {34036#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,032 INFO L273 TraceCheckUtils]: 114: Hoare triple {34036#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,033 INFO L273 TraceCheckUtils]: 115: Hoare triple {34036#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,034 INFO L273 TraceCheckUtils]: 116: Hoare triple {34037#(<= main_~i~0 28)} assume true; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,034 INFO L273 TraceCheckUtils]: 117: Hoare triple {34037#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,035 INFO L273 TraceCheckUtils]: 118: Hoare triple {34037#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,035 INFO L273 TraceCheckUtils]: 119: Hoare triple {34037#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,036 INFO L273 TraceCheckUtils]: 120: Hoare triple {34038#(<= main_~i~0 29)} assume true; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,036 INFO L273 TraceCheckUtils]: 121: Hoare triple {34038#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,037 INFO L273 TraceCheckUtils]: 122: Hoare triple {34038#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,037 INFO L273 TraceCheckUtils]: 123: Hoare triple {34038#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,038 INFO L273 TraceCheckUtils]: 124: Hoare triple {34039#(<= main_~i~0 30)} assume true; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,038 INFO L273 TraceCheckUtils]: 125: Hoare triple {34039#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,039 INFO L273 TraceCheckUtils]: 126: Hoare triple {34039#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,040 INFO L273 TraceCheckUtils]: 127: Hoare triple {34039#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {34040#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:23,040 INFO L273 TraceCheckUtils]: 128: Hoare triple {34040#(<= main_~i~0 31)} assume true; {34040#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:23,041 INFO L273 TraceCheckUtils]: 129: Hoare triple {34040#(<= main_~i~0 31)} assume !(~i~0 < 100000); {34009#false} is VALID [2018-11-14 18:39:23,041 INFO L273 TraceCheckUtils]: 130: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,041 INFO L273 TraceCheckUtils]: 131: Hoare triple {34009#false} assume !(~swapped~0 != 0); {34009#false} is VALID [2018-11-14 18:39:23,041 INFO L273 TraceCheckUtils]: 132: Hoare triple {34009#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {34009#false} is VALID [2018-11-14 18:39:23,042 INFO L273 TraceCheckUtils]: 133: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,042 INFO L273 TraceCheckUtils]: 134: Hoare triple {34009#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {34009#false} is VALID [2018-11-14 18:39:23,042 INFO L273 TraceCheckUtils]: 135: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,042 INFO L273 TraceCheckUtils]: 136: Hoare triple {34009#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {34009#false} is VALID [2018-11-14 18:39:23,042 INFO L256 TraceCheckUtils]: 137: Hoare triple {34009#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {34009#false} is VALID [2018-11-14 18:39:23,043 INFO L273 TraceCheckUtils]: 138: Hoare triple {34009#false} ~cond := #in~cond; {34009#false} is VALID [2018-11-14 18:39:23,043 INFO L273 TraceCheckUtils]: 139: Hoare triple {34009#false} assume ~cond == 0; {34009#false} is VALID [2018-11-14 18:39:23,043 INFO L273 TraceCheckUtils]: 140: Hoare triple {34009#false} assume !false; {34009#false} is VALID [2018-11-14 18:39:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 2 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:23,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:23,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:23,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:39:23,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-11-14 18:39:23,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:23,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:23,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {34008#true} call ULTIMATE.init(); {34008#true} is VALID [2018-11-14 18:39:23,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {34008#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34008#true} is VALID [2018-11-14 18:39:23,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {34008#true} assume true; {34008#true} is VALID [2018-11-14 18:39:23,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34008#true} {34008#true} #83#return; {34008#true} is VALID [2018-11-14 18:39:23,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {34008#true} call #t~ret8 := main(); {34008#true} is VALID [2018-11-14 18:39:23,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {34008#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {34008#true} is VALID [2018-11-14 18:39:23,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {34008#true} assume true; {34008#true} is VALID [2018-11-14 18:39:23,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {34008#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {34065#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:23,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {34065#(<= main_~i~0 1)} assume true; {34065#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:23,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {34065#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34065#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:23,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {34065#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34065#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:23,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {34065#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:23,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {34011#(<= main_~i~0 2)} assume true; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:23,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {34011#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:23,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {34011#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34011#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:23,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {34011#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:23,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {34012#(<= main_~i~0 3)} assume true; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:23,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {34012#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:23,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {34012#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34012#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:23,463 INFO L273 TraceCheckUtils]: 19: Hoare triple {34012#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:23,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {34013#(<= main_~i~0 4)} assume true; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:23,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {34013#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:23,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {34013#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34013#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:23,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {34013#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:23,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {34014#(<= main_~i~0 5)} assume true; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:23,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {34014#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:23,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {34014#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34014#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:23,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {34014#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:23,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {34015#(<= main_~i~0 6)} assume true; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:23,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {34015#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:23,469 INFO L273 TraceCheckUtils]: 30: Hoare triple {34015#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34015#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:23,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {34015#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:23,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {34016#(<= main_~i~0 7)} assume true; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:23,471 INFO L273 TraceCheckUtils]: 33: Hoare triple {34016#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:23,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {34016#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34016#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:23,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {34016#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:23,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {34017#(<= main_~i~0 8)} assume true; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:23,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {34017#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:23,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {34017#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34017#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:23,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {34017#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:23,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {34018#(<= main_~i~0 9)} assume true; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:23,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {34018#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:23,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {34018#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34018#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:23,477 INFO L273 TraceCheckUtils]: 43: Hoare triple {34018#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:23,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {34019#(<= main_~i~0 10)} assume true; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:23,478 INFO L273 TraceCheckUtils]: 45: Hoare triple {34019#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:23,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {34019#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34019#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:23,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {34019#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:23,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {34020#(<= main_~i~0 11)} assume true; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:23,480 INFO L273 TraceCheckUtils]: 49: Hoare triple {34020#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:23,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {34020#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34020#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:23,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {34020#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:23,482 INFO L273 TraceCheckUtils]: 52: Hoare triple {34021#(<= main_~i~0 12)} assume true; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:23,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {34021#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:23,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {34021#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34021#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:23,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {34021#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,484 INFO L273 TraceCheckUtils]: 56: Hoare triple {34022#(<= main_~i~0 13)} assume true; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {34022#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {34022#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34022#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:23,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {34022#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {34023#(<= main_~i~0 14)} assume true; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {34023#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {34023#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34023#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:23,488 INFO L273 TraceCheckUtils]: 63: Hoare triple {34023#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {34024#(<= main_~i~0 15)} assume true; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,489 INFO L273 TraceCheckUtils]: 65: Hoare triple {34024#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {34024#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34024#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:23,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {34024#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,491 INFO L273 TraceCheckUtils]: 68: Hoare triple {34025#(<= main_~i~0 16)} assume true; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {34025#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,492 INFO L273 TraceCheckUtils]: 70: Hoare triple {34025#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34025#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:23,492 INFO L273 TraceCheckUtils]: 71: Hoare triple {34025#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,493 INFO L273 TraceCheckUtils]: 72: Hoare triple {34026#(<= main_~i~0 17)} assume true; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,493 INFO L273 TraceCheckUtils]: 73: Hoare triple {34026#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,494 INFO L273 TraceCheckUtils]: 74: Hoare triple {34026#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34026#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:23,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {34026#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {34027#(<= main_~i~0 18)} assume true; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,496 INFO L273 TraceCheckUtils]: 77: Hoare triple {34027#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,496 INFO L273 TraceCheckUtils]: 78: Hoare triple {34027#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34027#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:23,497 INFO L273 TraceCheckUtils]: 79: Hoare triple {34027#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,497 INFO L273 TraceCheckUtils]: 80: Hoare triple {34028#(<= main_~i~0 19)} assume true; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,498 INFO L273 TraceCheckUtils]: 81: Hoare triple {34028#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,498 INFO L273 TraceCheckUtils]: 82: Hoare triple {34028#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34028#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:23,499 INFO L273 TraceCheckUtils]: 83: Hoare triple {34028#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,500 INFO L273 TraceCheckUtils]: 84: Hoare triple {34029#(<= main_~i~0 20)} assume true; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,500 INFO L273 TraceCheckUtils]: 85: Hoare triple {34029#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,501 INFO L273 TraceCheckUtils]: 86: Hoare triple {34029#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34029#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:23,501 INFO L273 TraceCheckUtils]: 87: Hoare triple {34029#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,502 INFO L273 TraceCheckUtils]: 88: Hoare triple {34030#(<= main_~i~0 21)} assume true; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,502 INFO L273 TraceCheckUtils]: 89: Hoare triple {34030#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,503 INFO L273 TraceCheckUtils]: 90: Hoare triple {34030#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34030#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:23,504 INFO L273 TraceCheckUtils]: 91: Hoare triple {34030#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,504 INFO L273 TraceCheckUtils]: 92: Hoare triple {34031#(<= main_~i~0 22)} assume true; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,505 INFO L273 TraceCheckUtils]: 93: Hoare triple {34031#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,505 INFO L273 TraceCheckUtils]: 94: Hoare triple {34031#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34031#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:23,506 INFO L273 TraceCheckUtils]: 95: Hoare triple {34031#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,506 INFO L273 TraceCheckUtils]: 96: Hoare triple {34032#(<= main_~i~0 23)} assume true; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,507 INFO L273 TraceCheckUtils]: 97: Hoare triple {34032#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,507 INFO L273 TraceCheckUtils]: 98: Hoare triple {34032#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34032#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:23,508 INFO L273 TraceCheckUtils]: 99: Hoare triple {34032#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,509 INFO L273 TraceCheckUtils]: 100: Hoare triple {34033#(<= main_~i~0 24)} assume true; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,509 INFO L273 TraceCheckUtils]: 101: Hoare triple {34033#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,510 INFO L273 TraceCheckUtils]: 102: Hoare triple {34033#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34033#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:23,510 INFO L273 TraceCheckUtils]: 103: Hoare triple {34033#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,511 INFO L273 TraceCheckUtils]: 104: Hoare triple {34034#(<= main_~i~0 25)} assume true; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,511 INFO L273 TraceCheckUtils]: 105: Hoare triple {34034#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,512 INFO L273 TraceCheckUtils]: 106: Hoare triple {34034#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34034#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:23,512 INFO L273 TraceCheckUtils]: 107: Hoare triple {34034#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,513 INFO L273 TraceCheckUtils]: 108: Hoare triple {34035#(<= main_~i~0 26)} assume true; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,513 INFO L273 TraceCheckUtils]: 109: Hoare triple {34035#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,514 INFO L273 TraceCheckUtils]: 110: Hoare triple {34035#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34035#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:23,515 INFO L273 TraceCheckUtils]: 111: Hoare triple {34035#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,515 INFO L273 TraceCheckUtils]: 112: Hoare triple {34036#(<= main_~i~0 27)} assume true; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,516 INFO L273 TraceCheckUtils]: 113: Hoare triple {34036#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,516 INFO L273 TraceCheckUtils]: 114: Hoare triple {34036#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34036#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:23,517 INFO L273 TraceCheckUtils]: 115: Hoare triple {34036#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,517 INFO L273 TraceCheckUtils]: 116: Hoare triple {34037#(<= main_~i~0 28)} assume true; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,518 INFO L273 TraceCheckUtils]: 117: Hoare triple {34037#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,518 INFO L273 TraceCheckUtils]: 118: Hoare triple {34037#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34037#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:23,519 INFO L273 TraceCheckUtils]: 119: Hoare triple {34037#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,520 INFO L273 TraceCheckUtils]: 120: Hoare triple {34038#(<= main_~i~0 29)} assume true; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,520 INFO L273 TraceCheckUtils]: 121: Hoare triple {34038#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,521 INFO L273 TraceCheckUtils]: 122: Hoare triple {34038#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34038#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:23,521 INFO L273 TraceCheckUtils]: 123: Hoare triple {34038#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,522 INFO L273 TraceCheckUtils]: 124: Hoare triple {34039#(<= main_~i~0 30)} assume true; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,522 INFO L273 TraceCheckUtils]: 125: Hoare triple {34039#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,523 INFO L273 TraceCheckUtils]: 126: Hoare triple {34039#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {34039#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:23,524 INFO L273 TraceCheckUtils]: 127: Hoare triple {34039#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {34040#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:23,524 INFO L273 TraceCheckUtils]: 128: Hoare triple {34040#(<= main_~i~0 31)} assume true; {34040#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:23,525 INFO L273 TraceCheckUtils]: 129: Hoare triple {34040#(<= main_~i~0 31)} assume !(~i~0 < 100000); {34009#false} is VALID [2018-11-14 18:39:23,525 INFO L273 TraceCheckUtils]: 130: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,525 INFO L273 TraceCheckUtils]: 131: Hoare triple {34009#false} assume !(~swapped~0 != 0); {34009#false} is VALID [2018-11-14 18:39:23,525 INFO L273 TraceCheckUtils]: 132: Hoare triple {34009#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L273 TraceCheckUtils]: 133: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L273 TraceCheckUtils]: 134: Hoare triple {34009#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L273 TraceCheckUtils]: 135: Hoare triple {34009#false} assume true; {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L273 TraceCheckUtils]: 136: Hoare triple {34009#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L256 TraceCheckUtils]: 137: Hoare triple {34009#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {34009#false} is VALID [2018-11-14 18:39:23,526 INFO L273 TraceCheckUtils]: 138: Hoare triple {34009#false} ~cond := #in~cond; {34009#false} is VALID [2018-11-14 18:39:23,527 INFO L273 TraceCheckUtils]: 139: Hoare triple {34009#false} assume ~cond == 0; {34009#false} is VALID [2018-11-14 18:39:23,527 INFO L273 TraceCheckUtils]: 140: Hoare triple {34009#false} assume !false; {34009#false} is VALID [2018-11-14 18:39:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 2 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:23,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:23,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 18:39:23,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-11-14 18:39:23,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:23,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:39:23,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:23,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:39:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:39:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:39:23,695 INFO L87 Difference]: Start difference. First operand 266 states and 329 transitions. Second operand 34 states. [2018-11-14 18:39:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:24,805 INFO L93 Difference]: Finished difference Result 538 states and 670 transitions. [2018-11-14 18:39:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:39:24,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-11-14 18:39:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:39:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 212 transitions. [2018-11-14 18:39:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:39:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 212 transitions. [2018-11-14 18:39:24,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 212 transitions. [2018-11-14 18:39:25,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:25,021 INFO L225 Difference]: With dead ends: 538 [2018-11-14 18:39:25,021 INFO L226 Difference]: Without dead ends: 278 [2018-11-14 18:39:25,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:39:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-14 18:39:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2018-11-14 18:39:25,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:25,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand 274 states. [2018-11-14 18:39:25,122 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand 274 states. [2018-11-14 18:39:25,122 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 274 states. [2018-11-14 18:39:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:25,127 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2018-11-14 18:39:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 345 transitions. [2018-11-14 18:39:25,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:25,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:25,128 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 278 states. [2018-11-14 18:39:25,128 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 278 states. [2018-11-14 18:39:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:25,132 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2018-11-14 18:39:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 345 transitions. [2018-11-14 18:39:25,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:25,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:25,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:25,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-14 18:39:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 339 transitions. [2018-11-14 18:39:25,138 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 339 transitions. Word has length 141 [2018-11-14 18:39:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:25,138 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 339 transitions. [2018-11-14 18:39:25,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:39:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 339 transitions. [2018-11-14 18:39:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-14 18:39:25,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:25,139 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:25,140 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:25,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2111501740, now seen corresponding path program 31 times [2018-11-14 18:39:25,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:25,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:25,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:25,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:25,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:25,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {36045#true} call ULTIMATE.init(); {36045#true} is VALID [2018-11-14 18:39:25,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {36045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36045#true} is VALID [2018-11-14 18:39:25,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {36045#true} assume true; {36045#true} is VALID [2018-11-14 18:39:25,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36045#true} {36045#true} #83#return; {36045#true} is VALID [2018-11-14 18:39:25,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {36045#true} call #t~ret8 := main(); {36045#true} is VALID [2018-11-14 18:39:25,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {36045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {36045#true} is VALID [2018-11-14 18:39:25,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {36045#true} assume true; {36045#true} is VALID [2018-11-14 18:39:25,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {36045#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {36047#(= main_~i~0 1)} is VALID [2018-11-14 18:39:25,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {36047#(= main_~i~0 1)} assume true; {36047#(= main_~i~0 1)} is VALID [2018-11-14 18:39:25,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {36047#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36047#(= main_~i~0 1)} is VALID [2018-11-14 18:39:25,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {36047#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36047#(= main_~i~0 1)} is VALID [2018-11-14 18:39:25,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {36047#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:25,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {36048#(<= main_~i~0 2)} assume true; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:25,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {36048#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:25,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {36048#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:25,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {36048#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:25,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {36049#(<= main_~i~0 3)} assume true; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:25,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {36049#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:25,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {36049#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:25,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {36049#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:25,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {36050#(<= main_~i~0 4)} assume true; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:25,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {36050#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:25,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {36050#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:25,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {36050#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:25,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {36051#(<= main_~i~0 5)} assume true; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:25,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {36051#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:25,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {36051#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:25,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {36051#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:25,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {36052#(<= main_~i~0 6)} assume true; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:25,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {36052#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:25,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {36052#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:25,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {36052#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:25,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {36053#(<= main_~i~0 7)} assume true; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:25,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {36053#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:25,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {36053#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:25,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {36053#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:25,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {36054#(<= main_~i~0 8)} assume true; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:25,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {36054#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:25,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {36054#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:25,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {36054#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:25,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {36055#(<= main_~i~0 9)} assume true; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:25,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {36055#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:25,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {36055#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:25,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {36055#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:25,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {36056#(<= main_~i~0 10)} assume true; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:25,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {36056#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:25,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {36056#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:25,855 INFO L273 TraceCheckUtils]: 47: Hoare triple {36056#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:25,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {36057#(<= main_~i~0 11)} assume true; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:25,856 INFO L273 TraceCheckUtils]: 49: Hoare triple {36057#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:25,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {36057#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:25,857 INFO L273 TraceCheckUtils]: 51: Hoare triple {36057#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:25,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {36058#(<= main_~i~0 12)} assume true; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:25,858 INFO L273 TraceCheckUtils]: 53: Hoare triple {36058#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:25,859 INFO L273 TraceCheckUtils]: 54: Hoare triple {36058#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:25,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {36058#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:25,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {36059#(<= main_~i~0 13)} assume true; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:25,861 INFO L273 TraceCheckUtils]: 57: Hoare triple {36059#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:25,861 INFO L273 TraceCheckUtils]: 58: Hoare triple {36059#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:25,862 INFO L273 TraceCheckUtils]: 59: Hoare triple {36059#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:25,862 INFO L273 TraceCheckUtils]: 60: Hoare triple {36060#(<= main_~i~0 14)} assume true; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:25,863 INFO L273 TraceCheckUtils]: 61: Hoare triple {36060#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:25,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {36060#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:25,864 INFO L273 TraceCheckUtils]: 63: Hoare triple {36060#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:25,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {36061#(<= main_~i~0 15)} assume true; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:25,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {36061#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:25,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {36061#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:25,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {36061#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:25,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {36062#(<= main_~i~0 16)} assume true; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:25,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {36062#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:25,869 INFO L273 TraceCheckUtils]: 70: Hoare triple {36062#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:25,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {36062#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:25,870 INFO L273 TraceCheckUtils]: 72: Hoare triple {36063#(<= main_~i~0 17)} assume true; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:25,871 INFO L273 TraceCheckUtils]: 73: Hoare triple {36063#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:25,871 INFO L273 TraceCheckUtils]: 74: Hoare triple {36063#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:25,872 INFO L273 TraceCheckUtils]: 75: Hoare triple {36063#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:25,873 INFO L273 TraceCheckUtils]: 76: Hoare triple {36064#(<= main_~i~0 18)} assume true; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:25,873 INFO L273 TraceCheckUtils]: 77: Hoare triple {36064#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:25,874 INFO L273 TraceCheckUtils]: 78: Hoare triple {36064#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:25,875 INFO L273 TraceCheckUtils]: 79: Hoare triple {36064#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:25,876 INFO L273 TraceCheckUtils]: 80: Hoare triple {36065#(<= main_~i~0 19)} assume true; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:25,876 INFO L273 TraceCheckUtils]: 81: Hoare triple {36065#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:25,877 INFO L273 TraceCheckUtils]: 82: Hoare triple {36065#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:25,878 INFO L273 TraceCheckUtils]: 83: Hoare triple {36065#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:25,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {36066#(<= main_~i~0 20)} assume true; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:25,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {36066#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:25,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {36066#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:25,880 INFO L273 TraceCheckUtils]: 87: Hoare triple {36066#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:25,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {36067#(<= main_~i~0 21)} assume true; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:25,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {36067#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:25,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {36067#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:25,883 INFO L273 TraceCheckUtils]: 91: Hoare triple {36067#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:25,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {36068#(<= main_~i~0 22)} assume true; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:25,884 INFO L273 TraceCheckUtils]: 93: Hoare triple {36068#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:25,885 INFO L273 TraceCheckUtils]: 94: Hoare triple {36068#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:25,885 INFO L273 TraceCheckUtils]: 95: Hoare triple {36068#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:25,886 INFO L273 TraceCheckUtils]: 96: Hoare triple {36069#(<= main_~i~0 23)} assume true; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:25,887 INFO L273 TraceCheckUtils]: 97: Hoare triple {36069#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:25,887 INFO L273 TraceCheckUtils]: 98: Hoare triple {36069#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:25,888 INFO L273 TraceCheckUtils]: 99: Hoare triple {36069#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:25,889 INFO L273 TraceCheckUtils]: 100: Hoare triple {36070#(<= main_~i~0 24)} assume true; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:25,889 INFO L273 TraceCheckUtils]: 101: Hoare triple {36070#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:25,890 INFO L273 TraceCheckUtils]: 102: Hoare triple {36070#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:25,891 INFO L273 TraceCheckUtils]: 103: Hoare triple {36070#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:25,891 INFO L273 TraceCheckUtils]: 104: Hoare triple {36071#(<= main_~i~0 25)} assume true; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:25,892 INFO L273 TraceCheckUtils]: 105: Hoare triple {36071#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:25,892 INFO L273 TraceCheckUtils]: 106: Hoare triple {36071#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:25,893 INFO L273 TraceCheckUtils]: 107: Hoare triple {36071#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:25,894 INFO L273 TraceCheckUtils]: 108: Hoare triple {36072#(<= main_~i~0 26)} assume true; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:25,894 INFO L273 TraceCheckUtils]: 109: Hoare triple {36072#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:25,895 INFO L273 TraceCheckUtils]: 110: Hoare triple {36072#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:25,896 INFO L273 TraceCheckUtils]: 111: Hoare triple {36072#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:25,897 INFO L273 TraceCheckUtils]: 112: Hoare triple {36073#(<= main_~i~0 27)} assume true; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:25,897 INFO L273 TraceCheckUtils]: 113: Hoare triple {36073#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:25,898 INFO L273 TraceCheckUtils]: 114: Hoare triple {36073#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:25,899 INFO L273 TraceCheckUtils]: 115: Hoare triple {36073#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:25,899 INFO L273 TraceCheckUtils]: 116: Hoare triple {36074#(<= main_~i~0 28)} assume true; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:25,900 INFO L273 TraceCheckUtils]: 117: Hoare triple {36074#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:25,900 INFO L273 TraceCheckUtils]: 118: Hoare triple {36074#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:25,901 INFO L273 TraceCheckUtils]: 119: Hoare triple {36074#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:25,902 INFO L273 TraceCheckUtils]: 120: Hoare triple {36075#(<= main_~i~0 29)} assume true; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:25,902 INFO L273 TraceCheckUtils]: 121: Hoare triple {36075#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:25,903 INFO L273 TraceCheckUtils]: 122: Hoare triple {36075#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:25,904 INFO L273 TraceCheckUtils]: 123: Hoare triple {36075#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:25,904 INFO L273 TraceCheckUtils]: 124: Hoare triple {36076#(<= main_~i~0 30)} assume true; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:25,905 INFO L273 TraceCheckUtils]: 125: Hoare triple {36076#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:25,906 INFO L273 TraceCheckUtils]: 126: Hoare triple {36076#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:25,906 INFO L273 TraceCheckUtils]: 127: Hoare triple {36076#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:25,907 INFO L273 TraceCheckUtils]: 128: Hoare triple {36077#(<= main_~i~0 31)} assume true; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:25,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {36077#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:25,908 INFO L273 TraceCheckUtils]: 130: Hoare triple {36077#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:25,909 INFO L273 TraceCheckUtils]: 131: Hoare triple {36077#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {36078#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:25,910 INFO L273 TraceCheckUtils]: 132: Hoare triple {36078#(<= main_~i~0 32)} assume true; {36078#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:25,910 INFO L273 TraceCheckUtils]: 133: Hoare triple {36078#(<= main_~i~0 32)} assume !(~i~0 < 100000); {36046#false} is VALID [2018-11-14 18:39:25,911 INFO L273 TraceCheckUtils]: 134: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:25,911 INFO L273 TraceCheckUtils]: 135: Hoare triple {36046#false} assume !(~swapped~0 != 0); {36046#false} is VALID [2018-11-14 18:39:25,911 INFO L273 TraceCheckUtils]: 136: Hoare triple {36046#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {36046#false} is VALID [2018-11-14 18:39:25,911 INFO L273 TraceCheckUtils]: 137: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:25,912 INFO L273 TraceCheckUtils]: 138: Hoare triple {36046#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {36046#false} is VALID [2018-11-14 18:39:25,912 INFO L273 TraceCheckUtils]: 139: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:25,912 INFO L273 TraceCheckUtils]: 140: Hoare triple {36046#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {36046#false} is VALID [2018-11-14 18:39:25,912 INFO L256 TraceCheckUtils]: 141: Hoare triple {36046#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {36046#false} is VALID [2018-11-14 18:39:25,913 INFO L273 TraceCheckUtils]: 142: Hoare triple {36046#false} ~cond := #in~cond; {36046#false} is VALID [2018-11-14 18:39:25,913 INFO L273 TraceCheckUtils]: 143: Hoare triple {36046#false} assume ~cond == 0; {36046#false} is VALID [2018-11-14 18:39:25,913 INFO L273 TraceCheckUtils]: 144: Hoare triple {36046#false} assume !false; {36046#false} is VALID [2018-11-14 18:39:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 2 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:25,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:25,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:26,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:26,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {36045#true} call ULTIMATE.init(); {36045#true} is VALID [2018-11-14 18:39:26,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {36045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36045#true} is VALID [2018-11-14 18:39:26,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {36045#true} assume true; {36045#true} is VALID [2018-11-14 18:39:26,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36045#true} {36045#true} #83#return; {36045#true} is VALID [2018-11-14 18:39:26,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {36045#true} call #t~ret8 := main(); {36045#true} is VALID [2018-11-14 18:39:26,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {36045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {36045#true} is VALID [2018-11-14 18:39:26,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {36045#true} assume true; {36045#true} is VALID [2018-11-14 18:39:26,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {36045#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {36103#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:26,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {36103#(<= main_~i~0 1)} assume true; {36103#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:26,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {36103#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36103#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:26,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {36103#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36103#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:26,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {36103#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:26,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {36048#(<= main_~i~0 2)} assume true; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:26,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {36048#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:26,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {36048#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36048#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:26,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {36048#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:26,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {36049#(<= main_~i~0 3)} assume true; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:26,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {36049#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:26,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {36049#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36049#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:26,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {36049#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:26,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {36050#(<= main_~i~0 4)} assume true; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:26,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {36050#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:26,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {36050#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36050#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:26,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {36050#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:26,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {36051#(<= main_~i~0 5)} assume true; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:26,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {36051#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:26,364 INFO L273 TraceCheckUtils]: 26: Hoare triple {36051#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36051#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:26,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {36051#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:26,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {36052#(<= main_~i~0 6)} assume true; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:26,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {36052#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:26,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {36052#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36052#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:26,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {36052#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:26,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {36053#(<= main_~i~0 7)} assume true; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:26,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {36053#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:26,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {36053#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36053#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:26,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {36053#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:26,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {36054#(<= main_~i~0 8)} assume true; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:26,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {36054#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:26,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {36054#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36054#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:26,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {36054#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:26,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {36055#(<= main_~i~0 9)} assume true; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:26,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {36055#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:26,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {36055#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36055#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:26,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {36055#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:26,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {36056#(<= main_~i~0 10)} assume true; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:26,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {36056#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:26,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {36056#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36056#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:26,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {36056#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:26,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {36057#(<= main_~i~0 11)} assume true; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:26,377 INFO L273 TraceCheckUtils]: 49: Hoare triple {36057#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:26,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {36057#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36057#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:26,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {36057#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:26,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {36058#(<= main_~i~0 12)} assume true; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:26,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {36058#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:26,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {36058#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36058#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:26,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {36058#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:26,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {36059#(<= main_~i~0 13)} assume true; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:26,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {36059#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:26,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {36059#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36059#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:26,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {36059#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:26,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {36060#(<= main_~i~0 14)} assume true; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:26,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {36060#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:26,385 INFO L273 TraceCheckUtils]: 62: Hoare triple {36060#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36060#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:26,394 INFO L273 TraceCheckUtils]: 63: Hoare triple {36060#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:26,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {36061#(<= main_~i~0 15)} assume true; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:26,395 INFO L273 TraceCheckUtils]: 65: Hoare triple {36061#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:26,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {36061#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36061#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:26,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {36061#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:26,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {36062#(<= main_~i~0 16)} assume true; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:26,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {36062#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:26,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {36062#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36062#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:26,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {36062#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:26,398 INFO L273 TraceCheckUtils]: 72: Hoare triple {36063#(<= main_~i~0 17)} assume true; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:26,398 INFO L273 TraceCheckUtils]: 73: Hoare triple {36063#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:26,398 INFO L273 TraceCheckUtils]: 74: Hoare triple {36063#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36063#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:26,399 INFO L273 TraceCheckUtils]: 75: Hoare triple {36063#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:26,399 INFO L273 TraceCheckUtils]: 76: Hoare triple {36064#(<= main_~i~0 18)} assume true; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:26,399 INFO L273 TraceCheckUtils]: 77: Hoare triple {36064#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:26,400 INFO L273 TraceCheckUtils]: 78: Hoare triple {36064#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36064#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:26,401 INFO L273 TraceCheckUtils]: 79: Hoare triple {36064#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:26,401 INFO L273 TraceCheckUtils]: 80: Hoare triple {36065#(<= main_~i~0 19)} assume true; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:26,401 INFO L273 TraceCheckUtils]: 81: Hoare triple {36065#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:26,402 INFO L273 TraceCheckUtils]: 82: Hoare triple {36065#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36065#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:26,403 INFO L273 TraceCheckUtils]: 83: Hoare triple {36065#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:26,403 INFO L273 TraceCheckUtils]: 84: Hoare triple {36066#(<= main_~i~0 20)} assume true; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:26,404 INFO L273 TraceCheckUtils]: 85: Hoare triple {36066#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:26,404 INFO L273 TraceCheckUtils]: 86: Hoare triple {36066#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36066#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:26,405 INFO L273 TraceCheckUtils]: 87: Hoare triple {36066#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:26,405 INFO L273 TraceCheckUtils]: 88: Hoare triple {36067#(<= main_~i~0 21)} assume true; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:26,406 INFO L273 TraceCheckUtils]: 89: Hoare triple {36067#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:26,406 INFO L273 TraceCheckUtils]: 90: Hoare triple {36067#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36067#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:26,407 INFO L273 TraceCheckUtils]: 91: Hoare triple {36067#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:26,407 INFO L273 TraceCheckUtils]: 92: Hoare triple {36068#(<= main_~i~0 22)} assume true; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:26,408 INFO L273 TraceCheckUtils]: 93: Hoare triple {36068#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:26,408 INFO L273 TraceCheckUtils]: 94: Hoare triple {36068#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36068#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:26,409 INFO L273 TraceCheckUtils]: 95: Hoare triple {36068#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:26,410 INFO L273 TraceCheckUtils]: 96: Hoare triple {36069#(<= main_~i~0 23)} assume true; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:26,410 INFO L273 TraceCheckUtils]: 97: Hoare triple {36069#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:26,411 INFO L273 TraceCheckUtils]: 98: Hoare triple {36069#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36069#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:26,411 INFO L273 TraceCheckUtils]: 99: Hoare triple {36069#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:26,412 INFO L273 TraceCheckUtils]: 100: Hoare triple {36070#(<= main_~i~0 24)} assume true; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:26,412 INFO L273 TraceCheckUtils]: 101: Hoare triple {36070#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:26,413 INFO L273 TraceCheckUtils]: 102: Hoare triple {36070#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36070#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:26,413 INFO L273 TraceCheckUtils]: 103: Hoare triple {36070#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:26,414 INFO L273 TraceCheckUtils]: 104: Hoare triple {36071#(<= main_~i~0 25)} assume true; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:26,414 INFO L273 TraceCheckUtils]: 105: Hoare triple {36071#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:26,415 INFO L273 TraceCheckUtils]: 106: Hoare triple {36071#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36071#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:26,415 INFO L273 TraceCheckUtils]: 107: Hoare triple {36071#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:26,416 INFO L273 TraceCheckUtils]: 108: Hoare triple {36072#(<= main_~i~0 26)} assume true; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:26,416 INFO L273 TraceCheckUtils]: 109: Hoare triple {36072#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:26,417 INFO L273 TraceCheckUtils]: 110: Hoare triple {36072#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36072#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:26,417 INFO L273 TraceCheckUtils]: 111: Hoare triple {36072#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:26,418 INFO L273 TraceCheckUtils]: 112: Hoare triple {36073#(<= main_~i~0 27)} assume true; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:26,418 INFO L273 TraceCheckUtils]: 113: Hoare triple {36073#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:26,419 INFO L273 TraceCheckUtils]: 114: Hoare triple {36073#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36073#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:26,420 INFO L273 TraceCheckUtils]: 115: Hoare triple {36073#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:26,420 INFO L273 TraceCheckUtils]: 116: Hoare triple {36074#(<= main_~i~0 28)} assume true; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:26,421 INFO L273 TraceCheckUtils]: 117: Hoare triple {36074#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:26,421 INFO L273 TraceCheckUtils]: 118: Hoare triple {36074#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36074#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:26,422 INFO L273 TraceCheckUtils]: 119: Hoare triple {36074#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:26,422 INFO L273 TraceCheckUtils]: 120: Hoare triple {36075#(<= main_~i~0 29)} assume true; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:26,423 INFO L273 TraceCheckUtils]: 121: Hoare triple {36075#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:26,423 INFO L273 TraceCheckUtils]: 122: Hoare triple {36075#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36075#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:26,424 INFO L273 TraceCheckUtils]: 123: Hoare triple {36075#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:26,424 INFO L273 TraceCheckUtils]: 124: Hoare triple {36076#(<= main_~i~0 30)} assume true; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:26,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {36076#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:26,425 INFO L273 TraceCheckUtils]: 126: Hoare triple {36076#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36076#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:26,426 INFO L273 TraceCheckUtils]: 127: Hoare triple {36076#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:26,426 INFO L273 TraceCheckUtils]: 128: Hoare triple {36077#(<= main_~i~0 31)} assume true; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:26,427 INFO L273 TraceCheckUtils]: 129: Hoare triple {36077#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:26,427 INFO L273 TraceCheckUtils]: 130: Hoare triple {36077#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36077#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:26,428 INFO L273 TraceCheckUtils]: 131: Hoare triple {36077#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {36078#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:26,429 INFO L273 TraceCheckUtils]: 132: Hoare triple {36078#(<= main_~i~0 32)} assume true; {36078#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:26,429 INFO L273 TraceCheckUtils]: 133: Hoare triple {36078#(<= main_~i~0 32)} assume !(~i~0 < 100000); {36046#false} is VALID [2018-11-14 18:39:26,429 INFO L273 TraceCheckUtils]: 134: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 135: Hoare triple {36046#false} assume !(~swapped~0 != 0); {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 136: Hoare triple {36046#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 137: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 138: Hoare triple {36046#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 139: Hoare triple {36046#false} assume true; {36046#false} is VALID [2018-11-14 18:39:26,430 INFO L273 TraceCheckUtils]: 140: Hoare triple {36046#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {36046#false} is VALID [2018-11-14 18:39:26,431 INFO L256 TraceCheckUtils]: 141: Hoare triple {36046#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {36046#false} is VALID [2018-11-14 18:39:26,431 INFO L273 TraceCheckUtils]: 142: Hoare triple {36046#false} ~cond := #in~cond; {36046#false} is VALID [2018-11-14 18:39:26,431 INFO L273 TraceCheckUtils]: 143: Hoare triple {36046#false} assume ~cond == 0; {36046#false} is VALID [2018-11-14 18:39:26,431 INFO L273 TraceCheckUtils]: 144: Hoare triple {36046#false} assume !false; {36046#false} is VALID [2018-11-14 18:39:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 2 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-14 18:39:26,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-11-14 18:39:26,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:26,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 18:39:26,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:26,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 18:39:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 18:39:26,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:39:26,596 INFO L87 Difference]: Start difference. First operand 274 states and 339 transitions. Second operand 35 states. [2018-11-14 18:39:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:27,504 INFO L93 Difference]: Finished difference Result 554 states and 690 transitions. [2018-11-14 18:39:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:39:27,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-11-14 18:39:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:39:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 217 transitions. [2018-11-14 18:39:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:39:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 217 transitions. [2018-11-14 18:39:27,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 217 transitions. [2018-11-14 18:39:27,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:27,713 INFO L225 Difference]: With dead ends: 554 [2018-11-14 18:39:27,713 INFO L226 Difference]: Without dead ends: 286 [2018-11-14 18:39:27,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:39:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-14 18:39:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-11-14 18:39:27,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:27,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 282 states. [2018-11-14 18:39:27,787 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 282 states. [2018-11-14 18:39:27,788 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 282 states. [2018-11-14 18:39:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:27,793 INFO L93 Difference]: Finished difference Result 286 states and 355 transitions. [2018-11-14 18:39:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 355 transitions. [2018-11-14 18:39:27,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:27,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:27,794 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 286 states. [2018-11-14 18:39:27,794 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 286 states. [2018-11-14 18:39:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:27,800 INFO L93 Difference]: Finished difference Result 286 states and 355 transitions. [2018-11-14 18:39:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 355 transitions. [2018-11-14 18:39:27,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:27,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:27,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:27,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-14 18:39:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 349 transitions. [2018-11-14 18:39:27,807 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 349 transitions. Word has length 145 [2018-11-14 18:39:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:27,807 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 349 transitions. [2018-11-14 18:39:27,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 18:39:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 349 transitions. [2018-11-14 18:39:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-14 18:39:27,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:27,809 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:27,809 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:27,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2088441340, now seen corresponding path program 32 times [2018-11-14 18:39:27,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:27,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:28,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {38141#true} call ULTIMATE.init(); {38141#true} is VALID [2018-11-14 18:39:28,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {38141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38141#true} is VALID [2018-11-14 18:39:28,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {38141#true} assume true; {38141#true} is VALID [2018-11-14 18:39:28,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38141#true} {38141#true} #83#return; {38141#true} is VALID [2018-11-14 18:39:28,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {38141#true} call #t~ret8 := main(); {38141#true} is VALID [2018-11-14 18:39:28,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {38141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {38141#true} is VALID [2018-11-14 18:39:28,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {38141#true} assume true; {38141#true} is VALID [2018-11-14 18:39:28,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {38141#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {38143#(= main_~i~0 1)} is VALID [2018-11-14 18:39:28,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {38143#(= main_~i~0 1)} assume true; {38143#(= main_~i~0 1)} is VALID [2018-11-14 18:39:28,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {38143#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38143#(= main_~i~0 1)} is VALID [2018-11-14 18:39:28,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {38143#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38143#(= main_~i~0 1)} is VALID [2018-11-14 18:39:28,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {38143#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {38144#(<= main_~i~0 2)} assume true; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {38144#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {38144#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {38144#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {38145#(<= main_~i~0 3)} assume true; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {38145#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {38145#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {38145#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {38146#(<= main_~i~0 4)} assume true; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {38146#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {38146#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {38146#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {38147#(<= main_~i~0 5)} assume true; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {38147#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {38147#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {38147#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,428 INFO L273 TraceCheckUtils]: 28: Hoare triple {38148#(<= main_~i~0 6)} assume true; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {38148#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {38148#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {38148#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:28,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {38149#(<= main_~i~0 7)} assume true; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:28,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {38149#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:28,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {38149#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:28,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {38149#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:28,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {38150#(<= main_~i~0 8)} assume true; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:28,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {38150#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:28,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {38150#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:28,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {38150#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:28,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {38151#(<= main_~i~0 9)} assume true; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:28,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {38151#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:28,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {38151#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:28,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {38151#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:28,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {38152#(<= main_~i~0 10)} assume true; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:28,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {38152#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:28,438 INFO L273 TraceCheckUtils]: 46: Hoare triple {38152#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:28,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {38152#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:28,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {38153#(<= main_~i~0 11)} assume true; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:28,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {38153#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:28,440 INFO L273 TraceCheckUtils]: 50: Hoare triple {38153#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:28,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {38153#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:28,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {38154#(<= main_~i~0 12)} assume true; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:28,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {38154#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:28,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {38154#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:28,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {38154#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:28,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {38155#(<= main_~i~0 13)} assume true; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:28,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {38155#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:28,444 INFO L273 TraceCheckUtils]: 58: Hoare triple {38155#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:28,445 INFO L273 TraceCheckUtils]: 59: Hoare triple {38155#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:28,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {38156#(<= main_~i~0 14)} assume true; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:28,446 INFO L273 TraceCheckUtils]: 61: Hoare triple {38156#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:28,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {38156#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:28,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {38156#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:28,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {38157#(<= main_~i~0 15)} assume true; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:28,448 INFO L273 TraceCheckUtils]: 65: Hoare triple {38157#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:28,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {38157#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:28,449 INFO L273 TraceCheckUtils]: 67: Hoare triple {38157#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:28,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {38158#(<= main_~i~0 16)} assume true; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:28,450 INFO L273 TraceCheckUtils]: 69: Hoare triple {38158#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:28,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {38158#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:28,451 INFO L273 TraceCheckUtils]: 71: Hoare triple {38158#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:28,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {38159#(<= main_~i~0 17)} assume true; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:28,452 INFO L273 TraceCheckUtils]: 73: Hoare triple {38159#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:28,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {38159#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:28,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {38159#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:28,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {38160#(<= main_~i~0 18)} assume true; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:28,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {38160#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:28,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {38160#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:28,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {38160#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:28,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {38161#(<= main_~i~0 19)} assume true; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:28,456 INFO L273 TraceCheckUtils]: 81: Hoare triple {38161#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:28,456 INFO L273 TraceCheckUtils]: 82: Hoare triple {38161#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:28,457 INFO L273 TraceCheckUtils]: 83: Hoare triple {38161#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:28,458 INFO L273 TraceCheckUtils]: 84: Hoare triple {38162#(<= main_~i~0 20)} assume true; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:28,458 INFO L273 TraceCheckUtils]: 85: Hoare triple {38162#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:28,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {38162#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:28,459 INFO L273 TraceCheckUtils]: 87: Hoare triple {38162#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:28,460 INFO L273 TraceCheckUtils]: 88: Hoare triple {38163#(<= main_~i~0 21)} assume true; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:28,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {38163#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:28,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {38163#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:28,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {38163#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:28,462 INFO L273 TraceCheckUtils]: 92: Hoare triple {38164#(<= main_~i~0 22)} assume true; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:28,462 INFO L273 TraceCheckUtils]: 93: Hoare triple {38164#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:28,463 INFO L273 TraceCheckUtils]: 94: Hoare triple {38164#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:28,463 INFO L273 TraceCheckUtils]: 95: Hoare triple {38164#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:28,464 INFO L273 TraceCheckUtils]: 96: Hoare triple {38165#(<= main_~i~0 23)} assume true; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:28,464 INFO L273 TraceCheckUtils]: 97: Hoare triple {38165#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:28,465 INFO L273 TraceCheckUtils]: 98: Hoare triple {38165#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:28,466 INFO L273 TraceCheckUtils]: 99: Hoare triple {38165#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:28,466 INFO L273 TraceCheckUtils]: 100: Hoare triple {38166#(<= main_~i~0 24)} assume true; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:28,467 INFO L273 TraceCheckUtils]: 101: Hoare triple {38166#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:28,467 INFO L273 TraceCheckUtils]: 102: Hoare triple {38166#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:28,468 INFO L273 TraceCheckUtils]: 103: Hoare triple {38166#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:28,468 INFO L273 TraceCheckUtils]: 104: Hoare triple {38167#(<= main_~i~0 25)} assume true; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:28,469 INFO L273 TraceCheckUtils]: 105: Hoare triple {38167#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:28,469 INFO L273 TraceCheckUtils]: 106: Hoare triple {38167#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:28,470 INFO L273 TraceCheckUtils]: 107: Hoare triple {38167#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:28,470 INFO L273 TraceCheckUtils]: 108: Hoare triple {38168#(<= main_~i~0 26)} assume true; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:28,471 INFO L273 TraceCheckUtils]: 109: Hoare triple {38168#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:28,471 INFO L273 TraceCheckUtils]: 110: Hoare triple {38168#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:28,472 INFO L273 TraceCheckUtils]: 111: Hoare triple {38168#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:28,472 INFO L273 TraceCheckUtils]: 112: Hoare triple {38169#(<= main_~i~0 27)} assume true; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:28,473 INFO L273 TraceCheckUtils]: 113: Hoare triple {38169#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:28,473 INFO L273 TraceCheckUtils]: 114: Hoare triple {38169#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:28,474 INFO L273 TraceCheckUtils]: 115: Hoare triple {38169#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:28,475 INFO L273 TraceCheckUtils]: 116: Hoare triple {38170#(<= main_~i~0 28)} assume true; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:28,475 INFO L273 TraceCheckUtils]: 117: Hoare triple {38170#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:28,475 INFO L273 TraceCheckUtils]: 118: Hoare triple {38170#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:28,476 INFO L273 TraceCheckUtils]: 119: Hoare triple {38170#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:28,477 INFO L273 TraceCheckUtils]: 120: Hoare triple {38171#(<= main_~i~0 29)} assume true; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:28,477 INFO L273 TraceCheckUtils]: 121: Hoare triple {38171#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:28,478 INFO L273 TraceCheckUtils]: 122: Hoare triple {38171#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:28,478 INFO L273 TraceCheckUtils]: 123: Hoare triple {38171#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:28,479 INFO L273 TraceCheckUtils]: 124: Hoare triple {38172#(<= main_~i~0 30)} assume true; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:28,479 INFO L273 TraceCheckUtils]: 125: Hoare triple {38172#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:28,480 INFO L273 TraceCheckUtils]: 126: Hoare triple {38172#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:28,480 INFO L273 TraceCheckUtils]: 127: Hoare triple {38172#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:28,481 INFO L273 TraceCheckUtils]: 128: Hoare triple {38173#(<= main_~i~0 31)} assume true; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:28,481 INFO L273 TraceCheckUtils]: 129: Hoare triple {38173#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:28,482 INFO L273 TraceCheckUtils]: 130: Hoare triple {38173#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:28,482 INFO L273 TraceCheckUtils]: 131: Hoare triple {38173#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:28,483 INFO L273 TraceCheckUtils]: 132: Hoare triple {38174#(<= main_~i~0 32)} assume true; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:28,483 INFO L273 TraceCheckUtils]: 133: Hoare triple {38174#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:28,484 INFO L273 TraceCheckUtils]: 134: Hoare triple {38174#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:28,485 INFO L273 TraceCheckUtils]: 135: Hoare triple {38174#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {38175#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:28,485 INFO L273 TraceCheckUtils]: 136: Hoare triple {38175#(<= main_~i~0 33)} assume true; {38175#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:28,486 INFO L273 TraceCheckUtils]: 137: Hoare triple {38175#(<= main_~i~0 33)} assume !(~i~0 < 100000); {38142#false} is VALID [2018-11-14 18:39:28,486 INFO L273 TraceCheckUtils]: 138: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:28,486 INFO L273 TraceCheckUtils]: 139: Hoare triple {38142#false} assume !(~swapped~0 != 0); {38142#false} is VALID [2018-11-14 18:39:28,486 INFO L273 TraceCheckUtils]: 140: Hoare triple {38142#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {38142#false} is VALID [2018-11-14 18:39:28,486 INFO L273 TraceCheckUtils]: 141: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L273 TraceCheckUtils]: 142: Hoare triple {38142#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L273 TraceCheckUtils]: 143: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L273 TraceCheckUtils]: 144: Hoare triple {38142#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L256 TraceCheckUtils]: 145: Hoare triple {38142#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L273 TraceCheckUtils]: 146: Hoare triple {38142#false} ~cond := #in~cond; {38142#false} is VALID [2018-11-14 18:39:28,487 INFO L273 TraceCheckUtils]: 147: Hoare triple {38142#false} assume ~cond == 0; {38142#false} is VALID [2018-11-14 18:39:28,488 INFO L273 TraceCheckUtils]: 148: Hoare triple {38142#false} assume !false; {38142#false} is VALID [2018-11-14 18:39:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 2 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:28,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:28,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:28,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:39:28,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:39:28,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:28,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:28,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {38141#true} call ULTIMATE.init(); {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {38141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {38141#true} assume true; {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38141#true} {38141#true} #83#return; {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {38141#true} call #t~ret8 := main(); {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {38141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {38141#true} is VALID [2018-11-14 18:39:28,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {38141#true} assume true; {38141#true} is VALID [2018-11-14 18:39:28,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {38141#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {38200#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:28,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {38200#(<= main_~i~0 1)} assume true; {38200#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:28,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {38200#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38200#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:28,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {38200#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38200#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:28,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {38200#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {38144#(<= main_~i~0 2)} assume true; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {38144#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {38144#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38144#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:28,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {38144#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {38145#(<= main_~i~0 3)} assume true; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {38145#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {38145#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38145#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:28,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {38145#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {38146#(<= main_~i~0 4)} assume true; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {38146#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {38146#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38146#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:28,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {38146#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {38147#(<= main_~i~0 5)} assume true; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {38147#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {38147#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38147#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:28,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {38147#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {38148#(<= main_~i~0 6)} assume true; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {38148#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:28,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {38148#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38148#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:29,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {38148#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:29,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {38149#(<= main_~i~0 7)} assume true; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:29,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {38149#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:29,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {38149#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38149#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:29,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {38149#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:29,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {38150#(<= main_~i~0 8)} assume true; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:29,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {38150#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:29,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {38150#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38150#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:29,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {38150#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:29,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {38151#(<= main_~i~0 9)} assume true; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:29,006 INFO L273 TraceCheckUtils]: 41: Hoare triple {38151#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:29,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {38151#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38151#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:29,007 INFO L273 TraceCheckUtils]: 43: Hoare triple {38151#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:29,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {38152#(<= main_~i~0 10)} assume true; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:29,008 INFO L273 TraceCheckUtils]: 45: Hoare triple {38152#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:29,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {38152#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38152#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:29,008 INFO L273 TraceCheckUtils]: 47: Hoare triple {38152#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:29,009 INFO L273 TraceCheckUtils]: 48: Hoare triple {38153#(<= main_~i~0 11)} assume true; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:29,009 INFO L273 TraceCheckUtils]: 49: Hoare triple {38153#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:29,010 INFO L273 TraceCheckUtils]: 50: Hoare triple {38153#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38153#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:29,010 INFO L273 TraceCheckUtils]: 51: Hoare triple {38153#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:29,011 INFO L273 TraceCheckUtils]: 52: Hoare triple {38154#(<= main_~i~0 12)} assume true; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:29,011 INFO L273 TraceCheckUtils]: 53: Hoare triple {38154#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:29,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {38154#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38154#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:29,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {38154#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:29,013 INFO L273 TraceCheckUtils]: 56: Hoare triple {38155#(<= main_~i~0 13)} assume true; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:29,013 INFO L273 TraceCheckUtils]: 57: Hoare triple {38155#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:29,014 INFO L273 TraceCheckUtils]: 58: Hoare triple {38155#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38155#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:29,015 INFO L273 TraceCheckUtils]: 59: Hoare triple {38155#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:29,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {38156#(<= main_~i~0 14)} assume true; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:29,016 INFO L273 TraceCheckUtils]: 61: Hoare triple {38156#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:29,016 INFO L273 TraceCheckUtils]: 62: Hoare triple {38156#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38156#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:29,017 INFO L273 TraceCheckUtils]: 63: Hoare triple {38156#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:29,017 INFO L273 TraceCheckUtils]: 64: Hoare triple {38157#(<= main_~i~0 15)} assume true; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:29,018 INFO L273 TraceCheckUtils]: 65: Hoare triple {38157#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:29,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {38157#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38157#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:29,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {38157#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:29,020 INFO L273 TraceCheckUtils]: 68: Hoare triple {38158#(<= main_~i~0 16)} assume true; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:29,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {38158#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:29,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {38158#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38158#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:29,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {38158#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:29,022 INFO L273 TraceCheckUtils]: 72: Hoare triple {38159#(<= main_~i~0 17)} assume true; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:29,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {38159#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:29,026 INFO L273 TraceCheckUtils]: 74: Hoare triple {38159#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38159#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:29,026 INFO L273 TraceCheckUtils]: 75: Hoare triple {38159#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:29,027 INFO L273 TraceCheckUtils]: 76: Hoare triple {38160#(<= main_~i~0 18)} assume true; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:29,027 INFO L273 TraceCheckUtils]: 77: Hoare triple {38160#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:29,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {38160#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38160#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:29,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {38160#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:29,029 INFO L273 TraceCheckUtils]: 80: Hoare triple {38161#(<= main_~i~0 19)} assume true; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:29,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {38161#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:29,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {38161#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38161#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:29,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {38161#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:29,031 INFO L273 TraceCheckUtils]: 84: Hoare triple {38162#(<= main_~i~0 20)} assume true; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:29,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {38162#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:29,032 INFO L273 TraceCheckUtils]: 86: Hoare triple {38162#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38162#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:29,032 INFO L273 TraceCheckUtils]: 87: Hoare triple {38162#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:29,033 INFO L273 TraceCheckUtils]: 88: Hoare triple {38163#(<= main_~i~0 21)} assume true; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:29,033 INFO L273 TraceCheckUtils]: 89: Hoare triple {38163#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:29,035 INFO L273 TraceCheckUtils]: 90: Hoare triple {38163#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38163#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:29,035 INFO L273 TraceCheckUtils]: 91: Hoare triple {38163#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:29,036 INFO L273 TraceCheckUtils]: 92: Hoare triple {38164#(<= main_~i~0 22)} assume true; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:29,037 INFO L273 TraceCheckUtils]: 93: Hoare triple {38164#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:29,037 INFO L273 TraceCheckUtils]: 94: Hoare triple {38164#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38164#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:29,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {38164#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:29,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {38165#(<= main_~i~0 23)} assume true; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:29,041 INFO L273 TraceCheckUtils]: 97: Hoare triple {38165#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:29,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {38165#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38165#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:29,043 INFO L273 TraceCheckUtils]: 99: Hoare triple {38165#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:29,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {38166#(<= main_~i~0 24)} assume true; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:29,046 INFO L273 TraceCheckUtils]: 101: Hoare triple {38166#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:29,046 INFO L273 TraceCheckUtils]: 102: Hoare triple {38166#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38166#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:29,049 INFO L273 TraceCheckUtils]: 103: Hoare triple {38166#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:29,049 INFO L273 TraceCheckUtils]: 104: Hoare triple {38167#(<= main_~i~0 25)} assume true; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:29,051 INFO L273 TraceCheckUtils]: 105: Hoare triple {38167#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:29,051 INFO L273 TraceCheckUtils]: 106: Hoare triple {38167#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38167#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:29,054 INFO L273 TraceCheckUtils]: 107: Hoare triple {38167#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:29,054 INFO L273 TraceCheckUtils]: 108: Hoare triple {38168#(<= main_~i~0 26)} assume true; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:29,056 INFO L273 TraceCheckUtils]: 109: Hoare triple {38168#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:29,056 INFO L273 TraceCheckUtils]: 110: Hoare triple {38168#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38168#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:29,058 INFO L273 TraceCheckUtils]: 111: Hoare triple {38168#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:29,058 INFO L273 TraceCheckUtils]: 112: Hoare triple {38169#(<= main_~i~0 27)} assume true; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:29,061 INFO L273 TraceCheckUtils]: 113: Hoare triple {38169#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:29,061 INFO L273 TraceCheckUtils]: 114: Hoare triple {38169#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38169#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:29,064 INFO L273 TraceCheckUtils]: 115: Hoare triple {38169#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:29,064 INFO L273 TraceCheckUtils]: 116: Hoare triple {38170#(<= main_~i~0 28)} assume true; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:29,067 INFO L273 TraceCheckUtils]: 117: Hoare triple {38170#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:29,067 INFO L273 TraceCheckUtils]: 118: Hoare triple {38170#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38170#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:29,069 INFO L273 TraceCheckUtils]: 119: Hoare triple {38170#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:29,069 INFO L273 TraceCheckUtils]: 120: Hoare triple {38171#(<= main_~i~0 29)} assume true; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:29,072 INFO L273 TraceCheckUtils]: 121: Hoare triple {38171#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:29,072 INFO L273 TraceCheckUtils]: 122: Hoare triple {38171#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38171#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:29,074 INFO L273 TraceCheckUtils]: 123: Hoare triple {38171#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:29,074 INFO L273 TraceCheckUtils]: 124: Hoare triple {38172#(<= main_~i~0 30)} assume true; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:29,077 INFO L273 TraceCheckUtils]: 125: Hoare triple {38172#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:29,077 INFO L273 TraceCheckUtils]: 126: Hoare triple {38172#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38172#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:29,079 INFO L273 TraceCheckUtils]: 127: Hoare triple {38172#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:29,079 INFO L273 TraceCheckUtils]: 128: Hoare triple {38173#(<= main_~i~0 31)} assume true; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:29,082 INFO L273 TraceCheckUtils]: 129: Hoare triple {38173#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:29,082 INFO L273 TraceCheckUtils]: 130: Hoare triple {38173#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38173#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:29,085 INFO L273 TraceCheckUtils]: 131: Hoare triple {38173#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:29,085 INFO L273 TraceCheckUtils]: 132: Hoare triple {38174#(<= main_~i~0 32)} assume true; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:29,088 INFO L273 TraceCheckUtils]: 133: Hoare triple {38174#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:29,088 INFO L273 TraceCheckUtils]: 134: Hoare triple {38174#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38174#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:29,090 INFO L273 TraceCheckUtils]: 135: Hoare triple {38174#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {38175#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:29,090 INFO L273 TraceCheckUtils]: 136: Hoare triple {38175#(<= main_~i~0 33)} assume true; {38175#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 137: Hoare triple {38175#(<= main_~i~0 33)} assume !(~i~0 < 100000); {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 138: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 139: Hoare triple {38142#false} assume !(~swapped~0 != 0); {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 140: Hoare triple {38142#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 141: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 142: Hoare triple {38142#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 143: Hoare triple {38142#false} assume true; {38142#false} is VALID [2018-11-14 18:39:29,093 INFO L273 TraceCheckUtils]: 144: Hoare triple {38142#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {38142#false} is VALID [2018-11-14 18:39:29,094 INFO L256 TraceCheckUtils]: 145: Hoare triple {38142#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {38142#false} is VALID [2018-11-14 18:39:29,094 INFO L273 TraceCheckUtils]: 146: Hoare triple {38142#false} ~cond := #in~cond; {38142#false} is VALID [2018-11-14 18:39:29,094 INFO L273 TraceCheckUtils]: 147: Hoare triple {38142#false} assume ~cond == 0; {38142#false} is VALID [2018-11-14 18:39:29,094 INFO L273 TraceCheckUtils]: 148: Hoare triple {38142#false} assume !false; {38142#false} is VALID [2018-11-14 18:39:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 2 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:29,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:29,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-14 18:39:29,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 149 [2018-11-14 18:39:29,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:29,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 18:39:29,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:29,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 18:39:29,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 18:39:29,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:39:29,312 INFO L87 Difference]: Start difference. First operand 282 states and 349 transitions. Second operand 36 states. [2018-11-14 18:39:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:30,278 INFO L93 Difference]: Finished difference Result 570 states and 710 transitions. [2018-11-14 18:39:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:39:30,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 149 [2018-11-14 18:39:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:39:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 222 transitions. [2018-11-14 18:39:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:39:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 222 transitions. [2018-11-14 18:39:30,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 222 transitions. [2018-11-14 18:39:30,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:30,497 INFO L225 Difference]: With dead ends: 570 [2018-11-14 18:39:30,498 INFO L226 Difference]: Without dead ends: 294 [2018-11-14 18:39:30,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:39:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-14 18:39:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2018-11-14 18:39:31,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:31,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand 290 states. [2018-11-14 18:39:31,093 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand 290 states. [2018-11-14 18:39:31,093 INFO L87 Difference]: Start difference. First operand 294 states. Second operand 290 states. [2018-11-14 18:39:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:31,100 INFO L93 Difference]: Finished difference Result 294 states and 365 transitions. [2018-11-14 18:39:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 365 transitions. [2018-11-14 18:39:31,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:31,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:31,101 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand 294 states. [2018-11-14 18:39:31,101 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 294 states. [2018-11-14 18:39:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:31,107 INFO L93 Difference]: Finished difference Result 294 states and 365 transitions. [2018-11-14 18:39:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 365 transitions. [2018-11-14 18:39:31,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:31,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:31,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:31,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-14 18:39:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 359 transitions. [2018-11-14 18:39:31,113 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 359 transitions. Word has length 149 [2018-11-14 18:39:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:31,114 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 359 transitions. [2018-11-14 18:39:31,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 18:39:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 359 transitions. [2018-11-14 18:39:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-14 18:39:31,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:31,115 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:31,115 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:31,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1248676, now seen corresponding path program 33 times [2018-11-14 18:39:31,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:31,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:31,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:33,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {40296#true} call ULTIMATE.init(); {40296#true} is VALID [2018-11-14 18:39:33,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {40296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40296#true} is VALID [2018-11-14 18:39:33,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {40296#true} assume true; {40296#true} is VALID [2018-11-14 18:39:33,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40296#true} {40296#true} #83#return; {40296#true} is VALID [2018-11-14 18:39:33,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {40296#true} call #t~ret8 := main(); {40296#true} is VALID [2018-11-14 18:39:33,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {40296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {40296#true} is VALID [2018-11-14 18:39:33,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {40296#true} assume true; {40296#true} is VALID [2018-11-14 18:39:33,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {40296#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {40298#(= main_~i~0 1)} is VALID [2018-11-14 18:39:33,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {40298#(= main_~i~0 1)} assume true; {40298#(= main_~i~0 1)} is VALID [2018-11-14 18:39:33,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {40298#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40298#(= main_~i~0 1)} is VALID [2018-11-14 18:39:33,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {40298#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40298#(= main_~i~0 1)} is VALID [2018-11-14 18:39:33,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {40298#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {40299#(<= main_~i~0 2)} assume true; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {40299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {40299#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {40299#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {40300#(<= main_~i~0 3)} assume true; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {40300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {40300#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {40300#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {40301#(<= main_~i~0 4)} assume true; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {40301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {40301#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {40301#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {40302#(<= main_~i~0 5)} assume true; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {40302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {40302#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {40302#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {40303#(<= main_~i~0 6)} assume true; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {40303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {40303#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {40303#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {40304#(<= main_~i~0 7)} assume true; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {40304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {40304#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {40304#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {40305#(<= main_~i~0 8)} assume true; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {40305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {40305#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {40305#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {40306#(<= main_~i~0 9)} assume true; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {40306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,266 INFO L273 TraceCheckUtils]: 42: Hoare triple {40306#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {40306#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,267 INFO L273 TraceCheckUtils]: 44: Hoare triple {40307#(<= main_~i~0 10)} assume true; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {40307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,268 INFO L273 TraceCheckUtils]: 46: Hoare triple {40307#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {40307#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {40308#(<= main_~i~0 11)} assume true; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {40308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {40308#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {40308#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {40309#(<= main_~i~0 12)} assume true; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {40309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {40309#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,272 INFO L273 TraceCheckUtils]: 55: Hoare triple {40309#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,273 INFO L273 TraceCheckUtils]: 56: Hoare triple {40310#(<= main_~i~0 13)} assume true; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,273 INFO L273 TraceCheckUtils]: 57: Hoare triple {40310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {40310#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {40310#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {40311#(<= main_~i~0 14)} assume true; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {40311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {40311#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {40311#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {40312#(<= main_~i~0 15)} assume true; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,278 INFO L273 TraceCheckUtils]: 65: Hoare triple {40312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {40312#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,279 INFO L273 TraceCheckUtils]: 67: Hoare triple {40312#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {40313#(<= main_~i~0 16)} assume true; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,280 INFO L273 TraceCheckUtils]: 69: Hoare triple {40313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,280 INFO L273 TraceCheckUtils]: 70: Hoare triple {40313#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,281 INFO L273 TraceCheckUtils]: 71: Hoare triple {40313#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,281 INFO L273 TraceCheckUtils]: 72: Hoare triple {40314#(<= main_~i~0 17)} assume true; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {40314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {40314#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {40314#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,283 INFO L273 TraceCheckUtils]: 76: Hoare triple {40315#(<= main_~i~0 18)} assume true; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,284 INFO L273 TraceCheckUtils]: 77: Hoare triple {40315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,284 INFO L273 TraceCheckUtils]: 78: Hoare triple {40315#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,285 INFO L273 TraceCheckUtils]: 79: Hoare triple {40315#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,285 INFO L273 TraceCheckUtils]: 80: Hoare triple {40316#(<= main_~i~0 19)} assume true; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,286 INFO L273 TraceCheckUtils]: 81: Hoare triple {40316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,286 INFO L273 TraceCheckUtils]: 82: Hoare triple {40316#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {40316#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,287 INFO L273 TraceCheckUtils]: 84: Hoare triple {40317#(<= main_~i~0 20)} assume true; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,288 INFO L273 TraceCheckUtils]: 85: Hoare triple {40317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {40317#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,289 INFO L273 TraceCheckUtils]: 87: Hoare triple {40317#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,290 INFO L273 TraceCheckUtils]: 88: Hoare triple {40318#(<= main_~i~0 21)} assume true; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,290 INFO L273 TraceCheckUtils]: 89: Hoare triple {40318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,290 INFO L273 TraceCheckUtils]: 90: Hoare triple {40318#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,291 INFO L273 TraceCheckUtils]: 91: Hoare triple {40318#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,292 INFO L273 TraceCheckUtils]: 92: Hoare triple {40319#(<= main_~i~0 22)} assume true; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,292 INFO L273 TraceCheckUtils]: 93: Hoare triple {40319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,292 INFO L273 TraceCheckUtils]: 94: Hoare triple {40319#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,293 INFO L273 TraceCheckUtils]: 95: Hoare triple {40319#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,294 INFO L273 TraceCheckUtils]: 96: Hoare triple {40320#(<= main_~i~0 23)} assume true; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,294 INFO L273 TraceCheckUtils]: 97: Hoare triple {40320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,295 INFO L273 TraceCheckUtils]: 98: Hoare triple {40320#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,295 INFO L273 TraceCheckUtils]: 99: Hoare triple {40320#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,296 INFO L273 TraceCheckUtils]: 100: Hoare triple {40321#(<= main_~i~0 24)} assume true; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,296 INFO L273 TraceCheckUtils]: 101: Hoare triple {40321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,297 INFO L273 TraceCheckUtils]: 102: Hoare triple {40321#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,297 INFO L273 TraceCheckUtils]: 103: Hoare triple {40321#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,298 INFO L273 TraceCheckUtils]: 104: Hoare triple {40322#(<= main_~i~0 25)} assume true; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {40322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,299 INFO L273 TraceCheckUtils]: 106: Hoare triple {40322#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,299 INFO L273 TraceCheckUtils]: 107: Hoare triple {40322#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,300 INFO L273 TraceCheckUtils]: 108: Hoare triple {40323#(<= main_~i~0 26)} assume true; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,300 INFO L273 TraceCheckUtils]: 109: Hoare triple {40323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,301 INFO L273 TraceCheckUtils]: 110: Hoare triple {40323#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,301 INFO L273 TraceCheckUtils]: 111: Hoare triple {40323#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,302 INFO L273 TraceCheckUtils]: 112: Hoare triple {40324#(<= main_~i~0 27)} assume true; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,302 INFO L273 TraceCheckUtils]: 113: Hoare triple {40324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,303 INFO L273 TraceCheckUtils]: 114: Hoare triple {40324#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,304 INFO L273 TraceCheckUtils]: 115: Hoare triple {40324#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,304 INFO L273 TraceCheckUtils]: 116: Hoare triple {40325#(<= main_~i~0 28)} assume true; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,304 INFO L273 TraceCheckUtils]: 117: Hoare triple {40325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,305 INFO L273 TraceCheckUtils]: 118: Hoare triple {40325#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,306 INFO L273 TraceCheckUtils]: 119: Hoare triple {40325#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,306 INFO L273 TraceCheckUtils]: 120: Hoare triple {40326#(<= main_~i~0 29)} assume true; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,307 INFO L273 TraceCheckUtils]: 121: Hoare triple {40326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,307 INFO L273 TraceCheckUtils]: 122: Hoare triple {40326#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,308 INFO L273 TraceCheckUtils]: 123: Hoare triple {40326#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,308 INFO L273 TraceCheckUtils]: 124: Hoare triple {40327#(<= main_~i~0 30)} assume true; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,309 INFO L273 TraceCheckUtils]: 125: Hoare triple {40327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,309 INFO L273 TraceCheckUtils]: 126: Hoare triple {40327#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,310 INFO L273 TraceCheckUtils]: 127: Hoare triple {40327#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,310 INFO L273 TraceCheckUtils]: 128: Hoare triple {40328#(<= main_~i~0 31)} assume true; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,311 INFO L273 TraceCheckUtils]: 129: Hoare triple {40328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,311 INFO L273 TraceCheckUtils]: 130: Hoare triple {40328#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,312 INFO L273 TraceCheckUtils]: 131: Hoare triple {40328#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,312 INFO L273 TraceCheckUtils]: 132: Hoare triple {40329#(<= main_~i~0 32)} assume true; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,313 INFO L273 TraceCheckUtils]: 133: Hoare triple {40329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,313 INFO L273 TraceCheckUtils]: 134: Hoare triple {40329#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,314 INFO L273 TraceCheckUtils]: 135: Hoare triple {40329#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:33,314 INFO L273 TraceCheckUtils]: 136: Hoare triple {40330#(<= main_~i~0 33)} assume true; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:33,315 INFO L273 TraceCheckUtils]: 137: Hoare triple {40330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:33,315 INFO L273 TraceCheckUtils]: 138: Hoare triple {40330#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:33,316 INFO L273 TraceCheckUtils]: 139: Hoare triple {40330#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {40331#(<= main_~i~0 34)} is VALID [2018-11-14 18:39:33,316 INFO L273 TraceCheckUtils]: 140: Hoare triple {40331#(<= main_~i~0 34)} assume true; {40331#(<= main_~i~0 34)} is VALID [2018-11-14 18:39:33,317 INFO L273 TraceCheckUtils]: 141: Hoare triple {40331#(<= main_~i~0 34)} assume !(~i~0 < 100000); {40297#false} is VALID [2018-11-14 18:39:33,317 INFO L273 TraceCheckUtils]: 142: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:33,317 INFO L273 TraceCheckUtils]: 143: Hoare triple {40297#false} assume !(~swapped~0 != 0); {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L273 TraceCheckUtils]: 144: Hoare triple {40297#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L273 TraceCheckUtils]: 145: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L273 TraceCheckUtils]: 146: Hoare triple {40297#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L273 TraceCheckUtils]: 147: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L273 TraceCheckUtils]: 148: Hoare triple {40297#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {40297#false} is VALID [2018-11-14 18:39:33,318 INFO L256 TraceCheckUtils]: 149: Hoare triple {40297#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {40297#false} is VALID [2018-11-14 18:39:33,319 INFO L273 TraceCheckUtils]: 150: Hoare triple {40297#false} ~cond := #in~cond; {40297#false} is VALID [2018-11-14 18:39:33,319 INFO L273 TraceCheckUtils]: 151: Hoare triple {40297#false} assume ~cond == 0; {40297#false} is VALID [2018-11-14 18:39:33,319 INFO L273 TraceCheckUtils]: 152: Hoare triple {40297#false} assume !false; {40297#false} is VALID [2018-11-14 18:39:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 2 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:33,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:33,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:39:33,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:39:33,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-14 18:39:33,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:33,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:33,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {40296#true} call ULTIMATE.init(); {40296#true} is VALID [2018-11-14 18:39:33,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {40296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40296#true} is VALID [2018-11-14 18:39:33,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {40296#true} assume true; {40296#true} is VALID [2018-11-14 18:39:33,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40296#true} {40296#true} #83#return; {40296#true} is VALID [2018-11-14 18:39:33,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {40296#true} call #t~ret8 := main(); {40296#true} is VALID [2018-11-14 18:39:33,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {40296#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {40296#true} is VALID [2018-11-14 18:39:33,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {40296#true} assume true; {40296#true} is VALID [2018-11-14 18:39:33,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {40296#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {40356#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:33,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {40356#(<= main_~i~0 1)} assume true; {40356#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:33,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {40356#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40356#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:33,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {40356#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40356#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:33,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {40356#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {40299#(<= main_~i~0 2)} assume true; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {40299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {40299#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40299#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:33,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {40299#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {40300#(<= main_~i~0 3)} assume true; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {40300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {40300#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40300#(<= main_~i~0 3)} is VALID [2018-11-14 18:39:33,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {40300#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {40301#(<= main_~i~0 4)} assume true; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {40301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {40301#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40301#(<= main_~i~0 4)} is VALID [2018-11-14 18:39:33,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {40301#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,933 INFO L273 TraceCheckUtils]: 24: Hoare triple {40302#(<= main_~i~0 5)} assume true; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {40302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {40302#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40302#(<= main_~i~0 5)} is VALID [2018-11-14 18:39:33,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {40302#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {40303#(<= main_~i~0 6)} assume true; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {40303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {40303#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40303#(<= main_~i~0 6)} is VALID [2018-11-14 18:39:33,937 INFO L273 TraceCheckUtils]: 31: Hoare triple {40303#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {40304#(<= main_~i~0 7)} assume true; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,938 INFO L273 TraceCheckUtils]: 33: Hoare triple {40304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,938 INFO L273 TraceCheckUtils]: 34: Hoare triple {40304#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40304#(<= main_~i~0 7)} is VALID [2018-11-14 18:39:33,939 INFO L273 TraceCheckUtils]: 35: Hoare triple {40304#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,939 INFO L273 TraceCheckUtils]: 36: Hoare triple {40305#(<= main_~i~0 8)} assume true; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {40305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {40305#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40305#(<= main_~i~0 8)} is VALID [2018-11-14 18:39:33,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {40305#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,941 INFO L273 TraceCheckUtils]: 40: Hoare triple {40306#(<= main_~i~0 9)} assume true; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,942 INFO L273 TraceCheckUtils]: 41: Hoare triple {40306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,942 INFO L273 TraceCheckUtils]: 42: Hoare triple {40306#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40306#(<= main_~i~0 9)} is VALID [2018-11-14 18:39:33,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {40306#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {40307#(<= main_~i~0 10)} assume true; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,944 INFO L273 TraceCheckUtils]: 45: Hoare triple {40307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,944 INFO L273 TraceCheckUtils]: 46: Hoare triple {40307#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40307#(<= main_~i~0 10)} is VALID [2018-11-14 18:39:33,945 INFO L273 TraceCheckUtils]: 47: Hoare triple {40307#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {40308#(<= main_~i~0 11)} assume true; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,946 INFO L273 TraceCheckUtils]: 49: Hoare triple {40308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,946 INFO L273 TraceCheckUtils]: 50: Hoare triple {40308#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40308#(<= main_~i~0 11)} is VALID [2018-11-14 18:39:33,947 INFO L273 TraceCheckUtils]: 51: Hoare triple {40308#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {40309#(<= main_~i~0 12)} assume true; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,948 INFO L273 TraceCheckUtils]: 53: Hoare triple {40309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,948 INFO L273 TraceCheckUtils]: 54: Hoare triple {40309#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40309#(<= main_~i~0 12)} is VALID [2018-11-14 18:39:33,949 INFO L273 TraceCheckUtils]: 55: Hoare triple {40309#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,950 INFO L273 TraceCheckUtils]: 56: Hoare triple {40310#(<= main_~i~0 13)} assume true; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,950 INFO L273 TraceCheckUtils]: 57: Hoare triple {40310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {40310#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40310#(<= main_~i~0 13)} is VALID [2018-11-14 18:39:33,951 INFO L273 TraceCheckUtils]: 59: Hoare triple {40310#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,952 INFO L273 TraceCheckUtils]: 60: Hoare triple {40311#(<= main_~i~0 14)} assume true; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,952 INFO L273 TraceCheckUtils]: 61: Hoare triple {40311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {40311#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40311#(<= main_~i~0 14)} is VALID [2018-11-14 18:39:33,953 INFO L273 TraceCheckUtils]: 63: Hoare triple {40311#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,954 INFO L273 TraceCheckUtils]: 64: Hoare triple {40312#(<= main_~i~0 15)} assume true; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {40312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,955 INFO L273 TraceCheckUtils]: 66: Hoare triple {40312#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40312#(<= main_~i~0 15)} is VALID [2018-11-14 18:39:33,955 INFO L273 TraceCheckUtils]: 67: Hoare triple {40312#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,956 INFO L273 TraceCheckUtils]: 68: Hoare triple {40313#(<= main_~i~0 16)} assume true; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,956 INFO L273 TraceCheckUtils]: 69: Hoare triple {40313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,957 INFO L273 TraceCheckUtils]: 70: Hoare triple {40313#(<= main_~i~0 16)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40313#(<= main_~i~0 16)} is VALID [2018-11-14 18:39:33,957 INFO L273 TraceCheckUtils]: 71: Hoare triple {40313#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,958 INFO L273 TraceCheckUtils]: 72: Hoare triple {40314#(<= main_~i~0 17)} assume true; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,958 INFO L273 TraceCheckUtils]: 73: Hoare triple {40314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,959 INFO L273 TraceCheckUtils]: 74: Hoare triple {40314#(<= main_~i~0 17)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40314#(<= main_~i~0 17)} is VALID [2018-11-14 18:39:33,959 INFO L273 TraceCheckUtils]: 75: Hoare triple {40314#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,960 INFO L273 TraceCheckUtils]: 76: Hoare triple {40315#(<= main_~i~0 18)} assume true; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,960 INFO L273 TraceCheckUtils]: 77: Hoare triple {40315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {40315#(<= main_~i~0 18)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40315#(<= main_~i~0 18)} is VALID [2018-11-14 18:39:33,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {40315#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,962 INFO L273 TraceCheckUtils]: 80: Hoare triple {40316#(<= main_~i~0 19)} assume true; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,962 INFO L273 TraceCheckUtils]: 81: Hoare triple {40316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,963 INFO L273 TraceCheckUtils]: 82: Hoare triple {40316#(<= main_~i~0 19)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40316#(<= main_~i~0 19)} is VALID [2018-11-14 18:39:33,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {40316#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,964 INFO L273 TraceCheckUtils]: 84: Hoare triple {40317#(<= main_~i~0 20)} assume true; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {40317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {40317#(<= main_~i~0 20)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40317#(<= main_~i~0 20)} is VALID [2018-11-14 18:39:33,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {40317#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {40318#(<= main_~i~0 21)} assume true; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,967 INFO L273 TraceCheckUtils]: 89: Hoare triple {40318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,967 INFO L273 TraceCheckUtils]: 90: Hoare triple {40318#(<= main_~i~0 21)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40318#(<= main_~i~0 21)} is VALID [2018-11-14 18:39:33,968 INFO L273 TraceCheckUtils]: 91: Hoare triple {40318#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,968 INFO L273 TraceCheckUtils]: 92: Hoare triple {40319#(<= main_~i~0 22)} assume true; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,969 INFO L273 TraceCheckUtils]: 93: Hoare triple {40319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,969 INFO L273 TraceCheckUtils]: 94: Hoare triple {40319#(<= main_~i~0 22)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40319#(<= main_~i~0 22)} is VALID [2018-11-14 18:39:33,970 INFO L273 TraceCheckUtils]: 95: Hoare triple {40319#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,970 INFO L273 TraceCheckUtils]: 96: Hoare triple {40320#(<= main_~i~0 23)} assume true; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,971 INFO L273 TraceCheckUtils]: 97: Hoare triple {40320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,971 INFO L273 TraceCheckUtils]: 98: Hoare triple {40320#(<= main_~i~0 23)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40320#(<= main_~i~0 23)} is VALID [2018-11-14 18:39:33,972 INFO L273 TraceCheckUtils]: 99: Hoare triple {40320#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,972 INFO L273 TraceCheckUtils]: 100: Hoare triple {40321#(<= main_~i~0 24)} assume true; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {40321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,973 INFO L273 TraceCheckUtils]: 102: Hoare triple {40321#(<= main_~i~0 24)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40321#(<= main_~i~0 24)} is VALID [2018-11-14 18:39:33,974 INFO L273 TraceCheckUtils]: 103: Hoare triple {40321#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,974 INFO L273 TraceCheckUtils]: 104: Hoare triple {40322#(<= main_~i~0 25)} assume true; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,975 INFO L273 TraceCheckUtils]: 105: Hoare triple {40322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,975 INFO L273 TraceCheckUtils]: 106: Hoare triple {40322#(<= main_~i~0 25)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40322#(<= main_~i~0 25)} is VALID [2018-11-14 18:39:33,976 INFO L273 TraceCheckUtils]: 107: Hoare triple {40322#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,977 INFO L273 TraceCheckUtils]: 108: Hoare triple {40323#(<= main_~i~0 26)} assume true; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,977 INFO L273 TraceCheckUtils]: 109: Hoare triple {40323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,977 INFO L273 TraceCheckUtils]: 110: Hoare triple {40323#(<= main_~i~0 26)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40323#(<= main_~i~0 26)} is VALID [2018-11-14 18:39:33,978 INFO L273 TraceCheckUtils]: 111: Hoare triple {40323#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,979 INFO L273 TraceCheckUtils]: 112: Hoare triple {40324#(<= main_~i~0 27)} assume true; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,979 INFO L273 TraceCheckUtils]: 113: Hoare triple {40324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,980 INFO L273 TraceCheckUtils]: 114: Hoare triple {40324#(<= main_~i~0 27)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40324#(<= main_~i~0 27)} is VALID [2018-11-14 18:39:33,980 INFO L273 TraceCheckUtils]: 115: Hoare triple {40324#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,981 INFO L273 TraceCheckUtils]: 116: Hoare triple {40325#(<= main_~i~0 28)} assume true; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,981 INFO L273 TraceCheckUtils]: 117: Hoare triple {40325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,982 INFO L273 TraceCheckUtils]: 118: Hoare triple {40325#(<= main_~i~0 28)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40325#(<= main_~i~0 28)} is VALID [2018-11-14 18:39:33,982 INFO L273 TraceCheckUtils]: 119: Hoare triple {40325#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,983 INFO L273 TraceCheckUtils]: 120: Hoare triple {40326#(<= main_~i~0 29)} assume true; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,983 INFO L273 TraceCheckUtils]: 121: Hoare triple {40326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,984 INFO L273 TraceCheckUtils]: 122: Hoare triple {40326#(<= main_~i~0 29)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40326#(<= main_~i~0 29)} is VALID [2018-11-14 18:39:33,984 INFO L273 TraceCheckUtils]: 123: Hoare triple {40326#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,985 INFO L273 TraceCheckUtils]: 124: Hoare triple {40327#(<= main_~i~0 30)} assume true; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,986 INFO L273 TraceCheckUtils]: 125: Hoare triple {40327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,987 INFO L273 TraceCheckUtils]: 126: Hoare triple {40327#(<= main_~i~0 30)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40327#(<= main_~i~0 30)} is VALID [2018-11-14 18:39:33,988 INFO L273 TraceCheckUtils]: 127: Hoare triple {40327#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,989 INFO L273 TraceCheckUtils]: 128: Hoare triple {40328#(<= main_~i~0 31)} assume true; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,989 INFO L273 TraceCheckUtils]: 129: Hoare triple {40328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,989 INFO L273 TraceCheckUtils]: 130: Hoare triple {40328#(<= main_~i~0 31)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40328#(<= main_~i~0 31)} is VALID [2018-11-14 18:39:33,993 INFO L273 TraceCheckUtils]: 131: Hoare triple {40328#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,993 INFO L273 TraceCheckUtils]: 132: Hoare triple {40329#(<= main_~i~0 32)} assume true; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,995 INFO L273 TraceCheckUtils]: 133: Hoare triple {40329#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,995 INFO L273 TraceCheckUtils]: 134: Hoare triple {40329#(<= main_~i~0 32)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40329#(<= main_~i~0 32)} is VALID [2018-11-14 18:39:33,998 INFO L273 TraceCheckUtils]: 135: Hoare triple {40329#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:33,998 INFO L273 TraceCheckUtils]: 136: Hoare triple {40330#(<= main_~i~0 33)} assume true; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:34,001 INFO L273 TraceCheckUtils]: 137: Hoare triple {40330#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4); {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:34,001 INFO L273 TraceCheckUtils]: 138: Hoare triple {40330#(<= main_~i~0 33)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40330#(<= main_~i~0 33)} is VALID [2018-11-14 18:39:34,003 INFO L273 TraceCheckUtils]: 139: Hoare triple {40330#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {40331#(<= main_~i~0 34)} is VALID [2018-11-14 18:39:34,003 INFO L273 TraceCheckUtils]: 140: Hoare triple {40331#(<= main_~i~0 34)} assume true; {40331#(<= main_~i~0 34)} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 141: Hoare triple {40331#(<= main_~i~0 34)} assume !(~i~0 < 100000); {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 142: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 143: Hoare triple {40297#false} assume !(~swapped~0 != 0); {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 144: Hoare triple {40297#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 145: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 146: Hoare triple {40297#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 147: Hoare triple {40297#false} assume true; {40297#false} is VALID [2018-11-14 18:39:34,005 INFO L273 TraceCheckUtils]: 148: Hoare triple {40297#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {40297#false} is VALID [2018-11-14 18:39:34,006 INFO L256 TraceCheckUtils]: 149: Hoare triple {40297#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {40297#false} is VALID [2018-11-14 18:39:34,006 INFO L273 TraceCheckUtils]: 150: Hoare triple {40297#false} ~cond := #in~cond; {40297#false} is VALID [2018-11-14 18:39:34,006 INFO L273 TraceCheckUtils]: 151: Hoare triple {40297#false} assume ~cond == 0; {40297#false} is VALID [2018-11-14 18:39:34,006 INFO L273 TraceCheckUtils]: 152: Hoare triple {40297#false} assume !false; {40297#false} is VALID [2018-11-14 18:39:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 2 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:39:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-14 18:39:34,043 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 153 [2018-11-14 18:39:34,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:34,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 18:39:34,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 18:39:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 18:39:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:39:34,224 INFO L87 Difference]: Start difference. First operand 290 states and 359 transitions. Second operand 37 states.