java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:43:13,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:43:13,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:43:13,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:43:13,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:43:13,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:43:13,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:43:13,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:43:13,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:43:13,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:43:13,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:43:13,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:43:13,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:43:13,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:43:13,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:43:13,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:43:13,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:43:13,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:43:13,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:43:13,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:43:13,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:43:13,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:43:13,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:43:13,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:43:13,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:43:13,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:43:13,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:43:13,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:43:13,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:43:13,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:43:13,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:43:13,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:43:13,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:43:13,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:43:13,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:43:13,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:43:13,191 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:43:13,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:43:13,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:43:13,227 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:43:13,227 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:43:13,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:43:13,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:43:13,228 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:43:13,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:43:13,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:43:13,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:43:13,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:43:13,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:43:13,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:43:13,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:43:13,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:43:13,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:43:13,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:43:13,231 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:43:13,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:43:13,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:43:13,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:43:13,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:43:13,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:43:13,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:13,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:43:13,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:43:13,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:43:13,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:43:13,234 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:43:13,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:43:13,234 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:43:13,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:43:13,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:43:13,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:43:13,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:43:13,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:43:13,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-18 22:43:13,395 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c014e7278/6ff24d6f10174eeeb90eb47e705adb13/FLAGb10bc0bac [2018-11-18 22:43:13,826 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:43:13,827 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-18 22:43:13,834 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c014e7278/6ff24d6f10174eeeb90eb47e705adb13/FLAGb10bc0bac [2018-11-18 22:43:14,198 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c014e7278/6ff24d6f10174eeeb90eb47e705adb13 [2018-11-18 22:43:14,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:43:14,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:43:14,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:43:14,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:43:14,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40239a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14, skipping insertion in model container [2018-11-18 22:43:14,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:43:14,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:43:14,494 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,501 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:43:14,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,572 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:43:14,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14 WrapperNode [2018-11-18 22:43:14,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:43:14,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:43:14,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:43:14,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:43:14,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:43:14,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:14,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:43:14,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:43:14,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:43:14,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:43:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:43:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:43:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:43:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:43:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:43:15,747 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:43:15,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15 BoogieIcfgContainer [2018-11-18 22:43:15,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:43:15,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:43:15,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:43:15,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:43:15,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:43:14" (1/3) ... [2018-11-18 22:43:15,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b75207e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (2/3) ... [2018-11-18 22:43:15,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b75207e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:15, skipping insertion in model container [2018-11-18 22:43:15,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:15" (3/3) ... [2018-11-18 22:43:15,758 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call2_ground.i [2018-11-18 22:43:15,768 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:43:15,776 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:43:15,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:43:15,823 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:43:15,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:43:15,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:43:15,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:43:15,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:43:15,828 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:43:15,828 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:43:15,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:43:15,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:43:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-18 22:43:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:43:15,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:15,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:15,860 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:15,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1734015145, now seen corresponding path program 1 times [2018-11-18 22:43:15,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:16,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-18 22:43:16,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52#true} is VALID [2018-11-18 22:43:16,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-18 22:43:16,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #137#return; {52#true} is VALID [2018-11-18 22:43:16,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret15 := main(); {52#true} is VALID [2018-11-18 22:43:16,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {52#true} is VALID [2018-11-18 22:43:16,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-18 22:43:16,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#false} ~x~0 := 0; {53#false} is VALID [2018-11-18 22:43:16,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-18 22:43:16,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {53#false} is VALID [2018-11-18 22:43:16,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-18 22:43:16,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {53#false} is VALID [2018-11-18 22:43:16,016 INFO L256 TraceCheckUtils]: 12: Hoare triple {53#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {53#false} is VALID [2018-11-18 22:43:16,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {53#false} ~cond := #in~cond; {53#false} is VALID [2018-11-18 22:43:16,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#false} assume 0 == ~cond; {53#false} is VALID [2018-11-18 22:43:16,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-18 22:43:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:16,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:16,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:43:16,027 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:43:16,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:16,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:43:16,138 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-18 22:43:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:43:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:43:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:16,150 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-18 22:43:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,470 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2018-11-18 22:43:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:43:16,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:43:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-18 22:43:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-18 22:43:16,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-18 22:43:17,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,108 INFO L225 Difference]: With dead ends: 92 [2018-11-18 22:43:17,108 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:43:17,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:43:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 22:43:17,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:17,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-18 22:43:17,346 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-18 22:43:17,346 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-18 22:43:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,353 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-18 22:43:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-18 22:43:17,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,355 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-18 22:43:17,355 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-18 22:43:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,361 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-18 22:43:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-18 22:43:17,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:17,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:43:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-18 22:43:17,369 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 16 [2018-11-18 22:43:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-18 22:43:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:43:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-18 22:43:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 22:43:17,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:17,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:17,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:17,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1030099958, now seen corresponding path program 1 times [2018-11-18 22:43:17,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {321#true} call ULTIMATE.init(); {321#true} is VALID [2018-11-18 22:43:17,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {321#true} is VALID [2018-11-18 22:43:17,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {321#true} assume true; {321#true} is VALID [2018-11-18 22:43:17,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {321#true} {321#true} #137#return; {321#true} is VALID [2018-11-18 22:43:17,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {321#true} call #t~ret15 := main(); {321#true} is VALID [2018-11-18 22:43:17,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {323#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {323#(= main_~i~0 0)} assume true; {323#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {323#(= main_~i~0 0)} assume !(~i~0 < 100000); {322#false} is VALID [2018-11-18 22:43:17,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#false} ~x~0 := 0; {322#false} is VALID [2018-11-18 22:43:17,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {322#false} assume true; {322#false} is VALID [2018-11-18 22:43:17,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {322#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {322#false} is VALID [2018-11-18 22:43:17,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {322#false} assume true; {322#false} is VALID [2018-11-18 22:43:17,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#false} assume !!(~y~0 < 100000);call #t~mem13 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem14 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {322#false} is VALID [2018-11-18 22:43:17,545 INFO L256 TraceCheckUtils]: 13: Hoare triple {322#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {322#false} is VALID [2018-11-18 22:43:17,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#false} ~cond := #in~cond; {322#false} is VALID [2018-11-18 22:43:17,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#false} assume 0 == ~cond; {322#false} is VALID [2018-11-18 22:43:17,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {322#false} assume !false; {322#false} is VALID [2018-11-18 22:43:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:17,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:17,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:17,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 22:43:17,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:17,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:17,589 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-18 22:43:17,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:17,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:17,590 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-18 22:43:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,056 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-18 22:43:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:18,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 22:43:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-18 22:43:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-18 22:43:18,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-18 22:43:18,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,295 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:43:18,295 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 22:43:18,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 22:43:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-18 22:43:18,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:18,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2018-11-18 22:43:18,344 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2018-11-18 22:43:18,345 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2018-11-18 22:43:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,351 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-18 22:43:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-18 22:43:18,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,353 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2018-11-18 22:43:18,353 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2018-11-18 22:43:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,358 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-18 22:43:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-18 22:43:18,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:18,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:43:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-18 22:43:18,364 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 17 [2018-11-18 22:43:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:18,364 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-18 22:43:18,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-18 22:43:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:43:18,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:18,366 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:18,366 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:18,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1829402631, now seen corresponding path program 1 times [2018-11-18 22:43:18,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:18,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-18 22:43:18,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-18 22:43:18,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-18 22:43:18,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #137#return; {630#true} is VALID [2018-11-18 22:43:18,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret15 := main(); {630#true} is VALID [2018-11-18 22:43:18,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {632#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:18,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {632#(= 0 main_~i~0)} assume true; {632#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:18,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {633#(= main_~k~0 0)} is VALID [2018-11-18 22:43:18,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {633#(= main_~k~0 0)} assume true; {633#(= main_~k~0 0)} is VALID [2018-11-18 22:43:18,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {633#(= main_~k~0 0)} assume !(~k~0 < 100000); {631#false} is VALID [2018-11-18 22:43:18,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {631#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {631#false} is VALID [2018-11-18 22:43:18,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {631#false} ~x~0 := 0; {631#false} is VALID [2018-11-18 22:43:18,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {631#false} assume true; {631#false} is VALID [2018-11-18 22:43:18,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {631#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {631#false} is VALID [2018-11-18 22:43:18,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {631#false} assume true; {631#false} is VALID [2018-11-18 22:43:18,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {631#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {631#false} is VALID [2018-11-18 22:43:18,499 INFO L256 TraceCheckUtils]: 16: Hoare triple {631#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {631#false} is VALID [2018-11-18 22:43:18,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {631#false} ~cond := #in~cond; {631#false} is VALID [2018-11-18 22:43:18,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {631#false} assume 0 == ~cond; {631#false} is VALID [2018-11-18 22:43:18,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-18 22:43:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:18,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:18,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:43:18,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-18 22:43:18,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:18,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:43:18,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:43:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:43:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:43:18,563 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 4 states. [2018-11-18 22:43:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,989 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2018-11-18 22:43:18,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:43:18,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-18 22:43:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:43:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-18 22:43:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:43:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-18 22:43:18,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2018-11-18 22:43:19,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:19,258 INFO L225 Difference]: With dead ends: 109 [2018-11-18 22:43:19,259 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 22:43:19,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 22:43:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-11-18 22:43:19,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:19,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 48 states. [2018-11-18 22:43:19,283 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 48 states. [2018-11-18 22:43:19,283 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 48 states. [2018-11-18 22:43:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,288 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-18 22:43:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-18 22:43:19,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,290 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 71 states. [2018-11-18 22:43:19,290 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 71 states. [2018-11-18 22:43:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,295 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-18 22:43:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-18 22:43:19,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:19,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:43:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-18 22:43:19,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 20 [2018-11-18 22:43:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:19,301 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 22:43:19,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:43:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 22:43:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:43:19,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:19,302 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:19,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:19,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1435057265, now seen corresponding path program 1 times [2018-11-18 22:43:19,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:19,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:19,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:19,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2018-11-18 22:43:19,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {988#true} is VALID [2018-11-18 22:43:19,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2018-11-18 22:43:19,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {988#true} {988#true} #137#return; {988#true} is VALID [2018-11-18 22:43:19,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {988#true} call #t~ret15 := main(); {988#true} is VALID [2018-11-18 22:43:19,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {988#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {990#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:19,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {990#(= 0 main_~i~0)} assume true; {990#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:19,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {990#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {991#(= main_~k~0 0)} is VALID [2018-11-18 22:43:19,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {991#(= main_~k~0 0)} assume true; {991#(= main_~k~0 0)} is VALID [2018-11-18 22:43:19,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {991#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {991#(= main_~k~0 0)} is VALID [2018-11-18 22:43:19,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {991#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {991#(= main_~k~0 0)} is VALID [2018-11-18 22:43:19,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {991#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {992#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:19,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {992#(<= main_~k~0 1)} assume true; {992#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:19,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {992#(<= main_~k~0 1)} assume !(~k~0 < 100000); {989#false} is VALID [2018-11-18 22:43:19,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {989#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {989#false} is VALID [2018-11-18 22:43:19,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {989#false} ~x~0 := 0; {989#false} is VALID [2018-11-18 22:43:19,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {989#false} assume true; {989#false} is VALID [2018-11-18 22:43:19,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {989#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {989#false} is VALID [2018-11-18 22:43:19,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {989#false} assume true; {989#false} is VALID [2018-11-18 22:43:19,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {989#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {989#false} is VALID [2018-11-18 22:43:19,437 INFO L256 TraceCheckUtils]: 20: Hoare triple {989#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {989#false} is VALID [2018-11-18 22:43:19,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {989#false} ~cond := #in~cond; {989#false} is VALID [2018-11-18 22:43:19,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {989#false} assume 0 == ~cond; {989#false} is VALID [2018-11-18 22:43:19,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {989#false} assume !false; {989#false} is VALID [2018-11-18 22:43:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:19,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:19,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:19,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:19,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2018-11-18 22:43:19,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {988#true} is VALID [2018-11-18 22:43:19,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2018-11-18 22:43:19,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {988#true} {988#true} #137#return; {988#true} is VALID [2018-11-18 22:43:19,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {988#true} call #t~ret15 := main(); {988#true} is VALID [2018-11-18 22:43:19,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {988#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1011#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:19,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {1011#(<= main_~i~0 0)} assume true; {1011#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {1011#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1018#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:19,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#(<= main_~k~0 0)} assume true; {1018#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:19,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {1018#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1018#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:19,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {1018#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1018#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:19,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {1018#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {992#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:19,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {992#(<= main_~k~0 1)} assume true; {992#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:19,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {992#(<= main_~k~0 1)} assume !(~k~0 < 100000); {989#false} is VALID [2018-11-18 22:43:19,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {989#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {989#false} is VALID [2018-11-18 22:43:19,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {989#false} ~x~0 := 0; {989#false} is VALID [2018-11-18 22:43:19,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {989#false} assume true; {989#false} is VALID [2018-11-18 22:43:19,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {989#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {989#false} is VALID [2018-11-18 22:43:19,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {989#false} assume true; {989#false} is VALID [2018-11-18 22:43:19,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {989#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {989#false} is VALID [2018-11-18 22:43:19,837 INFO L256 TraceCheckUtils]: 20: Hoare triple {989#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {989#false} is VALID [2018-11-18 22:43:19,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {989#false} ~cond := #in~cond; {989#false} is VALID [2018-11-18 22:43:19,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {989#false} assume 0 == ~cond; {989#false} is VALID [2018-11-18 22:43:19,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {989#false} assume !false; {989#false} is VALID [2018-11-18 22:43:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:19,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:19,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 22:43:19,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-18 22:43:19,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:19,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:43:19,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:19,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:43:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:43:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:43:19,960 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 7 states. [2018-11-18 22:43:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,420 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2018-11-18 22:43:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:43:20,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-18 22:43:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-18 22:43:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2018-11-18 22:43:20,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2018-11-18 22:43:20,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,641 INFO L225 Difference]: With dead ends: 113 [2018-11-18 22:43:20,641 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:43:20,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:43:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2018-11-18 22:43:20,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:20,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 52 states. [2018-11-18 22:43:20,713 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 52 states. [2018-11-18 22:43:20,713 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 52 states. [2018-11-18 22:43:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,717 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-11-18 22:43:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-18 22:43:20,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,718 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 75 states. [2018-11-18 22:43:20,719 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 75 states. [2018-11-18 22:43:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,723 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-11-18 22:43:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2018-11-18 22:43:20,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:20,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:43:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-11-18 22:43:20,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 24 [2018-11-18 22:43:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:20,728 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-18 22:43:20,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:43:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-18 22:43:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 22:43:20,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:20,729 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:20,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:20,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1629766693, now seen corresponding path program 2 times [2018-11-18 22:43:20,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2018-11-18 22:43:20,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {1438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1438#true} is VALID [2018-11-18 22:43:20,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 22:43:20,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #137#return; {1438#true} is VALID [2018-11-18 22:43:20,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret15 := main(); {1438#true} is VALID [2018-11-18 22:43:20,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {1438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1440#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:20,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {1440#(= 0 main_~i~0)} assume true; {1440#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:20,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {1440#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1441#(= main_~k~0 0)} is VALID [2018-11-18 22:43:20,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {1441#(= main_~k~0 0)} assume true; {1441#(= main_~k~0 0)} is VALID [2018-11-18 22:43:20,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {1441#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1441#(= main_~k~0 0)} is VALID [2018-11-18 22:43:20,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {1441#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1441#(= main_~k~0 0)} is VALID [2018-11-18 22:43:20,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {1441#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1442#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:20,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1442#(<= main_~k~0 1)} assume true; {1442#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:20,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {1442#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1442#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:20,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1442#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:20,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1443#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:20,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {1443#(<= main_~k~0 2)} assume true; {1443#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:20,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {1443#(<= main_~k~0 2)} assume !(~k~0 < 100000); {1439#false} is VALID [2018-11-18 22:43:20,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {1439#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1439#false} is VALID [2018-11-18 22:43:20,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {1439#false} ~x~0 := 0; {1439#false} is VALID [2018-11-18 22:43:20,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {1439#false} assume true; {1439#false} is VALID [2018-11-18 22:43:20,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {1439#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1439#false} is VALID [2018-11-18 22:43:20,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {1439#false} assume true; {1439#false} is VALID [2018-11-18 22:43:20,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {1439#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1439#false} is VALID [2018-11-18 22:43:20,862 INFO L256 TraceCheckUtils]: 24: Hoare triple {1439#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1439#false} is VALID [2018-11-18 22:43:20,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {1439#false} ~cond := #in~cond; {1439#false} is VALID [2018-11-18 22:43:20,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {1439#false} assume 0 == ~cond; {1439#false} is VALID [2018-11-18 22:43:20,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2018-11-18 22:43:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:20,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:20,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:20,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:20,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:43:20,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:21,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2018-11-18 22:43:21,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {1438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1438#true} is VALID [2018-11-18 22:43:21,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2018-11-18 22:43:21,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #137#return; {1438#true} is VALID [2018-11-18 22:43:21,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret15 := main(); {1438#true} is VALID [2018-11-18 22:43:21,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {1438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {1462#(<= main_~i~0 0)} assume true; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {1462#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {1462#(<= main_~i~0 0)} assume true; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(<= main_~i~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {1462#(<= main_~i~0 0)} assume true; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {1462#(<= main_~i~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {1462#(<= main_~i~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {1462#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {1462#(<= main_~i~0 0)} assume true; {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {1462#(<= main_~i~0 0)} assume !(~k~0 < 100000); {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {1462#(<= main_~i~0 0)} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1462#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:21,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {1462#(<= main_~i~0 0)} ~x~0 := 0; {1505#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 22:43:21,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {1505#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume true; {1505#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 22:43:21,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {1505#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1439#false} is VALID [2018-11-18 22:43:21,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {1439#false} assume true; {1439#false} is VALID [2018-11-18 22:43:21,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {1439#false} assume !!(~y~0 < ~i~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~y~0, 4); {1439#false} is VALID [2018-11-18 22:43:21,042 INFO L256 TraceCheckUtils]: 24: Hoare triple {1439#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1439#false} is VALID [2018-11-18 22:43:21,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {1439#false} ~cond := #in~cond; {1439#false} is VALID [2018-11-18 22:43:21,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {1439#false} assume 0 == ~cond; {1439#false} is VALID [2018-11-18 22:43:21,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2018-11-18 22:43:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 22:43:21,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:43:21,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-18 22:43:21,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 22:43:21,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:21,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:43:21,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:21,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:43:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:43:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:21,135 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 8 states. [2018-11-18 22:43:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,944 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2018-11-18 22:43:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:21,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 22:43:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-18 22:43:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-18 22:43:21,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-18 22:43:22,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,190 INFO L225 Difference]: With dead ends: 111 [2018-11-18 22:43:22,190 INFO L226 Difference]: Without dead ends: 73 [2018-11-18 22:43:22,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-18 22:43:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-11-18 22:43:22,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:22,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 64 states. [2018-11-18 22:43:22,229 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 64 states. [2018-11-18 22:43:22,229 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 64 states. [2018-11-18 22:43:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,233 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-11-18 22:43:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2018-11-18 22:43:22,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:22,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 73 states. [2018-11-18 22:43:22,234 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 73 states. [2018-11-18 22:43:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,238 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-11-18 22:43:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2018-11-18 22:43:22,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:22,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:22,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:22,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 22:43:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-18 22:43:22,241 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 28 [2018-11-18 22:43:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:22,242 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-18 22:43:22,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:43:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-18 22:43:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:43:22,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:22,243 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:22,243 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:22,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash 780121715, now seen corresponding path program 1 times [2018-11-18 22:43:22,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:22,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-18 22:43:22,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {1913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1913#true} is VALID [2018-11-18 22:43:22,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-18 22:43:22,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #137#return; {1913#true} is VALID [2018-11-18 22:43:22,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret15 := main(); {1913#true} is VALID [2018-11-18 22:43:22,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {1913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1915#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:22,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {1915#(= 0 main_~i~0)} assume true; {1915#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:22,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {1915#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1916#(= main_~k~0 0)} is VALID [2018-11-18 22:43:22,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {1916#(= main_~k~0 0)} assume true; {1916#(= main_~k~0 0)} is VALID [2018-11-18 22:43:22,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {1916#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1916#(= main_~k~0 0)} is VALID [2018-11-18 22:43:22,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {1916#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1916#(= main_~k~0 0)} is VALID [2018-11-18 22:43:22,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {1916#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {1917#(<= main_~k~0 1)} assume true; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {1917#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {1917#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {1917#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {1918#(<= main_~k~0 2)} assume true; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {1918#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {1918#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {1918#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {1919#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:22,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {1919#(<= main_~k~0 3)} assume true; {1919#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:22,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {1919#(<= main_~k~0 3)} assume !(~k~0 < 100000); {1914#false} is VALID [2018-11-18 22:43:22,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {1914#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1914#false} is VALID [2018-11-18 22:43:22,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {1914#false} ~x~0 := 0; {1914#false} is VALID [2018-11-18 22:43:22,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-18 22:43:22,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {1914#false} assume !(~x~0 < ~i~0); {1914#false} is VALID [2018-11-18 22:43:22,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {1914#false} ~x~0 := 1 + ~i~0; {1914#false} is VALID [2018-11-18 22:43:22,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-18 22:43:22,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {1914#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1914#false} is VALID [2018-11-18 22:43:22,491 INFO L256 TraceCheckUtils]: 29: Hoare triple {1914#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {1914#false} is VALID [2018-11-18 22:43:22,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-18 22:43:22,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {1914#false} assume 0 == ~cond; {1914#false} is VALID [2018-11-18 22:43:22,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-18 22:43:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:22,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:22,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:22,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-18 22:43:22,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {1913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1913#true} is VALID [2018-11-18 22:43:22,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-18 22:43:22,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #137#return; {1913#true} is VALID [2018-11-18 22:43:22,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret15 := main(); {1913#true} is VALID [2018-11-18 22:43:22,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {1913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1938#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {1938#(<= main_~i~0 0)} assume true; {1938#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {1938#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1945#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:22,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {1945#(<= main_~k~0 0)} assume true; {1945#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:22,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {1945#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1945#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:22,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {1945#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1945#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:22,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {1945#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {1917#(<= main_~k~0 1)} assume true; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {1917#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {1917#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1917#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:22,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {1917#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1918#(<= main_~k~0 2)} assume true; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {1918#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {1918#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1918#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:22,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {1918#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {1919#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:22,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {1919#(<= main_~k~0 3)} assume true; {1919#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:22,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {1919#(<= main_~k~0 3)} assume !(~k~0 < 100000); {1914#false} is VALID [2018-11-18 22:43:22,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {1914#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1914#false} is VALID [2018-11-18 22:43:22,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {1914#false} ~x~0 := 0; {1914#false} is VALID [2018-11-18 22:43:22,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-18 22:43:22,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {1914#false} assume !(~x~0 < ~i~0); {1914#false} is VALID [2018-11-18 22:43:22,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {1914#false} ~x~0 := 1 + ~i~0; {1914#false} is VALID [2018-11-18 22:43:22,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-18 22:43:22,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {1914#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1914#false} is VALID [2018-11-18 22:43:22,819 INFO L256 TraceCheckUtils]: 29: Hoare triple {1914#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {1914#false} is VALID [2018-11-18 22:43:22,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-18 22:43:22,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {1914#false} assume 0 == ~cond; {1914#false} is VALID [2018-11-18 22:43:22,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-18 22:43:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:22,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:22,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-18 22:43:22,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:43:22,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:22,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:43:22,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:43:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:43:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:22,921 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 9 states. [2018-11-18 22:43:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,805 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2018-11-18 22:43:23,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:23,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:43:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2018-11-18 22:43:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2018-11-18 22:43:23,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 145 transitions. [2018-11-18 22:43:24,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:24,058 INFO L225 Difference]: With dead ends: 119 [2018-11-18 22:43:24,058 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 22:43:24,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:43:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 22:43:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-11-18 22:43:24,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:24,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 68 states. [2018-11-18 22:43:24,079 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 68 states. [2018-11-18 22:43:24,079 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 68 states. [2018-11-18 22:43:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,082 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-18 22:43:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-18 22:43:24,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,083 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 77 states. [2018-11-18 22:43:24,083 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 77 states. [2018-11-18 22:43:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,087 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-18 22:43:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-18 22:43:24,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:24,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:43:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-18 22:43:24,091 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 33 [2018-11-18 22:43:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-18 22:43:24,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:43:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-18 22:43:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 22:43:24,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:24,092 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:24,093 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:24,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash -688591287, now seen corresponding path program 2 times [2018-11-18 22:43:24,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:24,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {2427#true} call ULTIMATE.init(); {2427#true} is VALID [2018-11-18 22:43:24,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {2427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2427#true} is VALID [2018-11-18 22:43:24,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {2427#true} assume true; {2427#true} is VALID [2018-11-18 22:43:24,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2427#true} {2427#true} #137#return; {2427#true} is VALID [2018-11-18 22:43:24,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {2427#true} call #t~ret15 := main(); {2427#true} is VALID [2018-11-18 22:43:24,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {2427#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2429#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:24,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {2429#(= 0 main_~i~0)} assume true; {2429#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:24,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {2429#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2430#(= main_~k~0 0)} is VALID [2018-11-18 22:43:24,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {2430#(= main_~k~0 0)} assume true; {2430#(= main_~k~0 0)} is VALID [2018-11-18 22:43:24,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {2430#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2430#(= main_~k~0 0)} is VALID [2018-11-18 22:43:24,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {2430#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2430#(= main_~k~0 0)} is VALID [2018-11-18 22:43:24,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {2430#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {2431#(<= main_~k~0 1)} assume true; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {2431#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {2431#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {2431#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {2432#(<= main_~k~0 2)} assume true; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {2432#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {2432#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {2432#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {2433#(<= main_~k~0 3)} assume true; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {2433#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {2433#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {2433#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2434#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:24,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {2434#(<= main_~k~0 4)} assume true; {2434#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:24,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {2434#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2428#false} is VALID [2018-11-18 22:43:24,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {2428#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2428#false} is VALID [2018-11-18 22:43:24,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {2428#false} ~x~0 := 0; {2428#false} is VALID [2018-11-18 22:43:24,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {2428#false} assume true; {2428#false} is VALID [2018-11-18 22:43:24,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {2428#false} assume !(~x~0 < ~i~0); {2428#false} is VALID [2018-11-18 22:43:24,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {2428#false} ~x~0 := 1 + ~i~0; {2428#false} is VALID [2018-11-18 22:43:24,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {2428#false} assume true; {2428#false} is VALID [2018-11-18 22:43:24,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {2428#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2428#false} is VALID [2018-11-18 22:43:24,261 INFO L256 TraceCheckUtils]: 33: Hoare triple {2428#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2428#false} is VALID [2018-11-18 22:43:24,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {2428#false} ~cond := #in~cond; {2428#false} is VALID [2018-11-18 22:43:24,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {2428#false} assume 0 == ~cond; {2428#false} is VALID [2018-11-18 22:43:24,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {2428#false} assume !false; {2428#false} is VALID [2018-11-18 22:43:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:24,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:24,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:24,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:24,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:24,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:24,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {2427#true} call ULTIMATE.init(); {2427#true} is VALID [2018-11-18 22:43:24,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {2427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2427#true} is VALID [2018-11-18 22:43:24,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {2427#true} assume true; {2427#true} is VALID [2018-11-18 22:43:24,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2427#true} {2427#true} #137#return; {2427#true} is VALID [2018-11-18 22:43:24,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {2427#true} call #t~ret15 := main(); {2427#true} is VALID [2018-11-18 22:43:24,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {2427#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2453#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:24,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {2453#(<= main_~i~0 0)} assume true; {2453#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:24,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {2453#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2460#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:24,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {2460#(<= main_~k~0 0)} assume true; {2460#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:24,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {2460#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2460#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:24,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {2460#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2460#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:24,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {2460#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {2431#(<= main_~k~0 1)} assume true; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {2431#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {2431#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2431#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:24,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {2431#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {2432#(<= main_~k~0 2)} assume true; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {2432#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {2432#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2432#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:24,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {2432#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {2433#(<= main_~k~0 3)} assume true; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {2433#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {2433#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2433#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:24,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {2433#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2434#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:24,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {2434#(<= main_~k~0 4)} assume true; {2434#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:24,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {2434#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2428#false} is VALID [2018-11-18 22:43:24,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {2428#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2428#false} is VALID [2018-11-18 22:43:24,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {2428#false} ~x~0 := 0; {2428#false} is VALID [2018-11-18 22:43:24,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {2428#false} assume true; {2428#false} is VALID [2018-11-18 22:43:24,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {2428#false} assume !(~x~0 < ~i~0); {2428#false} is VALID [2018-11-18 22:43:24,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {2428#false} ~x~0 := 1 + ~i~0; {2428#false} is VALID [2018-11-18 22:43:24,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {2428#false} assume true; {2428#false} is VALID [2018-11-18 22:43:24,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {2428#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2428#false} is VALID [2018-11-18 22:43:24,701 INFO L256 TraceCheckUtils]: 33: Hoare triple {2428#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2428#false} is VALID [2018-11-18 22:43:24,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {2428#false} ~cond := #in~cond; {2428#false} is VALID [2018-11-18 22:43:24,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {2428#false} assume 0 == ~cond; {2428#false} is VALID [2018-11-18 22:43:24,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {2428#false} assume !false; {2428#false} is VALID [2018-11-18 22:43:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-18 22:43:24,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-18 22:43:24,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:24,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:43:25,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:25,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:43:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:43:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:43:25,010 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 10 states. [2018-11-18 22:43:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,539 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-11-18 22:43:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:43:25,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-18 22:43:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-18 22:43:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-18 22:43:25,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 150 transitions. [2018-11-18 22:43:25,814 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-18 22:43:25,816 INFO L225 Difference]: With dead ends: 123 [2018-11-18 22:43:25,817 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 22:43:25,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 22:43:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-18 22:43:25,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:25,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 72 states. [2018-11-18 22:43:25,846 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 72 states. [2018-11-18 22:43:25,847 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 72 states. [2018-11-18 22:43:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,850 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-11-18 22:43:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-18 22:43:25,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,851 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 81 states. [2018-11-18 22:43:25,851 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 81 states. [2018-11-18 22:43:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,854 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-11-18 22:43:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-18 22:43:25,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:25,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 22:43:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2018-11-18 22:43:25,858 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 37 [2018-11-18 22:43:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:25,858 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2018-11-18 22:43:25,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:43:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2018-11-18 22:43:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 22:43:25,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:25,859 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:25,860 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:25,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1337871135, now seen corresponding path program 3 times [2018-11-18 22:43:25,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:25,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:25,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:25,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {2974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2974#true} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-18 22:43:26,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2974#true} {2974#true} #137#return; {2974#true} is VALID [2018-11-18 22:43:26,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {2974#true} call #t~ret15 := main(); {2974#true} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {2974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2976#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:26,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {2976#(= 0 main_~i~0)} assume true; {2976#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:26,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {2976#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2977#(= main_~k~0 0)} is VALID [2018-11-18 22:43:26,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {2977#(= main_~k~0 0)} assume true; {2977#(= main_~k~0 0)} is VALID [2018-11-18 22:43:26,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {2977#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2977#(= main_~k~0 0)} is VALID [2018-11-18 22:43:26,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {2977#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2977#(= main_~k~0 0)} is VALID [2018-11-18 22:43:26,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {2977#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {2978#(<= main_~k~0 1)} assume true; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {2978#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {2978#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {2978#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {2979#(<= main_~k~0 2)} assume true; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {2979#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {2979#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {2980#(<= main_~k~0 3)} assume true; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {2980#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {2980#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {2980#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {2981#(<= main_~k~0 4)} assume true; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {2981#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {2981#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,040 INFO L273 TraceCheckUtils]: 27: Hoare triple {2981#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2982#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:26,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#(<= main_~k~0 5)} assume true; {2982#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:26,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#(<= main_~k~0 5)} assume !(~k~0 < 100000); {2975#false} is VALID [2018-11-18 22:43:26,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {2975#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2975#false} is VALID [2018-11-18 22:43:26,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {2975#false} ~x~0 := 0; {2975#false} is VALID [2018-11-18 22:43:26,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {2975#false} assume true; {2975#false} is VALID [2018-11-18 22:43:26,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {2975#false} assume !(~x~0 < ~i~0); {2975#false} is VALID [2018-11-18 22:43:26,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {2975#false} ~x~0 := 1 + ~i~0; {2975#false} is VALID [2018-11-18 22:43:26,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {2975#false} assume true; {2975#false} is VALID [2018-11-18 22:43:26,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {2975#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2975#false} is VALID [2018-11-18 22:43:26,043 INFO L256 TraceCheckUtils]: 37: Hoare triple {2975#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2975#false} is VALID [2018-11-18 22:43:26,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2018-11-18 22:43:26,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2018-11-18 22:43:26,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2018-11-18 22:43:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:26,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:26,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 22:43:26,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:26,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2018-11-18 22:43:26,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {2974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2974#true} is VALID [2018-11-18 22:43:26,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-18 22:43:26,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2974#true} {2974#true} #137#return; {2974#true} is VALID [2018-11-18 22:43:26,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {2974#true} call #t~ret15 := main(); {2974#true} is VALID [2018-11-18 22:43:26,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {2974#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3001#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:26,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {3001#(<= main_~i~0 0)} assume true; {3001#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:26,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {3001#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3008#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:26,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {3008#(<= main_~k~0 0)} assume true; {3008#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:26,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {3008#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3008#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:26,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {3008#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3008#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:26,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {3008#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {2978#(<= main_~k~0 1)} assume true; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {2978#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {2978#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2978#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:26,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {2978#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {2979#(<= main_~k~0 2)} assume true; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {2979#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2979#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:26,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {2979#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {2980#(<= main_~k~0 3)} assume true; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {2980#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,293 INFO L273 TraceCheckUtils]: 22: Hoare triple {2980#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2980#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:26,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {2980#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,294 INFO L273 TraceCheckUtils]: 24: Hoare triple {2981#(<= main_~k~0 4)} assume true; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {2981#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {2981#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2981#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:26,295 INFO L273 TraceCheckUtils]: 27: Hoare triple {2981#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2982#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:26,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {2982#(<= main_~k~0 5)} assume true; {2982#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:26,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {2982#(<= main_~k~0 5)} assume !(~k~0 < 100000); {2975#false} is VALID [2018-11-18 22:43:26,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {2975#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2975#false} is VALID [2018-11-18 22:43:26,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {2975#false} ~x~0 := 0; {2975#false} is VALID [2018-11-18 22:43:26,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {2975#false} assume true; {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {2975#false} assume !(~x~0 < ~i~0); {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {2975#false} ~x~0 := 1 + ~i~0; {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {2975#false} assume true; {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {2975#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L256 TraceCheckUtils]: 37: Hoare triple {2975#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2975#false} is VALID [2018-11-18 22:43:26,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2018-11-18 22:43:26,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2018-11-18 22:43:26,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2018-11-18 22:43:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:26,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:26,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-18 22:43:26,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-18 22:43:26,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:26,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:43:26,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:26,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:43:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:43:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:26,450 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 11 states. [2018-11-18 22:43:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,309 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2018-11-18 22:43:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:43:27,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-18 22:43:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2018-11-18 22:43:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2018-11-18 22:43:27,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 155 transitions. [2018-11-18 22:43:27,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:27,515 INFO L225 Difference]: With dead ends: 127 [2018-11-18 22:43:27,515 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 22:43:27,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:43:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 22:43:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2018-11-18 22:43:27,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:27,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 76 states. [2018-11-18 22:43:27,538 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 76 states. [2018-11-18 22:43:27,538 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 76 states. [2018-11-18 22:43:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,542 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-18 22:43:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2018-11-18 22:43:27,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:27,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:27,543 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 85 states. [2018-11-18 22:43:27,543 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 85 states. [2018-11-18 22:43:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,545 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-18 22:43:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2018-11-18 22:43:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:27,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:27,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 22:43:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2018-11-18 22:43:27,549 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 41 [2018-11-18 22:43:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:27,549 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2018-11-18 22:43:27,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:43:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2018-11-18 22:43:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 22:43:27,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:27,551 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:27,551 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1480674549, now seen corresponding path program 4 times [2018-11-18 22:43:27,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:27,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:27,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {3554#true} call ULTIMATE.init(); {3554#true} is VALID [2018-11-18 22:43:28,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {3554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3554#true} is VALID [2018-11-18 22:43:28,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {3554#true} assume true; {3554#true} is VALID [2018-11-18 22:43:28,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3554#true} {3554#true} #137#return; {3554#true} is VALID [2018-11-18 22:43:28,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {3554#true} call #t~ret15 := main(); {3554#true} is VALID [2018-11-18 22:43:28,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {3554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3556#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:28,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {3556#(= 0 main_~i~0)} assume true; {3556#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:28,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {3556#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3557#(= main_~k~0 0)} is VALID [2018-11-18 22:43:28,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {3557#(= main_~k~0 0)} assume true; {3557#(= main_~k~0 0)} is VALID [2018-11-18 22:43:28,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {3557#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3557#(= main_~k~0 0)} is VALID [2018-11-18 22:43:28,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {3557#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3557#(= main_~k~0 0)} is VALID [2018-11-18 22:43:28,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {3557#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {3558#(<= main_~k~0 1)} assume true; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {3558#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {3558#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {3558#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {3559#(<= main_~k~0 2)} assume true; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {3559#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {3559#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {3559#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {3560#(<= main_~k~0 3)} assume true; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {3560#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {3560#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {3560#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {3561#(<= main_~k~0 4)} assume true; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {3561#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {3561#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {3561#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {3562#(<= main_~k~0 5)} assume true; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {3562#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {3562#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {3562#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3563#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:28,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {3563#(<= main_~k~0 6)} assume true; {3563#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:28,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {3563#(<= main_~k~0 6)} assume !(~k~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:28,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {3555#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3555#false} is VALID [2018-11-18 22:43:28,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {3555#false} ~x~0 := 0; {3555#false} is VALID [2018-11-18 22:43:28,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:28,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {3555#false} assume !(~x~0 < ~i~0); {3555#false} is VALID [2018-11-18 22:43:28,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {3555#false} ~x~0 := 1 + ~i~0; {3555#false} is VALID [2018-11-18 22:43:28,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:28,566 INFO L273 TraceCheckUtils]: 40: Hoare triple {3555#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3555#false} is VALID [2018-11-18 22:43:28,566 INFO L256 TraceCheckUtils]: 41: Hoare triple {3555#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3555#false} is VALID [2018-11-18 22:43:28,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {3555#false} ~cond := #in~cond; {3555#false} is VALID [2018-11-18 22:43:28,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {3555#false} assume 0 == ~cond; {3555#false} is VALID [2018-11-18 22:43:28,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {3555#false} assume !false; {3555#false} is VALID [2018-11-18 22:43:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:28,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:28,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:28,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:28,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:28,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {3554#true} call ULTIMATE.init(); {3554#true} is VALID [2018-11-18 22:43:28,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {3554#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3554#true} is VALID [2018-11-18 22:43:28,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {3554#true} assume true; {3554#true} is VALID [2018-11-18 22:43:28,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3554#true} {3554#true} #137#return; {3554#true} is VALID [2018-11-18 22:43:28,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {3554#true} call #t~ret15 := main(); {3554#true} is VALID [2018-11-18 22:43:28,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {3554#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3582#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:28,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {3582#(<= main_~i~0 0)} assume true; {3582#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:28,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {3582#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3589#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:28,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {3589#(<= main_~k~0 0)} assume true; {3589#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:28,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {3589#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3589#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:28,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {3589#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3589#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:28,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {3589#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {3558#(<= main_~k~0 1)} assume true; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {3558#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {3558#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3558#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:28,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {3558#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {3559#(<= main_~k~0 2)} assume true; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {3559#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {3559#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3559#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:28,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {3559#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {3560#(<= main_~k~0 3)} assume true; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {3560#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,800 INFO L273 TraceCheckUtils]: 22: Hoare triple {3560#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3560#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:28,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {3560#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {3561#(<= main_~k~0 4)} assume true; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {3561#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {3561#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3561#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:28,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {3561#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {3562#(<= main_~k~0 5)} assume true; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {3562#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {3562#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3562#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:28,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {3562#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3563#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:28,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {3563#(<= main_~k~0 6)} assume true; {3563#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:28,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {3563#(<= main_~k~0 6)} assume !(~k~0 < 100000); {3555#false} is VALID [2018-11-18 22:43:28,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {3555#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3555#false} is VALID [2018-11-18 22:43:28,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {3555#false} ~x~0 := 0; {3555#false} is VALID [2018-11-18 22:43:28,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:28,807 INFO L273 TraceCheckUtils]: 37: Hoare triple {3555#false} assume !(~x~0 < ~i~0); {3555#false} is VALID [2018-11-18 22:43:28,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {3555#false} ~x~0 := 1 + ~i~0; {3555#false} is VALID [2018-11-18 22:43:28,808 INFO L273 TraceCheckUtils]: 39: Hoare triple {3555#false} assume true; {3555#false} is VALID [2018-11-18 22:43:28,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {3555#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3555#false} is VALID [2018-11-18 22:43:28,808 INFO L256 TraceCheckUtils]: 41: Hoare triple {3555#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3555#false} is VALID [2018-11-18 22:43:28,808 INFO L273 TraceCheckUtils]: 42: Hoare triple {3555#false} ~cond := #in~cond; {3555#false} is VALID [2018-11-18 22:43:28,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {3555#false} assume 0 == ~cond; {3555#false} is VALID [2018-11-18 22:43:28,809 INFO L273 TraceCheckUtils]: 44: Hoare triple {3555#false} assume !false; {3555#false} is VALID [2018-11-18 22:43:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:28,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:28,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-18 22:43:28,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-18 22:43:28,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:28,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:28,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:28,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:28,877 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 12 states. [2018-11-18 22:43:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,586 INFO L93 Difference]: Finished difference Result 131 states and 165 transitions. [2018-11-18 22:43:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:43:29,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-18 22:43:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2018-11-18 22:43:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2018-11-18 22:43:29,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 160 transitions. [2018-11-18 22:43:29,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:29,798 INFO L225 Difference]: With dead ends: 131 [2018-11-18 22:43:29,799 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 22:43:29,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:43:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 22:43:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-11-18 22:43:30,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:30,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 80 states. [2018-11-18 22:43:30,270 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 80 states. [2018-11-18 22:43:30,270 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 80 states. [2018-11-18 22:43:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:30,274 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-18 22:43:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-18 22:43:30,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:30,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:30,275 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 89 states. [2018-11-18 22:43:30,275 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 89 states. [2018-11-18 22:43:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:30,278 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-18 22:43:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-18 22:43:30,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:30,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:30,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:30,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 22:43:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-18 22:43:30,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 45 [2018-11-18 22:43:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:30,281 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-18 22:43:30,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-18 22:43:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 22:43:30,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:30,282 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:30,282 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:30,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2128383029, now seen corresponding path program 5 times [2018-11-18 22:43:30,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:30,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:30,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:30,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:30,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {4167#true} call ULTIMATE.init(); {4167#true} is VALID [2018-11-18 22:43:30,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {4167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4167#true} is VALID [2018-11-18 22:43:30,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {4167#true} assume true; {4167#true} is VALID [2018-11-18 22:43:30,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4167#true} {4167#true} #137#return; {4167#true} is VALID [2018-11-18 22:43:30,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {4167#true} call #t~ret15 := main(); {4167#true} is VALID [2018-11-18 22:43:30,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {4167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4169#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:30,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {4169#(= 0 main_~i~0)} assume true; {4169#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:30,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {4169#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4170#(= main_~k~0 0)} is VALID [2018-11-18 22:43:30,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {4170#(= main_~k~0 0)} assume true; {4170#(= main_~k~0 0)} is VALID [2018-11-18 22:43:30,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {4170#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4170#(= main_~k~0 0)} is VALID [2018-11-18 22:43:30,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {4170#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4170#(= main_~k~0 0)} is VALID [2018-11-18 22:43:30,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {4170#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {4171#(<= main_~k~0 1)} assume true; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {4171#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {4171#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {4172#(<= main_~k~0 2)} assume true; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {4172#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {4172#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {4172#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {4173#(<= main_~k~0 3)} assume true; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {4173#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {4173#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {4173#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {4174#(<= main_~k~0 4)} assume true; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {4174#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {4174#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {4174#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {4175#(<= main_~k~0 5)} assume true; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {4175#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {4175#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {4175#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {4176#(<= main_~k~0 6)} assume true; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {4176#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {4176#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {4176#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4177#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:30,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {4177#(<= main_~k~0 7)} assume true; {4177#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:30,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {4177#(<= main_~k~0 7)} assume !(~k~0 < 100000); {4168#false} is VALID [2018-11-18 22:43:30,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {4168#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4168#false} is VALID [2018-11-18 22:43:30,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {4168#false} ~x~0 := 0; {4168#false} is VALID [2018-11-18 22:43:30,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {4168#false} assume true; {4168#false} is VALID [2018-11-18 22:43:30,474 INFO L273 TraceCheckUtils]: 41: Hoare triple {4168#false} assume !(~x~0 < ~i~0); {4168#false} is VALID [2018-11-18 22:43:30,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {4168#false} ~x~0 := 1 + ~i~0; {4168#false} is VALID [2018-11-18 22:43:30,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {4168#false} assume true; {4168#false} is VALID [2018-11-18 22:43:30,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {4168#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4168#false} is VALID [2018-11-18 22:43:30,476 INFO L256 TraceCheckUtils]: 45: Hoare triple {4168#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4168#false} is VALID [2018-11-18 22:43:30,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {4168#false} ~cond := #in~cond; {4168#false} is VALID [2018-11-18 22:43:30,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {4168#false} assume 0 == ~cond; {4168#false} is VALID [2018-11-18 22:43:30,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {4168#false} assume !false; {4168#false} is VALID [2018-11-18 22:43:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:30,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:30,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-18 22:43:30,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:30,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:30,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {4167#true} call ULTIMATE.init(); {4167#true} is VALID [2018-11-18 22:43:30,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {4167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4167#true} is VALID [2018-11-18 22:43:30,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {4167#true} assume true; {4167#true} is VALID [2018-11-18 22:43:30,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4167#true} {4167#true} #137#return; {4167#true} is VALID [2018-11-18 22:43:30,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {4167#true} call #t~ret15 := main(); {4167#true} is VALID [2018-11-18 22:43:30,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {4167#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4196#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:30,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {4196#(<= main_~i~0 0)} assume true; {4196#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:30,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {4196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4203#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:30,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {4203#(<= main_~k~0 0)} assume true; {4203#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:30,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {4203#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4203#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:30,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {4203#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4203#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:30,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {4203#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {4171#(<= main_~k~0 1)} assume true; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {4171#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {4171#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4171#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:30,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {4172#(<= main_~k~0 2)} assume true; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {4172#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {4172#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4172#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:30,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {4172#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {4173#(<= main_~k~0 3)} assume true; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {4173#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {4173#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4173#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:30,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {4173#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {4174#(<= main_~k~0 4)} assume true; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {4174#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {4174#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4174#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:30,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {4174#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {4175#(<= main_~k~0 5)} assume true; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {4175#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {4175#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4175#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:30,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {4175#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {4176#(<= main_~k~0 6)} assume true; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {4176#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {4176#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4176#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:30,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {4176#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4177#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:30,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {4177#(<= main_~k~0 7)} assume true; {4177#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:30,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {4177#(<= main_~k~0 7)} assume !(~k~0 < 100000); {4168#false} is VALID [2018-11-18 22:43:30,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {4168#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4168#false} is VALID [2018-11-18 22:43:30,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {4168#false} ~x~0 := 0; {4168#false} is VALID [2018-11-18 22:43:30,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {4168#false} assume true; {4168#false} is VALID [2018-11-18 22:43:30,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {4168#false} assume !(~x~0 < ~i~0); {4168#false} is VALID [2018-11-18 22:43:30,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {4168#false} ~x~0 := 1 + ~i~0; {4168#false} is VALID [2018-11-18 22:43:30,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {4168#false} assume true; {4168#false} is VALID [2018-11-18 22:43:30,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {4168#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4168#false} is VALID [2018-11-18 22:43:30,732 INFO L256 TraceCheckUtils]: 45: Hoare triple {4168#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4168#false} is VALID [2018-11-18 22:43:30,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {4168#false} ~cond := #in~cond; {4168#false} is VALID [2018-11-18 22:43:30,732 INFO L273 TraceCheckUtils]: 47: Hoare triple {4168#false} assume 0 == ~cond; {4168#false} is VALID [2018-11-18 22:43:30,732 INFO L273 TraceCheckUtils]: 48: Hoare triple {4168#false} assume !false; {4168#false} is VALID [2018-11-18 22:43:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:30,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:30,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-18 22:43:30,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-18 22:43:30,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:30,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:43:30,811 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-18 22:43:30,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:43:30,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:43:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:43:30,812 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 13 states. [2018-11-18 22:43:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,601 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-11-18 22:43:31,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:43:31,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-18 22:43:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:43:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-18 22:43:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:43:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2018-11-18 22:43:31,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 165 transitions. [2018-11-18 22:43:31,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:31,950 INFO L225 Difference]: With dead ends: 135 [2018-11-18 22:43:31,950 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 22:43:31,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 22:43:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-11-18 22:43:31,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:31,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 84 states. [2018-11-18 22:43:31,986 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 84 states. [2018-11-18 22:43:31,986 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 84 states. [2018-11-18 22:43:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,989 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2018-11-18 22:43:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2018-11-18 22:43:31,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:31,990 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 93 states. [2018-11-18 22:43:31,990 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 93 states. [2018-11-18 22:43:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,992 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2018-11-18 22:43:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2018-11-18 22:43:31,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:31,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:31,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:31,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 22:43:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-11-18 22:43:31,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 49 [2018-11-18 22:43:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:31,995 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-11-18 22:43:31,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:43:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-11-18 22:43:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 22:43:31,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:31,996 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:31,996 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:31,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1941291103, now seen corresponding path program 6 times [2018-11-18 22:43:31,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:31,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:31,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:32,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {4813#true} call ULTIMATE.init(); {4813#true} is VALID [2018-11-18 22:43:32,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {4813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4813#true} is VALID [2018-11-18 22:43:32,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-18 22:43:32,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4813#true} {4813#true} #137#return; {4813#true} is VALID [2018-11-18 22:43:32,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {4813#true} call #t~ret15 := main(); {4813#true} is VALID [2018-11-18 22:43:32,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {4813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4815#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:32,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {4815#(= 0 main_~i~0)} assume true; {4815#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:32,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {4815#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4816#(= main_~k~0 0)} is VALID [2018-11-18 22:43:32,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {4816#(= main_~k~0 0)} assume true; {4816#(= main_~k~0 0)} is VALID [2018-11-18 22:43:32,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {4816#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4816#(= main_~k~0 0)} is VALID [2018-11-18 22:43:32,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {4816#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4816#(= main_~k~0 0)} is VALID [2018-11-18 22:43:32,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {4816#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:32,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {4817#(<= main_~k~0 1)} assume true; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:32,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {4817#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:32,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {4817#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:32,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {4817#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:32,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {4818#(<= main_~k~0 2)} assume true; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:32,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {4818#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:32,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {4818#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:32,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {4818#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:32,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {4819#(<= main_~k~0 3)} assume true; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:32,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {4819#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:32,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {4819#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:32,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {4819#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:32,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {4820#(<= main_~k~0 4)} assume true; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:32,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {4820#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:32,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {4820#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:32,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {4820#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:32,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {4821#(<= main_~k~0 5)} assume true; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:32,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {4821#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:32,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {4821#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:32,627 INFO L273 TraceCheckUtils]: 31: Hoare triple {4821#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:32,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {4822#(<= main_~k~0 6)} assume true; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:32,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {4822#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:32,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {4822#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:32,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {4822#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:32,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {4823#(<= main_~k~0 7)} assume true; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:32,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {4823#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:32,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {4823#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:32,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {4823#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4824#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:32,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {4824#(<= main_~k~0 8)} assume true; {4824#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:32,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {4824#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4814#false} is VALID [2018-11-18 22:43:32,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {4814#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4814#false} is VALID [2018-11-18 22:43:32,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {4814#false} ~x~0 := 0; {4814#false} is VALID [2018-11-18 22:43:32,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-18 22:43:32,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {4814#false} assume !(~x~0 < ~i~0); {4814#false} is VALID [2018-11-18 22:43:32,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {4814#false} ~x~0 := 1 + ~i~0; {4814#false} is VALID [2018-11-18 22:43:32,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-18 22:43:32,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {4814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4814#false} is VALID [2018-11-18 22:43:32,750 INFO L256 TraceCheckUtils]: 49: Hoare triple {4814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4814#false} is VALID [2018-11-18 22:43:32,750 INFO L273 TraceCheckUtils]: 50: Hoare triple {4814#false} ~cond := #in~cond; {4814#false} is VALID [2018-11-18 22:43:32,750 INFO L273 TraceCheckUtils]: 51: Hoare triple {4814#false} assume 0 == ~cond; {4814#false} is VALID [2018-11-18 22:43:32,750 INFO L273 TraceCheckUtils]: 52: Hoare triple {4814#false} assume !false; {4814#false} is VALID [2018-11-18 22:43:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:32,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:32,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:32,909 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-18 22:43:32,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:32,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:33,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {4813#true} call ULTIMATE.init(); {4813#true} is VALID [2018-11-18 22:43:33,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {4813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4813#true} is VALID [2018-11-18 22:43:33,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {4813#true} assume true; {4813#true} is VALID [2018-11-18 22:43:33,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4813#true} {4813#true} #137#return; {4813#true} is VALID [2018-11-18 22:43:33,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {4813#true} call #t~ret15 := main(); {4813#true} is VALID [2018-11-18 22:43:33,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {4813#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4843#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:33,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {4843#(<= main_~i~0 0)} assume true; {4843#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:33,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {4843#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4850#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:33,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {4850#(<= main_~k~0 0)} assume true; {4850#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:33,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {4850#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4850#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:33,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {4850#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4850#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:33,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {4850#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:33,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {4817#(<= main_~k~0 1)} assume true; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:33,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {4817#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:33,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {4817#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4817#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:33,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {4817#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:33,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {4818#(<= main_~k~0 2)} assume true; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:33,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {4818#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:33,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {4818#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4818#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:33,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {4818#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:33,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {4819#(<= main_~k~0 3)} assume true; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:33,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {4819#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:33,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {4819#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4819#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:33,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {4819#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:33,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {4820#(<= main_~k~0 4)} assume true; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:33,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {4820#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:33,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {4820#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4820#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:33,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {4820#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:33,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {4821#(<= main_~k~0 5)} assume true; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:33,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {4821#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:33,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {4821#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4821#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:33,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {4821#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:33,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {4822#(<= main_~k~0 6)} assume true; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:33,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {4822#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:33,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {4822#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4822#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:33,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {4822#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:33,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {4823#(<= main_~k~0 7)} assume true; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:33,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {4823#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:33,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {4823#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4823#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:33,552 INFO L273 TraceCheckUtils]: 39: Hoare triple {4823#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4824#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:33,553 INFO L273 TraceCheckUtils]: 40: Hoare triple {4824#(<= main_~k~0 8)} assume true; {4824#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:33,553 INFO L273 TraceCheckUtils]: 41: Hoare triple {4824#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4814#false} is VALID [2018-11-18 22:43:33,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {4814#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4814#false} is VALID [2018-11-18 22:43:33,554 INFO L273 TraceCheckUtils]: 43: Hoare triple {4814#false} ~x~0 := 0; {4814#false} is VALID [2018-11-18 22:43:33,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-18 22:43:33,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {4814#false} assume !(~x~0 < ~i~0); {4814#false} is VALID [2018-11-18 22:43:33,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {4814#false} ~x~0 := 1 + ~i~0; {4814#false} is VALID [2018-11-18 22:43:33,555 INFO L273 TraceCheckUtils]: 47: Hoare triple {4814#false} assume true; {4814#false} is VALID [2018-11-18 22:43:33,555 INFO L273 TraceCheckUtils]: 48: Hoare triple {4814#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4814#false} is VALID [2018-11-18 22:43:33,555 INFO L256 TraceCheckUtils]: 49: Hoare triple {4814#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4814#false} is VALID [2018-11-18 22:43:33,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {4814#false} ~cond := #in~cond; {4814#false} is VALID [2018-11-18 22:43:33,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {4814#false} assume 0 == ~cond; {4814#false} is VALID [2018-11-18 22:43:33,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {4814#false} assume !false; {4814#false} is VALID [2018-11-18 22:43:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:33,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-18 22:43:33,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-11-18 22:43:33,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:33,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:43:33,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:33,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:43:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:43:33,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:43:33,637 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 14 states. [2018-11-18 22:43:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,418 INFO L93 Difference]: Finished difference Result 139 states and 175 transitions. [2018-11-18 22:43:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:43:34,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-11-18 22:43:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2018-11-18 22:43:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2018-11-18 22:43:34,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 170 transitions. [2018-11-18 22:43:34,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:34,585 INFO L225 Difference]: With dead ends: 139 [2018-11-18 22:43:34,585 INFO L226 Difference]: Without dead ends: 97 [2018-11-18 22:43:34,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:43:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-18 22:43:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-11-18 22:43:34,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:34,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 88 states. [2018-11-18 22:43:34,615 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 88 states. [2018-11-18 22:43:34,615 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 88 states. [2018-11-18 22:43:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,618 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2018-11-18 22:43:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2018-11-18 22:43:34,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:34,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 97 states. [2018-11-18 22:43:34,618 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 97 states. [2018-11-18 22:43:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,621 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2018-11-18 22:43:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2018-11-18 22:43:34,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:34,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:34,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:34,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 22:43:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-11-18 22:43:34,624 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 53 [2018-11-18 22:43:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:34,624 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-11-18 22:43:34,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:43:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-11-18 22:43:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 22:43:34,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:34,625 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:34,626 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:34,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash -858050441, now seen corresponding path program 7 times [2018-11-18 22:43:34,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:34,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:35,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {5492#true} call ULTIMATE.init(); {5492#true} is VALID [2018-11-18 22:43:35,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {5492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5492#true} is VALID [2018-11-18 22:43:35,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {5492#true} assume true; {5492#true} is VALID [2018-11-18 22:43:35,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5492#true} {5492#true} #137#return; {5492#true} is VALID [2018-11-18 22:43:35,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {5492#true} call #t~ret15 := main(); {5492#true} is VALID [2018-11-18 22:43:35,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {5492#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5494#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:35,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {5494#(= 0 main_~i~0)} assume true; {5494#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:35,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {5494#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5495#(= main_~k~0 0)} is VALID [2018-11-18 22:43:35,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {5495#(= main_~k~0 0)} assume true; {5495#(= main_~k~0 0)} is VALID [2018-11-18 22:43:35,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {5495#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5495#(= main_~k~0 0)} is VALID [2018-11-18 22:43:35,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {5495#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5495#(= main_~k~0 0)} is VALID [2018-11-18 22:43:35,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {5495#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {5496#(<= main_~k~0 1)} assume true; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {5496#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {5496#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {5496#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {5497#(<= main_~k~0 2)} assume true; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {5497#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {5497#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {5497#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {5498#(<= main_~k~0 3)} assume true; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {5498#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {5498#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {5498#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {5499#(<= main_~k~0 4)} assume true; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {5499#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {5499#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {5499#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {5500#(<= main_~k~0 5)} assume true; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,145 INFO L273 TraceCheckUtils]: 29: Hoare triple {5500#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,145 INFO L273 TraceCheckUtils]: 30: Hoare triple {5500#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {5500#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {5501#(<= main_~k~0 6)} assume true; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {5501#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {5501#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {5501#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {5502#(<= main_~k~0 7)} assume true; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {5502#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {5502#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {5502#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {5503#(<= main_~k~0 8)} assume true; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {5503#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {5503#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {5503#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5504#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:35,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {5504#(<= main_~k~0 9)} assume true; {5504#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:35,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {5504#(<= main_~k~0 9)} assume !(~k~0 < 100000); {5493#false} is VALID [2018-11-18 22:43:35,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {5493#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5493#false} is VALID [2018-11-18 22:43:35,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {5493#false} ~x~0 := 0; {5493#false} is VALID [2018-11-18 22:43:35,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {5493#false} assume true; {5493#false} is VALID [2018-11-18 22:43:35,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {5493#false} assume !(~x~0 < ~i~0); {5493#false} is VALID [2018-11-18 22:43:35,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {5493#false} ~x~0 := 1 + ~i~0; {5493#false} is VALID [2018-11-18 22:43:35,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {5493#false} assume true; {5493#false} is VALID [2018-11-18 22:43:35,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {5493#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5493#false} is VALID [2018-11-18 22:43:35,156 INFO L256 TraceCheckUtils]: 53: Hoare triple {5493#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5493#false} is VALID [2018-11-18 22:43:35,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {5493#false} ~cond := #in~cond; {5493#false} is VALID [2018-11-18 22:43:35,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {5493#false} assume 0 == ~cond; {5493#false} is VALID [2018-11-18 22:43:35,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {5493#false} assume !false; {5493#false} is VALID [2018-11-18 22:43:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:35,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:35,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:35,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:35,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:35,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {5492#true} call ULTIMATE.init(); {5492#true} is VALID [2018-11-18 22:43:35,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {5492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5492#true} is VALID [2018-11-18 22:43:35,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {5492#true} assume true; {5492#true} is VALID [2018-11-18 22:43:35,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5492#true} {5492#true} #137#return; {5492#true} is VALID [2018-11-18 22:43:35,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {5492#true} call #t~ret15 := main(); {5492#true} is VALID [2018-11-18 22:43:35,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {5492#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5523#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:35,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {5523#(<= main_~i~0 0)} assume true; {5523#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:35,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {5523#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5530#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:35,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {5530#(<= main_~k~0 0)} assume true; {5530#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:35,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {5530#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5530#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:35,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {5530#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5530#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:35,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {5530#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {5496#(<= main_~k~0 1)} assume true; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {5496#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {5496#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5496#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:35,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {5496#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {5497#(<= main_~k~0 2)} assume true; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {5497#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {5497#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5497#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:35,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {5497#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {5498#(<= main_~k~0 3)} assume true; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {5498#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {5498#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5498#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:35,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {5498#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {5499#(<= main_~k~0 4)} assume true; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {5499#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {5499#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5499#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:35,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {5499#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {5500#(<= main_~k~0 5)} assume true; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {5500#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {5500#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5500#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:35,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {5500#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {5501#(<= main_~k~0 6)} assume true; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {5501#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {5501#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5501#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:35,371 INFO L273 TraceCheckUtils]: 35: Hoare triple {5501#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,372 INFO L273 TraceCheckUtils]: 36: Hoare triple {5502#(<= main_~k~0 7)} assume true; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,372 INFO L273 TraceCheckUtils]: 37: Hoare triple {5502#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {5502#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5502#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:35,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {5502#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,374 INFO L273 TraceCheckUtils]: 40: Hoare triple {5503#(<= main_~k~0 8)} assume true; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {5503#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {5503#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5503#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:35,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {5503#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5504#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:35,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {5504#(<= main_~k~0 9)} assume true; {5504#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:35,377 INFO L273 TraceCheckUtils]: 45: Hoare triple {5504#(<= main_~k~0 9)} assume !(~k~0 < 100000); {5493#false} is VALID [2018-11-18 22:43:35,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {5493#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5493#false} is VALID [2018-11-18 22:43:35,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {5493#false} ~x~0 := 0; {5493#false} is VALID [2018-11-18 22:43:35,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {5493#false} assume true; {5493#false} is VALID [2018-11-18 22:43:35,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {5493#false} assume !(~x~0 < ~i~0); {5493#false} is VALID [2018-11-18 22:43:35,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {5493#false} ~x~0 := 1 + ~i~0; {5493#false} is VALID [2018-11-18 22:43:35,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {5493#false} assume true; {5493#false} is VALID [2018-11-18 22:43:35,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {5493#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5493#false} is VALID [2018-11-18 22:43:35,379 INFO L256 TraceCheckUtils]: 53: Hoare triple {5493#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5493#false} is VALID [2018-11-18 22:43:35,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {5493#false} ~cond := #in~cond; {5493#false} is VALID [2018-11-18 22:43:35,379 INFO L273 TraceCheckUtils]: 55: Hoare triple {5493#false} assume 0 == ~cond; {5493#false} is VALID [2018-11-18 22:43:35,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {5493#false} assume !false; {5493#false} is VALID [2018-11-18 22:43:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:35,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-11-18 22:43:35,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-18 22:43:35,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:35,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:43:35,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:35,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:43:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:43:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:35,542 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 15 states. [2018-11-18 22:43:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:35,999 INFO L93 Difference]: Finished difference Result 143 states and 180 transitions. [2018-11-18 22:43:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:43:35,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-18 22:43:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2018-11-18 22:43:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2018-11-18 22:43:36,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 175 transitions. [2018-11-18 22:43:36,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:36,453 INFO L225 Difference]: With dead ends: 143 [2018-11-18 22:43:36,453 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 22:43:36,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:43:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 22:43:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2018-11-18 22:43:36,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:36,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 92 states. [2018-11-18 22:43:36,478 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 92 states. [2018-11-18 22:43:36,478 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 92 states. [2018-11-18 22:43:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:36,481 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-18 22:43:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2018-11-18 22:43:36,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:36,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:36,482 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 101 states. [2018-11-18 22:43:36,482 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 101 states. [2018-11-18 22:43:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:36,485 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-18 22:43:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2018-11-18 22:43:36,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:36,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:36,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:36,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:43:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2018-11-18 22:43:36,488 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 57 [2018-11-18 22:43:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2018-11-18 22:43:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:43:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2018-11-18 22:43:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 22:43:36,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:36,490 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:36,490 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:36,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2026125747, now seen corresponding path program 8 times [2018-11-18 22:43:36,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:37,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {6204#true} call ULTIMATE.init(); {6204#true} is VALID [2018-11-18 22:43:37,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {6204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6204#true} is VALID [2018-11-18 22:43:37,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {6204#true} assume true; {6204#true} is VALID [2018-11-18 22:43:37,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6204#true} {6204#true} #137#return; {6204#true} is VALID [2018-11-18 22:43:37,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6204#true} call #t~ret15 := main(); {6204#true} is VALID [2018-11-18 22:43:37,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {6204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6206#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:37,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {6206#(= 0 main_~i~0)} assume true; {6206#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:37,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {6206#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6207#(= main_~k~0 0)} is VALID [2018-11-18 22:43:37,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {6207#(= main_~k~0 0)} assume true; {6207#(= main_~k~0 0)} is VALID [2018-11-18 22:43:37,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {6207#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6207#(= main_~k~0 0)} is VALID [2018-11-18 22:43:37,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {6207#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6207#(= main_~k~0 0)} is VALID [2018-11-18 22:43:37,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {6207#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {6208#(<= main_~k~0 1)} assume true; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {6208#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {6208#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {6208#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {6209#(<= main_~k~0 2)} assume true; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {6209#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {6209#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {6209#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {6210#(<= main_~k~0 3)} assume true; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {6210#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {6210#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {6210#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {6211#(<= main_~k~0 4)} assume true; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {6211#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {6211#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {6211#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {6212#(<= main_~k~0 5)} assume true; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {6212#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,126 INFO L273 TraceCheckUtils]: 30: Hoare triple {6212#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {6212#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {6213#(<= main_~k~0 6)} assume true; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {6213#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {6213#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {6213#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {6214#(<= main_~k~0 7)} assume true; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {6214#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {6214#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,132 INFO L273 TraceCheckUtils]: 39: Hoare triple {6214#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {6215#(<= main_~k~0 8)} assume true; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {6215#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {6215#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {6215#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {6216#(<= main_~k~0 9)} assume true; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {6216#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {6216#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {6216#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6217#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:37,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {6217#(<= main_~k~0 10)} assume true; {6217#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:37,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {6217#(<= main_~k~0 10)} assume !(~k~0 < 100000); {6205#false} is VALID [2018-11-18 22:43:37,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {6205#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#false} is VALID [2018-11-18 22:43:37,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {6205#false} ~x~0 := 0; {6205#false} is VALID [2018-11-18 22:43:37,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {6205#false} assume true; {6205#false} is VALID [2018-11-18 22:43:37,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {6205#false} assume !(~x~0 < ~i~0); {6205#false} is VALID [2018-11-18 22:43:37,139 INFO L273 TraceCheckUtils]: 54: Hoare triple {6205#false} ~x~0 := 1 + ~i~0; {6205#false} is VALID [2018-11-18 22:43:37,139 INFO L273 TraceCheckUtils]: 55: Hoare triple {6205#false} assume true; {6205#false} is VALID [2018-11-18 22:43:37,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {6205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#false} is VALID [2018-11-18 22:43:37,139 INFO L256 TraceCheckUtils]: 57: Hoare triple {6205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6205#false} is VALID [2018-11-18 22:43:37,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {6205#false} ~cond := #in~cond; {6205#false} is VALID [2018-11-18 22:43:37,140 INFO L273 TraceCheckUtils]: 59: Hoare triple {6205#false} assume 0 == ~cond; {6205#false} is VALID [2018-11-18 22:43:37,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {6205#false} assume !false; {6205#false} is VALID [2018-11-18 22:43:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:37,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:37,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:37,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:37,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:37,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:37,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {6204#true} call ULTIMATE.init(); {6204#true} is VALID [2018-11-18 22:43:37,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {6204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6204#true} is VALID [2018-11-18 22:43:37,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {6204#true} assume true; {6204#true} is VALID [2018-11-18 22:43:37,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6204#true} {6204#true} #137#return; {6204#true} is VALID [2018-11-18 22:43:37,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {6204#true} call #t~ret15 := main(); {6204#true} is VALID [2018-11-18 22:43:37,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {6204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6236#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:37,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {6236#(<= main_~i~0 0)} assume true; {6236#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:37,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {6236#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6243#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:37,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {6243#(<= main_~k~0 0)} assume true; {6243#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:37,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {6243#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6243#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:37,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {6243#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6243#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:37,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {6243#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {6208#(<= main_~k~0 1)} assume true; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {6208#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {6208#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6208#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:37,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {6208#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {6209#(<= main_~k~0 2)} assume true; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {6209#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {6209#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6209#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:37,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {6209#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {6210#(<= main_~k~0 3)} assume true; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {6210#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {6210#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6210#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:37,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {6210#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {6211#(<= main_~k~0 4)} assume true; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {6211#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {6211#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6211#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:37,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {6211#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {6212#(<= main_~k~0 5)} assume true; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {6212#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {6212#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6212#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:37,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {6212#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {6213#(<= main_~k~0 6)} assume true; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {6213#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {6213#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6213#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:37,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {6213#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {6214#(<= main_~k~0 7)} assume true; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {6214#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {6214#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6214#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:37,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {6214#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {6215#(<= main_~k~0 8)} assume true; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {6215#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {6215#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6215#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:37,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {6215#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {6216#(<= main_~k~0 9)} assume true; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {6216#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {6216#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6216#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:37,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {6216#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6217#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:37,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {6217#(<= main_~k~0 10)} assume true; {6217#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:37,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {6217#(<= main_~k~0 10)} assume !(~k~0 < 100000); {6205#false} is VALID [2018-11-18 22:43:37,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {6205#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#false} is VALID [2018-11-18 22:43:37,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {6205#false} ~x~0 := 0; {6205#false} is VALID [2018-11-18 22:43:37,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {6205#false} assume true; {6205#false} is VALID [2018-11-18 22:43:37,416 INFO L273 TraceCheckUtils]: 53: Hoare triple {6205#false} assume !(~x~0 < ~i~0); {6205#false} is VALID [2018-11-18 22:43:37,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {6205#false} ~x~0 := 1 + ~i~0; {6205#false} is VALID [2018-11-18 22:43:37,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {6205#false} assume true; {6205#false} is VALID [2018-11-18 22:43:37,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {6205#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6205#false} is VALID [2018-11-18 22:43:37,417 INFO L256 TraceCheckUtils]: 57: Hoare triple {6205#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6205#false} is VALID [2018-11-18 22:43:37,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {6205#false} ~cond := #in~cond; {6205#false} is VALID [2018-11-18 22:43:37,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {6205#false} assume 0 == ~cond; {6205#false} is VALID [2018-11-18 22:43:37,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {6205#false} assume !false; {6205#false} is VALID [2018-11-18 22:43:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:37,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-11-18 22:43:37,443 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-18 22:43:37,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:37,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:43:37,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:37,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:43:37,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:43:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:43:37,505 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand 16 states. [2018-11-18 22:43:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:38,776 INFO L93 Difference]: Finished difference Result 147 states and 185 transitions. [2018-11-18 22:43:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:43:38,777 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-18 22:43:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:43:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 180 transitions. [2018-11-18 22:43:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:43:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 180 transitions. [2018-11-18 22:43:38,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 180 transitions. [2018-11-18 22:43:39,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:39,455 INFO L225 Difference]: With dead ends: 147 [2018-11-18 22:43:39,455 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 22:43:39,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:43:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 22:43:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2018-11-18 22:43:39,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:39,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 96 states. [2018-11-18 22:43:39,491 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 96 states. [2018-11-18 22:43:39,491 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 96 states. [2018-11-18 22:43:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:39,496 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2018-11-18 22:43:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-11-18 22:43:39,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:39,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:39,497 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 105 states. [2018-11-18 22:43:39,497 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 105 states. [2018-11-18 22:43:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:39,501 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2018-11-18 22:43:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-11-18 22:43:39,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:39,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:39,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:39,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 22:43:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2018-11-18 22:43:39,507 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 61 [2018-11-18 22:43:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:39,507 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2018-11-18 22:43:39,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:43:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2018-11-18 22:43:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 22:43:39,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:39,508 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:39,509 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:39,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1360101667, now seen corresponding path program 9 times [2018-11-18 22:43:39,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:39,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:39,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:40,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {6949#true} call ULTIMATE.init(); {6949#true} is VALID [2018-11-18 22:43:40,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {6949#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6949#true} is VALID [2018-11-18 22:43:40,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {6949#true} assume true; {6949#true} is VALID [2018-11-18 22:43:40,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6949#true} {6949#true} #137#return; {6949#true} is VALID [2018-11-18 22:43:40,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {6949#true} call #t~ret15 := main(); {6949#true} is VALID [2018-11-18 22:43:40,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {6949#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6951#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:40,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {6951#(= 0 main_~i~0)} assume true; {6951#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:40,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {6951#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6952#(= main_~k~0 0)} is VALID [2018-11-18 22:43:40,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {6952#(= main_~k~0 0)} assume true; {6952#(= main_~k~0 0)} is VALID [2018-11-18 22:43:40,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {6952#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6952#(= main_~k~0 0)} is VALID [2018-11-18 22:43:40,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {6952#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6952#(= main_~k~0 0)} is VALID [2018-11-18 22:43:40,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {6952#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {6953#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:40,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {6953#(<= main_~k~0 1)} assume true; {6953#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:40,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {6953#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6953#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:40,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {6953#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6953#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:40,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {6953#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6954#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:40,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {6954#(<= main_~k~0 2)} assume true; {6954#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:40,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {6954#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6954#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:40,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {6954#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6954#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:40,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {6954#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6955#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:40,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {6955#(<= main_~k~0 3)} assume true; {6955#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:40,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {6955#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6955#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:40,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {6955#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6955#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:40,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {6955#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6956#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:40,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {6956#(<= main_~k~0 4)} assume true; {6956#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:40,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {6956#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6956#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:40,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {6956#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6956#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:40,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {6956#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6957#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:40,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {6957#(<= main_~k~0 5)} assume true; {6957#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:40,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {6957#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6957#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:40,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {6957#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6957#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:40,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {6957#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6958#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:40,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {6958#(<= main_~k~0 6)} assume true; {6958#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:40,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {6958#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6958#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:40,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {6958#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6958#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:40,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {6958#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6959#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:40,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {6959#(<= main_~k~0 7)} assume true; {6959#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:40,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {6959#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6959#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:40,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {6959#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6959#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:40,128 INFO L273 TraceCheckUtils]: 39: Hoare triple {6959#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6960#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:40,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {6960#(<= main_~k~0 8)} assume true; {6960#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:40,129 INFO L273 TraceCheckUtils]: 41: Hoare triple {6960#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6960#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:40,130 INFO L273 TraceCheckUtils]: 42: Hoare triple {6960#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6960#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:40,130 INFO L273 TraceCheckUtils]: 43: Hoare triple {6960#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6961#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:40,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {6961#(<= main_~k~0 9)} assume true; {6961#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:40,132 INFO L273 TraceCheckUtils]: 45: Hoare triple {6961#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6961#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:40,132 INFO L273 TraceCheckUtils]: 46: Hoare triple {6961#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6961#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:40,133 INFO L273 TraceCheckUtils]: 47: Hoare triple {6961#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6962#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:40,134 INFO L273 TraceCheckUtils]: 48: Hoare triple {6962#(<= main_~k~0 10)} assume true; {6962#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:40,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {6962#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6962#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:40,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {6962#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6962#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:40,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {6962#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {6963#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:40,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {6963#(<= main_~k~0 11)} assume true; {6963#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:40,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {6963#(<= main_~k~0 11)} assume !(~k~0 < 100000); {6950#false} is VALID [2018-11-18 22:43:40,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {6950#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {6950#false} ~x~0 := 0; {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 56: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {6950#false} assume !(~x~0 < ~i~0); {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {6950#false} ~x~0 := 1 + ~i~0; {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {6950#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,139 INFO L256 TraceCheckUtils]: 61: Hoare triple {6950#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6950#false} is VALID [2018-11-18 22:43:40,139 INFO L273 TraceCheckUtils]: 62: Hoare triple {6950#false} ~cond := #in~cond; {6950#false} is VALID [2018-11-18 22:43:40,139 INFO L273 TraceCheckUtils]: 63: Hoare triple {6950#false} assume 0 == ~cond; {6950#false} is VALID [2018-11-18 22:43:40,139 INFO L273 TraceCheckUtils]: 64: Hoare triple {6950#false} assume !false; {6950#false} is VALID [2018-11-18 22:43:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:40,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:40,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:40,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:40,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-18 22:43:40,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:40,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:40,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {6949#true} call ULTIMATE.init(); {6949#true} is VALID [2018-11-18 22:43:40,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {6949#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6949#true} is VALID [2018-11-18 22:43:40,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {6949#true} assume true; {6949#true} is VALID [2018-11-18 22:43:40,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6949#true} {6949#true} #137#return; {6949#true} is VALID [2018-11-18 22:43:40,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {6949#true} call #t~ret15 := main(); {6949#true} is VALID [2018-11-18 22:43:40,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {6949#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6982#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {6982#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {6982#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {6982#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6989#(and (= main_~i~0 main_~k~0) (= main_~s~0 (+ main_~i~0 1)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {6989#(and (= main_~i~0 main_~k~0) (= main_~s~0 (+ main_~i~0 1)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {6989#(and (= main_~i~0 main_~k~0) (= main_~s~0 (+ main_~i~0 1)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {6989#(and (= main_~i~0 main_~k~0) (= main_~s~0 (+ main_~i~0 1)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6996#(and (= main_~i~0 main_~k~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) |main_#t~mem1|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~k~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {6996#(and (= main_~i~0 main_~k~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) |main_#t~mem1|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~k~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7000#(and (= main_~i~0 main_~k~0) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~k~0) |main_~#a~0.offset|))) (= main_~k~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {7000#(and (= main_~i~0 main_~k~0) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~k~0) |main_~#a~0.offset|))) (= main_~k~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} ~k~0 := 1 + ~k~0; {7004#(and (= main_~k~0 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {7004#(and (= main_~k~0 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume true; {7004#(and (= main_~k~0 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {7004#(and (= main_~k~0 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 main_~s~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7011#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) |main_#t~mem1|) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-18 22:43:40,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {7011#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)) |main_#t~mem1|) (<= (+ (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4)) 1) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 39: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 49: Hoare triple {6950#false} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {6950#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {6950#false} ~k~0 := 1 + ~k~0; {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {6950#false} assume !(~k~0 < 100000); {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {6950#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {6950#false} ~x~0 := 0; {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 57: Hoare triple {6950#false} assume !(~x~0 < ~i~0); {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 58: Hoare triple {6950#false} ~x~0 := 1 + ~i~0; {6950#false} is VALID [2018-11-18 22:43:40,738 INFO L273 TraceCheckUtils]: 59: Hoare triple {6950#false} assume true; {6950#false} is VALID [2018-11-18 22:43:40,739 INFO L273 TraceCheckUtils]: 60: Hoare triple {6950#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6950#false} is VALID [2018-11-18 22:43:40,739 INFO L256 TraceCheckUtils]: 61: Hoare triple {6950#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6950#false} is VALID [2018-11-18 22:43:40,739 INFO L273 TraceCheckUtils]: 62: Hoare triple {6950#false} ~cond := #in~cond; {6950#false} is VALID [2018-11-18 22:43:40,739 INFO L273 TraceCheckUtils]: 63: Hoare triple {6950#false} assume 0 == ~cond; {6950#false} is VALID [2018-11-18 22:43:40,739 INFO L273 TraceCheckUtils]: 64: Hoare triple {6950#false} assume !false; {6950#false} is VALID [2018-11-18 22:43:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-18 22:43:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:40,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-18 22:43:40,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-18 22:43:40,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:40,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:43:40,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:40,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:43:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:43:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=257, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:40,839 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 21 states. [2018-11-18 22:43:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:43,004 INFO L93 Difference]: Finished difference Result 195 states and 245 transitions. [2018-11-18 22:43:43,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:43:43,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-18 22:43:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2018-11-18 22:43:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2018-11-18 22:43:43,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2018-11-18 22:43:43,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:43,637 INFO L225 Difference]: With dead ends: 195 [2018-11-18 22:43:43,638 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:43:43,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=429, Invalid=693, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:43:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:43:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-11-18 22:43:43,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:43,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 104 states. [2018-11-18 22:43:43,727 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 104 states. [2018-11-18 22:43:43,728 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 104 states. [2018-11-18 22:43:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:43,732 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2018-11-18 22:43:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2018-11-18 22:43:43,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:43,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:43,733 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 114 states. [2018-11-18 22:43:43,733 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 114 states. [2018-11-18 22:43:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:43,736 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2018-11-18 22:43:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2018-11-18 22:43:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:43,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:43,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 22:43:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2018-11-18 22:43:43,739 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 65 [2018-11-18 22:43:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:43,739 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2018-11-18 22:43:43,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:43:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2018-11-18 22:43:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 22:43:43,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:43,741 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:43,741 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:43,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1008039045, now seen corresponding path program 1 times [2018-11-18 22:43:43,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:43,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:43,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:44,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {7803#true} call ULTIMATE.init(); {7803#true} is VALID [2018-11-18 22:43:44,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {7803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7803#true} is VALID [2018-11-18 22:43:44,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {7803#true} assume true; {7803#true} is VALID [2018-11-18 22:43:44,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7803#true} {7803#true} #137#return; {7803#true} is VALID [2018-11-18 22:43:44,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {7803#true} call #t~ret15 := main(); {7803#true} is VALID [2018-11-18 22:43:44,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {7803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7805#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:44,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {7805#(= 0 main_~i~0)} assume true; {7805#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:44,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {7805#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7806#(= main_~k~0 0)} is VALID [2018-11-18 22:43:44,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {7806#(= main_~k~0 0)} assume true; {7806#(= main_~k~0 0)} is VALID [2018-11-18 22:43:44,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {7806#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7806#(= main_~k~0 0)} is VALID [2018-11-18 22:43:44,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7806#(= main_~k~0 0)} is VALID [2018-11-18 22:43:44,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~k~0 1)} assume true; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {7807#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {7807#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {7808#(<= main_~k~0 2)} assume true; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {7808#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {7808#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {7808#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {7809#(<= main_~k~0 3)} assume true; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {7809#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {7809#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {7809#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {7810#(<= main_~k~0 4)} assume true; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {7810#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {7810#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {7810#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {7811#(<= main_~k~0 5)} assume true; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {7811#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {7811#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {7811#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {7812#(<= main_~k~0 6)} assume true; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,453 INFO L273 TraceCheckUtils]: 33: Hoare triple {7812#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {7812#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {7812#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {7813#(<= main_~k~0 7)} assume true; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {7813#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {7813#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {7813#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {7814#(<= main_~k~0 8)} assume true; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {7814#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {7814#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {7814#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {7815#(<= main_~k~0 9)} assume true; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {7815#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {7815#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {7815#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {7816#(<= main_~k~0 10)} assume true; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {7816#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {7816#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {7816#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {7817#(<= main_~k~0 11)} assume true; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {7817#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {7817#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {7817#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7818#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:44,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {7818#(<= main_~k~0 12)} assume true; {7818#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:44,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {7818#(<= main_~k~0 12)} assume !(~k~0 < 100000); {7804#false} is VALID [2018-11-18 22:43:44,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {7804#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7804#false} is VALID [2018-11-18 22:43:44,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {7804#false} ~x~0 := 0; {7804#false} is VALID [2018-11-18 22:43:44,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {7804#false} assume true; {7804#false} is VALID [2018-11-18 22:43:44,468 INFO L273 TraceCheckUtils]: 61: Hoare triple {7804#false} assume !(~x~0 < ~i~0); {7804#false} is VALID [2018-11-18 22:43:44,468 INFO L273 TraceCheckUtils]: 62: Hoare triple {7804#false} ~x~0 := 1 + ~i~0; {7804#false} is VALID [2018-11-18 22:43:44,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {7804#false} assume true; {7804#false} is VALID [2018-11-18 22:43:44,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {7804#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7804#false} is VALID [2018-11-18 22:43:44,469 INFO L256 TraceCheckUtils]: 65: Hoare triple {7804#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7804#false} is VALID [2018-11-18 22:43:44,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {7804#false} ~cond := #in~cond; {7804#false} is VALID [2018-11-18 22:43:44,469 INFO L273 TraceCheckUtils]: 67: Hoare triple {7804#false} assume 0 == ~cond; {7804#false} is VALID [2018-11-18 22:43:44,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {7804#false} assume !false; {7804#false} is VALID [2018-11-18 22:43:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:44,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:44,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:44,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:44,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {7803#true} call ULTIMATE.init(); {7803#true} is VALID [2018-11-18 22:43:44,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {7803#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7803#true} is VALID [2018-11-18 22:43:44,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {7803#true} assume true; {7803#true} is VALID [2018-11-18 22:43:44,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7803#true} {7803#true} #137#return; {7803#true} is VALID [2018-11-18 22:43:44,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {7803#true} call #t~ret15 := main(); {7803#true} is VALID [2018-11-18 22:43:44,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {7803#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7837#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:44,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {7837#(<= main_~i~0 0)} assume true; {7837#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:44,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {7837#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7844#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:44,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {7844#(<= main_~k~0 0)} assume true; {7844#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:44,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {7844#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7844#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:44,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {7844#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7844#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:44,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {7844#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~k~0 1)} assume true; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {7807#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7807#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:44,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {7807#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {7808#(<= main_~k~0 2)} assume true; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {7808#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {7808#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7808#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:44,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {7808#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {7809#(<= main_~k~0 3)} assume true; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {7809#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {7809#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7809#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:44,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {7809#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {7810#(<= main_~k~0 4)} assume true; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {7810#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {7810#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7810#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:44,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {7810#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {7811#(<= main_~k~0 5)} assume true; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {7811#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {7811#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7811#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:44,703 INFO L273 TraceCheckUtils]: 31: Hoare triple {7811#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {7812#(<= main_~k~0 6)} assume true; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {7812#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {7812#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7812#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:44,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {7812#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,706 INFO L273 TraceCheckUtils]: 36: Hoare triple {7813#(<= main_~k~0 7)} assume true; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {7813#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {7813#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7813#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:44,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {7813#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {7814#(<= main_~k~0 8)} assume true; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {7814#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,709 INFO L273 TraceCheckUtils]: 42: Hoare triple {7814#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7814#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:44,709 INFO L273 TraceCheckUtils]: 43: Hoare triple {7814#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,710 INFO L273 TraceCheckUtils]: 44: Hoare triple {7815#(<= main_~k~0 9)} assume true; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {7815#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,711 INFO L273 TraceCheckUtils]: 46: Hoare triple {7815#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7815#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:44,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {7815#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,712 INFO L273 TraceCheckUtils]: 48: Hoare triple {7816#(<= main_~k~0 10)} assume true; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,713 INFO L273 TraceCheckUtils]: 49: Hoare triple {7816#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,713 INFO L273 TraceCheckUtils]: 50: Hoare triple {7816#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7816#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:44,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {7816#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,714 INFO L273 TraceCheckUtils]: 52: Hoare triple {7817#(<= main_~k~0 11)} assume true; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,715 INFO L273 TraceCheckUtils]: 53: Hoare triple {7817#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,715 INFO L273 TraceCheckUtils]: 54: Hoare triple {7817#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7817#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:44,716 INFO L273 TraceCheckUtils]: 55: Hoare triple {7817#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7818#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:44,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {7818#(<= main_~k~0 12)} assume true; {7818#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:44,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {7818#(<= main_~k~0 12)} assume !(~k~0 < 100000); {7804#false} is VALID [2018-11-18 22:43:44,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {7804#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7804#false} is VALID [2018-11-18 22:43:44,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {7804#false} ~x~0 := 0; {7804#false} is VALID [2018-11-18 22:43:44,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {7804#false} assume true; {7804#false} is VALID [2018-11-18 22:43:44,718 INFO L273 TraceCheckUtils]: 61: Hoare triple {7804#false} assume !(~x~0 < ~i~0); {7804#false} is VALID [2018-11-18 22:43:44,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {7804#false} ~x~0 := 1 + ~i~0; {7804#false} is VALID [2018-11-18 22:43:44,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {7804#false} assume true; {7804#false} is VALID [2018-11-18 22:43:44,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {7804#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7804#false} is VALID [2018-11-18 22:43:44,719 INFO L256 TraceCheckUtils]: 65: Hoare triple {7804#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7804#false} is VALID [2018-11-18 22:43:44,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {7804#false} ~cond := #in~cond; {7804#false} is VALID [2018-11-18 22:43:44,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {7804#false} assume 0 == ~cond; {7804#false} is VALID [2018-11-18 22:43:44,720 INFO L273 TraceCheckUtils]: 68: Hoare triple {7804#false} assume !false; {7804#false} is VALID [2018-11-18 22:43:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:44,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:44,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-11-18 22:43:44,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-11-18 22:43:44,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:44,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:43:44,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:43:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:43:44,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:43:44,809 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 18 states. [2018-11-18 22:43:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:46,121 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2018-11-18 22:43:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:43:46,121 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-11-18 22:43:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:43:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2018-11-18 22:43:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:43:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 190 transitions. [2018-11-18 22:43:46,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 190 transitions. [2018-11-18 22:43:46,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:46,375 INFO L225 Difference]: With dead ends: 159 [2018-11-18 22:43:46,375 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 22:43:46,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:43:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 22:43:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-11-18 22:43:46,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:46,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 108 states. [2018-11-18 22:43:46,498 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 108 states. [2018-11-18 22:43:46,498 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 108 states. [2018-11-18 22:43:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:46,501 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-11-18 22:43:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-11-18 22:43:46,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:46,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:46,502 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 117 states. [2018-11-18 22:43:46,502 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 117 states. [2018-11-18 22:43:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:46,505 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-11-18 22:43:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-11-18 22:43:46,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:46,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:46,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:46,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 22:43:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2018-11-18 22:43:46,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 69 [2018-11-18 22:43:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:46,509 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2018-11-18 22:43:46,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:43:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2018-11-18 22:43:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 22:43:46,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:46,510 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:46,510 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:46,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1633550161, now seen corresponding path program 2 times [2018-11-18 22:43:46,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:46,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {8632#true} call ULTIMATE.init(); {8632#true} is VALID [2018-11-18 22:43:46,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {8632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8632#true} is VALID [2018-11-18 22:43:46,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {8632#true} assume true; {8632#true} is VALID [2018-11-18 22:43:46,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8632#true} {8632#true} #137#return; {8632#true} is VALID [2018-11-18 22:43:46,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {8632#true} call #t~ret15 := main(); {8632#true} is VALID [2018-11-18 22:43:46,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {8632#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8634#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:46,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {8634#(= 0 main_~i~0)} assume true; {8634#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:46,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {8634#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {8635#(= main_~k~0 0)} is VALID [2018-11-18 22:43:46,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {8635#(= main_~k~0 0)} assume true; {8635#(= main_~k~0 0)} is VALID [2018-11-18 22:43:46,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {8635#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8635#(= main_~k~0 0)} is VALID [2018-11-18 22:43:46,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {8635#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8635#(= main_~k~0 0)} is VALID [2018-11-18 22:43:46,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {8635#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:46,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {8636#(<= main_~k~0 1)} assume true; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:46,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {8636#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:46,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {8636#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:46,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {8636#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:46,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {8637#(<= main_~k~0 2)} assume true; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:46,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {8637#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:46,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {8637#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:46,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {8637#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:46,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {8638#(<= main_~k~0 3)} assume true; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:46,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {8638#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:46,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {8638#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:46,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {8638#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:46,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {8639#(<= main_~k~0 4)} assume true; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:46,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {8639#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:46,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {8639#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:46,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {8639#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:46,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {8640#(<= main_~k~0 5)} assume true; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:46,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {8640#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:46,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {8640#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:46,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {8640#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:46,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {8641#(<= main_~k~0 6)} assume true; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:46,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {8641#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:46,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {8641#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:46,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {8641#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:46,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {8642#(<= main_~k~0 7)} assume true; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:46,828 INFO L273 TraceCheckUtils]: 37: Hoare triple {8642#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:46,828 INFO L273 TraceCheckUtils]: 38: Hoare triple {8642#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:46,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {8642#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:46,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {8643#(<= main_~k~0 8)} assume true; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:46,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {8643#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:46,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {8643#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:46,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {8643#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:46,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {8644#(<= main_~k~0 9)} assume true; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:46,832 INFO L273 TraceCheckUtils]: 45: Hoare triple {8644#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:46,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {8644#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:46,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {8644#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:46,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {8645#(<= main_~k~0 10)} assume true; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:46,834 INFO L273 TraceCheckUtils]: 49: Hoare triple {8645#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:46,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {8645#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:46,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {8645#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 52: Hoare triple {8646#(<= main_~k~0 11)} assume true; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:46,838 INFO L273 TraceCheckUtils]: 53: Hoare triple {8646#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 54: Hoare triple {8646#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 55: Hoare triple {8646#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:46,839 INFO L273 TraceCheckUtils]: 56: Hoare triple {8647#(<= main_~k~0 12)} assume true; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 57: Hoare triple {8647#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:46,840 INFO L273 TraceCheckUtils]: 58: Hoare triple {8647#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 59: Hoare triple {8647#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {8648#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:46,841 INFO L273 TraceCheckUtils]: 60: Hoare triple {8648#(<= main_~k~0 13)} assume true; {8648#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 61: Hoare triple {8648#(<= main_~k~0 13)} assume !(~k~0 < 100000); {8633#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 62: Hoare triple {8633#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8633#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 63: Hoare triple {8633#false} ~x~0 := 0; {8633#false} is VALID [2018-11-18 22:43:46,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {8633#false} assume true; {8633#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 65: Hoare triple {8633#false} assume !(~x~0 < ~i~0); {8633#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {8633#false} ~x~0 := 1 + ~i~0; {8633#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {8633#false} assume true; {8633#false} is VALID [2018-11-18 22:43:46,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {8633#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8633#false} is VALID [2018-11-18 22:43:46,843 INFO L256 TraceCheckUtils]: 69: Hoare triple {8633#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8633#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 70: Hoare triple {8633#false} ~cond := #in~cond; {8633#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 71: Hoare triple {8633#false} assume 0 == ~cond; {8633#false} is VALID [2018-11-18 22:43:46,844 INFO L273 TraceCheckUtils]: 72: Hoare triple {8633#false} assume !false; {8633#false} is VALID [2018-11-18 22:43:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:46,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:46,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:46,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:46,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:46,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:46,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:47,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {8632#true} call ULTIMATE.init(); {8632#true} is VALID [2018-11-18 22:43:47,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {8632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8632#true} is VALID [2018-11-18 22:43:47,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {8632#true} assume true; {8632#true} is VALID [2018-11-18 22:43:47,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8632#true} {8632#true} #137#return; {8632#true} is VALID [2018-11-18 22:43:47,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {8632#true} call #t~ret15 := main(); {8632#true} is VALID [2018-11-18 22:43:47,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {8632#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8667#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:47,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {8667#(<= main_~i~0 0)} assume true; {8667#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:47,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {8667#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {8674#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:47,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {8674#(<= main_~k~0 0)} assume true; {8674#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:47,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {8674#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8674#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:47,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {8674#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8674#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:47,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {8674#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:47,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {8636#(<= main_~k~0 1)} assume true; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:47,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {8636#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:47,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {8636#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8636#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:47,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {8636#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:47,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {8637#(<= main_~k~0 2)} assume true; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:47,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {8637#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:47,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {8637#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8637#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:47,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {8637#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:47,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {8638#(<= main_~k~0 3)} assume true; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:47,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {8638#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:47,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {8638#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8638#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:47,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {8638#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:47,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {8639#(<= main_~k~0 4)} assume true; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:47,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {8639#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:47,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {8639#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8639#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:47,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {8639#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:47,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {8640#(<= main_~k~0 5)} assume true; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:47,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {8640#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:47,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {8640#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8640#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:47,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {8640#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:47,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {8641#(<= main_~k~0 6)} assume true; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:47,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {8641#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:47,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {8641#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8641#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:47,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {8641#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:47,400 INFO L273 TraceCheckUtils]: 36: Hoare triple {8642#(<= main_~k~0 7)} assume true; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:47,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {8642#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:47,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {8642#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8642#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:47,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {8642#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:47,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {8643#(<= main_~k~0 8)} assume true; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:47,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {8643#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:47,403 INFO L273 TraceCheckUtils]: 42: Hoare triple {8643#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8643#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:47,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {8643#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:47,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {8644#(<= main_~k~0 9)} assume true; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:47,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {8644#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:47,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {8644#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8644#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:47,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {8644#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:47,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {8645#(<= main_~k~0 10)} assume true; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:47,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {8645#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:47,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {8645#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8645#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:47,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {8645#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:47,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {8646#(<= main_~k~0 11)} assume true; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:47,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {8646#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:47,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {8646#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8646#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:47,410 INFO L273 TraceCheckUtils]: 55: Hoare triple {8646#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:47,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {8647#(<= main_~k~0 12)} assume true; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:47,411 INFO L273 TraceCheckUtils]: 57: Hoare triple {8647#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:47,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {8647#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8647#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:47,413 INFO L273 TraceCheckUtils]: 59: Hoare triple {8647#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {8648#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:47,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {8648#(<= main_~k~0 13)} assume true; {8648#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:47,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {8648#(<= main_~k~0 13)} assume !(~k~0 < 100000); {8633#false} is VALID [2018-11-18 22:43:47,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {8633#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8633#false} is VALID [2018-11-18 22:43:47,414 INFO L273 TraceCheckUtils]: 63: Hoare triple {8633#false} ~x~0 := 0; {8633#false} is VALID [2018-11-18 22:43:47,414 INFO L273 TraceCheckUtils]: 64: Hoare triple {8633#false} assume true; {8633#false} is VALID [2018-11-18 22:43:47,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {8633#false} assume !(~x~0 < ~i~0); {8633#false} is VALID [2018-11-18 22:43:47,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {8633#false} ~x~0 := 1 + ~i~0; {8633#false} is VALID [2018-11-18 22:43:47,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {8633#false} assume true; {8633#false} is VALID [2018-11-18 22:43:47,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {8633#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8633#false} is VALID [2018-11-18 22:43:47,415 INFO L256 TraceCheckUtils]: 69: Hoare triple {8633#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8633#false} is VALID [2018-11-18 22:43:47,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {8633#false} ~cond := #in~cond; {8633#false} is VALID [2018-11-18 22:43:47,416 INFO L273 TraceCheckUtils]: 71: Hoare triple {8633#false} assume 0 == ~cond; {8633#false} is VALID [2018-11-18 22:43:47,416 INFO L273 TraceCheckUtils]: 72: Hoare triple {8633#false} assume !false; {8633#false} is VALID [2018-11-18 22:43:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:47,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:47,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-11-18 22:43:47,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-11-18 22:43:47,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:47,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:43:47,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:47,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:43:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:43:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:43:47,509 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand 19 states. [2018-11-18 22:43:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:48,533 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2018-11-18 22:43:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:43:48,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-11-18 22:43:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:43:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 195 transitions. [2018-11-18 22:43:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:43:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 195 transitions. [2018-11-18 22:43:48,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 195 transitions. [2018-11-18 22:43:48,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:48,836 INFO L225 Difference]: With dead ends: 163 [2018-11-18 22:43:48,837 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 22:43:48,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:43:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 22:43:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2018-11-18 22:43:49,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:49,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 112 states. [2018-11-18 22:43:49,045 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 112 states. [2018-11-18 22:43:49,045 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 112 states. [2018-11-18 22:43:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:49,047 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2018-11-18 22:43:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2018-11-18 22:43:49,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:49,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:49,048 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 121 states. [2018-11-18 22:43:49,048 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 121 states. [2018-11-18 22:43:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:49,051 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2018-11-18 22:43:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2018-11-18 22:43:49,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:49,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:49,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:49,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 22:43:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2018-11-18 22:43:49,054 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 73 [2018-11-18 22:43:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:49,054 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2018-11-18 22:43:49,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:43:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2018-11-18 22:43:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 22:43:49,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:49,055 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:49,056 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:49,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1839700007, now seen corresponding path program 3 times [2018-11-18 22:43:49,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:49,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:49,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:49,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:49,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:49,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {9494#true} call ULTIMATE.init(); {9494#true} is VALID [2018-11-18 22:43:49,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {9494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9494#true} is VALID [2018-11-18 22:43:49,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {9494#true} assume true; {9494#true} is VALID [2018-11-18 22:43:49,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9494#true} {9494#true} #137#return; {9494#true} is VALID [2018-11-18 22:43:49,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {9494#true} call #t~ret15 := main(); {9494#true} is VALID [2018-11-18 22:43:49,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {9494#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9496#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:49,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {9496#(= 0 main_~i~0)} assume true; {9496#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:49,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {9496#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {9497#(= main_~k~0 0)} is VALID [2018-11-18 22:43:49,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {9497#(= main_~k~0 0)} assume true; {9497#(= main_~k~0 0)} is VALID [2018-11-18 22:43:49,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {9497#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9497#(= main_~k~0 0)} is VALID [2018-11-18 22:43:49,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {9497#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9497#(= main_~k~0 0)} is VALID [2018-11-18 22:43:49,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {9497#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:49,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {9498#(<= main_~k~0 1)} assume true; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:49,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {9498#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:49,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {9498#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:49,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {9498#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:49,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {9499#(<= main_~k~0 2)} assume true; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:49,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {9499#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:49,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {9499#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:49,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {9499#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:49,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {9500#(<= main_~k~0 3)} assume true; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:49,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {9500#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:49,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {9500#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:49,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {9500#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:49,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {9501#(<= main_~k~0 4)} assume true; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:49,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {9501#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:49,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {9501#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:49,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {9501#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:49,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {9502#(<= main_~k~0 5)} assume true; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:49,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {9502#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:49,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {9502#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:49,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {9502#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:49,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {9503#(<= main_~k~0 6)} assume true; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:49,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {9503#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:49,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {9503#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:49,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {9503#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:49,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {9504#(<= main_~k~0 7)} assume true; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:49,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {9504#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:49,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {9504#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:49,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {9504#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:49,832 INFO L273 TraceCheckUtils]: 40: Hoare triple {9505#(<= main_~k~0 8)} assume true; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:49,832 INFO L273 TraceCheckUtils]: 41: Hoare triple {9505#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:49,833 INFO L273 TraceCheckUtils]: 42: Hoare triple {9505#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:49,833 INFO L273 TraceCheckUtils]: 43: Hoare triple {9505#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:49,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {9506#(<= main_~k~0 9)} assume true; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:49,834 INFO L273 TraceCheckUtils]: 45: Hoare triple {9506#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:49,835 INFO L273 TraceCheckUtils]: 46: Hoare triple {9506#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:49,836 INFO L273 TraceCheckUtils]: 47: Hoare triple {9506#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:49,836 INFO L273 TraceCheckUtils]: 48: Hoare triple {9507#(<= main_~k~0 10)} assume true; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:49,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {9507#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:49,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {9507#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:49,838 INFO L273 TraceCheckUtils]: 51: Hoare triple {9507#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:49,838 INFO L273 TraceCheckUtils]: 52: Hoare triple {9508#(<= main_~k~0 11)} assume true; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:49,839 INFO L273 TraceCheckUtils]: 53: Hoare triple {9508#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:49,840 INFO L273 TraceCheckUtils]: 54: Hoare triple {9508#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:49,840 INFO L273 TraceCheckUtils]: 55: Hoare triple {9508#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:49,841 INFO L273 TraceCheckUtils]: 56: Hoare triple {9509#(<= main_~k~0 12)} assume true; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:49,841 INFO L273 TraceCheckUtils]: 57: Hoare triple {9509#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:49,842 INFO L273 TraceCheckUtils]: 58: Hoare triple {9509#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:49,843 INFO L273 TraceCheckUtils]: 59: Hoare triple {9509#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:49,843 INFO L273 TraceCheckUtils]: 60: Hoare triple {9510#(<= main_~k~0 13)} assume true; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:49,844 INFO L273 TraceCheckUtils]: 61: Hoare triple {9510#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:49,844 INFO L273 TraceCheckUtils]: 62: Hoare triple {9510#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:49,845 INFO L273 TraceCheckUtils]: 63: Hoare triple {9510#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {9511#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:49,845 INFO L273 TraceCheckUtils]: 64: Hoare triple {9511#(<= main_~k~0 14)} assume true; {9511#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:49,846 INFO L273 TraceCheckUtils]: 65: Hoare triple {9511#(<= main_~k~0 14)} assume !(~k~0 < 100000); {9495#false} is VALID [2018-11-18 22:43:49,846 INFO L273 TraceCheckUtils]: 66: Hoare triple {9495#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9495#false} is VALID [2018-11-18 22:43:49,847 INFO L273 TraceCheckUtils]: 67: Hoare triple {9495#false} ~x~0 := 0; {9495#false} is VALID [2018-11-18 22:43:49,847 INFO L273 TraceCheckUtils]: 68: Hoare triple {9495#false} assume true; {9495#false} is VALID [2018-11-18 22:43:49,847 INFO L273 TraceCheckUtils]: 69: Hoare triple {9495#false} assume !(~x~0 < ~i~0); {9495#false} is VALID [2018-11-18 22:43:49,847 INFO L273 TraceCheckUtils]: 70: Hoare triple {9495#false} ~x~0 := 1 + ~i~0; {9495#false} is VALID [2018-11-18 22:43:49,847 INFO L273 TraceCheckUtils]: 71: Hoare triple {9495#false} assume true; {9495#false} is VALID [2018-11-18 22:43:49,848 INFO L273 TraceCheckUtils]: 72: Hoare triple {9495#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9495#false} is VALID [2018-11-18 22:43:49,848 INFO L256 TraceCheckUtils]: 73: Hoare triple {9495#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9495#false} is VALID [2018-11-18 22:43:49,848 INFO L273 TraceCheckUtils]: 74: Hoare triple {9495#false} ~cond := #in~cond; {9495#false} is VALID [2018-11-18 22:43:49,848 INFO L273 TraceCheckUtils]: 75: Hoare triple {9495#false} assume 0 == ~cond; {9495#false} is VALID [2018-11-18 22:43:49,848 INFO L273 TraceCheckUtils]: 76: Hoare triple {9495#false} assume !false; {9495#false} is VALID [2018-11-18 22:43:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:49,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:49,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:49,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-18 22:43:49,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:49,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:50,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {9494#true} call ULTIMATE.init(); {9494#true} is VALID [2018-11-18 22:43:50,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {9494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9494#true} is VALID [2018-11-18 22:43:50,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {9494#true} assume true; {9494#true} is VALID [2018-11-18 22:43:50,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9494#true} {9494#true} #137#return; {9494#true} is VALID [2018-11-18 22:43:50,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {9494#true} call #t~ret15 := main(); {9494#true} is VALID [2018-11-18 22:43:50,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {9494#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9530#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:50,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {9530#(<= main_~i~0 0)} assume true; {9530#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:50,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {9530#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {9537#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:50,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {9537#(<= main_~k~0 0)} assume true; {9537#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:50,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {9537#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9537#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:50,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {9537#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9537#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:50,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {9537#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:50,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {9498#(<= main_~k~0 1)} assume true; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:50,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {9498#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:50,170 INFO L273 TraceCheckUtils]: 14: Hoare triple {9498#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9498#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:50,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {9498#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:50,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {9499#(<= main_~k~0 2)} assume true; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:50,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {9499#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:50,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {9499#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9499#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:50,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {9499#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:50,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {9500#(<= main_~k~0 3)} assume true; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:50,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {9500#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:50,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {9500#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9500#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:50,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {9500#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:50,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {9501#(<= main_~k~0 4)} assume true; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:50,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {9501#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:50,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {9501#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9501#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:50,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {9501#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:50,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {9502#(<= main_~k~0 5)} assume true; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:50,179 INFO L273 TraceCheckUtils]: 29: Hoare triple {9502#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:50,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {9502#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9502#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:50,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {9502#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:50,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {9503#(<= main_~k~0 6)} assume true; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:50,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {9503#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:50,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {9503#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9503#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:50,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {9503#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:50,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {9504#(<= main_~k~0 7)} assume true; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:50,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {9504#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:50,209 INFO L273 TraceCheckUtils]: 38: Hoare triple {9504#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9504#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:50,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {9504#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:50,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {9505#(<= main_~k~0 8)} assume true; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:50,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {9505#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:50,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {9505#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9505#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:50,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {9505#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:50,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {9506#(<= main_~k~0 9)} assume true; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:50,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {9506#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:50,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {9506#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9506#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:50,240 INFO L273 TraceCheckUtils]: 47: Hoare triple {9506#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:50,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {9507#(<= main_~k~0 10)} assume true; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:50,241 INFO L273 TraceCheckUtils]: 49: Hoare triple {9507#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:50,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {9507#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9507#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:50,242 INFO L273 TraceCheckUtils]: 51: Hoare triple {9507#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:50,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {9508#(<= main_~k~0 11)} assume true; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:50,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {9508#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:50,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {9508#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9508#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:50,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {9508#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:50,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {9509#(<= main_~k~0 12)} assume true; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:50,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {9509#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:50,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {9509#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9509#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:50,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {9509#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:50,246 INFO L273 TraceCheckUtils]: 60: Hoare triple {9510#(<= main_~k~0 13)} assume true; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:50,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {9510#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:50,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {9510#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9510#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:50,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {9510#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {9511#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:50,249 INFO L273 TraceCheckUtils]: 64: Hoare triple {9511#(<= main_~k~0 14)} assume true; {9511#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:50,249 INFO L273 TraceCheckUtils]: 65: Hoare triple {9511#(<= main_~k~0 14)} assume !(~k~0 < 100000); {9495#false} is VALID [2018-11-18 22:43:50,249 INFO L273 TraceCheckUtils]: 66: Hoare triple {9495#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9495#false} is VALID [2018-11-18 22:43:50,250 INFO L273 TraceCheckUtils]: 67: Hoare triple {9495#false} ~x~0 := 0; {9495#false} is VALID [2018-11-18 22:43:50,250 INFO L273 TraceCheckUtils]: 68: Hoare triple {9495#false} assume true; {9495#false} is VALID [2018-11-18 22:43:50,250 INFO L273 TraceCheckUtils]: 69: Hoare triple {9495#false} assume !(~x~0 < ~i~0); {9495#false} is VALID [2018-11-18 22:43:50,250 INFO L273 TraceCheckUtils]: 70: Hoare triple {9495#false} ~x~0 := 1 + ~i~0; {9495#false} is VALID [2018-11-18 22:43:50,250 INFO L273 TraceCheckUtils]: 71: Hoare triple {9495#false} assume true; {9495#false} is VALID [2018-11-18 22:43:50,251 INFO L273 TraceCheckUtils]: 72: Hoare triple {9495#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9495#false} is VALID [2018-11-18 22:43:50,251 INFO L256 TraceCheckUtils]: 73: Hoare triple {9495#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9495#false} is VALID [2018-11-18 22:43:50,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {9495#false} ~cond := #in~cond; {9495#false} is VALID [2018-11-18 22:43:50,251 INFO L273 TraceCheckUtils]: 75: Hoare triple {9495#false} assume 0 == ~cond; {9495#false} is VALID [2018-11-18 22:43:50,252 INFO L273 TraceCheckUtils]: 76: Hoare triple {9495#false} assume !false; {9495#false} is VALID [2018-11-18 22:43:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:50,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:50,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-11-18 22:43:50,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-11-18 22:43:50,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:50,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:43:50,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:50,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:43:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:43:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:43:50,353 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand 20 states. [2018-11-18 22:43:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:51,254 INFO L93 Difference]: Finished difference Result 167 states and 209 transitions. [2018-11-18 22:43:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:43:51,254 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-11-18 22:43:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:43:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2018-11-18 22:43:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:43:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2018-11-18 22:43:51,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 200 transitions. [2018-11-18 22:43:51,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:51,540 INFO L225 Difference]: With dead ends: 167 [2018-11-18 22:43:51,540 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 22:43:51,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:43:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 22:43:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-11-18 22:43:51,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:51,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 116 states. [2018-11-18 22:43:51,589 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 116 states. [2018-11-18 22:43:51,589 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 116 states. [2018-11-18 22:43:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:51,593 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2018-11-18 22:43:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2018-11-18 22:43:51,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:51,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:51,594 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 125 states. [2018-11-18 22:43:51,594 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 125 states. [2018-11-18 22:43:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:51,596 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2018-11-18 22:43:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2018-11-18 22:43:51,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:51,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:51,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:51,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 22:43:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2018-11-18 22:43:51,599 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 77 [2018-11-18 22:43:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:51,600 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2018-11-18 22:43:51,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:43:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2018-11-18 22:43:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 22:43:51,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:51,601 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:51,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1758669315, now seen corresponding path program 4 times [2018-11-18 22:43:51,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:51,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:51,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {10389#true} call ULTIMATE.init(); {10389#true} is VALID [2018-11-18 22:43:51,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {10389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10389#true} is VALID [2018-11-18 22:43:51,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {10389#true} assume true; {10389#true} is VALID [2018-11-18 22:43:51,846 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10389#true} {10389#true} #137#return; {10389#true} is VALID [2018-11-18 22:43:51,846 INFO L256 TraceCheckUtils]: 4: Hoare triple {10389#true} call #t~ret15 := main(); {10389#true} is VALID [2018-11-18 22:43:51,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {10389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10391#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:51,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {10391#(= 0 main_~i~0)} assume true; {10391#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:51,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {10391#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10392#(= main_~k~0 0)} is VALID [2018-11-18 22:43:51,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {10392#(= main_~k~0 0)} assume true; {10392#(= main_~k~0 0)} is VALID [2018-11-18 22:43:51,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {10392#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10392#(= main_~k~0 0)} is VALID [2018-11-18 22:43:51,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {10392#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10392#(= main_~k~0 0)} is VALID [2018-11-18 22:43:51,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {10392#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:51,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {10393#(<= main_~k~0 1)} assume true; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:51,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {10393#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:51,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {10393#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:51,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {10393#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:51,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {10394#(<= main_~k~0 2)} assume true; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:51,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {10394#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:51,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {10394#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:51,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {10394#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:51,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {10395#(<= main_~k~0 3)} assume true; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:51,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {10395#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:51,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {10395#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:51,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {10395#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:51,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {10396#(<= main_~k~0 4)} assume true; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:51,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {10396#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:51,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {10396#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:51,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {10396#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:51,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {10397#(<= main_~k~0 5)} assume true; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:51,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {10397#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:51,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {10397#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:51,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {10397#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:51,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {10398#(<= main_~k~0 6)} assume true; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:51,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {10398#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:51,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {10398#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:51,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {10398#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:51,863 INFO L273 TraceCheckUtils]: 36: Hoare triple {10399#(<= main_~k~0 7)} assume true; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:51,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {10399#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:51,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {10399#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:51,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {10399#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:51,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {10400#(<= main_~k~0 8)} assume true; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:51,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {10400#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:51,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {10400#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:51,867 INFO L273 TraceCheckUtils]: 43: Hoare triple {10400#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:51,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {10401#(<= main_~k~0 9)} assume true; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:51,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {10401#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:51,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {10401#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:51,869 INFO L273 TraceCheckUtils]: 47: Hoare triple {10401#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:51,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {10402#(<= main_~k~0 10)} assume true; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:51,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {10402#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:51,870 INFO L273 TraceCheckUtils]: 50: Hoare triple {10402#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:51,871 INFO L273 TraceCheckUtils]: 51: Hoare triple {10402#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:51,872 INFO L273 TraceCheckUtils]: 52: Hoare triple {10403#(<= main_~k~0 11)} assume true; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:51,872 INFO L273 TraceCheckUtils]: 53: Hoare triple {10403#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:51,873 INFO L273 TraceCheckUtils]: 54: Hoare triple {10403#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:51,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {10403#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:51,874 INFO L273 TraceCheckUtils]: 56: Hoare triple {10404#(<= main_~k~0 12)} assume true; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:51,874 INFO L273 TraceCheckUtils]: 57: Hoare triple {10404#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:51,875 INFO L273 TraceCheckUtils]: 58: Hoare triple {10404#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:51,875 INFO L273 TraceCheckUtils]: 59: Hoare triple {10404#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:51,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {10405#(<= main_~k~0 13)} assume true; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:51,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {10405#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:51,877 INFO L273 TraceCheckUtils]: 62: Hoare triple {10405#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:51,878 INFO L273 TraceCheckUtils]: 63: Hoare triple {10405#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:51,878 INFO L273 TraceCheckUtils]: 64: Hoare triple {10406#(<= main_~k~0 14)} assume true; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:51,879 INFO L273 TraceCheckUtils]: 65: Hoare triple {10406#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:51,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {10406#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:51,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {10406#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10407#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:51,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {10407#(<= main_~k~0 15)} assume true; {10407#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:51,881 INFO L273 TraceCheckUtils]: 69: Hoare triple {10407#(<= main_~k~0 15)} assume !(~k~0 < 100000); {10390#false} is VALID [2018-11-18 22:43:51,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {10390#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10390#false} is VALID [2018-11-18 22:43:51,881 INFO L273 TraceCheckUtils]: 71: Hoare triple {10390#false} ~x~0 := 0; {10390#false} is VALID [2018-11-18 22:43:51,882 INFO L273 TraceCheckUtils]: 72: Hoare triple {10390#false} assume true; {10390#false} is VALID [2018-11-18 22:43:51,882 INFO L273 TraceCheckUtils]: 73: Hoare triple {10390#false} assume !(~x~0 < ~i~0); {10390#false} is VALID [2018-11-18 22:43:51,882 INFO L273 TraceCheckUtils]: 74: Hoare triple {10390#false} ~x~0 := 1 + ~i~0; {10390#false} is VALID [2018-11-18 22:43:51,882 INFO L273 TraceCheckUtils]: 75: Hoare triple {10390#false} assume true; {10390#false} is VALID [2018-11-18 22:43:51,882 INFO L273 TraceCheckUtils]: 76: Hoare triple {10390#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10390#false} is VALID [2018-11-18 22:43:51,883 INFO L256 TraceCheckUtils]: 77: Hoare triple {10390#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10390#false} is VALID [2018-11-18 22:43:51,883 INFO L273 TraceCheckUtils]: 78: Hoare triple {10390#false} ~cond := #in~cond; {10390#false} is VALID [2018-11-18 22:43:51,883 INFO L273 TraceCheckUtils]: 79: Hoare triple {10390#false} assume 0 == ~cond; {10390#false} is VALID [2018-11-18 22:43:51,883 INFO L273 TraceCheckUtils]: 80: Hoare triple {10390#false} assume !false; {10390#false} is VALID [2018-11-18 22:43:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:51,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:51,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:43:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:51,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:51,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:51,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:52,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {10389#true} call ULTIMATE.init(); {10389#true} is VALID [2018-11-18 22:43:52,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {10389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10389#true} is VALID [2018-11-18 22:43:52,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {10389#true} assume true; {10389#true} is VALID [2018-11-18 22:43:52,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10389#true} {10389#true} #137#return; {10389#true} is VALID [2018-11-18 22:43:52,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {10389#true} call #t~ret15 := main(); {10389#true} is VALID [2018-11-18 22:43:52,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {10389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10426#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:52,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {10426#(<= main_~i~0 0)} assume true; {10426#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:52,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {10426#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10433#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:52,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {10433#(<= main_~k~0 0)} assume true; {10433#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:52,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {10433#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10433#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:52,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {10433#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10433#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:52,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {10433#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:52,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {10393#(<= main_~k~0 1)} assume true; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:52,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {10393#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:52,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {10393#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10393#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:52,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {10393#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:52,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {10394#(<= main_~k~0 2)} assume true; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:52,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {10394#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:52,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {10394#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10394#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:52,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {10394#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:52,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {10395#(<= main_~k~0 3)} assume true; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:52,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {10395#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:52,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {10395#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10395#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:52,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {10395#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:52,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {10396#(<= main_~k~0 4)} assume true; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:52,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {10396#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:52,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {10396#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10396#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:52,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {10396#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:52,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {10397#(<= main_~k~0 5)} assume true; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:52,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {10397#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:52,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {10397#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10397#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:52,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {10397#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:52,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {10398#(<= main_~k~0 6)} assume true; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:52,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {10398#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:52,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {10398#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10398#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:52,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {10398#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:52,282 INFO L273 TraceCheckUtils]: 36: Hoare triple {10399#(<= main_~k~0 7)} assume true; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:52,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {10399#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:52,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {10399#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10399#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:52,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {10399#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:52,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {10400#(<= main_~k~0 8)} assume true; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:52,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {10400#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:52,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {10400#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10400#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:52,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {10400#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:52,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {10401#(<= main_~k~0 9)} assume true; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:52,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {10401#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:52,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {10401#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10401#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:52,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {10401#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:52,297 INFO L273 TraceCheckUtils]: 48: Hoare triple {10402#(<= main_~k~0 10)} assume true; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:52,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {10402#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:52,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {10402#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10402#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:52,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {10402#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:52,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {10403#(<= main_~k~0 11)} assume true; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:52,303 INFO L273 TraceCheckUtils]: 53: Hoare triple {10403#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:52,306 INFO L273 TraceCheckUtils]: 54: Hoare triple {10403#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10403#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:52,306 INFO L273 TraceCheckUtils]: 55: Hoare triple {10403#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:52,308 INFO L273 TraceCheckUtils]: 56: Hoare triple {10404#(<= main_~k~0 12)} assume true; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:52,308 INFO L273 TraceCheckUtils]: 57: Hoare triple {10404#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:52,310 INFO L273 TraceCheckUtils]: 58: Hoare triple {10404#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10404#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:52,310 INFO L273 TraceCheckUtils]: 59: Hoare triple {10404#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:52,313 INFO L273 TraceCheckUtils]: 60: Hoare triple {10405#(<= main_~k~0 13)} assume true; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:52,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {10405#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:52,316 INFO L273 TraceCheckUtils]: 62: Hoare triple {10405#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10405#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:52,316 INFO L273 TraceCheckUtils]: 63: Hoare triple {10405#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:52,319 INFO L273 TraceCheckUtils]: 64: Hoare triple {10406#(<= main_~k~0 14)} assume true; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:52,319 INFO L273 TraceCheckUtils]: 65: Hoare triple {10406#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:52,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {10406#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10406#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:52,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {10406#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10407#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:52,324 INFO L273 TraceCheckUtils]: 68: Hoare triple {10407#(<= main_~k~0 15)} assume true; {10407#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:52,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {10407#(<= main_~k~0 15)} assume !(~k~0 < 100000); {10390#false} is VALID [2018-11-18 22:43:52,324 INFO L273 TraceCheckUtils]: 70: Hoare triple {10390#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10390#false} is VALID [2018-11-18 22:43:52,324 INFO L273 TraceCheckUtils]: 71: Hoare triple {10390#false} ~x~0 := 0; {10390#false} is VALID [2018-11-18 22:43:52,324 INFO L273 TraceCheckUtils]: 72: Hoare triple {10390#false} assume true; {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 73: Hoare triple {10390#false} assume !(~x~0 < ~i~0); {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 74: Hoare triple {10390#false} ~x~0 := 1 + ~i~0; {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 75: Hoare triple {10390#false} assume true; {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 76: Hoare triple {10390#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L256 TraceCheckUtils]: 77: Hoare triple {10390#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 78: Hoare triple {10390#false} ~cond := #in~cond; {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 79: Hoare triple {10390#false} assume 0 == ~cond; {10390#false} is VALID [2018-11-18 22:43:52,325 INFO L273 TraceCheckUtils]: 80: Hoare triple {10390#false} assume !false; {10390#false} is VALID [2018-11-18 22:43:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:52,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:52,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-11-18 22:43:52,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-11-18 22:43:52,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:52,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:43:52,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:52,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:43:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:43:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:52,829 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 21 states. [2018-11-18 22:43:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:54,547 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2018-11-18 22:43:54,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:43:54,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-11-18 22:43:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 205 transitions. [2018-11-18 22:43:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 205 transitions. [2018-11-18 22:43:54,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 205 transitions. [2018-11-18 22:43:55,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:55,525 INFO L225 Difference]: With dead ends: 171 [2018-11-18 22:43:55,525 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 22:43:55,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:43:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 22:43:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2018-11-18 22:43:55,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:55,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 120 states. [2018-11-18 22:43:55,591 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 120 states. [2018-11-18 22:43:55,591 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 120 states. [2018-11-18 22:43:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:55,594 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2018-11-18 22:43:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2018-11-18 22:43:55,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:55,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:55,595 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 129 states. [2018-11-18 22:43:55,595 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 129 states. [2018-11-18 22:43:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:55,597 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2018-11-18 22:43:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2018-11-18 22:43:55,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:55,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:55,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:55,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 22:43:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2018-11-18 22:43:55,601 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 81 [2018-11-18 22:43:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:55,601 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2018-11-18 22:43:55,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:43:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2018-11-18 22:43:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 22:43:55,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:55,603 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:55,603 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:55,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash -577554221, now seen corresponding path program 5 times [2018-11-18 22:43:55,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:55,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:55,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {11317#true} call ULTIMATE.init(); {11317#true} is VALID [2018-11-18 22:43:55,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {11317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11317#true} is VALID [2018-11-18 22:43:55,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {11317#true} assume true; {11317#true} is VALID [2018-11-18 22:43:55,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11317#true} {11317#true} #137#return; {11317#true} is VALID [2018-11-18 22:43:55,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {11317#true} call #t~ret15 := main(); {11317#true} is VALID [2018-11-18 22:43:55,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {11317#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11319#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:55,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {11319#(= 0 main_~i~0)} assume true; {11319#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:55,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {11319#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {11320#(= main_~k~0 0)} is VALID [2018-11-18 22:43:55,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {11320#(= main_~k~0 0)} assume true; {11320#(= main_~k~0 0)} is VALID [2018-11-18 22:43:55,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {11320#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11320#(= main_~k~0 0)} is VALID [2018-11-18 22:43:55,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {11320#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11320#(= main_~k~0 0)} is VALID [2018-11-18 22:43:55,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {11320#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:55,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {11321#(<= main_~k~0 1)} assume true; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:55,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {11321#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:55,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {11321#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:55,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {11321#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:55,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {11322#(<= main_~k~0 2)} assume true; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:55,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {11322#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:55,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {11322#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:55,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {11322#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:55,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {11323#(<= main_~k~0 3)} assume true; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:55,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {11323#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:55,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:55,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {11323#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:55,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {11324#(<= main_~k~0 4)} assume true; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:55,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {11324#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:55,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {11324#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:55,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {11324#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:55,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {11325#(<= main_~k~0 5)} assume true; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:55,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {11325#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:55,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {11325#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:55,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {11325#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:55,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {11326#(<= main_~k~0 6)} assume true; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:55,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {11326#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:55,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {11326#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:55,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {11326#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:55,967 INFO L273 TraceCheckUtils]: 36: Hoare triple {11327#(<= main_~k~0 7)} assume true; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:55,967 INFO L273 TraceCheckUtils]: 37: Hoare triple {11327#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:55,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {11327#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:55,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {11327#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:55,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {11328#(<= main_~k~0 8)} assume true; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:55,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {11328#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:55,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {11328#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:55,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {11328#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:55,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {11329#(<= main_~k~0 9)} assume true; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:55,972 INFO L273 TraceCheckUtils]: 45: Hoare triple {11329#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:55,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {11329#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:55,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {11329#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:55,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {11330#(<= main_~k~0 10)} assume true; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:55,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {11330#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:55,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {11330#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:55,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {11330#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:55,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {11331#(<= main_~k~0 11)} assume true; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:55,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {11331#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:55,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {11331#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:55,985 INFO L273 TraceCheckUtils]: 55: Hoare triple {11331#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:55,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {11332#(<= main_~k~0 12)} assume true; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:55,986 INFO L273 TraceCheckUtils]: 57: Hoare triple {11332#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:55,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {11332#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:55,986 INFO L273 TraceCheckUtils]: 59: Hoare triple {11332#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:55,987 INFO L273 TraceCheckUtils]: 60: Hoare triple {11333#(<= main_~k~0 13)} assume true; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:55,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {11333#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:55,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {11333#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:55,989 INFO L273 TraceCheckUtils]: 63: Hoare triple {11333#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:55,989 INFO L273 TraceCheckUtils]: 64: Hoare triple {11334#(<= main_~k~0 14)} assume true; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:55,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {11334#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:55,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {11334#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:55,991 INFO L273 TraceCheckUtils]: 67: Hoare triple {11334#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:55,992 INFO L273 TraceCheckUtils]: 68: Hoare triple {11335#(<= main_~k~0 15)} assume true; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:55,992 INFO L273 TraceCheckUtils]: 69: Hoare triple {11335#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:55,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {11335#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:55,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {11335#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {11336#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:55,994 INFO L273 TraceCheckUtils]: 72: Hoare triple {11336#(<= main_~k~0 16)} assume true; {11336#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:55,995 INFO L273 TraceCheckUtils]: 73: Hoare triple {11336#(<= main_~k~0 16)} assume !(~k~0 < 100000); {11318#false} is VALID [2018-11-18 22:43:55,995 INFO L273 TraceCheckUtils]: 74: Hoare triple {11318#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#false} is VALID [2018-11-18 22:43:55,995 INFO L273 TraceCheckUtils]: 75: Hoare triple {11318#false} ~x~0 := 0; {11318#false} is VALID [2018-11-18 22:43:55,995 INFO L273 TraceCheckUtils]: 76: Hoare triple {11318#false} assume true; {11318#false} is VALID [2018-11-18 22:43:55,995 INFO L273 TraceCheckUtils]: 77: Hoare triple {11318#false} assume !(~x~0 < ~i~0); {11318#false} is VALID [2018-11-18 22:43:55,996 INFO L273 TraceCheckUtils]: 78: Hoare triple {11318#false} ~x~0 := 1 + ~i~0; {11318#false} is VALID [2018-11-18 22:43:55,996 INFO L273 TraceCheckUtils]: 79: Hoare triple {11318#false} assume true; {11318#false} is VALID [2018-11-18 22:43:55,996 INFO L273 TraceCheckUtils]: 80: Hoare triple {11318#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#false} is VALID [2018-11-18 22:43:55,996 INFO L256 TraceCheckUtils]: 81: Hoare triple {11318#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11318#false} is VALID [2018-11-18 22:43:55,996 INFO L273 TraceCheckUtils]: 82: Hoare triple {11318#false} ~cond := #in~cond; {11318#false} is VALID [2018-11-18 22:43:55,997 INFO L273 TraceCheckUtils]: 83: Hoare triple {11318#false} assume 0 == ~cond; {11318#false} is VALID [2018-11-18 22:43:55,997 INFO L273 TraceCheckUtils]: 84: Hoare triple {11318#false} assume !false; {11318#false} is VALID [2018-11-18 22:43:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:56,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:56,002 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-18 22:43:56,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:56,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-18 22:43:56,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:56,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:56,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {11317#true} call ULTIMATE.init(); {11317#true} is VALID [2018-11-18 22:43:56,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {11317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11317#true} is VALID [2018-11-18 22:43:56,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {11317#true} assume true; {11317#true} is VALID [2018-11-18 22:43:56,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11317#true} {11317#true} #137#return; {11317#true} is VALID [2018-11-18 22:43:56,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {11317#true} call #t~ret15 := main(); {11317#true} is VALID [2018-11-18 22:43:56,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {11317#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11355#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:56,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {11355#(<= main_~i~0 0)} assume true; {11355#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:56,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {11355#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {11362#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:56,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {11362#(<= main_~k~0 0)} assume true; {11362#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {11362#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11362#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:56,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {11362#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11362#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {11362#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:56,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {11321#(<= main_~k~0 1)} assume true; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {11321#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:56,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {11321#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11321#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:56,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {11321#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {11322#(<= main_~k~0 2)} assume true; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:56,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {11322#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {11322#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11322#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:56,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {11322#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:56,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {11323#(<= main_~k~0 3)} assume true; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {11323#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:56,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11323#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:56,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {11323#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {11324#(<= main_~k~0 4)} assume true; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:56,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {11324#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:56,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {11324#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11324#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {11324#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:56,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {11325#(<= main_~k~0 5)} assume true; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {11325#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:56,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {11325#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11325#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:56,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {11325#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {11326#(<= main_~k~0 6)} assume true; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:56,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {11326#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:56,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {11326#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11326#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:56,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {11326#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:56,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {11327#(<= main_~k~0 7)} assume true; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:56,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {11327#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:56,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {11327#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11327#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:56,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {11327#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:56,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {11328#(<= main_~k~0 8)} assume true; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:56,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {11328#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:56,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {11328#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11328#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:56,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {11328#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:56,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {11329#(<= main_~k~0 9)} assume true; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:56,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {11329#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:56,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {11329#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11329#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:56,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {11329#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:56,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {11330#(<= main_~k~0 10)} assume true; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:56,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {11330#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:56,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {11330#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11330#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:56,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {11330#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:56,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {11331#(<= main_~k~0 11)} assume true; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:56,320 INFO L273 TraceCheckUtils]: 53: Hoare triple {11331#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:56,320 INFO L273 TraceCheckUtils]: 54: Hoare triple {11331#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11331#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:56,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {11331#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:56,322 INFO L273 TraceCheckUtils]: 56: Hoare triple {11332#(<= main_~k~0 12)} assume true; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:56,322 INFO L273 TraceCheckUtils]: 57: Hoare triple {11332#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:56,323 INFO L273 TraceCheckUtils]: 58: Hoare triple {11332#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11332#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:56,324 INFO L273 TraceCheckUtils]: 59: Hoare triple {11332#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:56,324 INFO L273 TraceCheckUtils]: 60: Hoare triple {11333#(<= main_~k~0 13)} assume true; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:56,325 INFO L273 TraceCheckUtils]: 61: Hoare triple {11333#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:56,325 INFO L273 TraceCheckUtils]: 62: Hoare triple {11333#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11333#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:56,326 INFO L273 TraceCheckUtils]: 63: Hoare triple {11333#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:56,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {11334#(<= main_~k~0 14)} assume true; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:56,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {11334#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:56,328 INFO L273 TraceCheckUtils]: 66: Hoare triple {11334#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11334#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:56,329 INFO L273 TraceCheckUtils]: 67: Hoare triple {11334#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:56,330 INFO L273 TraceCheckUtils]: 68: Hoare triple {11335#(<= main_~k~0 15)} assume true; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:56,330 INFO L273 TraceCheckUtils]: 69: Hoare triple {11335#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:56,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {11335#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11335#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:56,332 INFO L273 TraceCheckUtils]: 71: Hoare triple {11335#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {11336#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:56,332 INFO L273 TraceCheckUtils]: 72: Hoare triple {11336#(<= main_~k~0 16)} assume true; {11336#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:56,333 INFO L273 TraceCheckUtils]: 73: Hoare triple {11336#(<= main_~k~0 16)} assume !(~k~0 < 100000); {11318#false} is VALID [2018-11-18 22:43:56,333 INFO L273 TraceCheckUtils]: 74: Hoare triple {11318#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#false} is VALID [2018-11-18 22:43:56,333 INFO L273 TraceCheckUtils]: 75: Hoare triple {11318#false} ~x~0 := 0; {11318#false} is VALID [2018-11-18 22:43:56,334 INFO L273 TraceCheckUtils]: 76: Hoare triple {11318#false} assume true; {11318#false} is VALID [2018-11-18 22:43:56,334 INFO L273 TraceCheckUtils]: 77: Hoare triple {11318#false} assume !(~x~0 < ~i~0); {11318#false} is VALID [2018-11-18 22:43:56,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {11318#false} ~x~0 := 1 + ~i~0; {11318#false} is VALID [2018-11-18 22:43:56,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {11318#false} assume true; {11318#false} is VALID [2018-11-18 22:43:56,335 INFO L273 TraceCheckUtils]: 80: Hoare triple {11318#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11318#false} is VALID [2018-11-18 22:43:56,335 INFO L256 TraceCheckUtils]: 81: Hoare triple {11318#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11318#false} is VALID [2018-11-18 22:43:56,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {11318#false} ~cond := #in~cond; {11318#false} is VALID [2018-11-18 22:43:56,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {11318#false} assume 0 == ~cond; {11318#false} is VALID [2018-11-18 22:43:56,336 INFO L273 TraceCheckUtils]: 84: Hoare triple {11318#false} assume !false; {11318#false} is VALID [2018-11-18 22:43:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:56,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-11-18 22:43:56,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-11-18 22:43:56,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:56,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:43:56,461 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-18 22:43:56,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:43:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:43:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:43:56,462 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand 22 states. [2018-11-18 22:43:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:57,742 INFO L93 Difference]: Finished difference Result 175 states and 219 transitions. [2018-11-18 22:43:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:43:57,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-11-18 22:43:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:43:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 210 transitions. [2018-11-18 22:43:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:43:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 210 transitions. [2018-11-18 22:43:57,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 210 transitions. [2018-11-18 22:43:57,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:57,943 INFO L225 Difference]: With dead ends: 175 [2018-11-18 22:43:57,943 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 22:43:57,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:43:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 22:43:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2018-11-18 22:43:57,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:57,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 124 states. [2018-11-18 22:43:58,000 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 124 states. [2018-11-18 22:43:58,000 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 124 states. [2018-11-18 22:43:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:58,003 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2018-11-18 22:43:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2018-11-18 22:43:58,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:58,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:58,003 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 133 states. [2018-11-18 22:43:58,003 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 133 states. [2018-11-18 22:43:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:58,005 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2018-11-18 22:43:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2018-11-18 22:43:58,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:58,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:58,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:58,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 22:43:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2018-11-18 22:43:58,008 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 85 [2018-11-18 22:43:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:58,008 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2018-11-18 22:43:58,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:43:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2018-11-18 22:43:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 22:43:58,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:58,009 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:58,009 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:58,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:58,010 INFO L82 PathProgramCache]: Analyzing trace with hash -239058775, now seen corresponding path program 6 times [2018-11-18 22:43:58,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:58,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:58,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:58,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {12278#true} call ULTIMATE.init(); {12278#true} is VALID [2018-11-18 22:43:58,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {12278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12278#true} is VALID [2018-11-18 22:43:58,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {12278#true} assume true; {12278#true} is VALID [2018-11-18 22:43:58,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12278#true} {12278#true} #137#return; {12278#true} is VALID [2018-11-18 22:43:58,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {12278#true} call #t~ret15 := main(); {12278#true} is VALID [2018-11-18 22:43:58,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {12278#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12280#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:58,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {12280#(= 0 main_~i~0)} assume true; {12280#(= 0 main_~i~0)} is VALID [2018-11-18 22:43:58,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {12280#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {12281#(= main_~k~0 0)} is VALID [2018-11-18 22:43:58,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {12281#(= main_~k~0 0)} assume true; {12281#(= main_~k~0 0)} is VALID [2018-11-18 22:43:58,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {12281#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12281#(= main_~k~0 0)} is VALID [2018-11-18 22:43:58,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {12281#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12281#(= main_~k~0 0)} is VALID [2018-11-18 22:43:58,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {12281#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:58,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {12282#(<= main_~k~0 1)} assume true; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:58,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {12282#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:58,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {12282#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:58,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {12282#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:58,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {12283#(<= main_~k~0 2)} assume true; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:58,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {12283#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:58,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {12283#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:58,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {12283#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:58,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {12284#(<= main_~k~0 3)} assume true; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:58,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {12284#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:58,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {12284#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:58,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {12284#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:58,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {12285#(<= main_~k~0 4)} assume true; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:58,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {12285#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:58,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {12285#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:58,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {12285#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:58,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {12286#(<= main_~k~0 5)} assume true; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:58,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {12286#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:58,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {12286#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:58,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {12286#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:58,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {12287#(<= main_~k~0 6)} assume true; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:58,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {12287#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:58,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {12287#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:58,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {12287#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:58,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {12288#(<= main_~k~0 7)} assume true; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:58,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {12288#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:58,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {12288#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:58,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {12288#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:58,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {12289#(<= main_~k~0 8)} assume true; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:58,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {12289#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:58,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {12289#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:58,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {12289#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:58,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {12290#(<= main_~k~0 9)} assume true; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:58,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {12290#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:58,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {12290#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:58,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {12290#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:58,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {12291#(<= main_~k~0 10)} assume true; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:58,982 INFO L273 TraceCheckUtils]: 49: Hoare triple {12291#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:58,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {12291#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:58,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {12291#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:58,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {12292#(<= main_~k~0 11)} assume true; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:58,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {12292#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:58,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {12292#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:58,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {12292#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:58,987 INFO L273 TraceCheckUtils]: 56: Hoare triple {12293#(<= main_~k~0 12)} assume true; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:58,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {12293#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:58,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {12293#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:58,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {12293#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:58,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {12294#(<= main_~k~0 13)} assume true; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:58,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {12294#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:58,990 INFO L273 TraceCheckUtils]: 62: Hoare triple {12294#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:58,991 INFO L273 TraceCheckUtils]: 63: Hoare triple {12294#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:58,991 INFO L273 TraceCheckUtils]: 64: Hoare triple {12295#(<= main_~k~0 14)} assume true; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:58,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {12295#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:58,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {12295#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:58,993 INFO L273 TraceCheckUtils]: 67: Hoare triple {12295#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:58,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {12296#(<= main_~k~0 15)} assume true; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:58,994 INFO L273 TraceCheckUtils]: 69: Hoare triple {12296#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:58,994 INFO L273 TraceCheckUtils]: 70: Hoare triple {12296#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:58,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {12296#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:58,996 INFO L273 TraceCheckUtils]: 72: Hoare triple {12297#(<= main_~k~0 16)} assume true; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:58,996 INFO L273 TraceCheckUtils]: 73: Hoare triple {12297#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:58,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {12297#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:58,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {12297#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {12298#(<= main_~k~0 17)} is VALID [2018-11-18 22:43:58,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {12298#(<= main_~k~0 17)} assume true; {12298#(<= main_~k~0 17)} is VALID [2018-11-18 22:43:58,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {12298#(<= main_~k~0 17)} assume !(~k~0 < 100000); {12279#false} is VALID [2018-11-18 22:43:58,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {12279#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12279#false} is VALID [2018-11-18 22:43:58,999 INFO L273 TraceCheckUtils]: 79: Hoare triple {12279#false} ~x~0 := 0; {12279#false} is VALID [2018-11-18 22:43:58,999 INFO L273 TraceCheckUtils]: 80: Hoare triple {12279#false} assume true; {12279#false} is VALID [2018-11-18 22:43:58,999 INFO L273 TraceCheckUtils]: 81: Hoare triple {12279#false} assume !(~x~0 < ~i~0); {12279#false} is VALID [2018-11-18 22:43:58,999 INFO L273 TraceCheckUtils]: 82: Hoare triple {12279#false} ~x~0 := 1 + ~i~0; {12279#false} is VALID [2018-11-18 22:43:59,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {12279#false} assume true; {12279#false} is VALID [2018-11-18 22:43:59,000 INFO L273 TraceCheckUtils]: 84: Hoare triple {12279#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12279#false} is VALID [2018-11-18 22:43:59,000 INFO L256 TraceCheckUtils]: 85: Hoare triple {12279#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12279#false} is VALID [2018-11-18 22:43:59,000 INFO L273 TraceCheckUtils]: 86: Hoare triple {12279#false} ~cond := #in~cond; {12279#false} is VALID [2018-11-18 22:43:59,000 INFO L273 TraceCheckUtils]: 87: Hoare triple {12279#false} assume 0 == ~cond; {12279#false} is VALID [2018-11-18 22:43:59,001 INFO L273 TraceCheckUtils]: 88: Hoare triple {12279#false} assume !false; {12279#false} is VALID [2018-11-18 22:43:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:59,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:59,007 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-18 22:43:59,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:59,105 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-18 22:43:59,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:59,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:59,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {12278#true} call ULTIMATE.init(); {12278#true} is VALID [2018-11-18 22:43:59,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {12278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12278#true} is VALID [2018-11-18 22:43:59,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {12278#true} assume true; {12278#true} is VALID [2018-11-18 22:43:59,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12278#true} {12278#true} #137#return; {12278#true} is VALID [2018-11-18 22:43:59,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {12278#true} call #t~ret15 := main(); {12278#true} is VALID [2018-11-18 22:43:59,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {12278#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12317#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:59,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {12317#(<= main_~i~0 0)} assume true; {12317#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:59,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {12317#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {12324#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:59,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {12324#(<= main_~k~0 0)} assume true; {12324#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:59,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {12324#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12324#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:59,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {12324#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12324#(<= main_~k~0 0)} is VALID [2018-11-18 22:43:59,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {12324#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:59,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {12282#(<= main_~k~0 1)} assume true; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:59,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {12282#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:59,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {12282#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12282#(<= main_~k~0 1)} is VALID [2018-11-18 22:43:59,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {12282#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:59,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {12283#(<= main_~k~0 2)} assume true; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:59,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {12283#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:59,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {12283#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12283#(<= main_~k~0 2)} is VALID [2018-11-18 22:43:59,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {12283#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:59,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {12284#(<= main_~k~0 3)} assume true; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:59,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {12284#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:59,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {12284#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12284#(<= main_~k~0 3)} is VALID [2018-11-18 22:43:59,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {12284#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:59,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {12285#(<= main_~k~0 4)} assume true; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:59,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {12285#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:59,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {12285#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12285#(<= main_~k~0 4)} is VALID [2018-11-18 22:43:59,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {12285#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:59,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {12286#(<= main_~k~0 5)} assume true; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:59,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {12286#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:59,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {12286#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12286#(<= main_~k~0 5)} is VALID [2018-11-18 22:43:59,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {12286#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:59,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {12287#(<= main_~k~0 6)} assume true; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:59,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {12287#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:59,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {12287#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12287#(<= main_~k~0 6)} is VALID [2018-11-18 22:43:59,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {12287#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:59,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {12288#(<= main_~k~0 7)} assume true; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:59,348 INFO L273 TraceCheckUtils]: 37: Hoare triple {12288#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:59,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {12288#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12288#(<= main_~k~0 7)} is VALID [2018-11-18 22:43:59,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {12288#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:59,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {12289#(<= main_~k~0 8)} assume true; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:59,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {12289#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:59,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {12289#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12289#(<= main_~k~0 8)} is VALID [2018-11-18 22:43:59,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {12289#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:59,352 INFO L273 TraceCheckUtils]: 44: Hoare triple {12290#(<= main_~k~0 9)} assume true; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:59,352 INFO L273 TraceCheckUtils]: 45: Hoare triple {12290#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:59,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {12290#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12290#(<= main_~k~0 9)} is VALID [2018-11-18 22:43:59,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {12290#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:59,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {12291#(<= main_~k~0 10)} assume true; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:59,355 INFO L273 TraceCheckUtils]: 49: Hoare triple {12291#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:59,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {12291#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12291#(<= main_~k~0 10)} is VALID [2018-11-18 22:43:59,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {12291#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:59,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {12292#(<= main_~k~0 11)} assume true; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:59,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {12292#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:59,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {12292#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12292#(<= main_~k~0 11)} is VALID [2018-11-18 22:43:59,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {12292#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:59,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {12293#(<= main_~k~0 12)} assume true; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:59,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {12293#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:59,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {12293#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12293#(<= main_~k~0 12)} is VALID [2018-11-18 22:43:59,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {12293#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:59,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {12294#(<= main_~k~0 13)} assume true; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:59,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {12294#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:59,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {12294#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12294#(<= main_~k~0 13)} is VALID [2018-11-18 22:43:59,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {12294#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:59,363 INFO L273 TraceCheckUtils]: 64: Hoare triple {12295#(<= main_~k~0 14)} assume true; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:59,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {12295#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:59,364 INFO L273 TraceCheckUtils]: 66: Hoare triple {12295#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12295#(<= main_~k~0 14)} is VALID [2018-11-18 22:43:59,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {12295#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:59,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {12296#(<= main_~k~0 15)} assume true; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:59,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {12296#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:59,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {12296#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12296#(<= main_~k~0 15)} is VALID [2018-11-18 22:43:59,367 INFO L273 TraceCheckUtils]: 71: Hoare triple {12296#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:59,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {12297#(<= main_~k~0 16)} assume true; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:59,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {12297#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:59,369 INFO L273 TraceCheckUtils]: 74: Hoare triple {12297#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12297#(<= main_~k~0 16)} is VALID [2018-11-18 22:43:59,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {12297#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {12298#(<= main_~k~0 17)} is VALID [2018-11-18 22:43:59,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {12298#(<= main_~k~0 17)} assume true; {12298#(<= main_~k~0 17)} is VALID [2018-11-18 22:43:59,371 INFO L273 TraceCheckUtils]: 77: Hoare triple {12298#(<= main_~k~0 17)} assume !(~k~0 < 100000); {12279#false} is VALID [2018-11-18 22:43:59,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {12279#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12279#false} is VALID [2018-11-18 22:43:59,371 INFO L273 TraceCheckUtils]: 79: Hoare triple {12279#false} ~x~0 := 0; {12279#false} is VALID [2018-11-18 22:43:59,371 INFO L273 TraceCheckUtils]: 80: Hoare triple {12279#false} assume true; {12279#false} is VALID [2018-11-18 22:43:59,372 INFO L273 TraceCheckUtils]: 81: Hoare triple {12279#false} assume !(~x~0 < ~i~0); {12279#false} is VALID [2018-11-18 22:43:59,372 INFO L273 TraceCheckUtils]: 82: Hoare triple {12279#false} ~x~0 := 1 + ~i~0; {12279#false} is VALID [2018-11-18 22:43:59,372 INFO L273 TraceCheckUtils]: 83: Hoare triple {12279#false} assume true; {12279#false} is VALID [2018-11-18 22:43:59,372 INFO L273 TraceCheckUtils]: 84: Hoare triple {12279#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12279#false} is VALID [2018-11-18 22:43:59,372 INFO L256 TraceCheckUtils]: 85: Hoare triple {12279#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12279#false} is VALID [2018-11-18 22:43:59,373 INFO L273 TraceCheckUtils]: 86: Hoare triple {12279#false} ~cond := #in~cond; {12279#false} is VALID [2018-11-18 22:43:59,373 INFO L273 TraceCheckUtils]: 87: Hoare triple {12279#false} assume 0 == ~cond; {12279#false} is VALID [2018-11-18 22:43:59,373 INFO L273 TraceCheckUtils]: 88: Hoare triple {12279#false} assume !false; {12279#false} is VALID [2018-11-18 22:43:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:43:59,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:59,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-11-18 22:43:59,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2018-11-18 22:43:59,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:59,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:43:59,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:59,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:43:59,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:43:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:43:59,484 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand 23 states. [2018-11-18 22:44:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:00,771 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2018-11-18 22:44:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:44:00,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2018-11-18 22:44:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 215 transitions. [2018-11-18 22:44:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 215 transitions. [2018-11-18 22:44:00,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 215 transitions. [2018-11-18 22:44:00,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:00,959 INFO L225 Difference]: With dead ends: 179 [2018-11-18 22:44:00,959 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 22:44:00,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:44:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 22:44:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-11-18 22:44:01,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:01,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 128 states. [2018-11-18 22:44:01,030 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 128 states. [2018-11-18 22:44:01,031 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 128 states. [2018-11-18 22:44:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:01,033 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2018-11-18 22:44:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2018-11-18 22:44:01,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:01,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:01,034 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 137 states. [2018-11-18 22:44:01,034 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 137 states. [2018-11-18 22:44:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:01,037 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2018-11-18 22:44:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2018-11-18 22:44:01,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:01,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:01,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:01,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 22:44:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2018-11-18 22:44:01,040 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 89 [2018-11-18 22:44:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:01,041 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2018-11-18 22:44:01,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:44:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2018-11-18 22:44:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 22:44:01,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:01,042 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:01,042 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:01,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1780912769, now seen corresponding path program 7 times [2018-11-18 22:44:01,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:01,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:01,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:01,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:01,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:02,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {13272#true} call ULTIMATE.init(); {13272#true} is VALID [2018-11-18 22:44:02,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {13272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13272#true} is VALID [2018-11-18 22:44:02,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {13272#true} assume true; {13272#true} is VALID [2018-11-18 22:44:02,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13272#true} {13272#true} #137#return; {13272#true} is VALID [2018-11-18 22:44:02,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {13272#true} call #t~ret15 := main(); {13272#true} is VALID [2018-11-18 22:44:02,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {13272#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13274#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:02,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {13274#(= 0 main_~i~0)} assume true; {13274#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:02,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {13274#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {13275#(= main_~k~0 0)} is VALID [2018-11-18 22:44:02,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {13275#(= main_~k~0 0)} assume true; {13275#(= main_~k~0 0)} is VALID [2018-11-18 22:44:02,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {13275#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13275#(= main_~k~0 0)} is VALID [2018-11-18 22:44:02,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {13275#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13275#(= main_~k~0 0)} is VALID [2018-11-18 22:44:02,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {13275#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {13276#(<= main_~k~0 1)} assume true; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {13276#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {13276#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {13276#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {13277#(<= main_~k~0 2)} assume true; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {13277#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {13277#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {13277#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {13278#(<= main_~k~0 3)} assume true; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {13278#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {13278#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {13278#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {13279#(<= main_~k~0 4)} assume true; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {13279#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {13279#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {13279#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {13280#(<= main_~k~0 5)} assume true; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {13280#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {13280#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {13280#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {13281#(<= main_~k~0 6)} assume true; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {13281#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {13281#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {13281#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {13282#(<= main_~k~0 7)} assume true; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {13282#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {13282#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {13282#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {13283#(<= main_~k~0 8)} assume true; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {13283#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {13283#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {13283#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {13284#(<= main_~k~0 9)} assume true; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {13284#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {13284#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {13284#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {13285#(<= main_~k~0 10)} assume true; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,148 INFO L273 TraceCheckUtils]: 49: Hoare triple {13285#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {13285#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {13285#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {13286#(<= main_~k~0 11)} assume true; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {13286#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {13286#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,151 INFO L273 TraceCheckUtils]: 55: Hoare triple {13286#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {13287#(<= main_~k~0 12)} assume true; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {13287#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {13287#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,153 INFO L273 TraceCheckUtils]: 59: Hoare triple {13287#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {13288#(<= main_~k~0 13)} assume true; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {13288#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,155 INFO L273 TraceCheckUtils]: 62: Hoare triple {13288#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {13288#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,156 INFO L273 TraceCheckUtils]: 64: Hoare triple {13289#(<= main_~k~0 14)} assume true; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {13289#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,157 INFO L273 TraceCheckUtils]: 66: Hoare triple {13289#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {13289#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {13290#(<= main_~k~0 15)} assume true; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,159 INFO L273 TraceCheckUtils]: 69: Hoare triple {13290#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,159 INFO L273 TraceCheckUtils]: 70: Hoare triple {13290#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,160 INFO L273 TraceCheckUtils]: 71: Hoare triple {13290#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,161 INFO L273 TraceCheckUtils]: 72: Hoare triple {13291#(<= main_~k~0 16)} assume true; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,161 INFO L273 TraceCheckUtils]: 73: Hoare triple {13291#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,162 INFO L273 TraceCheckUtils]: 74: Hoare triple {13291#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,162 INFO L273 TraceCheckUtils]: 75: Hoare triple {13291#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,163 INFO L273 TraceCheckUtils]: 76: Hoare triple {13292#(<= main_~k~0 17)} assume true; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,164 INFO L273 TraceCheckUtils]: 77: Hoare triple {13292#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,164 INFO L273 TraceCheckUtils]: 78: Hoare triple {13292#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,165 INFO L273 TraceCheckUtils]: 79: Hoare triple {13292#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {13293#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:02,165 INFO L273 TraceCheckUtils]: 80: Hoare triple {13293#(<= main_~k~0 18)} assume true; {13293#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:02,166 INFO L273 TraceCheckUtils]: 81: Hoare triple {13293#(<= main_~k~0 18)} assume !(~k~0 < 100000); {13273#false} is VALID [2018-11-18 22:44:02,166 INFO L273 TraceCheckUtils]: 82: Hoare triple {13273#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13273#false} is VALID [2018-11-18 22:44:02,166 INFO L273 TraceCheckUtils]: 83: Hoare triple {13273#false} ~x~0 := 0; {13273#false} is VALID [2018-11-18 22:44:02,167 INFO L273 TraceCheckUtils]: 84: Hoare triple {13273#false} assume true; {13273#false} is VALID [2018-11-18 22:44:02,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {13273#false} assume !(~x~0 < ~i~0); {13273#false} is VALID [2018-11-18 22:44:02,167 INFO L273 TraceCheckUtils]: 86: Hoare triple {13273#false} ~x~0 := 1 + ~i~0; {13273#false} is VALID [2018-11-18 22:44:02,167 INFO L273 TraceCheckUtils]: 87: Hoare triple {13273#false} assume true; {13273#false} is VALID [2018-11-18 22:44:02,167 INFO L273 TraceCheckUtils]: 88: Hoare triple {13273#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13273#false} is VALID [2018-11-18 22:44:02,168 INFO L256 TraceCheckUtils]: 89: Hoare triple {13273#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13273#false} is VALID [2018-11-18 22:44:02,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {13273#false} ~cond := #in~cond; {13273#false} is VALID [2018-11-18 22:44:02,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {13273#false} assume 0 == ~cond; {13273#false} is VALID [2018-11-18 22:44:02,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {13273#false} assume !false; {13273#false} is VALID [2018-11-18 22:44:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:02,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:02,174 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-18 22:44:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:02,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:02,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {13272#true} call ULTIMATE.init(); {13272#true} is VALID [2018-11-18 22:44:02,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {13272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13272#true} is VALID [2018-11-18 22:44:02,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {13272#true} assume true; {13272#true} is VALID [2018-11-18 22:44:02,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13272#true} {13272#true} #137#return; {13272#true} is VALID [2018-11-18 22:44:02,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {13272#true} call #t~ret15 := main(); {13272#true} is VALID [2018-11-18 22:44:02,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {13272#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13312#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:02,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {13312#(<= main_~i~0 0)} assume true; {13312#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:02,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {13312#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {13319#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:02,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {13319#(<= main_~k~0 0)} assume true; {13319#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:02,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {13319#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13319#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:02,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {13319#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13319#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:02,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {13319#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {13276#(<= main_~k~0 1)} assume true; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {13276#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {13276#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13276#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:02,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {13276#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {13277#(<= main_~k~0 2)} assume true; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {13277#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {13277#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13277#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:02,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {13277#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {13278#(<= main_~k~0 3)} assume true; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {13278#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {13278#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13278#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:02,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {13278#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {13279#(<= main_~k~0 4)} assume true; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {13279#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {13279#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13279#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:02,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {13279#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {13280#(<= main_~k~0 5)} assume true; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {13280#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {13280#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13280#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:02,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {13280#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {13281#(<= main_~k~0 6)} assume true; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {13281#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {13281#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13281#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:02,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {13281#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {13282#(<= main_~k~0 7)} assume true; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {13282#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {13282#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13282#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:02,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {13282#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {13283#(<= main_~k~0 8)} assume true; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {13283#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,781 INFO L273 TraceCheckUtils]: 42: Hoare triple {13283#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13283#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:02,781 INFO L273 TraceCheckUtils]: 43: Hoare triple {13283#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {13284#(<= main_~k~0 9)} assume true; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {13284#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {13284#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13284#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:02,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {13284#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {13285#(<= main_~k~0 10)} assume true; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,785 INFO L273 TraceCheckUtils]: 49: Hoare triple {13285#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {13285#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13285#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:02,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {13285#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {13286#(<= main_~k~0 11)} assume true; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {13286#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {13286#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13286#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:02,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {13286#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {13287#(<= main_~k~0 12)} assume true; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {13287#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,790 INFO L273 TraceCheckUtils]: 58: Hoare triple {13287#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13287#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:02,791 INFO L273 TraceCheckUtils]: 59: Hoare triple {13287#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,791 INFO L273 TraceCheckUtils]: 60: Hoare triple {13288#(<= main_~k~0 13)} assume true; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,792 INFO L273 TraceCheckUtils]: 61: Hoare triple {13288#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,792 INFO L273 TraceCheckUtils]: 62: Hoare triple {13288#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13288#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:02,793 INFO L273 TraceCheckUtils]: 63: Hoare triple {13288#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,793 INFO L273 TraceCheckUtils]: 64: Hoare triple {13289#(<= main_~k~0 14)} assume true; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {13289#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,794 INFO L273 TraceCheckUtils]: 66: Hoare triple {13289#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13289#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:02,795 INFO L273 TraceCheckUtils]: 67: Hoare triple {13289#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,796 INFO L273 TraceCheckUtils]: 68: Hoare triple {13290#(<= main_~k~0 15)} assume true; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,796 INFO L273 TraceCheckUtils]: 69: Hoare triple {13290#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,797 INFO L273 TraceCheckUtils]: 70: Hoare triple {13290#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13290#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:02,798 INFO L273 TraceCheckUtils]: 71: Hoare triple {13290#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,798 INFO L273 TraceCheckUtils]: 72: Hoare triple {13291#(<= main_~k~0 16)} assume true; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,799 INFO L273 TraceCheckUtils]: 73: Hoare triple {13291#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,799 INFO L273 TraceCheckUtils]: 74: Hoare triple {13291#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13291#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:02,800 INFO L273 TraceCheckUtils]: 75: Hoare triple {13291#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,800 INFO L273 TraceCheckUtils]: 76: Hoare triple {13292#(<= main_~k~0 17)} assume true; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,801 INFO L273 TraceCheckUtils]: 77: Hoare triple {13292#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,801 INFO L273 TraceCheckUtils]: 78: Hoare triple {13292#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13292#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:02,802 INFO L273 TraceCheckUtils]: 79: Hoare triple {13292#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {13293#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:02,803 INFO L273 TraceCheckUtils]: 80: Hoare triple {13293#(<= main_~k~0 18)} assume true; {13293#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:02,803 INFO L273 TraceCheckUtils]: 81: Hoare triple {13293#(<= main_~k~0 18)} assume !(~k~0 < 100000); {13273#false} is VALID [2018-11-18 22:44:02,803 INFO L273 TraceCheckUtils]: 82: Hoare triple {13273#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13273#false} is VALID [2018-11-18 22:44:02,804 INFO L273 TraceCheckUtils]: 83: Hoare triple {13273#false} ~x~0 := 0; {13273#false} is VALID [2018-11-18 22:44:02,804 INFO L273 TraceCheckUtils]: 84: Hoare triple {13273#false} assume true; {13273#false} is VALID [2018-11-18 22:44:02,804 INFO L273 TraceCheckUtils]: 85: Hoare triple {13273#false} assume !(~x~0 < ~i~0); {13273#false} is VALID [2018-11-18 22:44:02,804 INFO L273 TraceCheckUtils]: 86: Hoare triple {13273#false} ~x~0 := 1 + ~i~0; {13273#false} is VALID [2018-11-18 22:44:02,804 INFO L273 TraceCheckUtils]: 87: Hoare triple {13273#false} assume true; {13273#false} is VALID [2018-11-18 22:44:02,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {13273#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13273#false} is VALID [2018-11-18 22:44:02,805 INFO L256 TraceCheckUtils]: 89: Hoare triple {13273#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13273#false} is VALID [2018-11-18 22:44:02,805 INFO L273 TraceCheckUtils]: 90: Hoare triple {13273#false} ~cond := #in~cond; {13273#false} is VALID [2018-11-18 22:44:02,805 INFO L273 TraceCheckUtils]: 91: Hoare triple {13273#false} assume 0 == ~cond; {13273#false} is VALID [2018-11-18 22:44:02,805 INFO L273 TraceCheckUtils]: 92: Hoare triple {13273#false} assume !false; {13273#false} is VALID [2018-11-18 22:44:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-11-18 22:44:02,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-11-18 22:44:02,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:02,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:44:02,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:02,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:44:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:44:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:44:02,923 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand 24 states. [2018-11-18 22:44:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:04,360 INFO L93 Difference]: Finished difference Result 183 states and 229 transitions. [2018-11-18 22:44:04,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:44:04,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2018-11-18 22:44:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:44:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 220 transitions. [2018-11-18 22:44:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:44:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 220 transitions. [2018-11-18 22:44:04,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 220 transitions. [2018-11-18 22:44:04,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:04,591 INFO L225 Difference]: With dead ends: 183 [2018-11-18 22:44:04,591 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 22:44:04,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:44:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 22:44:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-18 22:44:04,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:04,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 132 states. [2018-11-18 22:44:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 132 states. [2018-11-18 22:44:04,649 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 132 states. [2018-11-18 22:44:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:04,653 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2018-11-18 22:44:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2018-11-18 22:44:04,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:04,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:04,653 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 141 states. [2018-11-18 22:44:04,655 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 141 states. [2018-11-18 22:44:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:04,658 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2018-11-18 22:44:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2018-11-18 22:44:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:04,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:04,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 22:44:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2018-11-18 22:44:04,662 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 93 [2018-11-18 22:44:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:04,662 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2018-11-18 22:44:04,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:44:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2018-11-18 22:44:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 22:44:04,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:04,664 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:04,664 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:04,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash -45858987, now seen corresponding path program 8 times [2018-11-18 22:44:04,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:04,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:05,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {14299#true} call ULTIMATE.init(); {14299#true} is VALID [2018-11-18 22:44:05,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {14299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14299#true} is VALID [2018-11-18 22:44:05,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {14299#true} assume true; {14299#true} is VALID [2018-11-18 22:44:05,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14299#true} {14299#true} #137#return; {14299#true} is VALID [2018-11-18 22:44:05,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {14299#true} call #t~ret15 := main(); {14299#true} is VALID [2018-11-18 22:44:05,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {14299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14301#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:05,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {14301#(= 0 main_~i~0)} assume true; {14301#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:05,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {14301#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {14302#(= main_~k~0 0)} is VALID [2018-11-18 22:44:05,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {14302#(= main_~k~0 0)} assume true; {14302#(= main_~k~0 0)} is VALID [2018-11-18 22:44:05,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {14302#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14302#(= main_~k~0 0)} is VALID [2018-11-18 22:44:05,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {14302#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14302#(= main_~k~0 0)} is VALID [2018-11-18 22:44:05,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {14302#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:05,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {14303#(<= main_~k~0 1)} assume true; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:05,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {14303#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:05,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {14303#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:05,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {14303#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:05,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {14304#(<= main_~k~0 2)} assume true; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:05,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {14304#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:05,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {14304#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:05,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {14304#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:05,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {14305#(<= main_~k~0 3)} assume true; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:05,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {14305#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:05,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {14305#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:05,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {14305#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:05,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {14306#(<= main_~k~0 4)} assume true; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:05,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {14306#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:05,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {14306#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:05,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {14306#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:05,712 INFO L273 TraceCheckUtils]: 28: Hoare triple {14307#(<= main_~k~0 5)} assume true; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:05,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {14307#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:05,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {14307#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:05,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {14307#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:05,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {14308#(<= main_~k~0 6)} assume true; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:05,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {14308#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:05,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {14308#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:05,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {14308#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:05,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {14309#(<= main_~k~0 7)} assume true; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:05,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {14309#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:05,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {14309#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:05,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {14309#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:05,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {14310#(<= main_~k~0 8)} assume true; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:05,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {14310#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:05,720 INFO L273 TraceCheckUtils]: 42: Hoare triple {14310#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:05,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {14310#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:05,721 INFO L273 TraceCheckUtils]: 44: Hoare triple {14311#(<= main_~k~0 9)} assume true; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:05,721 INFO L273 TraceCheckUtils]: 45: Hoare triple {14311#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:05,722 INFO L273 TraceCheckUtils]: 46: Hoare triple {14311#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:05,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {14311#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:05,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {14312#(<= main_~k~0 10)} assume true; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:05,724 INFO L273 TraceCheckUtils]: 49: Hoare triple {14312#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:05,724 INFO L273 TraceCheckUtils]: 50: Hoare triple {14312#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:05,725 INFO L273 TraceCheckUtils]: 51: Hoare triple {14312#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:05,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {14313#(<= main_~k~0 11)} assume true; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:05,726 INFO L273 TraceCheckUtils]: 53: Hoare triple {14313#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:05,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {14313#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:05,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {14313#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:05,728 INFO L273 TraceCheckUtils]: 56: Hoare triple {14314#(<= main_~k~0 12)} assume true; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:05,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {14314#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:05,729 INFO L273 TraceCheckUtils]: 58: Hoare triple {14314#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:05,729 INFO L273 TraceCheckUtils]: 59: Hoare triple {14314#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:05,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {14315#(<= main_~k~0 13)} assume true; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:05,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {14315#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:05,731 INFO L273 TraceCheckUtils]: 62: Hoare triple {14315#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:05,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {14315#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:05,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {14316#(<= main_~k~0 14)} assume true; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:05,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {14316#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:05,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {14316#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:05,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {14316#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:05,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {14317#(<= main_~k~0 15)} assume true; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:05,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {14317#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:05,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {14317#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:05,736 INFO L273 TraceCheckUtils]: 71: Hoare triple {14317#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:05,737 INFO L273 TraceCheckUtils]: 72: Hoare triple {14318#(<= main_~k~0 16)} assume true; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:05,737 INFO L273 TraceCheckUtils]: 73: Hoare triple {14318#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:05,738 INFO L273 TraceCheckUtils]: 74: Hoare triple {14318#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:05,739 INFO L273 TraceCheckUtils]: 75: Hoare triple {14318#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:05,739 INFO L273 TraceCheckUtils]: 76: Hoare triple {14319#(<= main_~k~0 17)} assume true; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:05,740 INFO L273 TraceCheckUtils]: 77: Hoare triple {14319#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:05,740 INFO L273 TraceCheckUtils]: 78: Hoare triple {14319#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:05,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {14319#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:05,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {14320#(<= main_~k~0 18)} assume true; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:05,742 INFO L273 TraceCheckUtils]: 81: Hoare triple {14320#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:05,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {14320#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:05,743 INFO L273 TraceCheckUtils]: 83: Hoare triple {14320#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {14321#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:05,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {14321#(<= main_~k~0 19)} assume true; {14321#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:05,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {14321#(<= main_~k~0 19)} assume !(~k~0 < 100000); {14300#false} is VALID [2018-11-18 22:44:05,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {14300#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14300#false} is VALID [2018-11-18 22:44:05,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {14300#false} ~x~0 := 0; {14300#false} is VALID [2018-11-18 22:44:05,745 INFO L273 TraceCheckUtils]: 88: Hoare triple {14300#false} assume true; {14300#false} is VALID [2018-11-18 22:44:05,745 INFO L273 TraceCheckUtils]: 89: Hoare triple {14300#false} assume !(~x~0 < ~i~0); {14300#false} is VALID [2018-11-18 22:44:05,745 INFO L273 TraceCheckUtils]: 90: Hoare triple {14300#false} ~x~0 := 1 + ~i~0; {14300#false} is VALID [2018-11-18 22:44:05,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {14300#false} assume true; {14300#false} is VALID [2018-11-18 22:44:05,746 INFO L273 TraceCheckUtils]: 92: Hoare triple {14300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14300#false} is VALID [2018-11-18 22:44:05,746 INFO L256 TraceCheckUtils]: 93: Hoare triple {14300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14300#false} is VALID [2018-11-18 22:44:05,746 INFO L273 TraceCheckUtils]: 94: Hoare triple {14300#false} ~cond := #in~cond; {14300#false} is VALID [2018-11-18 22:44:05,746 INFO L273 TraceCheckUtils]: 95: Hoare triple {14300#false} assume 0 == ~cond; {14300#false} is VALID [2018-11-18 22:44:05,747 INFO L273 TraceCheckUtils]: 96: Hoare triple {14300#false} assume !false; {14300#false} is VALID [2018-11-18 22:44:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:05,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:05,753 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-18 22:44:05,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:44:05,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:44:05,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:05,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:06,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {14299#true} call ULTIMATE.init(); {14299#true} is VALID [2018-11-18 22:44:06,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {14299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14299#true} is VALID [2018-11-18 22:44:06,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {14299#true} assume true; {14299#true} is VALID [2018-11-18 22:44:06,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14299#true} {14299#true} #137#return; {14299#true} is VALID [2018-11-18 22:44:06,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {14299#true} call #t~ret15 := main(); {14299#true} is VALID [2018-11-18 22:44:06,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {14299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14340#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:06,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {14340#(<= main_~i~0 0)} assume true; {14340#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:06,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {14340#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {14347#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:06,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {14347#(<= main_~k~0 0)} assume true; {14347#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:06,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {14347#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14347#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:06,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {14347#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14347#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:06,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {14347#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:06,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {14303#(<= main_~k~0 1)} assume true; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:06,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {14303#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:06,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {14303#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14303#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:06,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {14303#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:06,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {14304#(<= main_~k~0 2)} assume true; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:06,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {14304#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:06,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {14304#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14304#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:06,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {14304#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:06,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {14305#(<= main_~k~0 3)} assume true; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:06,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {14305#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:06,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {14305#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14305#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:06,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {14305#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:06,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {14306#(<= main_~k~0 4)} assume true; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:06,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {14306#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:06,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {14306#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14306#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:06,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {14306#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:06,034 INFO L273 TraceCheckUtils]: 28: Hoare triple {14307#(<= main_~k~0 5)} assume true; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:06,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {14307#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:06,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {14307#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14307#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:06,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {14307#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:06,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {14308#(<= main_~k~0 6)} assume true; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:06,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {14308#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:06,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {14308#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14308#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:06,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {14308#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:06,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {14309#(<= main_~k~0 7)} assume true; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:06,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {14309#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:06,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {14309#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14309#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:06,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {14309#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:06,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {14310#(<= main_~k~0 8)} assume true; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:06,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {14310#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:06,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {14310#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14310#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:06,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {14310#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:06,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {14311#(<= main_~k~0 9)} assume true; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:06,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {14311#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:06,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {14311#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14311#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:06,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {14311#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:06,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {14312#(<= main_~k~0 10)} assume true; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:06,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {14312#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:06,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {14312#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14312#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:06,046 INFO L273 TraceCheckUtils]: 51: Hoare triple {14312#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:06,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {14313#(<= main_~k~0 11)} assume true; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:06,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {14313#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:06,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {14313#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14313#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:06,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {14313#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:06,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {14314#(<= main_~k~0 12)} assume true; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:06,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {14314#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:06,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {14314#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14314#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:06,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {14314#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:06,051 INFO L273 TraceCheckUtils]: 60: Hoare triple {14315#(<= main_~k~0 13)} assume true; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:06,051 INFO L273 TraceCheckUtils]: 61: Hoare triple {14315#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:06,052 INFO L273 TraceCheckUtils]: 62: Hoare triple {14315#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14315#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:06,053 INFO L273 TraceCheckUtils]: 63: Hoare triple {14315#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:06,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {14316#(<= main_~k~0 14)} assume true; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:06,054 INFO L273 TraceCheckUtils]: 65: Hoare triple {14316#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:06,054 INFO L273 TraceCheckUtils]: 66: Hoare triple {14316#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14316#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:06,055 INFO L273 TraceCheckUtils]: 67: Hoare triple {14316#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:06,055 INFO L273 TraceCheckUtils]: 68: Hoare triple {14317#(<= main_~k~0 15)} assume true; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:06,056 INFO L273 TraceCheckUtils]: 69: Hoare triple {14317#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:06,056 INFO L273 TraceCheckUtils]: 70: Hoare triple {14317#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14317#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:06,057 INFO L273 TraceCheckUtils]: 71: Hoare triple {14317#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:06,058 INFO L273 TraceCheckUtils]: 72: Hoare triple {14318#(<= main_~k~0 16)} assume true; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:06,058 INFO L273 TraceCheckUtils]: 73: Hoare triple {14318#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:06,059 INFO L273 TraceCheckUtils]: 74: Hoare triple {14318#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14318#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:06,059 INFO L273 TraceCheckUtils]: 75: Hoare triple {14318#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:06,060 INFO L273 TraceCheckUtils]: 76: Hoare triple {14319#(<= main_~k~0 17)} assume true; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:06,060 INFO L273 TraceCheckUtils]: 77: Hoare triple {14319#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:06,061 INFO L273 TraceCheckUtils]: 78: Hoare triple {14319#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14319#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:06,061 INFO L273 TraceCheckUtils]: 79: Hoare triple {14319#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:06,062 INFO L273 TraceCheckUtils]: 80: Hoare triple {14320#(<= main_~k~0 18)} assume true; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:06,062 INFO L273 TraceCheckUtils]: 81: Hoare triple {14320#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:06,063 INFO L273 TraceCheckUtils]: 82: Hoare triple {14320#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14320#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:06,063 INFO L273 TraceCheckUtils]: 83: Hoare triple {14320#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {14321#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:06,064 INFO L273 TraceCheckUtils]: 84: Hoare triple {14321#(<= main_~k~0 19)} assume true; {14321#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:06,065 INFO L273 TraceCheckUtils]: 85: Hoare triple {14321#(<= main_~k~0 19)} assume !(~k~0 < 100000); {14300#false} is VALID [2018-11-18 22:44:06,065 INFO L273 TraceCheckUtils]: 86: Hoare triple {14300#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14300#false} is VALID [2018-11-18 22:44:06,065 INFO L273 TraceCheckUtils]: 87: Hoare triple {14300#false} ~x~0 := 0; {14300#false} is VALID [2018-11-18 22:44:06,065 INFO L273 TraceCheckUtils]: 88: Hoare triple {14300#false} assume true; {14300#false} is VALID [2018-11-18 22:44:06,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {14300#false} assume !(~x~0 < ~i~0); {14300#false} is VALID [2018-11-18 22:44:06,066 INFO L273 TraceCheckUtils]: 90: Hoare triple {14300#false} ~x~0 := 1 + ~i~0; {14300#false} is VALID [2018-11-18 22:44:06,066 INFO L273 TraceCheckUtils]: 91: Hoare triple {14300#false} assume true; {14300#false} is VALID [2018-11-18 22:44:06,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {14300#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14300#false} is VALID [2018-11-18 22:44:06,066 INFO L256 TraceCheckUtils]: 93: Hoare triple {14300#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14300#false} is VALID [2018-11-18 22:44:06,066 INFO L273 TraceCheckUtils]: 94: Hoare triple {14300#false} ~cond := #in~cond; {14300#false} is VALID [2018-11-18 22:44:06,067 INFO L273 TraceCheckUtils]: 95: Hoare triple {14300#false} assume 0 == ~cond; {14300#false} is VALID [2018-11-18 22:44:06,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {14300#false} assume !false; {14300#false} is VALID [2018-11-18 22:44:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:06,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-11-18 22:44:06,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2018-11-18 22:44:06,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:06,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:44:06,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:06,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:44:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:44:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:44:06,196 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 25 states. [2018-11-18 22:44:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:07,953 INFO L93 Difference]: Finished difference Result 187 states and 234 transitions. [2018-11-18 22:44:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:44:07,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2018-11-18 22:44:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:44:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2018-11-18 22:44:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:44:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2018-11-18 22:44:07,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 225 transitions. [2018-11-18 22:44:08,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:08,159 INFO L225 Difference]: With dead ends: 187 [2018-11-18 22:44:08,159 INFO L226 Difference]: Without dead ends: 145 [2018-11-18 22:44:08,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 22:44:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-18 22:44:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2018-11-18 22:44:08,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:08,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 136 states. [2018-11-18 22:44:08,224 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 136 states. [2018-11-18 22:44:08,224 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 136 states. [2018-11-18 22:44:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:08,227 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2018-11-18 22:44:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 180 transitions. [2018-11-18 22:44:08,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:08,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:08,228 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 145 states. [2018-11-18 22:44:08,228 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 145 states. [2018-11-18 22:44:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:08,230 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2018-11-18 22:44:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 180 transitions. [2018-11-18 22:44:08,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:08,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:08,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:08,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 22:44:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-18 22:44:08,233 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 97 [2018-11-18 22:44:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:08,233 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-18 22:44:08,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:44:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2018-11-18 22:44:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 22:44:08,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:08,235 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:08,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:08,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash 749090347, now seen corresponding path program 9 times [2018-11-18 22:44:08,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:08,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:08,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {15359#true} call ULTIMATE.init(); {15359#true} is VALID [2018-11-18 22:44:08,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {15359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15359#true} is VALID [2018-11-18 22:44:08,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {15359#true} assume true; {15359#true} is VALID [2018-11-18 22:44:08,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15359#true} {15359#true} #137#return; {15359#true} is VALID [2018-11-18 22:44:08,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {15359#true} call #t~ret15 := main(); {15359#true} is VALID [2018-11-18 22:44:08,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {15359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15361#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:08,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {15361#(= 0 main_~i~0)} assume true; {15361#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:08,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {15361#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {15362#(= main_~k~0 0)} is VALID [2018-11-18 22:44:08,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {15362#(= main_~k~0 0)} assume true; {15362#(= main_~k~0 0)} is VALID [2018-11-18 22:44:08,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {15362#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15362#(= main_~k~0 0)} is VALID [2018-11-18 22:44:08,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {15362#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15362#(= main_~k~0 0)} is VALID [2018-11-18 22:44:08,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {15362#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:08,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {15363#(<= main_~k~0 1)} assume true; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:08,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {15363#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:08,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {15363#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:08,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {15363#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:08,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {15364#(<= main_~k~0 2)} assume true; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:08,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {15364#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:08,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {15364#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:08,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {15364#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:08,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {15365#(<= main_~k~0 3)} assume true; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:08,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {15365#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:08,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {15365#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:08,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {15365#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:08,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {15366#(<= main_~k~0 4)} assume true; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:08,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {15366#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:08,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {15366#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:08,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {15366#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:08,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {15367#(<= main_~k~0 5)} assume true; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:08,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {15367#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:08,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {15367#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:08,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {15367#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:08,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {15368#(<= main_~k~0 6)} assume true; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:08,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {15368#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:08,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {15368#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:08,738 INFO L273 TraceCheckUtils]: 35: Hoare triple {15368#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:08,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {15369#(<= main_~k~0 7)} assume true; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:08,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {15369#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:08,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {15369#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:08,740 INFO L273 TraceCheckUtils]: 39: Hoare triple {15369#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:08,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {15370#(<= main_~k~0 8)} assume true; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:08,741 INFO L273 TraceCheckUtils]: 41: Hoare triple {15370#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:08,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {15370#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:08,742 INFO L273 TraceCheckUtils]: 43: Hoare triple {15370#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:08,743 INFO L273 TraceCheckUtils]: 44: Hoare triple {15371#(<= main_~k~0 9)} assume true; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:08,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {15371#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:08,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {15371#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:08,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {15371#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:08,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {15372#(<= main_~k~0 10)} assume true; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:08,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {15372#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:08,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {15372#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:08,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {15372#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:08,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {15373#(<= main_~k~0 11)} assume true; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:08,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {15373#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:08,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {15373#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:08,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {15373#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:08,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {15374#(<= main_~k~0 12)} assume true; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:08,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {15374#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:08,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {15374#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:08,751 INFO L273 TraceCheckUtils]: 59: Hoare triple {15374#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:08,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {15375#(<= main_~k~0 13)} assume true; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:08,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {15375#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:08,752 INFO L273 TraceCheckUtils]: 62: Hoare triple {15375#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:08,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {15375#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:08,753 INFO L273 TraceCheckUtils]: 64: Hoare triple {15376#(<= main_~k~0 14)} assume true; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:08,754 INFO L273 TraceCheckUtils]: 65: Hoare triple {15376#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:08,754 INFO L273 TraceCheckUtils]: 66: Hoare triple {15376#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:08,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {15376#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:08,755 INFO L273 TraceCheckUtils]: 68: Hoare triple {15377#(<= main_~k~0 15)} assume true; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:08,756 INFO L273 TraceCheckUtils]: 69: Hoare triple {15377#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:08,756 INFO L273 TraceCheckUtils]: 70: Hoare triple {15377#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:08,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {15377#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:08,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {15378#(<= main_~k~0 16)} assume true; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:08,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {15378#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:08,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {15378#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:08,759 INFO L273 TraceCheckUtils]: 75: Hoare triple {15378#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:08,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {15379#(<= main_~k~0 17)} assume true; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:08,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {15379#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:08,761 INFO L273 TraceCheckUtils]: 78: Hoare triple {15379#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:08,761 INFO L273 TraceCheckUtils]: 79: Hoare triple {15379#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:08,762 INFO L273 TraceCheckUtils]: 80: Hoare triple {15380#(<= main_~k~0 18)} assume true; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:08,762 INFO L273 TraceCheckUtils]: 81: Hoare triple {15380#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:08,763 INFO L273 TraceCheckUtils]: 82: Hoare triple {15380#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:08,763 INFO L273 TraceCheckUtils]: 83: Hoare triple {15380#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:08,764 INFO L273 TraceCheckUtils]: 84: Hoare triple {15381#(<= main_~k~0 19)} assume true; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:08,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {15381#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:08,765 INFO L273 TraceCheckUtils]: 86: Hoare triple {15381#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:08,766 INFO L273 TraceCheckUtils]: 87: Hoare triple {15381#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {15382#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:08,766 INFO L273 TraceCheckUtils]: 88: Hoare triple {15382#(<= main_~k~0 20)} assume true; {15382#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:08,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {15382#(<= main_~k~0 20)} assume !(~k~0 < 100000); {15360#false} is VALID [2018-11-18 22:44:08,767 INFO L273 TraceCheckUtils]: 90: Hoare triple {15360#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15360#false} is VALID [2018-11-18 22:44:08,767 INFO L273 TraceCheckUtils]: 91: Hoare triple {15360#false} ~x~0 := 0; {15360#false} is VALID [2018-11-18 22:44:08,767 INFO L273 TraceCheckUtils]: 92: Hoare triple {15360#false} assume true; {15360#false} is VALID [2018-11-18 22:44:08,767 INFO L273 TraceCheckUtils]: 93: Hoare triple {15360#false} assume !(~x~0 < ~i~0); {15360#false} is VALID [2018-11-18 22:44:08,768 INFO L273 TraceCheckUtils]: 94: Hoare triple {15360#false} ~x~0 := 1 + ~i~0; {15360#false} is VALID [2018-11-18 22:44:08,768 INFO L273 TraceCheckUtils]: 95: Hoare triple {15360#false} assume true; {15360#false} is VALID [2018-11-18 22:44:08,768 INFO L273 TraceCheckUtils]: 96: Hoare triple {15360#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15360#false} is VALID [2018-11-18 22:44:08,768 INFO L256 TraceCheckUtils]: 97: Hoare triple {15360#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15360#false} is VALID [2018-11-18 22:44:08,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {15360#false} ~cond := #in~cond; {15360#false} is VALID [2018-11-18 22:44:08,769 INFO L273 TraceCheckUtils]: 99: Hoare triple {15360#false} assume 0 == ~cond; {15360#false} is VALID [2018-11-18 22:44:08,769 INFO L273 TraceCheckUtils]: 100: Hoare triple {15360#false} assume !false; {15360#false} is VALID [2018-11-18 22:44:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:08,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:08,776 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-18 22:44:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:44:08,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-18 22:44:08,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:08,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:09,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {15359#true} call ULTIMATE.init(); {15359#true} is VALID [2018-11-18 22:44:09,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {15359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15359#true} is VALID [2018-11-18 22:44:09,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {15359#true} assume true; {15359#true} is VALID [2018-11-18 22:44:09,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15359#true} {15359#true} #137#return; {15359#true} is VALID [2018-11-18 22:44:09,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {15359#true} call #t~ret15 := main(); {15359#true} is VALID [2018-11-18 22:44:09,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {15359#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15401#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:09,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {15401#(<= main_~i~0 0)} assume true; {15401#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:09,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {15401#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {15408#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:09,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {15408#(<= main_~k~0 0)} assume true; {15408#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:09,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {15408#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15408#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:09,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {15408#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15408#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:09,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {15408#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:09,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {15363#(<= main_~k~0 1)} assume true; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:09,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {15363#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:09,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {15363#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15363#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:09,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {15363#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:09,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {15364#(<= main_~k~0 2)} assume true; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:09,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {15364#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:09,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {15364#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15364#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:09,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {15364#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:09,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {15365#(<= main_~k~0 3)} assume true; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:09,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {15365#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:09,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {15365#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15365#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:09,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {15365#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:09,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {15366#(<= main_~k~0 4)} assume true; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:09,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {15366#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:09,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {15366#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15366#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:09,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {15366#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:09,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {15367#(<= main_~k~0 5)} assume true; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:09,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {15367#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:09,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {15367#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15367#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:09,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {15367#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:09,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {15368#(<= main_~k~0 6)} assume true; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:09,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {15368#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:09,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {15368#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15368#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:09,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {15368#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:09,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {15369#(<= main_~k~0 7)} assume true; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:09,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {15369#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:09,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {15369#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15369#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:09,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {15369#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:09,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {15370#(<= main_~k~0 8)} assume true; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:09,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {15370#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:09,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {15370#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15370#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:09,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {15370#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:09,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {15371#(<= main_~k~0 9)} assume true; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:09,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {15371#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:09,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {15371#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15371#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:09,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {15371#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:09,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {15372#(<= main_~k~0 10)} assume true; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:09,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {15372#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:09,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {15372#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15372#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:09,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {15372#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:09,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {15373#(<= main_~k~0 11)} assume true; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:09,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {15373#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:09,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {15373#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15373#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:09,111 INFO L273 TraceCheckUtils]: 55: Hoare triple {15373#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:09,111 INFO L273 TraceCheckUtils]: 56: Hoare triple {15374#(<= main_~k~0 12)} assume true; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:09,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {15374#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:09,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {15374#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15374#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:09,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {15374#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:09,114 INFO L273 TraceCheckUtils]: 60: Hoare triple {15375#(<= main_~k~0 13)} assume true; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:09,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {15375#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:09,114 INFO L273 TraceCheckUtils]: 62: Hoare triple {15375#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15375#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:09,115 INFO L273 TraceCheckUtils]: 63: Hoare triple {15375#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:09,116 INFO L273 TraceCheckUtils]: 64: Hoare triple {15376#(<= main_~k~0 14)} assume true; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:09,116 INFO L273 TraceCheckUtils]: 65: Hoare triple {15376#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:09,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {15376#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15376#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:09,117 INFO L273 TraceCheckUtils]: 67: Hoare triple {15376#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:09,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {15377#(<= main_~k~0 15)} assume true; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:09,118 INFO L273 TraceCheckUtils]: 69: Hoare triple {15377#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:09,119 INFO L273 TraceCheckUtils]: 70: Hoare triple {15377#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15377#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:09,119 INFO L273 TraceCheckUtils]: 71: Hoare triple {15377#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:09,120 INFO L273 TraceCheckUtils]: 72: Hoare triple {15378#(<= main_~k~0 16)} assume true; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:09,120 INFO L273 TraceCheckUtils]: 73: Hoare triple {15378#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:09,121 INFO L273 TraceCheckUtils]: 74: Hoare triple {15378#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15378#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:09,122 INFO L273 TraceCheckUtils]: 75: Hoare triple {15378#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:09,122 INFO L273 TraceCheckUtils]: 76: Hoare triple {15379#(<= main_~k~0 17)} assume true; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:09,122 INFO L273 TraceCheckUtils]: 77: Hoare triple {15379#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:09,123 INFO L273 TraceCheckUtils]: 78: Hoare triple {15379#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15379#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:09,124 INFO L273 TraceCheckUtils]: 79: Hoare triple {15379#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:09,124 INFO L273 TraceCheckUtils]: 80: Hoare triple {15380#(<= main_~k~0 18)} assume true; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:09,125 INFO L273 TraceCheckUtils]: 81: Hoare triple {15380#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:09,125 INFO L273 TraceCheckUtils]: 82: Hoare triple {15380#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15380#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:09,126 INFO L273 TraceCheckUtils]: 83: Hoare triple {15380#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:09,126 INFO L273 TraceCheckUtils]: 84: Hoare triple {15381#(<= main_~k~0 19)} assume true; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:09,127 INFO L273 TraceCheckUtils]: 85: Hoare triple {15381#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:09,127 INFO L273 TraceCheckUtils]: 86: Hoare triple {15381#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15381#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:09,128 INFO L273 TraceCheckUtils]: 87: Hoare triple {15381#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {15382#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:09,129 INFO L273 TraceCheckUtils]: 88: Hoare triple {15382#(<= main_~k~0 20)} assume true; {15382#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:09,129 INFO L273 TraceCheckUtils]: 89: Hoare triple {15382#(<= main_~k~0 20)} assume !(~k~0 < 100000); {15360#false} is VALID [2018-11-18 22:44:09,129 INFO L273 TraceCheckUtils]: 90: Hoare triple {15360#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 91: Hoare triple {15360#false} ~x~0 := 0; {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {15360#false} assume true; {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 93: Hoare triple {15360#false} assume !(~x~0 < ~i~0); {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 94: Hoare triple {15360#false} ~x~0 := 1 + ~i~0; {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 95: Hoare triple {15360#false} assume true; {15360#false} is VALID [2018-11-18 22:44:09,130 INFO L273 TraceCheckUtils]: 96: Hoare triple {15360#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15360#false} is VALID [2018-11-18 22:44:09,131 INFO L256 TraceCheckUtils]: 97: Hoare triple {15360#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15360#false} is VALID [2018-11-18 22:44:09,131 INFO L273 TraceCheckUtils]: 98: Hoare triple {15360#false} ~cond := #in~cond; {15360#false} is VALID [2018-11-18 22:44:09,131 INFO L273 TraceCheckUtils]: 99: Hoare triple {15360#false} assume 0 == ~cond; {15360#false} is VALID [2018-11-18 22:44:09,131 INFO L273 TraceCheckUtils]: 100: Hoare triple {15360#false} assume !false; {15360#false} is VALID [2018-11-18 22:44:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:09,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-11-18 22:44:09,158 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 101 [2018-11-18 22:44:09,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:09,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:44:09,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:09,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:44:09,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:44:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:44:09,251 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand 26 states. [2018-11-18 22:44:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:11,300 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2018-11-18 22:44:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:44:11,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 101 [2018-11-18 22:44:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 230 transitions. [2018-11-18 22:44:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 230 transitions. [2018-11-18 22:44:11,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 230 transitions. [2018-11-18 22:44:11,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:11,580 INFO L225 Difference]: With dead ends: 191 [2018-11-18 22:44:11,581 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 22:44:11,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 22:44:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 22:44:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-18 22:44:11,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:11,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 140 states. [2018-11-18 22:44:11,792 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 140 states. [2018-11-18 22:44:11,792 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 140 states. [2018-11-18 22:44:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:11,795 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2018-11-18 22:44:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2018-11-18 22:44:11,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:11,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:11,796 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 149 states. [2018-11-18 22:44:11,796 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 149 states. [2018-11-18 22:44:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:11,799 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2018-11-18 22:44:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2018-11-18 22:44:11,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:11,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:11,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:11,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 22:44:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2018-11-18 22:44:11,803 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 101 [2018-11-18 22:44:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:11,804 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2018-11-18 22:44:11,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:44:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2018-11-18 22:44:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 22:44:11,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:11,805 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:11,805 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:11,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1508168193, now seen corresponding path program 10 times [2018-11-18 22:44:11,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:11,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:11,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:11,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:12,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {16452#true} call ULTIMATE.init(); {16452#true} is VALID [2018-11-18 22:44:12,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {16452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16452#true} is VALID [2018-11-18 22:44:12,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {16452#true} assume true; {16452#true} is VALID [2018-11-18 22:44:12,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16452#true} {16452#true} #137#return; {16452#true} is VALID [2018-11-18 22:44:12,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {16452#true} call #t~ret15 := main(); {16452#true} is VALID [2018-11-18 22:44:12,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {16452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {16454#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:12,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {16454#(= 0 main_~i~0)} assume true; {16454#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:12,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {16454#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {16455#(= main_~k~0 0)} is VALID [2018-11-18 22:44:12,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {16455#(= main_~k~0 0)} assume true; {16455#(= main_~k~0 0)} is VALID [2018-11-18 22:44:12,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {16455#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16455#(= main_~k~0 0)} is VALID [2018-11-18 22:44:12,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {16455#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16455#(= main_~k~0 0)} is VALID [2018-11-18 22:44:12,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {16455#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {16456#(<= main_~k~0 1)} assume true; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {16456#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {16456#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {16456#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {16457#(<= main_~k~0 2)} assume true; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {16457#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {16457#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {16457#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:12,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {16458#(<= main_~k~0 3)} assume true; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:12,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {16458#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:12,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {16458#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:12,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {16458#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:12,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {16459#(<= main_~k~0 4)} assume true; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:12,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {16459#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:12,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {16459#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:12,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {16459#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:12,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {16460#(<= main_~k~0 5)} assume true; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:12,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {16460#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:12,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {16460#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:12,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {16460#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:12,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {16461#(<= main_~k~0 6)} assume true; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:12,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {16461#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:12,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {16461#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:12,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {16461#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:12,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {16462#(<= main_~k~0 7)} assume true; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:12,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {16462#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:12,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {16462#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:12,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {16462#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:12,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {16463#(<= main_~k~0 8)} assume true; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:12,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {16463#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:12,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {16463#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:12,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {16463#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:12,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {16464#(<= main_~k~0 9)} assume true; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:12,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {16464#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:12,276 INFO L273 TraceCheckUtils]: 46: Hoare triple {16464#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:12,277 INFO L273 TraceCheckUtils]: 47: Hoare triple {16464#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:12,277 INFO L273 TraceCheckUtils]: 48: Hoare triple {16465#(<= main_~k~0 10)} assume true; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:12,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {16465#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:12,278 INFO L273 TraceCheckUtils]: 50: Hoare triple {16465#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:12,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {16465#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:12,279 INFO L273 TraceCheckUtils]: 52: Hoare triple {16466#(<= main_~k~0 11)} assume true; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:12,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {16466#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:12,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {16466#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:12,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {16466#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:12,305 INFO L273 TraceCheckUtils]: 56: Hoare triple {16467#(<= main_~k~0 12)} assume true; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:12,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {16467#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:12,327 INFO L273 TraceCheckUtils]: 58: Hoare triple {16467#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:12,329 INFO L273 TraceCheckUtils]: 59: Hoare triple {16467#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:12,329 INFO L273 TraceCheckUtils]: 60: Hoare triple {16468#(<= main_~k~0 13)} assume true; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:12,329 INFO L273 TraceCheckUtils]: 61: Hoare triple {16468#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:12,330 INFO L273 TraceCheckUtils]: 62: Hoare triple {16468#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:12,330 INFO L273 TraceCheckUtils]: 63: Hoare triple {16468#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:12,330 INFO L273 TraceCheckUtils]: 64: Hoare triple {16469#(<= main_~k~0 14)} assume true; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:12,331 INFO L273 TraceCheckUtils]: 65: Hoare triple {16469#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:12,337 INFO L273 TraceCheckUtils]: 66: Hoare triple {16469#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:12,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {16469#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:12,338 INFO L273 TraceCheckUtils]: 68: Hoare triple {16470#(<= main_~k~0 15)} assume true; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:12,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {16470#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:12,339 INFO L273 TraceCheckUtils]: 70: Hoare triple {16470#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:12,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {16470#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:12,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {16471#(<= main_~k~0 16)} assume true; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:12,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {16471#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:12,340 INFO L273 TraceCheckUtils]: 74: Hoare triple {16471#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:12,340 INFO L273 TraceCheckUtils]: 75: Hoare triple {16471#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:12,341 INFO L273 TraceCheckUtils]: 76: Hoare triple {16472#(<= main_~k~0 17)} assume true; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:12,341 INFO L273 TraceCheckUtils]: 77: Hoare triple {16472#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:12,342 INFO L273 TraceCheckUtils]: 78: Hoare triple {16472#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:12,342 INFO L273 TraceCheckUtils]: 79: Hoare triple {16472#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:12,343 INFO L273 TraceCheckUtils]: 80: Hoare triple {16473#(<= main_~k~0 18)} assume true; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:12,343 INFO L273 TraceCheckUtils]: 81: Hoare triple {16473#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:12,344 INFO L273 TraceCheckUtils]: 82: Hoare triple {16473#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:12,345 INFO L273 TraceCheckUtils]: 83: Hoare triple {16473#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:12,345 INFO L273 TraceCheckUtils]: 84: Hoare triple {16474#(<= main_~k~0 19)} assume true; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:12,346 INFO L273 TraceCheckUtils]: 85: Hoare triple {16474#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:12,346 INFO L273 TraceCheckUtils]: 86: Hoare triple {16474#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:12,347 INFO L273 TraceCheckUtils]: 87: Hoare triple {16474#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:12,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {16475#(<= main_~k~0 20)} assume true; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:12,348 INFO L273 TraceCheckUtils]: 89: Hoare triple {16475#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:12,348 INFO L273 TraceCheckUtils]: 90: Hoare triple {16475#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:12,349 INFO L273 TraceCheckUtils]: 91: Hoare triple {16475#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {16476#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:12,349 INFO L273 TraceCheckUtils]: 92: Hoare triple {16476#(<= main_~k~0 21)} assume true; {16476#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:12,350 INFO L273 TraceCheckUtils]: 93: Hoare triple {16476#(<= main_~k~0 21)} assume !(~k~0 < 100000); {16453#false} is VALID [2018-11-18 22:44:12,350 INFO L273 TraceCheckUtils]: 94: Hoare triple {16453#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16453#false} is VALID [2018-11-18 22:44:12,350 INFO L273 TraceCheckUtils]: 95: Hoare triple {16453#false} ~x~0 := 0; {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L273 TraceCheckUtils]: 96: Hoare triple {16453#false} assume true; {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L273 TraceCheckUtils]: 97: Hoare triple {16453#false} assume !(~x~0 < ~i~0); {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L273 TraceCheckUtils]: 98: Hoare triple {16453#false} ~x~0 := 1 + ~i~0; {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L273 TraceCheckUtils]: 99: Hoare triple {16453#false} assume true; {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L273 TraceCheckUtils]: 100: Hoare triple {16453#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16453#false} is VALID [2018-11-18 22:44:12,351 INFO L256 TraceCheckUtils]: 101: Hoare triple {16453#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {16453#false} is VALID [2018-11-18 22:44:12,352 INFO L273 TraceCheckUtils]: 102: Hoare triple {16453#false} ~cond := #in~cond; {16453#false} is VALID [2018-11-18 22:44:12,352 INFO L273 TraceCheckUtils]: 103: Hoare triple {16453#false} assume 0 == ~cond; {16453#false} is VALID [2018-11-18 22:44:12,352 INFO L273 TraceCheckUtils]: 104: Hoare triple {16453#false} assume !false; {16453#false} is VALID [2018-11-18 22:44:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:12,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:12,359 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-18 22:44:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:44:12,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:44:12,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:12,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:12,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {16452#true} call ULTIMATE.init(); {16452#true} is VALID [2018-11-18 22:44:12,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {16452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16452#true} is VALID [2018-11-18 22:44:12,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {16452#true} assume true; {16452#true} is VALID [2018-11-18 22:44:12,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16452#true} {16452#true} #137#return; {16452#true} is VALID [2018-11-18 22:44:12,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {16452#true} call #t~ret15 := main(); {16452#true} is VALID [2018-11-18 22:44:12,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {16452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {16495#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:12,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {16495#(<= main_~i~0 0)} assume true; {16495#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:12,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {16495#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {16502#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:12,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {16502#(<= main_~k~0 0)} assume true; {16502#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:12,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {16502#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16502#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:12,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {16502#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16502#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:12,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {16502#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {16456#(<= main_~k~0 1)} assume true; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {16456#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {16456#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16456#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:12,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {16456#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {16457#(<= main_~k~0 2)} assume true; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {16457#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {16457#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16457#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:12,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {16457#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:13,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {16458#(<= main_~k~0 3)} assume true; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:13,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {16458#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:13,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {16458#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16458#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:13,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {16458#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:13,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {16459#(<= main_~k~0 4)} assume true; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:13,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {16459#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:13,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {16459#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16459#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:13,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {16459#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:13,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {16460#(<= main_~k~0 5)} assume true; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:13,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {16460#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:13,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {16460#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16460#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:13,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {16460#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:13,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {16461#(<= main_~k~0 6)} assume true; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:13,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {16461#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:13,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {16461#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16461#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:13,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {16461#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:13,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {16462#(<= main_~k~0 7)} assume true; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:13,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {16462#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:13,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {16462#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16462#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:13,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {16462#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:13,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {16463#(<= main_~k~0 8)} assume true; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:13,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {16463#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:13,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {16463#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16463#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:13,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {16463#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:13,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {16464#(<= main_~k~0 9)} assume true; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:13,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {16464#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:13,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {16464#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16464#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:13,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {16464#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:13,015 INFO L273 TraceCheckUtils]: 48: Hoare triple {16465#(<= main_~k~0 10)} assume true; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:13,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {16465#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:13,016 INFO L273 TraceCheckUtils]: 50: Hoare triple {16465#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16465#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:13,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {16465#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:13,017 INFO L273 TraceCheckUtils]: 52: Hoare triple {16466#(<= main_~k~0 11)} assume true; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:13,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {16466#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:13,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {16466#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16466#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:13,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {16466#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:13,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {16467#(<= main_~k~0 12)} assume true; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:13,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {16467#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:13,045 INFO L273 TraceCheckUtils]: 58: Hoare triple {16467#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16467#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:13,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {16467#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:13,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {16468#(<= main_~k~0 13)} assume true; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:13,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {16468#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:13,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {16468#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16468#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:13,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {16468#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:13,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {16469#(<= main_~k~0 14)} assume true; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:13,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {16469#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:13,048 INFO L273 TraceCheckUtils]: 66: Hoare triple {16469#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16469#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:13,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {16469#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:13,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {16470#(<= main_~k~0 15)} assume true; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:13,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {16470#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:13,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {16470#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16470#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:13,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {16470#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:13,051 INFO L273 TraceCheckUtils]: 72: Hoare triple {16471#(<= main_~k~0 16)} assume true; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:13,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {16471#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:13,052 INFO L273 TraceCheckUtils]: 74: Hoare triple {16471#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16471#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:13,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {16471#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:13,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {16472#(<= main_~k~0 17)} assume true; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:13,053 INFO L273 TraceCheckUtils]: 77: Hoare triple {16472#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:13,056 INFO L273 TraceCheckUtils]: 78: Hoare triple {16472#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16472#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:13,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {16472#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:13,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {16473#(<= main_~k~0 18)} assume true; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:13,060 INFO L273 TraceCheckUtils]: 81: Hoare triple {16473#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:13,060 INFO L273 TraceCheckUtils]: 82: Hoare triple {16473#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16473#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:13,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {16473#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:13,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {16474#(<= main_~k~0 19)} assume true; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:13,061 INFO L273 TraceCheckUtils]: 85: Hoare triple {16474#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:13,061 INFO L273 TraceCheckUtils]: 86: Hoare triple {16474#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16474#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:13,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {16474#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:13,062 INFO L273 TraceCheckUtils]: 88: Hoare triple {16475#(<= main_~k~0 20)} assume true; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:13,062 INFO L273 TraceCheckUtils]: 89: Hoare triple {16475#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:13,063 INFO L273 TraceCheckUtils]: 90: Hoare triple {16475#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16475#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:13,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {16475#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {16476#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:13,063 INFO L273 TraceCheckUtils]: 92: Hoare triple {16476#(<= main_~k~0 21)} assume true; {16476#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:13,064 INFO L273 TraceCheckUtils]: 93: Hoare triple {16476#(<= main_~k~0 21)} assume !(~k~0 < 100000); {16453#false} is VALID [2018-11-18 22:44:13,064 INFO L273 TraceCheckUtils]: 94: Hoare triple {16453#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16453#false} is VALID [2018-11-18 22:44:13,064 INFO L273 TraceCheckUtils]: 95: Hoare triple {16453#false} ~x~0 := 0; {16453#false} is VALID [2018-11-18 22:44:13,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {16453#false} assume true; {16453#false} is VALID [2018-11-18 22:44:13,065 INFO L273 TraceCheckUtils]: 97: Hoare triple {16453#false} assume !(~x~0 < ~i~0); {16453#false} is VALID [2018-11-18 22:44:13,065 INFO L273 TraceCheckUtils]: 98: Hoare triple {16453#false} ~x~0 := 1 + ~i~0; {16453#false} is VALID [2018-11-18 22:44:13,065 INFO L273 TraceCheckUtils]: 99: Hoare triple {16453#false} assume true; {16453#false} is VALID [2018-11-18 22:44:13,065 INFO L273 TraceCheckUtils]: 100: Hoare triple {16453#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16453#false} is VALID [2018-11-18 22:44:13,065 INFO L256 TraceCheckUtils]: 101: Hoare triple {16453#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {16453#false} is VALID [2018-11-18 22:44:13,066 INFO L273 TraceCheckUtils]: 102: Hoare triple {16453#false} ~cond := #in~cond; {16453#false} is VALID [2018-11-18 22:44:13,066 INFO L273 TraceCheckUtils]: 103: Hoare triple {16453#false} assume 0 == ~cond; {16453#false} is VALID [2018-11-18 22:44:13,066 INFO L273 TraceCheckUtils]: 104: Hoare triple {16453#false} assume !false; {16453#false} is VALID [2018-11-18 22:44:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:13,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:13,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-11-18 22:44:13,094 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 105 [2018-11-18 22:44:13,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:13,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:44:13,194 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-18 22:44:13,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:44:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:44:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:44:13,195 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand 27 states. [2018-11-18 22:44:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:14,931 INFO L93 Difference]: Finished difference Result 195 states and 244 transitions. [2018-11-18 22:44:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:44:14,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 105 [2018-11-18 22:44:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:44:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 235 transitions. [2018-11-18 22:44:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:44:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 235 transitions. [2018-11-18 22:44:14,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 235 transitions. [2018-11-18 22:44:15,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:15,150 INFO L225 Difference]: With dead ends: 195 [2018-11-18 22:44:15,150 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 22:44:15,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 22:44:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 22:44:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2018-11-18 22:44:15,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:15,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 144 states. [2018-11-18 22:44:15,228 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 144 states. [2018-11-18 22:44:15,228 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 144 states. [2018-11-18 22:44:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:15,231 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2018-11-18 22:44:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2018-11-18 22:44:15,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:15,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:15,232 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 153 states. [2018-11-18 22:44:15,232 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 153 states. [2018-11-18 22:44:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:15,234 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2018-11-18 22:44:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2018-11-18 22:44:15,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:15,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:15,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:15,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 22:44:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2018-11-18 22:44:15,236 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 105 [2018-11-18 22:44:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:15,237 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2018-11-18 22:44:15,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:44:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2018-11-18 22:44:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 22:44:15,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:15,238 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:15,238 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:15,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1277530839, now seen corresponding path program 11 times [2018-11-18 22:44:15,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:15,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:15,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:15,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {17578#true} call ULTIMATE.init(); {17578#true} is VALID [2018-11-18 22:44:15,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {17578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17578#true} is VALID [2018-11-18 22:44:15,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {17578#true} assume true; {17578#true} is VALID [2018-11-18 22:44:15,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17578#true} {17578#true} #137#return; {17578#true} is VALID [2018-11-18 22:44:15,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {17578#true} call #t~ret15 := main(); {17578#true} is VALID [2018-11-18 22:44:15,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {17578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17580#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {17580#(= 0 main_~i~0)} assume true; {17580#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:15,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {17580#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {17581#(= main_~k~0 0)} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {17581#(= main_~k~0 0)} assume true; {17581#(= main_~k~0 0)} is VALID [2018-11-18 22:44:15,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {17581#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17581#(= main_~k~0 0)} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {17581#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17581#(= main_~k~0 0)} is VALID [2018-11-18 22:44:15,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {17581#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {17582#(<= main_~k~0 1)} assume true; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:15,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {17582#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:15,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {17582#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {17582#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:15,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {17583#(<= main_~k~0 2)} assume true; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {17583#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:15,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {17583#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:15,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {17583#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:15,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {17584#(<= main_~k~0 3)} assume true; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:15,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {17584#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:15,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {17584#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:15,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {17584#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:15,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {17585#(<= main_~k~0 4)} assume true; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:15,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {17585#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:15,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {17585#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:15,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {17585#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:15,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {17586#(<= main_~k~0 5)} assume true; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:15,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {17586#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:15,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {17586#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:15,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {17586#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:15,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {17587#(<= main_~k~0 6)} assume true; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:15,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {17587#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:15,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {17587#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:15,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {17587#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:15,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {17588#(<= main_~k~0 7)} assume true; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:15,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {17588#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:15,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {17588#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:15,664 INFO L273 TraceCheckUtils]: 39: Hoare triple {17588#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:15,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {17589#(<= main_~k~0 8)} assume true; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:15,665 INFO L273 TraceCheckUtils]: 41: Hoare triple {17589#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:15,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {17589#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:15,666 INFO L273 TraceCheckUtils]: 43: Hoare triple {17589#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:15,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {17590#(<= main_~k~0 9)} assume true; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:15,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {17590#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:15,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {17590#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:15,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {17590#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:15,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {17591#(<= main_~k~0 10)} assume true; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:15,669 INFO L273 TraceCheckUtils]: 49: Hoare triple {17591#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:15,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {17591#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:15,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {17591#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:15,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {17592#(<= main_~k~0 11)} assume true; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:15,672 INFO L273 TraceCheckUtils]: 53: Hoare triple {17592#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:15,672 INFO L273 TraceCheckUtils]: 54: Hoare triple {17592#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:15,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {17592#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:15,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {17593#(<= main_~k~0 12)} assume true; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:15,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {17593#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:15,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {17593#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:15,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {17593#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:15,676 INFO L273 TraceCheckUtils]: 60: Hoare triple {17594#(<= main_~k~0 13)} assume true; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:15,676 INFO L273 TraceCheckUtils]: 61: Hoare triple {17594#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:15,677 INFO L273 TraceCheckUtils]: 62: Hoare triple {17594#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:15,677 INFO L273 TraceCheckUtils]: 63: Hoare triple {17594#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:15,678 INFO L273 TraceCheckUtils]: 64: Hoare triple {17595#(<= main_~k~0 14)} assume true; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:15,678 INFO L273 TraceCheckUtils]: 65: Hoare triple {17595#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:15,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {17595#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:15,680 INFO L273 TraceCheckUtils]: 67: Hoare triple {17595#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:15,680 INFO L273 TraceCheckUtils]: 68: Hoare triple {17596#(<= main_~k~0 15)} assume true; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:15,681 INFO L273 TraceCheckUtils]: 69: Hoare triple {17596#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:15,681 INFO L273 TraceCheckUtils]: 70: Hoare triple {17596#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:15,682 INFO L273 TraceCheckUtils]: 71: Hoare triple {17596#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:15,683 INFO L273 TraceCheckUtils]: 72: Hoare triple {17597#(<= main_~k~0 16)} assume true; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:15,683 INFO L273 TraceCheckUtils]: 73: Hoare triple {17597#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:15,684 INFO L273 TraceCheckUtils]: 74: Hoare triple {17597#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:15,684 INFO L273 TraceCheckUtils]: 75: Hoare triple {17597#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:15,685 INFO L273 TraceCheckUtils]: 76: Hoare triple {17598#(<= main_~k~0 17)} assume true; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:15,685 INFO L273 TraceCheckUtils]: 77: Hoare triple {17598#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:15,686 INFO L273 TraceCheckUtils]: 78: Hoare triple {17598#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:15,687 INFO L273 TraceCheckUtils]: 79: Hoare triple {17598#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:15,687 INFO L273 TraceCheckUtils]: 80: Hoare triple {17599#(<= main_~k~0 18)} assume true; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:15,688 INFO L273 TraceCheckUtils]: 81: Hoare triple {17599#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:15,688 INFO L273 TraceCheckUtils]: 82: Hoare triple {17599#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:15,689 INFO L273 TraceCheckUtils]: 83: Hoare triple {17599#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:15,690 INFO L273 TraceCheckUtils]: 84: Hoare triple {17600#(<= main_~k~0 19)} assume true; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:15,690 INFO L273 TraceCheckUtils]: 85: Hoare triple {17600#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:15,691 INFO L273 TraceCheckUtils]: 86: Hoare triple {17600#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:15,691 INFO L273 TraceCheckUtils]: 87: Hoare triple {17600#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:15,692 INFO L273 TraceCheckUtils]: 88: Hoare triple {17601#(<= main_~k~0 20)} assume true; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:15,692 INFO L273 TraceCheckUtils]: 89: Hoare triple {17601#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:15,693 INFO L273 TraceCheckUtils]: 90: Hoare triple {17601#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:15,694 INFO L273 TraceCheckUtils]: 91: Hoare triple {17601#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:15,694 INFO L273 TraceCheckUtils]: 92: Hoare triple {17602#(<= main_~k~0 21)} assume true; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:15,695 INFO L273 TraceCheckUtils]: 93: Hoare triple {17602#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:15,695 INFO L273 TraceCheckUtils]: 94: Hoare triple {17602#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:15,696 INFO L273 TraceCheckUtils]: 95: Hoare triple {17602#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {17603#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:15,697 INFO L273 TraceCheckUtils]: 96: Hoare triple {17603#(<= main_~k~0 22)} assume true; {17603#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:15,697 INFO L273 TraceCheckUtils]: 97: Hoare triple {17603#(<= main_~k~0 22)} assume !(~k~0 < 100000); {17579#false} is VALID [2018-11-18 22:44:15,697 INFO L273 TraceCheckUtils]: 98: Hoare triple {17579#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17579#false} is VALID [2018-11-18 22:44:15,698 INFO L273 TraceCheckUtils]: 99: Hoare triple {17579#false} ~x~0 := 0; {17579#false} is VALID [2018-11-18 22:44:15,698 INFO L273 TraceCheckUtils]: 100: Hoare triple {17579#false} assume true; {17579#false} is VALID [2018-11-18 22:44:15,698 INFO L273 TraceCheckUtils]: 101: Hoare triple {17579#false} assume !(~x~0 < ~i~0); {17579#false} is VALID [2018-11-18 22:44:15,698 INFO L273 TraceCheckUtils]: 102: Hoare triple {17579#false} ~x~0 := 1 + ~i~0; {17579#false} is VALID [2018-11-18 22:44:15,698 INFO L273 TraceCheckUtils]: 103: Hoare triple {17579#false} assume true; {17579#false} is VALID [2018-11-18 22:44:15,699 INFO L273 TraceCheckUtils]: 104: Hoare triple {17579#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17579#false} is VALID [2018-11-18 22:44:15,699 INFO L256 TraceCheckUtils]: 105: Hoare triple {17579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17579#false} is VALID [2018-11-18 22:44:15,699 INFO L273 TraceCheckUtils]: 106: Hoare triple {17579#false} ~cond := #in~cond; {17579#false} is VALID [2018-11-18 22:44:15,699 INFO L273 TraceCheckUtils]: 107: Hoare triple {17579#false} assume 0 == ~cond; {17579#false} is VALID [2018-11-18 22:44:15,699 INFO L273 TraceCheckUtils]: 108: Hoare triple {17579#false} assume !false; {17579#false} is VALID [2018-11-18 22:44:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:15,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:15,708 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-18 22:44:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:44:15,792 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-18 22:44:15,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:15,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:16,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {17578#true} call ULTIMATE.init(); {17578#true} is VALID [2018-11-18 22:44:16,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {17578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17578#true} is VALID [2018-11-18 22:44:16,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {17578#true} assume true; {17578#true} is VALID [2018-11-18 22:44:16,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17578#true} {17578#true} #137#return; {17578#true} is VALID [2018-11-18 22:44:16,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {17578#true} call #t~ret15 := main(); {17578#true} is VALID [2018-11-18 22:44:16,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {17578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17622#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:16,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {17622#(<= main_~i~0 0)} assume true; {17622#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:16,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {17622#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {17629#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:16,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {17629#(<= main_~k~0 0)} assume true; {17629#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:16,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {17629#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17629#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:16,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {17629#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17629#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:16,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {17629#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:16,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {17582#(<= main_~k~0 1)} assume true; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:16,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {17582#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:16,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {17582#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {17582#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:16,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {17582#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:16,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {17583#(<= main_~k~0 2)} assume true; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:16,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {17583#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:16,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {17583#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17583#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:16,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {17583#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:16,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {17584#(<= main_~k~0 3)} assume true; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:16,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {17584#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:16,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {17584#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17584#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:16,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {17584#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:16,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {17585#(<= main_~k~0 4)} assume true; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:16,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {17585#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:16,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {17585#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17585#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:16,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {17585#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:16,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {17586#(<= main_~k~0 5)} assume true; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:16,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {17586#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:16,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {17586#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17586#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:16,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {17586#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:16,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {17587#(<= main_~k~0 6)} assume true; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:16,042 INFO L273 TraceCheckUtils]: 33: Hoare triple {17587#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:16,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {17587#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17587#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:16,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {17587#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:16,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {17588#(<= main_~k~0 7)} assume true; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:16,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {17588#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:16,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {17588#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17588#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:16,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {17588#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:16,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {17589#(<= main_~k~0 8)} assume true; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:16,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {17589#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:16,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {17589#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17589#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:16,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {17589#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:16,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {17590#(<= main_~k~0 9)} assume true; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:16,048 INFO L273 TraceCheckUtils]: 45: Hoare triple {17590#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:16,049 INFO L273 TraceCheckUtils]: 46: Hoare triple {17590#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17590#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:16,049 INFO L273 TraceCheckUtils]: 47: Hoare triple {17590#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:16,050 INFO L273 TraceCheckUtils]: 48: Hoare triple {17591#(<= main_~k~0 10)} assume true; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:16,050 INFO L273 TraceCheckUtils]: 49: Hoare triple {17591#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:16,051 INFO L273 TraceCheckUtils]: 50: Hoare triple {17591#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17591#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:16,052 INFO L273 TraceCheckUtils]: 51: Hoare triple {17591#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:16,052 INFO L273 TraceCheckUtils]: 52: Hoare triple {17592#(<= main_~k~0 11)} assume true; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:16,053 INFO L273 TraceCheckUtils]: 53: Hoare triple {17592#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:16,053 INFO L273 TraceCheckUtils]: 54: Hoare triple {17592#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17592#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:16,054 INFO L273 TraceCheckUtils]: 55: Hoare triple {17592#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:16,054 INFO L273 TraceCheckUtils]: 56: Hoare triple {17593#(<= main_~k~0 12)} assume true; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:16,055 INFO L273 TraceCheckUtils]: 57: Hoare triple {17593#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:16,055 INFO L273 TraceCheckUtils]: 58: Hoare triple {17593#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17593#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:16,056 INFO L273 TraceCheckUtils]: 59: Hoare triple {17593#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:16,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {17594#(<= main_~k~0 13)} assume true; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:16,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {17594#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:16,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {17594#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17594#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:16,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {17594#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:16,059 INFO L273 TraceCheckUtils]: 64: Hoare triple {17595#(<= main_~k~0 14)} assume true; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:16,059 INFO L273 TraceCheckUtils]: 65: Hoare triple {17595#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:16,059 INFO L273 TraceCheckUtils]: 66: Hoare triple {17595#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17595#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:16,060 INFO L273 TraceCheckUtils]: 67: Hoare triple {17595#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:16,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {17596#(<= main_~k~0 15)} assume true; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:16,061 INFO L273 TraceCheckUtils]: 69: Hoare triple {17596#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:16,062 INFO L273 TraceCheckUtils]: 70: Hoare triple {17596#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17596#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:16,062 INFO L273 TraceCheckUtils]: 71: Hoare triple {17596#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:16,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {17597#(<= main_~k~0 16)} assume true; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:16,063 INFO L273 TraceCheckUtils]: 73: Hoare triple {17597#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:16,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {17597#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17597#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:16,065 INFO L273 TraceCheckUtils]: 75: Hoare triple {17597#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:16,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {17598#(<= main_~k~0 17)} assume true; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:16,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {17598#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:16,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {17598#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17598#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:16,067 INFO L273 TraceCheckUtils]: 79: Hoare triple {17598#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:16,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {17599#(<= main_~k~0 18)} assume true; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:16,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {17599#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:16,068 INFO L273 TraceCheckUtils]: 82: Hoare triple {17599#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17599#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:16,069 INFO L273 TraceCheckUtils]: 83: Hoare triple {17599#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:16,070 INFO L273 TraceCheckUtils]: 84: Hoare triple {17600#(<= main_~k~0 19)} assume true; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:16,070 INFO L273 TraceCheckUtils]: 85: Hoare triple {17600#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:16,071 INFO L273 TraceCheckUtils]: 86: Hoare triple {17600#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17600#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:16,071 INFO L273 TraceCheckUtils]: 87: Hoare triple {17600#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:16,072 INFO L273 TraceCheckUtils]: 88: Hoare triple {17601#(<= main_~k~0 20)} assume true; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:16,072 INFO L273 TraceCheckUtils]: 89: Hoare triple {17601#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:16,073 INFO L273 TraceCheckUtils]: 90: Hoare triple {17601#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17601#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:16,074 INFO L273 TraceCheckUtils]: 91: Hoare triple {17601#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:16,074 INFO L273 TraceCheckUtils]: 92: Hoare triple {17602#(<= main_~k~0 21)} assume true; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:16,075 INFO L273 TraceCheckUtils]: 93: Hoare triple {17602#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:16,075 INFO L273 TraceCheckUtils]: 94: Hoare triple {17602#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17602#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:16,076 INFO L273 TraceCheckUtils]: 95: Hoare triple {17602#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {17603#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:16,076 INFO L273 TraceCheckUtils]: 96: Hoare triple {17603#(<= main_~k~0 22)} assume true; {17603#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:16,077 INFO L273 TraceCheckUtils]: 97: Hoare triple {17603#(<= main_~k~0 22)} assume !(~k~0 < 100000); {17579#false} is VALID [2018-11-18 22:44:16,077 INFO L273 TraceCheckUtils]: 98: Hoare triple {17579#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17579#false} is VALID [2018-11-18 22:44:16,077 INFO L273 TraceCheckUtils]: 99: Hoare triple {17579#false} ~x~0 := 0; {17579#false} is VALID [2018-11-18 22:44:16,077 INFO L273 TraceCheckUtils]: 100: Hoare triple {17579#false} assume true; {17579#false} is VALID [2018-11-18 22:44:16,078 INFO L273 TraceCheckUtils]: 101: Hoare triple {17579#false} assume !(~x~0 < ~i~0); {17579#false} is VALID [2018-11-18 22:44:16,078 INFO L273 TraceCheckUtils]: 102: Hoare triple {17579#false} ~x~0 := 1 + ~i~0; {17579#false} is VALID [2018-11-18 22:44:16,078 INFO L273 TraceCheckUtils]: 103: Hoare triple {17579#false} assume true; {17579#false} is VALID [2018-11-18 22:44:16,078 INFO L273 TraceCheckUtils]: 104: Hoare triple {17579#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17579#false} is VALID [2018-11-18 22:44:16,078 INFO L256 TraceCheckUtils]: 105: Hoare triple {17579#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17579#false} is VALID [2018-11-18 22:44:16,079 INFO L273 TraceCheckUtils]: 106: Hoare triple {17579#false} ~cond := #in~cond; {17579#false} is VALID [2018-11-18 22:44:16,079 INFO L273 TraceCheckUtils]: 107: Hoare triple {17579#false} assume 0 == ~cond; {17579#false} is VALID [2018-11-18 22:44:16,079 INFO L273 TraceCheckUtils]: 108: Hoare triple {17579#false} assume !false; {17579#false} is VALID [2018-11-18 22:44:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:16,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:16,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-11-18 22:44:16,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-11-18 22:44:16,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:16,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:44:16,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:44:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:44:16,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:44:16,212 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand 28 states. [2018-11-18 22:44:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:17,296 INFO L93 Difference]: Finished difference Result 199 states and 249 transitions. [2018-11-18 22:44:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:44:17,296 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-11-18 22:44:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:44:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 240 transitions. [2018-11-18 22:44:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:44:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 240 transitions. [2018-11-18 22:44:17,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 240 transitions. [2018-11-18 22:44:18,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:18,061 INFO L225 Difference]: With dead ends: 199 [2018-11-18 22:44:18,062 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 22:44:18,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 22:44:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 22:44:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2018-11-18 22:44:18,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:18,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 148 states. [2018-11-18 22:44:18,365 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 148 states. [2018-11-18 22:44:18,365 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 148 states. [2018-11-18 22:44:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,367 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2018-11-18 22:44:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2018-11-18 22:44:18,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,368 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 157 states. [2018-11-18 22:44:18,368 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 157 states. [2018-11-18 22:44:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,371 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2018-11-18 22:44:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2018-11-18 22:44:18,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:18,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 22:44:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 183 transitions. [2018-11-18 22:44:18,375 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 183 transitions. Word has length 109 [2018-11-18 22:44:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:18,375 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 183 transitions. [2018-11-18 22:44:18,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:44:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 183 transitions. [2018-11-18 22:44:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 22:44:18,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:18,376 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:18,376 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:18,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1144129363, now seen corresponding path program 12 times [2018-11-18 22:44:18,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:18,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:18,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {18737#true} call ULTIMATE.init(); {18737#true} is VALID [2018-11-18 22:44:18,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {18737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18737#true} is VALID [2018-11-18 22:44:18,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {18737#true} assume true; {18737#true} is VALID [2018-11-18 22:44:18,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18737#true} {18737#true} #137#return; {18737#true} is VALID [2018-11-18 22:44:18,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {18737#true} call #t~ret15 := main(); {18737#true} is VALID [2018-11-18 22:44:18,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {18737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18739#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:18,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {18739#(= 0 main_~i~0)} assume true; {18739#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:18,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {18739#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {18740#(= main_~k~0 0)} is VALID [2018-11-18 22:44:18,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {18740#(= main_~k~0 0)} assume true; {18740#(= main_~k~0 0)} is VALID [2018-11-18 22:44:18,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {18740#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18740#(= main_~k~0 0)} is VALID [2018-11-18 22:44:18,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {18740#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18740#(= main_~k~0 0)} is VALID [2018-11-18 22:44:18,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {18740#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:18,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {18741#(<= main_~k~0 1)} assume true; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:18,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {18741#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:18,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {18741#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:18,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {18741#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:18,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {18742#(<= main_~k~0 2)} assume true; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:18,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {18742#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:18,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {18742#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:18,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {18742#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:18,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {18743#(<= main_~k~0 3)} assume true; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:18,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {18743#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:18,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {18743#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:18,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {18743#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:18,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {18744#(<= main_~k~0 4)} assume true; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:18,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {18744#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:18,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {18744#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:18,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {18744#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:18,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {18745#(<= main_~k~0 5)} assume true; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:18,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {18745#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:18,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {18745#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:18,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {18745#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:18,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {18746#(<= main_~k~0 6)} assume true; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:18,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {18746#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:18,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {18746#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:18,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {18746#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:18,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {18747#(<= main_~k~0 7)} assume true; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:18,986 INFO L273 TraceCheckUtils]: 37: Hoare triple {18747#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:18,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {18747#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:18,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {18747#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:18,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {18748#(<= main_~k~0 8)} assume true; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:18,989 INFO L273 TraceCheckUtils]: 41: Hoare triple {18748#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:18,989 INFO L273 TraceCheckUtils]: 42: Hoare triple {18748#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:18,990 INFO L273 TraceCheckUtils]: 43: Hoare triple {18748#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:18,990 INFO L273 TraceCheckUtils]: 44: Hoare triple {18749#(<= main_~k~0 9)} assume true; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:18,991 INFO L273 TraceCheckUtils]: 45: Hoare triple {18749#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:18,991 INFO L273 TraceCheckUtils]: 46: Hoare triple {18749#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:18,992 INFO L273 TraceCheckUtils]: 47: Hoare triple {18749#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:18,993 INFO L273 TraceCheckUtils]: 48: Hoare triple {18750#(<= main_~k~0 10)} assume true; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:18,993 INFO L273 TraceCheckUtils]: 49: Hoare triple {18750#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:18,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {18750#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:18,994 INFO L273 TraceCheckUtils]: 51: Hoare triple {18750#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:18,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {18751#(<= main_~k~0 11)} assume true; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:18,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {18751#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:18,996 INFO L273 TraceCheckUtils]: 54: Hoare triple {18751#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:18,997 INFO L273 TraceCheckUtils]: 55: Hoare triple {18751#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:18,997 INFO L273 TraceCheckUtils]: 56: Hoare triple {18752#(<= main_~k~0 12)} assume true; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:18,998 INFO L273 TraceCheckUtils]: 57: Hoare triple {18752#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:18,998 INFO L273 TraceCheckUtils]: 58: Hoare triple {18752#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:18,999 INFO L273 TraceCheckUtils]: 59: Hoare triple {18752#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:18,999 INFO L273 TraceCheckUtils]: 60: Hoare triple {18753#(<= main_~k~0 13)} assume true; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,000 INFO L273 TraceCheckUtils]: 61: Hoare triple {18753#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,000 INFO L273 TraceCheckUtils]: 62: Hoare triple {18753#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,001 INFO L273 TraceCheckUtils]: 63: Hoare triple {18753#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {18754#(<= main_~k~0 14)} assume true; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {18754#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {18754#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {18754#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,004 INFO L273 TraceCheckUtils]: 68: Hoare triple {18755#(<= main_~k~0 15)} assume true; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,004 INFO L273 TraceCheckUtils]: 69: Hoare triple {18755#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,005 INFO L273 TraceCheckUtils]: 70: Hoare triple {18755#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,006 INFO L273 TraceCheckUtils]: 71: Hoare triple {18755#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,006 INFO L273 TraceCheckUtils]: 72: Hoare triple {18756#(<= main_~k~0 16)} assume true; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,007 INFO L273 TraceCheckUtils]: 73: Hoare triple {18756#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,007 INFO L273 TraceCheckUtils]: 74: Hoare triple {18756#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,008 INFO L273 TraceCheckUtils]: 75: Hoare triple {18756#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,008 INFO L273 TraceCheckUtils]: 76: Hoare triple {18757#(<= main_~k~0 17)} assume true; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,009 INFO L273 TraceCheckUtils]: 77: Hoare triple {18757#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,009 INFO L273 TraceCheckUtils]: 78: Hoare triple {18757#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,010 INFO L273 TraceCheckUtils]: 79: Hoare triple {18757#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,011 INFO L273 TraceCheckUtils]: 80: Hoare triple {18758#(<= main_~k~0 18)} assume true; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,011 INFO L273 TraceCheckUtils]: 81: Hoare triple {18758#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,012 INFO L273 TraceCheckUtils]: 82: Hoare triple {18758#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,012 INFO L273 TraceCheckUtils]: 83: Hoare triple {18758#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,013 INFO L273 TraceCheckUtils]: 84: Hoare triple {18759#(<= main_~k~0 19)} assume true; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,013 INFO L273 TraceCheckUtils]: 85: Hoare triple {18759#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,014 INFO L273 TraceCheckUtils]: 86: Hoare triple {18759#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,015 INFO L273 TraceCheckUtils]: 87: Hoare triple {18759#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,015 INFO L273 TraceCheckUtils]: 88: Hoare triple {18760#(<= main_~k~0 20)} assume true; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,016 INFO L273 TraceCheckUtils]: 89: Hoare triple {18760#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,016 INFO L273 TraceCheckUtils]: 90: Hoare triple {18760#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,017 INFO L273 TraceCheckUtils]: 91: Hoare triple {18760#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,018 INFO L273 TraceCheckUtils]: 92: Hoare triple {18761#(<= main_~k~0 21)} assume true; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {18761#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,019 INFO L273 TraceCheckUtils]: 94: Hoare triple {18761#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,019 INFO L273 TraceCheckUtils]: 95: Hoare triple {18761#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,020 INFO L273 TraceCheckUtils]: 96: Hoare triple {18762#(<= main_~k~0 22)} assume true; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,020 INFO L273 TraceCheckUtils]: 97: Hoare triple {18762#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,021 INFO L273 TraceCheckUtils]: 98: Hoare triple {18762#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,022 INFO L273 TraceCheckUtils]: 99: Hoare triple {18762#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {18763#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:19,022 INFO L273 TraceCheckUtils]: 100: Hoare triple {18763#(<= main_~k~0 23)} assume true; {18763#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:19,023 INFO L273 TraceCheckUtils]: 101: Hoare triple {18763#(<= main_~k~0 23)} assume !(~k~0 < 100000); {18738#false} is VALID [2018-11-18 22:44:19,023 INFO L273 TraceCheckUtils]: 102: Hoare triple {18738#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18738#false} is VALID [2018-11-18 22:44:19,023 INFO L273 TraceCheckUtils]: 103: Hoare triple {18738#false} ~x~0 := 0; {18738#false} is VALID [2018-11-18 22:44:19,023 INFO L273 TraceCheckUtils]: 104: Hoare triple {18738#false} assume true; {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L273 TraceCheckUtils]: 105: Hoare triple {18738#false} assume !(~x~0 < ~i~0); {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L273 TraceCheckUtils]: 106: Hoare triple {18738#false} ~x~0 := 1 + ~i~0; {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L273 TraceCheckUtils]: 107: Hoare triple {18738#false} assume true; {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L273 TraceCheckUtils]: 108: Hoare triple {18738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L256 TraceCheckUtils]: 109: Hoare triple {18738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18738#false} is VALID [2018-11-18 22:44:19,024 INFO L273 TraceCheckUtils]: 110: Hoare triple {18738#false} ~cond := #in~cond; {18738#false} is VALID [2018-11-18 22:44:19,025 INFO L273 TraceCheckUtils]: 111: Hoare triple {18738#false} assume 0 == ~cond; {18738#false} is VALID [2018-11-18 22:44:19,025 INFO L273 TraceCheckUtils]: 112: Hoare triple {18738#false} assume !false; {18738#false} is VALID [2018-11-18 22:44:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:19,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:19,037 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-18 22:44:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:44:19,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-11-18 22:44:19,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:19,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:19,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {18737#true} call ULTIMATE.init(); {18737#true} is VALID [2018-11-18 22:44:19,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {18737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18737#true} is VALID [2018-11-18 22:44:19,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {18737#true} assume true; {18737#true} is VALID [2018-11-18 22:44:19,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18737#true} {18737#true} #137#return; {18737#true} is VALID [2018-11-18 22:44:19,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {18737#true} call #t~ret15 := main(); {18737#true} is VALID [2018-11-18 22:44:19,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {18737#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18782#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:19,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {18782#(<= main_~i~0 0)} assume true; {18782#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:19,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {18782#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {18789#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:19,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {18789#(<= main_~k~0 0)} assume true; {18789#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:19,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {18789#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18789#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:19,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {18789#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18789#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:19,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {18789#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:19,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {18741#(<= main_~k~0 1)} assume true; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:19,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {18741#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:19,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {18741#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18741#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:19,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {18741#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:19,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {18742#(<= main_~k~0 2)} assume true; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:19,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {18742#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:19,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {18742#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18742#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:19,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {18742#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:19,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {18743#(<= main_~k~0 3)} assume true; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:19,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {18743#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:19,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {18743#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18743#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:19,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {18743#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:19,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {18744#(<= main_~k~0 4)} assume true; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:19,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {18744#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:19,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {18744#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18744#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:19,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {18744#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:19,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {18745#(<= main_~k~0 5)} assume true; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:19,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {18745#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:19,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {18745#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18745#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:19,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {18745#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:19,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {18746#(<= main_~k~0 6)} assume true; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:19,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {18746#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:19,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {18746#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18746#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:19,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {18746#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:19,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {18747#(<= main_~k~0 7)} assume true; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:19,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {18747#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:19,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {18747#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18747#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:19,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {18747#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:19,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {18748#(<= main_~k~0 8)} assume true; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:19,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {18748#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:19,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {18748#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18748#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:19,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {18748#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:19,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {18749#(<= main_~k~0 9)} assume true; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:19,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {18749#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:19,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {18749#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18749#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:19,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {18749#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:19,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {18750#(<= main_~k~0 10)} assume true; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:19,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {18750#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:19,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {18750#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18750#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:19,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {18750#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:19,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {18751#(<= main_~k~0 11)} assume true; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:19,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {18751#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:19,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {18751#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18751#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:19,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {18751#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:19,466 INFO L273 TraceCheckUtils]: 56: Hoare triple {18752#(<= main_~k~0 12)} assume true; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:19,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {18752#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:19,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {18752#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18752#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:19,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {18752#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {18753#(<= main_~k~0 13)} assume true; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {18753#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {18753#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18753#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:19,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {18753#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {18754#(<= main_~k~0 14)} assume true; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {18754#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {18754#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18754#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:19,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {18754#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {18755#(<= main_~k~0 15)} assume true; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {18755#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {18755#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18755#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:19,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {18755#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {18756#(<= main_~k~0 16)} assume true; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {18756#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {18756#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18756#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:19,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {18756#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {18757#(<= main_~k~0 17)} assume true; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,478 INFO L273 TraceCheckUtils]: 77: Hoare triple {18757#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {18757#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18757#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:19,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {18757#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,480 INFO L273 TraceCheckUtils]: 80: Hoare triple {18758#(<= main_~k~0 18)} assume true; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {18758#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {18758#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18758#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:19,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {18758#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {18759#(<= main_~k~0 19)} assume true; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {18759#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {18759#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18759#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:19,484 INFO L273 TraceCheckUtils]: 87: Hoare triple {18759#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,484 INFO L273 TraceCheckUtils]: 88: Hoare triple {18760#(<= main_~k~0 20)} assume true; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,485 INFO L273 TraceCheckUtils]: 89: Hoare triple {18760#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,485 INFO L273 TraceCheckUtils]: 90: Hoare triple {18760#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18760#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:19,486 INFO L273 TraceCheckUtils]: 91: Hoare triple {18760#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,487 INFO L273 TraceCheckUtils]: 92: Hoare triple {18761#(<= main_~k~0 21)} assume true; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,487 INFO L273 TraceCheckUtils]: 93: Hoare triple {18761#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,488 INFO L273 TraceCheckUtils]: 94: Hoare triple {18761#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18761#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:19,488 INFO L273 TraceCheckUtils]: 95: Hoare triple {18761#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {18762#(<= main_~k~0 22)} assume true; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,489 INFO L273 TraceCheckUtils]: 97: Hoare triple {18762#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,490 INFO L273 TraceCheckUtils]: 98: Hoare triple {18762#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18762#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:19,490 INFO L273 TraceCheckUtils]: 99: Hoare triple {18762#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {18763#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:19,491 INFO L273 TraceCheckUtils]: 100: Hoare triple {18763#(<= main_~k~0 23)} assume true; {18763#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:19,491 INFO L273 TraceCheckUtils]: 101: Hoare triple {18763#(<= main_~k~0 23)} assume !(~k~0 < 100000); {18738#false} is VALID [2018-11-18 22:44:19,492 INFO L273 TraceCheckUtils]: 102: Hoare triple {18738#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18738#false} is VALID [2018-11-18 22:44:19,492 INFO L273 TraceCheckUtils]: 103: Hoare triple {18738#false} ~x~0 := 0; {18738#false} is VALID [2018-11-18 22:44:19,492 INFO L273 TraceCheckUtils]: 104: Hoare triple {18738#false} assume true; {18738#false} is VALID [2018-11-18 22:44:19,492 INFO L273 TraceCheckUtils]: 105: Hoare triple {18738#false} assume !(~x~0 < ~i~0); {18738#false} is VALID [2018-11-18 22:44:19,492 INFO L273 TraceCheckUtils]: 106: Hoare triple {18738#false} ~x~0 := 1 + ~i~0; {18738#false} is VALID [2018-11-18 22:44:19,493 INFO L273 TraceCheckUtils]: 107: Hoare triple {18738#false} assume true; {18738#false} is VALID [2018-11-18 22:44:19,493 INFO L273 TraceCheckUtils]: 108: Hoare triple {18738#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18738#false} is VALID [2018-11-18 22:44:19,493 INFO L256 TraceCheckUtils]: 109: Hoare triple {18738#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18738#false} is VALID [2018-11-18 22:44:19,493 INFO L273 TraceCheckUtils]: 110: Hoare triple {18738#false} ~cond := #in~cond; {18738#false} is VALID [2018-11-18 22:44:19,493 INFO L273 TraceCheckUtils]: 111: Hoare triple {18738#false} assume 0 == ~cond; {18738#false} is VALID [2018-11-18 22:44:19,494 INFO L273 TraceCheckUtils]: 112: Hoare triple {18738#false} assume !false; {18738#false} is VALID [2018-11-18 22:44:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:19,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:19,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-11-18 22:44:19,522 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 113 [2018-11-18 22:44:19,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:19,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 22:44:19,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:19,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 22:44:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 22:44:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:44:19,627 INFO L87 Difference]: Start difference. First operand 148 states and 183 transitions. Second operand 29 states. [2018-11-18 22:44:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,022 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-11-18 22:44:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:44:21,023 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 113 [2018-11-18 22:44:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:44:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 245 transitions. [2018-11-18 22:44:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:44:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 245 transitions. [2018-11-18 22:44:21,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 245 transitions. [2018-11-18 22:44:21,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:21,308 INFO L225 Difference]: With dead ends: 203 [2018-11-18 22:44:21,309 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 22:44:21,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 22:44:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 22:44:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2018-11-18 22:44:21,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:21,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 152 states. [2018-11-18 22:44:21,387 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 152 states. [2018-11-18 22:44:21,387 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 152 states. [2018-11-18 22:44:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,390 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2018-11-18 22:44:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2018-11-18 22:44:21,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:21,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:21,391 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 161 states. [2018-11-18 22:44:21,391 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 161 states. [2018-11-18 22:44:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:21,393 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2018-11-18 22:44:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2018-11-18 22:44:21,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:21,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:21,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:21,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 22:44:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2018-11-18 22:44:21,397 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 113 [2018-11-18 22:44:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:21,397 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2018-11-18 22:44:21,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 22:44:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2018-11-18 22:44:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 22:44:21,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:21,398 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:21,398 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:21,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1300003965, now seen corresponding path program 13 times [2018-11-18 22:44:21,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:21,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:21,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {19929#true} call ULTIMATE.init(); {19929#true} is VALID [2018-11-18 22:44:21,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {19929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19929#true} is VALID [2018-11-18 22:44:21,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {19929#true} assume true; {19929#true} is VALID [2018-11-18 22:44:21,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19929#true} {19929#true} #137#return; {19929#true} is VALID [2018-11-18 22:44:21,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {19929#true} call #t~ret15 := main(); {19929#true} is VALID [2018-11-18 22:44:21,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {19929#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19931#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:21,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {19931#(= 0 main_~i~0)} assume true; {19931#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:21,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {19931#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {19932#(= main_~k~0 0)} is VALID [2018-11-18 22:44:21,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {19932#(= main_~k~0 0)} assume true; {19932#(= main_~k~0 0)} is VALID [2018-11-18 22:44:21,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {19932#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19932#(= main_~k~0 0)} is VALID [2018-11-18 22:44:21,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {19932#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19932#(= main_~k~0 0)} is VALID [2018-11-18 22:44:21,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {19932#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:21,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {19933#(<= main_~k~0 1)} assume true; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:21,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {19933#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:21,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {19933#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:21,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {19933#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:21,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {19934#(<= main_~k~0 2)} assume true; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:21,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {19934#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:21,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {19934#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:21,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {19934#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:21,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {19935#(<= main_~k~0 3)} assume true; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:21,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {19935#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:21,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {19935#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:21,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {19935#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:21,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {19936#(<= main_~k~0 4)} assume true; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:21,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {19936#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:21,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {19936#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:21,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {19936#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:21,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {19937#(<= main_~k~0 5)} assume true; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:21,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {19937#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:21,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {19937#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:21,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {19937#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:21,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {19938#(<= main_~k~0 6)} assume true; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:21,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {19938#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:21,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {19938#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:21,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {19938#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:21,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {19939#(<= main_~k~0 7)} assume true; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:21,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {19939#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:21,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {19939#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:21,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {19939#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:21,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {19940#(<= main_~k~0 8)} assume true; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:21,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {19940#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:21,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {19940#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:21,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {19940#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:21,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {19941#(<= main_~k~0 9)} assume true; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:21,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {19941#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:21,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {19941#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:21,889 INFO L273 TraceCheckUtils]: 47: Hoare triple {19941#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:21,889 INFO L273 TraceCheckUtils]: 48: Hoare triple {19942#(<= main_~k~0 10)} assume true; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:21,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {19942#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:21,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {19942#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:21,891 INFO L273 TraceCheckUtils]: 51: Hoare triple {19942#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:21,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {19943#(<= main_~k~0 11)} assume true; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:21,929 INFO L273 TraceCheckUtils]: 53: Hoare triple {19943#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:21,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {19943#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:21,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {19943#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:21,962 INFO L273 TraceCheckUtils]: 56: Hoare triple {19944#(<= main_~k~0 12)} assume true; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:21,977 INFO L273 TraceCheckUtils]: 57: Hoare triple {19944#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:21,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {19944#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:22,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {19944#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {19945#(<= main_~k~0 13)} assume true; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {19945#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,030 INFO L273 TraceCheckUtils]: 62: Hoare triple {19945#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,043 INFO L273 TraceCheckUtils]: 63: Hoare triple {19945#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,056 INFO L273 TraceCheckUtils]: 64: Hoare triple {19946#(<= main_~k~0 14)} assume true; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {19946#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {19946#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,091 INFO L273 TraceCheckUtils]: 67: Hoare triple {19946#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,103 INFO L273 TraceCheckUtils]: 68: Hoare triple {19947#(<= main_~k~0 15)} assume true; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,116 INFO L273 TraceCheckUtils]: 69: Hoare triple {19947#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,128 INFO L273 TraceCheckUtils]: 70: Hoare triple {19947#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {19947#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {19948#(<= main_~k~0 16)} assume true; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,167 INFO L273 TraceCheckUtils]: 73: Hoare triple {19948#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,180 INFO L273 TraceCheckUtils]: 74: Hoare triple {19948#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {19948#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,205 INFO L273 TraceCheckUtils]: 76: Hoare triple {19949#(<= main_~k~0 17)} assume true; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {19949#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,218 INFO L273 TraceCheckUtils]: 78: Hoare triple {19949#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,221 INFO L273 TraceCheckUtils]: 79: Hoare triple {19949#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,221 INFO L273 TraceCheckUtils]: 80: Hoare triple {19950#(<= main_~k~0 18)} assume true; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,221 INFO L273 TraceCheckUtils]: 81: Hoare triple {19950#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,222 INFO L273 TraceCheckUtils]: 82: Hoare triple {19950#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,222 INFO L273 TraceCheckUtils]: 83: Hoare triple {19950#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,222 INFO L273 TraceCheckUtils]: 84: Hoare triple {19951#(<= main_~k~0 19)} assume true; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,223 INFO L273 TraceCheckUtils]: 85: Hoare triple {19951#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,226 INFO L273 TraceCheckUtils]: 86: Hoare triple {19951#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,227 INFO L273 TraceCheckUtils]: 87: Hoare triple {19951#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,227 INFO L273 TraceCheckUtils]: 88: Hoare triple {19952#(<= main_~k~0 20)} assume true; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {19952#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,228 INFO L273 TraceCheckUtils]: 90: Hoare triple {19952#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,228 INFO L273 TraceCheckUtils]: 91: Hoare triple {19952#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,228 INFO L273 TraceCheckUtils]: 92: Hoare triple {19953#(<= main_~k~0 21)} assume true; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,229 INFO L273 TraceCheckUtils]: 93: Hoare triple {19953#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,229 INFO L273 TraceCheckUtils]: 94: Hoare triple {19953#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,229 INFO L273 TraceCheckUtils]: 95: Hoare triple {19953#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,230 INFO L273 TraceCheckUtils]: 96: Hoare triple {19954#(<= main_~k~0 22)} assume true; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,230 INFO L273 TraceCheckUtils]: 97: Hoare triple {19954#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,231 INFO L273 TraceCheckUtils]: 98: Hoare triple {19954#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,231 INFO L273 TraceCheckUtils]: 99: Hoare triple {19954#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,232 INFO L273 TraceCheckUtils]: 100: Hoare triple {19955#(<= main_~k~0 23)} assume true; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,232 INFO L273 TraceCheckUtils]: 101: Hoare triple {19955#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,233 INFO L273 TraceCheckUtils]: 102: Hoare triple {19955#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,234 INFO L273 TraceCheckUtils]: 103: Hoare triple {19955#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {19956#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:22,234 INFO L273 TraceCheckUtils]: 104: Hoare triple {19956#(<= main_~k~0 24)} assume true; {19956#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:22,235 INFO L273 TraceCheckUtils]: 105: Hoare triple {19956#(<= main_~k~0 24)} assume !(~k~0 < 100000); {19930#false} is VALID [2018-11-18 22:44:22,235 INFO L273 TraceCheckUtils]: 106: Hoare triple {19930#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19930#false} is VALID [2018-11-18 22:44:22,235 INFO L273 TraceCheckUtils]: 107: Hoare triple {19930#false} ~x~0 := 0; {19930#false} is VALID [2018-11-18 22:44:22,235 INFO L273 TraceCheckUtils]: 108: Hoare triple {19930#false} assume true; {19930#false} is VALID [2018-11-18 22:44:22,235 INFO L273 TraceCheckUtils]: 109: Hoare triple {19930#false} assume !(~x~0 < ~i~0); {19930#false} is VALID [2018-11-18 22:44:22,236 INFO L273 TraceCheckUtils]: 110: Hoare triple {19930#false} ~x~0 := 1 + ~i~0; {19930#false} is VALID [2018-11-18 22:44:22,236 INFO L273 TraceCheckUtils]: 111: Hoare triple {19930#false} assume true; {19930#false} is VALID [2018-11-18 22:44:22,236 INFO L273 TraceCheckUtils]: 112: Hoare triple {19930#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19930#false} is VALID [2018-11-18 22:44:22,236 INFO L256 TraceCheckUtils]: 113: Hoare triple {19930#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19930#false} is VALID [2018-11-18 22:44:22,236 INFO L273 TraceCheckUtils]: 114: Hoare triple {19930#false} ~cond := #in~cond; {19930#false} is VALID [2018-11-18 22:44:22,237 INFO L273 TraceCheckUtils]: 115: Hoare triple {19930#false} assume 0 == ~cond; {19930#false} is VALID [2018-11-18 22:44:22,237 INFO L273 TraceCheckUtils]: 116: Hoare triple {19930#false} assume !false; {19930#false} is VALID [2018-11-18 22:44:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:22,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:22,246 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-18 22:44:22,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:22,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:22,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {19929#true} call ULTIMATE.init(); {19929#true} is VALID [2018-11-18 22:44:22,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {19929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19929#true} is VALID [2018-11-18 22:44:22,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {19929#true} assume true; {19929#true} is VALID [2018-11-18 22:44:22,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19929#true} {19929#true} #137#return; {19929#true} is VALID [2018-11-18 22:44:22,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {19929#true} call #t~ret15 := main(); {19929#true} is VALID [2018-11-18 22:44:22,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {19929#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19975#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:22,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {19975#(<= main_~i~0 0)} assume true; {19975#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:22,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {19975#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {19982#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:22,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {19982#(<= main_~k~0 0)} assume true; {19982#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:22,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {19982#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19982#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:22,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {19982#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19982#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:22,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {19982#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:22,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {19933#(<= main_~k~0 1)} assume true; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:22,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {19933#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:22,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {19933#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19933#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:22,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {19933#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:22,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {19934#(<= main_~k~0 2)} assume true; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:22,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {19934#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:22,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {19934#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19934#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:22,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {19934#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:22,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {19935#(<= main_~k~0 3)} assume true; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:22,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {19935#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:22,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {19935#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19935#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:22,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {19935#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:22,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {19936#(<= main_~k~0 4)} assume true; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:22,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {19936#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:22,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {19936#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19936#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:22,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {19936#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:22,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {19937#(<= main_~k~0 5)} assume true; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:22,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {19937#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:22,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {19937#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19937#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:22,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {19937#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:22,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {19938#(<= main_~k~0 6)} assume true; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:22,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {19938#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:22,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {19938#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19938#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:22,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {19938#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:22,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {19939#(<= main_~k~0 7)} assume true; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:22,634 INFO L273 TraceCheckUtils]: 37: Hoare triple {19939#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:22,634 INFO L273 TraceCheckUtils]: 38: Hoare triple {19939#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19939#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:22,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {19939#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:22,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {19940#(<= main_~k~0 8)} assume true; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:22,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {19940#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:22,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {19940#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19940#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:22,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {19940#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:22,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {19941#(<= main_~k~0 9)} assume true; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:22,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {19941#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:22,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {19941#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19941#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:22,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {19941#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:22,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {19942#(<= main_~k~0 10)} assume true; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:22,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {19942#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:22,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {19942#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19942#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:22,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {19942#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:22,642 INFO L273 TraceCheckUtils]: 52: Hoare triple {19943#(<= main_~k~0 11)} assume true; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:22,642 INFO L273 TraceCheckUtils]: 53: Hoare triple {19943#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:22,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {19943#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19943#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:22,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {19943#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:22,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {19944#(<= main_~k~0 12)} assume true; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:22,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {19944#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:22,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {19944#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19944#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:22,645 INFO L273 TraceCheckUtils]: 59: Hoare triple {19944#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {19945#(<= main_~k~0 13)} assume true; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {19945#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,647 INFO L273 TraceCheckUtils]: 62: Hoare triple {19945#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19945#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:22,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {19945#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {19946#(<= main_~k~0 14)} assume true; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {19946#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {19946#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19946#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:22,650 INFO L273 TraceCheckUtils]: 67: Hoare triple {19946#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,650 INFO L273 TraceCheckUtils]: 68: Hoare triple {19947#(<= main_~k~0 15)} assume true; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,651 INFO L273 TraceCheckUtils]: 69: Hoare triple {19947#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,651 INFO L273 TraceCheckUtils]: 70: Hoare triple {19947#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19947#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:22,652 INFO L273 TraceCheckUtils]: 71: Hoare triple {19947#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,652 INFO L273 TraceCheckUtils]: 72: Hoare triple {19948#(<= main_~k~0 16)} assume true; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,653 INFO L273 TraceCheckUtils]: 73: Hoare triple {19948#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,653 INFO L273 TraceCheckUtils]: 74: Hoare triple {19948#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19948#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:22,654 INFO L273 TraceCheckUtils]: 75: Hoare triple {19948#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {19949#(<= main_~k~0 17)} assume true; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {19949#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {19949#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19949#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:22,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {19949#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,657 INFO L273 TraceCheckUtils]: 80: Hoare triple {19950#(<= main_~k~0 18)} assume true; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {19950#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,658 INFO L273 TraceCheckUtils]: 82: Hoare triple {19950#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19950#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:22,659 INFO L273 TraceCheckUtils]: 83: Hoare triple {19950#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {19951#(<= main_~k~0 19)} assume true; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,665 INFO L273 TraceCheckUtils]: 85: Hoare triple {19951#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,666 INFO L273 TraceCheckUtils]: 86: Hoare triple {19951#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19951#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:22,666 INFO L273 TraceCheckUtils]: 87: Hoare triple {19951#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,667 INFO L273 TraceCheckUtils]: 88: Hoare triple {19952#(<= main_~k~0 20)} assume true; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,667 INFO L273 TraceCheckUtils]: 89: Hoare triple {19952#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,667 INFO L273 TraceCheckUtils]: 90: Hoare triple {19952#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19952#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:22,668 INFO L273 TraceCheckUtils]: 91: Hoare triple {19952#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,668 INFO L273 TraceCheckUtils]: 92: Hoare triple {19953#(<= main_~k~0 21)} assume true; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,668 INFO L273 TraceCheckUtils]: 93: Hoare triple {19953#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,668 INFO L273 TraceCheckUtils]: 94: Hoare triple {19953#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19953#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:22,669 INFO L273 TraceCheckUtils]: 95: Hoare triple {19953#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,669 INFO L273 TraceCheckUtils]: 96: Hoare triple {19954#(<= main_~k~0 22)} assume true; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,670 INFO L273 TraceCheckUtils]: 97: Hoare triple {19954#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,670 INFO L273 TraceCheckUtils]: 98: Hoare triple {19954#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19954#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:22,671 INFO L273 TraceCheckUtils]: 99: Hoare triple {19954#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,672 INFO L273 TraceCheckUtils]: 100: Hoare triple {19955#(<= main_~k~0 23)} assume true; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,672 INFO L273 TraceCheckUtils]: 101: Hoare triple {19955#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,673 INFO L273 TraceCheckUtils]: 102: Hoare triple {19955#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19955#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:22,673 INFO L273 TraceCheckUtils]: 103: Hoare triple {19955#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {19956#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:22,674 INFO L273 TraceCheckUtils]: 104: Hoare triple {19956#(<= main_~k~0 24)} assume true; {19956#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:22,675 INFO L273 TraceCheckUtils]: 105: Hoare triple {19956#(<= main_~k~0 24)} assume !(~k~0 < 100000); {19930#false} is VALID [2018-11-18 22:44:22,675 INFO L273 TraceCheckUtils]: 106: Hoare triple {19930#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19930#false} is VALID [2018-11-18 22:44:22,675 INFO L273 TraceCheckUtils]: 107: Hoare triple {19930#false} ~x~0 := 0; {19930#false} is VALID [2018-11-18 22:44:22,675 INFO L273 TraceCheckUtils]: 108: Hoare triple {19930#false} assume true; {19930#false} is VALID [2018-11-18 22:44:22,675 INFO L273 TraceCheckUtils]: 109: Hoare triple {19930#false} assume !(~x~0 < ~i~0); {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L273 TraceCheckUtils]: 110: Hoare triple {19930#false} ~x~0 := 1 + ~i~0; {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L273 TraceCheckUtils]: 111: Hoare triple {19930#false} assume true; {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L273 TraceCheckUtils]: 112: Hoare triple {19930#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L256 TraceCheckUtils]: 113: Hoare triple {19930#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L273 TraceCheckUtils]: 114: Hoare triple {19930#false} ~cond := #in~cond; {19930#false} is VALID [2018-11-18 22:44:22,676 INFO L273 TraceCheckUtils]: 115: Hoare triple {19930#false} assume 0 == ~cond; {19930#false} is VALID [2018-11-18 22:44:22,677 INFO L273 TraceCheckUtils]: 116: Hoare triple {19930#false} assume !false; {19930#false} is VALID [2018-11-18 22:44:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:22,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:22,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2018-11-18 22:44:22,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 117 [2018-11-18 22:44:22,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:22,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:44:22,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:22,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:44:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:44:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:44:22,843 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand 30 states. [2018-11-18 22:44:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,040 INFO L93 Difference]: Finished difference Result 207 states and 259 transitions. [2018-11-18 22:44:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:44:25,040 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 117 [2018-11-18 22:44:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:44:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 250 transitions. [2018-11-18 22:44:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:44:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 250 transitions. [2018-11-18 22:44:25,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 250 transitions. [2018-11-18 22:44:25,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:25,272 INFO L225 Difference]: With dead ends: 207 [2018-11-18 22:44:25,273 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 22:44:25,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 22:44:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 22:44:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2018-11-18 22:44:25,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:25,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 156 states. [2018-11-18 22:44:25,369 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 156 states. [2018-11-18 22:44:25,369 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 156 states. [2018-11-18 22:44:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,373 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2018-11-18 22:44:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2018-11-18 22:44:25,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:25,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:25,374 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 165 states. [2018-11-18 22:44:25,374 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 165 states. [2018-11-18 22:44:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:25,377 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2018-11-18 22:44:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2018-11-18 22:44:25,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:25,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:25,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:25,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 22:44:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2018-11-18 22:44:25,380 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 117 [2018-11-18 22:44:25,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:25,381 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2018-11-18 22:44:25,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:44:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2018-11-18 22:44:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 22:44:25,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:25,382 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:25,382 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:25,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -349457575, now seen corresponding path program 14 times [2018-11-18 22:44:25,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:25,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:25,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {21154#true} call ULTIMATE.init(); {21154#true} is VALID [2018-11-18 22:44:25,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {21154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21154#true} is VALID [2018-11-18 22:44:25,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {21154#true} assume true; {21154#true} is VALID [2018-11-18 22:44:25,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21154#true} {21154#true} #137#return; {21154#true} is VALID [2018-11-18 22:44:25,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {21154#true} call #t~ret15 := main(); {21154#true} is VALID [2018-11-18 22:44:25,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {21154#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21156#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:25,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {21156#(= 0 main_~i~0)} assume true; {21156#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:25,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {21156#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {21157#(= main_~k~0 0)} is VALID [2018-11-18 22:44:25,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {21157#(= main_~k~0 0)} assume true; {21157#(= main_~k~0 0)} is VALID [2018-11-18 22:44:25,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {21157#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21157#(= main_~k~0 0)} is VALID [2018-11-18 22:44:25,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {21157#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21157#(= main_~k~0 0)} is VALID [2018-11-18 22:44:25,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {21157#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:25,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {21158#(<= main_~k~0 1)} assume true; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:25,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {21158#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:25,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {21158#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:25,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {21158#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:25,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {21159#(<= main_~k~0 2)} assume true; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:25,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {21159#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:25,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {21159#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:25,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {21159#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:25,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {21160#(<= main_~k~0 3)} assume true; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:25,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {21160#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:25,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {21160#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:25,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {21160#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:25,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {21161#(<= main_~k~0 4)} assume true; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:25,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {21161#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:25,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {21161#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:25,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {21161#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:25,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {21162#(<= main_~k~0 5)} assume true; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:25,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {21162#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:25,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {21162#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:25,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {21162#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:25,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {21163#(<= main_~k~0 6)} assume true; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:25,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {21163#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:25,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {21163#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:25,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {21163#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:25,989 INFO L273 TraceCheckUtils]: 36: Hoare triple {21164#(<= main_~k~0 7)} assume true; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:25,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {21164#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:25,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {21164#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:25,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {21164#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:25,991 INFO L273 TraceCheckUtils]: 40: Hoare triple {21165#(<= main_~k~0 8)} assume true; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:25,992 INFO L273 TraceCheckUtils]: 41: Hoare triple {21165#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:25,992 INFO L273 TraceCheckUtils]: 42: Hoare triple {21165#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:25,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {21165#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:25,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {21166#(<= main_~k~0 9)} assume true; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:25,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {21166#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:25,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {21166#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:25,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {21166#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:25,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {21167#(<= main_~k~0 10)} assume true; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:25,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {21167#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:25,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {21167#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:25,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {21167#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:25,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {21168#(<= main_~k~0 11)} assume true; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:25,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {21168#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:25,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {21168#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:26,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {21168#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {21169#(<= main_~k~0 12)} assume true; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {21169#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {21169#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {21169#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {21170#(<= main_~k~0 13)} assume true; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {21170#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {21170#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,005 INFO L273 TraceCheckUtils]: 63: Hoare triple {21170#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {21171#(<= main_~k~0 14)} assume true; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {21171#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {21171#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,007 INFO L273 TraceCheckUtils]: 67: Hoare triple {21171#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {21172#(<= main_~k~0 15)} assume true; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {21172#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {21172#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {21172#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,010 INFO L273 TraceCheckUtils]: 72: Hoare triple {21173#(<= main_~k~0 16)} assume true; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {21173#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {21173#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {21173#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,012 INFO L273 TraceCheckUtils]: 76: Hoare triple {21174#(<= main_~k~0 17)} assume true; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {21174#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,013 INFO L273 TraceCheckUtils]: 78: Hoare triple {21174#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {21174#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {21175#(<= main_~k~0 18)} assume true; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,014 INFO L273 TraceCheckUtils]: 81: Hoare triple {21175#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {21175#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,016 INFO L273 TraceCheckUtils]: 83: Hoare triple {21175#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,016 INFO L273 TraceCheckUtils]: 84: Hoare triple {21176#(<= main_~k~0 19)} assume true; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {21176#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {21176#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,018 INFO L273 TraceCheckUtils]: 87: Hoare triple {21176#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {21177#(<= main_~k~0 20)} assume true; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,019 INFO L273 TraceCheckUtils]: 89: Hoare triple {21177#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,019 INFO L273 TraceCheckUtils]: 90: Hoare triple {21177#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,020 INFO L273 TraceCheckUtils]: 91: Hoare triple {21177#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,021 INFO L273 TraceCheckUtils]: 92: Hoare triple {21178#(<= main_~k~0 21)} assume true; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {21178#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,022 INFO L273 TraceCheckUtils]: 94: Hoare triple {21178#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,022 INFO L273 TraceCheckUtils]: 95: Hoare triple {21178#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,023 INFO L273 TraceCheckUtils]: 96: Hoare triple {21179#(<= main_~k~0 22)} assume true; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,023 INFO L273 TraceCheckUtils]: 97: Hoare triple {21179#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,024 INFO L273 TraceCheckUtils]: 98: Hoare triple {21179#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,025 INFO L273 TraceCheckUtils]: 99: Hoare triple {21179#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,025 INFO L273 TraceCheckUtils]: 100: Hoare triple {21180#(<= main_~k~0 23)} assume true; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,045 INFO L273 TraceCheckUtils]: 101: Hoare triple {21180#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,058 INFO L273 TraceCheckUtils]: 102: Hoare triple {21180#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,067 INFO L273 TraceCheckUtils]: 103: Hoare triple {21180#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,067 INFO L273 TraceCheckUtils]: 104: Hoare triple {21181#(<= main_~k~0 24)} assume true; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,068 INFO L273 TraceCheckUtils]: 105: Hoare triple {21181#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,068 INFO L273 TraceCheckUtils]: 106: Hoare triple {21181#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,068 INFO L273 TraceCheckUtils]: 107: Hoare triple {21181#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {21182#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:26,069 INFO L273 TraceCheckUtils]: 108: Hoare triple {21182#(<= main_~k~0 25)} assume true; {21182#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:26,069 INFO L273 TraceCheckUtils]: 109: Hoare triple {21182#(<= main_~k~0 25)} assume !(~k~0 < 100000); {21155#false} is VALID [2018-11-18 22:44:26,069 INFO L273 TraceCheckUtils]: 110: Hoare triple {21155#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#false} is VALID [2018-11-18 22:44:26,069 INFO L273 TraceCheckUtils]: 111: Hoare triple {21155#false} ~x~0 := 0; {21155#false} is VALID [2018-11-18 22:44:26,069 INFO L273 TraceCheckUtils]: 112: Hoare triple {21155#false} assume true; {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 113: Hoare triple {21155#false} assume !(~x~0 < ~i~0); {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 114: Hoare triple {21155#false} ~x~0 := 1 + ~i~0; {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 115: Hoare triple {21155#false} assume true; {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 116: Hoare triple {21155#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L256 TraceCheckUtils]: 117: Hoare triple {21155#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 118: Hoare triple {21155#false} ~cond := #in~cond; {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 119: Hoare triple {21155#false} assume 0 == ~cond; {21155#false} is VALID [2018-11-18 22:44:26,070 INFO L273 TraceCheckUtils]: 120: Hoare triple {21155#false} assume !false; {21155#false} is VALID [2018-11-18 22:44:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:26,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:26,080 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-18 22:44:26,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:44:26,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:44:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:26,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:26,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {21154#true} call ULTIMATE.init(); {21154#true} is VALID [2018-11-18 22:44:26,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {21154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21154#true} is VALID [2018-11-18 22:44:26,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {21154#true} assume true; {21154#true} is VALID [2018-11-18 22:44:26,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21154#true} {21154#true} #137#return; {21154#true} is VALID [2018-11-18 22:44:26,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {21154#true} call #t~ret15 := main(); {21154#true} is VALID [2018-11-18 22:44:26,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {21154#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21201#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:26,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {21201#(<= main_~i~0 0)} assume true; {21201#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:26,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {21201#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {21208#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:26,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {21208#(<= main_~k~0 0)} assume true; {21208#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:26,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {21208#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21208#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:26,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {21208#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21208#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:26,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {21208#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:26,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {21158#(<= main_~k~0 1)} assume true; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:26,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {21158#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:26,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {21158#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21158#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:26,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {21158#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:26,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {21159#(<= main_~k~0 2)} assume true; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:26,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {21159#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:26,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {21159#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21159#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:26,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {21159#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:26,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {21160#(<= main_~k~0 3)} assume true; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:26,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {21160#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:26,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {21160#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21160#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:26,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {21160#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:26,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {21161#(<= main_~k~0 4)} assume true; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:26,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {21161#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:26,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {21161#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21161#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:26,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {21161#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:26,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {21162#(<= main_~k~0 5)} assume true; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:26,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {21162#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:26,428 INFO L273 TraceCheckUtils]: 30: Hoare triple {21162#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21162#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:26,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {21162#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:26,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {21163#(<= main_~k~0 6)} assume true; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:26,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {21163#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:26,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {21163#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21163#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:26,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {21163#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:26,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {21164#(<= main_~k~0 7)} assume true; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:26,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {21164#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:26,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {21164#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21164#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:26,433 INFO L273 TraceCheckUtils]: 39: Hoare triple {21164#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:26,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {21165#(<= main_~k~0 8)} assume true; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:26,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {21165#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:26,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {21165#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21165#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:26,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {21165#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:26,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {21166#(<= main_~k~0 9)} assume true; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:26,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {21166#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:26,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {21166#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21166#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:26,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {21166#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:26,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {21167#(<= main_~k~0 10)} assume true; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:26,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {21167#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:26,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {21167#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21167#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:26,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {21167#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:26,440 INFO L273 TraceCheckUtils]: 52: Hoare triple {21168#(<= main_~k~0 11)} assume true; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:26,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {21168#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:26,441 INFO L273 TraceCheckUtils]: 54: Hoare triple {21168#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21168#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:26,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {21168#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {21169#(<= main_~k~0 12)} assume true; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {21169#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {21169#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21169#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:26,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {21169#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {21170#(<= main_~k~0 13)} assume true; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {21170#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {21170#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21170#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:26,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {21170#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {21171#(<= main_~k~0 14)} assume true; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {21171#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {21171#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21171#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:26,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {21171#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {21172#(<= main_~k~0 15)} assume true; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {21172#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {21172#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21172#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:26,451 INFO L273 TraceCheckUtils]: 71: Hoare triple {21172#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {21173#(<= main_~k~0 16)} assume true; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,452 INFO L273 TraceCheckUtils]: 73: Hoare triple {21173#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {21173#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21173#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:26,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {21173#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {21174#(<= main_~k~0 17)} assume true; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,454 INFO L273 TraceCheckUtils]: 77: Hoare triple {21174#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {21174#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21174#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:26,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {21174#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {21175#(<= main_~k~0 18)} assume true; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,456 INFO L273 TraceCheckUtils]: 81: Hoare triple {21175#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,457 INFO L273 TraceCheckUtils]: 82: Hoare triple {21175#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21175#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:26,457 INFO L273 TraceCheckUtils]: 83: Hoare triple {21175#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,458 INFO L273 TraceCheckUtils]: 84: Hoare triple {21176#(<= main_~k~0 19)} assume true; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,458 INFO L273 TraceCheckUtils]: 85: Hoare triple {21176#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,459 INFO L273 TraceCheckUtils]: 86: Hoare triple {21176#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21176#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:26,459 INFO L273 TraceCheckUtils]: 87: Hoare triple {21176#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,460 INFO L273 TraceCheckUtils]: 88: Hoare triple {21177#(<= main_~k~0 20)} assume true; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {21177#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {21177#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21177#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:26,462 INFO L273 TraceCheckUtils]: 91: Hoare triple {21177#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,462 INFO L273 TraceCheckUtils]: 92: Hoare triple {21178#(<= main_~k~0 21)} assume true; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,463 INFO L273 TraceCheckUtils]: 93: Hoare triple {21178#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,463 INFO L273 TraceCheckUtils]: 94: Hoare triple {21178#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21178#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:26,464 INFO L273 TraceCheckUtils]: 95: Hoare triple {21178#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,464 INFO L273 TraceCheckUtils]: 96: Hoare triple {21179#(<= main_~k~0 22)} assume true; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,465 INFO L273 TraceCheckUtils]: 97: Hoare triple {21179#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,465 INFO L273 TraceCheckUtils]: 98: Hoare triple {21179#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21179#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:26,466 INFO L273 TraceCheckUtils]: 99: Hoare triple {21179#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,467 INFO L273 TraceCheckUtils]: 100: Hoare triple {21180#(<= main_~k~0 23)} assume true; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,467 INFO L273 TraceCheckUtils]: 101: Hoare triple {21180#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,468 INFO L273 TraceCheckUtils]: 102: Hoare triple {21180#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21180#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:26,468 INFO L273 TraceCheckUtils]: 103: Hoare triple {21180#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,469 INFO L273 TraceCheckUtils]: 104: Hoare triple {21181#(<= main_~k~0 24)} assume true; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,469 INFO L273 TraceCheckUtils]: 105: Hoare triple {21181#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,470 INFO L273 TraceCheckUtils]: 106: Hoare triple {21181#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21181#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:26,470 INFO L273 TraceCheckUtils]: 107: Hoare triple {21181#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {21182#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:26,471 INFO L273 TraceCheckUtils]: 108: Hoare triple {21182#(<= main_~k~0 25)} assume true; {21182#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:26,472 INFO L273 TraceCheckUtils]: 109: Hoare triple {21182#(<= main_~k~0 25)} assume !(~k~0 < 100000); {21155#false} is VALID [2018-11-18 22:44:26,472 INFO L273 TraceCheckUtils]: 110: Hoare triple {21155#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#false} is VALID [2018-11-18 22:44:26,472 INFO L273 TraceCheckUtils]: 111: Hoare triple {21155#false} ~x~0 := 0; {21155#false} is VALID [2018-11-18 22:44:26,472 INFO L273 TraceCheckUtils]: 112: Hoare triple {21155#false} assume true; {21155#false} is VALID [2018-11-18 22:44:26,472 INFO L273 TraceCheckUtils]: 113: Hoare triple {21155#false} assume !(~x~0 < ~i~0); {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L273 TraceCheckUtils]: 114: Hoare triple {21155#false} ~x~0 := 1 + ~i~0; {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L273 TraceCheckUtils]: 115: Hoare triple {21155#false} assume true; {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L273 TraceCheckUtils]: 116: Hoare triple {21155#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L256 TraceCheckUtils]: 117: Hoare triple {21155#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L273 TraceCheckUtils]: 118: Hoare triple {21155#false} ~cond := #in~cond; {21155#false} is VALID [2018-11-18 22:44:26,473 INFO L273 TraceCheckUtils]: 119: Hoare triple {21155#false} assume 0 == ~cond; {21155#false} is VALID [2018-11-18 22:44:26,474 INFO L273 TraceCheckUtils]: 120: Hoare triple {21155#false} assume !false; {21155#false} is VALID [2018-11-18 22:44:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:26,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:26,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-11-18 22:44:26,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2018-11-18 22:44:26,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:26,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 22:44:26,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:26,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 22:44:26,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 22:44:26,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:44:26,614 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand 31 states. [2018-11-18 22:44:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:28,873 INFO L93 Difference]: Finished difference Result 211 states and 264 transitions. [2018-11-18 22:44:28,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 22:44:28,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2018-11-18 22:44:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:44:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2018-11-18 22:44:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:44:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2018-11-18 22:44:28,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 255 transitions. [2018-11-18 22:44:29,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:29,122 INFO L225 Difference]: With dead ends: 211 [2018-11-18 22:44:29,122 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 22:44:29,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 22:44:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 22:44:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2018-11-18 22:44:29,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:29,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 160 states. [2018-11-18 22:44:29,494 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 160 states. [2018-11-18 22:44:29,494 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 160 states. [2018-11-18 22:44:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:29,498 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2018-11-18 22:44:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2018-11-18 22:44:29,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:29,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:29,499 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 169 states. [2018-11-18 22:44:29,499 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 169 states. [2018-11-18 22:44:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:29,502 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2018-11-18 22:44:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2018-11-18 22:44:29,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:29,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:29,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:29,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 22:44:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2018-11-18 22:44:29,508 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 121 [2018-11-18 22:44:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:29,508 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2018-11-18 22:44:29,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 22:44:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2018-11-18 22:44:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 22:44:29,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:29,509 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:29,509 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:29,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 837552175, now seen corresponding path program 15 times [2018-11-18 22:44:29,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:29,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:29,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:29,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:30,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {22412#true} call ULTIMATE.init(); {22412#true} is VALID [2018-11-18 22:44:30,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {22412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22412#true} is VALID [2018-11-18 22:44:30,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {22412#true} assume true; {22412#true} is VALID [2018-11-18 22:44:30,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22412#true} {22412#true} #137#return; {22412#true} is VALID [2018-11-18 22:44:30,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {22412#true} call #t~ret15 := main(); {22412#true} is VALID [2018-11-18 22:44:30,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {22412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22414#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:30,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {22414#(= 0 main_~i~0)} assume true; {22414#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:30,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {22414#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {22415#(= main_~k~0 0)} is VALID [2018-11-18 22:44:30,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {22415#(= main_~k~0 0)} assume true; {22415#(= main_~k~0 0)} is VALID [2018-11-18 22:44:30,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {22415#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22415#(= main_~k~0 0)} is VALID [2018-11-18 22:44:30,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {22415#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22415#(= main_~k~0 0)} is VALID [2018-11-18 22:44:30,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {22415#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {22416#(<= main_~k~0 1)} assume true; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {22416#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {22416#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {22416#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {22417#(<= main_~k~0 2)} assume true; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {22417#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {22417#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {22417#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {22418#(<= main_~k~0 3)} assume true; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {22418#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {22418#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {22418#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {22419#(<= main_~k~0 4)} assume true; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {22419#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {22419#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {22419#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {22420#(<= main_~k~0 5)} assume true; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {22420#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {22420#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {22420#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {22421#(<= main_~k~0 6)} assume true; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {22421#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {22421#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {22421#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {22422#(<= main_~k~0 7)} assume true; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {22422#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {22422#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {22422#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {22423#(<= main_~k~0 8)} assume true; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {22423#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {22423#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,054 INFO L273 TraceCheckUtils]: 43: Hoare triple {22423#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {22424#(<= main_~k~0 9)} assume true; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {22424#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {22424#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {22424#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {22425#(<= main_~k~0 10)} assume true; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {22425#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,058 INFO L273 TraceCheckUtils]: 50: Hoare triple {22425#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,058 INFO L273 TraceCheckUtils]: 51: Hoare triple {22425#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,059 INFO L273 TraceCheckUtils]: 52: Hoare triple {22426#(<= main_~k~0 11)} assume true; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,059 INFO L273 TraceCheckUtils]: 53: Hoare triple {22426#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,060 INFO L273 TraceCheckUtils]: 54: Hoare triple {22426#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {22426#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,061 INFO L273 TraceCheckUtils]: 56: Hoare triple {22427#(<= main_~k~0 12)} assume true; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {22427#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,062 INFO L273 TraceCheckUtils]: 58: Hoare triple {22427#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,063 INFO L273 TraceCheckUtils]: 59: Hoare triple {22427#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,063 INFO L273 TraceCheckUtils]: 60: Hoare triple {22428#(<= main_~k~0 13)} assume true; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,064 INFO L273 TraceCheckUtils]: 61: Hoare triple {22428#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,064 INFO L273 TraceCheckUtils]: 62: Hoare triple {22428#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {22428#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {22429#(<= main_~k~0 14)} assume true; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,066 INFO L273 TraceCheckUtils]: 65: Hoare triple {22429#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,066 INFO L273 TraceCheckUtils]: 66: Hoare triple {22429#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,067 INFO L273 TraceCheckUtils]: 67: Hoare triple {22429#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,068 INFO L273 TraceCheckUtils]: 68: Hoare triple {22430#(<= main_~k~0 15)} assume true; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {22430#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {22430#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {22430#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,070 INFO L273 TraceCheckUtils]: 72: Hoare triple {22431#(<= main_~k~0 16)} assume true; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,070 INFO L273 TraceCheckUtils]: 73: Hoare triple {22431#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {22431#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {22431#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,072 INFO L273 TraceCheckUtils]: 76: Hoare triple {22432#(<= main_~k~0 17)} assume true; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,073 INFO L273 TraceCheckUtils]: 77: Hoare triple {22432#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {22432#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,074 INFO L273 TraceCheckUtils]: 79: Hoare triple {22432#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,074 INFO L273 TraceCheckUtils]: 80: Hoare triple {22433#(<= main_~k~0 18)} assume true; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {22433#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {22433#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,076 INFO L273 TraceCheckUtils]: 83: Hoare triple {22433#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,077 INFO L273 TraceCheckUtils]: 84: Hoare triple {22434#(<= main_~k~0 19)} assume true; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,077 INFO L273 TraceCheckUtils]: 85: Hoare triple {22434#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {22434#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {22434#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {22435#(<= main_~k~0 20)} assume true; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {22435#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,080 INFO L273 TraceCheckUtils]: 90: Hoare triple {22435#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {22435#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {22436#(<= main_~k~0 21)} assume true; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {22436#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {22436#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {22436#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,083 INFO L273 TraceCheckUtils]: 96: Hoare triple {22437#(<= main_~k~0 22)} assume true; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,084 INFO L273 TraceCheckUtils]: 97: Hoare triple {22437#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,084 INFO L273 TraceCheckUtils]: 98: Hoare triple {22437#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,085 INFO L273 TraceCheckUtils]: 99: Hoare triple {22437#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,086 INFO L273 TraceCheckUtils]: 100: Hoare triple {22438#(<= main_~k~0 23)} assume true; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,086 INFO L273 TraceCheckUtils]: 101: Hoare triple {22438#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,086 INFO L273 TraceCheckUtils]: 102: Hoare triple {22438#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {22438#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,088 INFO L273 TraceCheckUtils]: 104: Hoare triple {22439#(<= main_~k~0 24)} assume true; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,088 INFO L273 TraceCheckUtils]: 105: Hoare triple {22439#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,089 INFO L273 TraceCheckUtils]: 106: Hoare triple {22439#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,089 INFO L273 TraceCheckUtils]: 107: Hoare triple {22439#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,090 INFO L273 TraceCheckUtils]: 108: Hoare triple {22440#(<= main_~k~0 25)} assume true; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,090 INFO L273 TraceCheckUtils]: 109: Hoare triple {22440#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,091 INFO L273 TraceCheckUtils]: 110: Hoare triple {22440#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,092 INFO L273 TraceCheckUtils]: 111: Hoare triple {22440#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {22441#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:30,092 INFO L273 TraceCheckUtils]: 112: Hoare triple {22441#(<= main_~k~0 26)} assume true; {22441#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:30,093 INFO L273 TraceCheckUtils]: 113: Hoare triple {22441#(<= main_~k~0 26)} assume !(~k~0 < 100000); {22413#false} is VALID [2018-11-18 22:44:30,093 INFO L273 TraceCheckUtils]: 114: Hoare triple {22413#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22413#false} is VALID [2018-11-18 22:44:30,093 INFO L273 TraceCheckUtils]: 115: Hoare triple {22413#false} ~x~0 := 0; {22413#false} is VALID [2018-11-18 22:44:30,093 INFO L273 TraceCheckUtils]: 116: Hoare triple {22413#false} assume true; {22413#false} is VALID [2018-11-18 22:44:30,094 INFO L273 TraceCheckUtils]: 117: Hoare triple {22413#false} assume !(~x~0 < ~i~0); {22413#false} is VALID [2018-11-18 22:44:30,094 INFO L273 TraceCheckUtils]: 118: Hoare triple {22413#false} ~x~0 := 1 + ~i~0; {22413#false} is VALID [2018-11-18 22:44:30,094 INFO L273 TraceCheckUtils]: 119: Hoare triple {22413#false} assume true; {22413#false} is VALID [2018-11-18 22:44:30,094 INFO L273 TraceCheckUtils]: 120: Hoare triple {22413#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22413#false} is VALID [2018-11-18 22:44:30,094 INFO L256 TraceCheckUtils]: 121: Hoare triple {22413#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22413#false} is VALID [2018-11-18 22:44:30,095 INFO L273 TraceCheckUtils]: 122: Hoare triple {22413#false} ~cond := #in~cond; {22413#false} is VALID [2018-11-18 22:44:30,095 INFO L273 TraceCheckUtils]: 123: Hoare triple {22413#false} assume 0 == ~cond; {22413#false} is VALID [2018-11-18 22:44:30,095 INFO L273 TraceCheckUtils]: 124: Hoare triple {22413#false} assume !false; {22413#false} is VALID [2018-11-18 22:44:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:30,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:30,105 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-18 22:44:30,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:44:30,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-18 22:44:30,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:30,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:30,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {22412#true} call ULTIMATE.init(); {22412#true} is VALID [2018-11-18 22:44:30,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {22412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22412#true} is VALID [2018-11-18 22:44:30,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {22412#true} assume true; {22412#true} is VALID [2018-11-18 22:44:30,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22412#true} {22412#true} #137#return; {22412#true} is VALID [2018-11-18 22:44:30,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {22412#true} call #t~ret15 := main(); {22412#true} is VALID [2018-11-18 22:44:30,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {22412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22460#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:30,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {22460#(<= main_~i~0 0)} assume true; {22460#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:30,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {22460#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {22467#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:30,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {22467#(<= main_~k~0 0)} assume true; {22467#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:30,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {22467#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22467#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:30,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {22467#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22467#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:30,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {22467#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {22416#(<= main_~k~0 1)} assume true; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {22416#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {22416#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22416#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:30,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {22416#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {22417#(<= main_~k~0 2)} assume true; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {22417#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {22417#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22417#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:30,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {22417#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {22418#(<= main_~k~0 3)} assume true; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {22418#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {22418#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22418#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:30,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {22418#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {22419#(<= main_~k~0 4)} assume true; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {22419#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {22419#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22419#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:30,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {22419#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {22420#(<= main_~k~0 5)} assume true; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {22420#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {22420#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22420#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:30,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {22420#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {22421#(<= main_~k~0 6)} assume true; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {22421#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {22421#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22421#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:30,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {22421#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {22422#(<= main_~k~0 7)} assume true; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {22422#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {22422#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22422#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:30,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {22422#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {22423#(<= main_~k~0 8)} assume true; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {22423#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {22423#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22423#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:30,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {22423#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {22424#(<= main_~k~0 9)} assume true; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,559 INFO L273 TraceCheckUtils]: 45: Hoare triple {22424#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {22424#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22424#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:30,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {22424#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {22425#(<= main_~k~0 10)} assume true; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {22425#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {22425#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22425#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:30,562 INFO L273 TraceCheckUtils]: 51: Hoare triple {22425#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,562 INFO L273 TraceCheckUtils]: 52: Hoare triple {22426#(<= main_~k~0 11)} assume true; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,563 INFO L273 TraceCheckUtils]: 53: Hoare triple {22426#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,563 INFO L273 TraceCheckUtils]: 54: Hoare triple {22426#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22426#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:30,564 INFO L273 TraceCheckUtils]: 55: Hoare triple {22426#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,565 INFO L273 TraceCheckUtils]: 56: Hoare triple {22427#(<= main_~k~0 12)} assume true; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,565 INFO L273 TraceCheckUtils]: 57: Hoare triple {22427#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,566 INFO L273 TraceCheckUtils]: 58: Hoare triple {22427#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22427#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:30,566 INFO L273 TraceCheckUtils]: 59: Hoare triple {22427#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {22428#(<= main_~k~0 13)} assume true; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {22428#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,568 INFO L273 TraceCheckUtils]: 62: Hoare triple {22428#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22428#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:30,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {22428#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,569 INFO L273 TraceCheckUtils]: 64: Hoare triple {22429#(<= main_~k~0 14)} assume true; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,570 INFO L273 TraceCheckUtils]: 65: Hoare triple {22429#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,570 INFO L273 TraceCheckUtils]: 66: Hoare triple {22429#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22429#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:30,571 INFO L273 TraceCheckUtils]: 67: Hoare triple {22429#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,571 INFO L273 TraceCheckUtils]: 68: Hoare triple {22430#(<= main_~k~0 15)} assume true; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,572 INFO L273 TraceCheckUtils]: 69: Hoare triple {22430#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,572 INFO L273 TraceCheckUtils]: 70: Hoare triple {22430#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22430#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:30,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {22430#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {22431#(<= main_~k~0 16)} assume true; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,575 INFO L273 TraceCheckUtils]: 73: Hoare triple {22431#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,575 INFO L273 TraceCheckUtils]: 74: Hoare triple {22431#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22431#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:30,576 INFO L273 TraceCheckUtils]: 75: Hoare triple {22431#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,577 INFO L273 TraceCheckUtils]: 76: Hoare triple {22432#(<= main_~k~0 17)} assume true; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,577 INFO L273 TraceCheckUtils]: 77: Hoare triple {22432#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,578 INFO L273 TraceCheckUtils]: 78: Hoare triple {22432#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22432#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:30,578 INFO L273 TraceCheckUtils]: 79: Hoare triple {22432#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,579 INFO L273 TraceCheckUtils]: 80: Hoare triple {22433#(<= main_~k~0 18)} assume true; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,579 INFO L273 TraceCheckUtils]: 81: Hoare triple {22433#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {22433#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22433#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:30,581 INFO L273 TraceCheckUtils]: 83: Hoare triple {22433#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {22434#(<= main_~k~0 19)} assume true; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {22434#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {22434#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22434#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:30,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {22434#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {22435#(<= main_~k~0 20)} assume true; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {22435#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,584 INFO L273 TraceCheckUtils]: 90: Hoare triple {22435#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22435#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:30,586 INFO L273 TraceCheckUtils]: 91: Hoare triple {22435#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,586 INFO L273 TraceCheckUtils]: 92: Hoare triple {22436#(<= main_~k~0 21)} assume true; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,587 INFO L273 TraceCheckUtils]: 93: Hoare triple {22436#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {22436#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22436#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:30,588 INFO L273 TraceCheckUtils]: 95: Hoare triple {22436#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,589 INFO L273 TraceCheckUtils]: 96: Hoare triple {22437#(<= main_~k~0 22)} assume true; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,589 INFO L273 TraceCheckUtils]: 97: Hoare triple {22437#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,590 INFO L273 TraceCheckUtils]: 98: Hoare triple {22437#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22437#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:30,590 INFO L273 TraceCheckUtils]: 99: Hoare triple {22437#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,591 INFO L273 TraceCheckUtils]: 100: Hoare triple {22438#(<= main_~k~0 23)} assume true; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {22438#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,592 INFO L273 TraceCheckUtils]: 102: Hoare triple {22438#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22438#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:30,592 INFO L273 TraceCheckUtils]: 103: Hoare triple {22438#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,593 INFO L273 TraceCheckUtils]: 104: Hoare triple {22439#(<= main_~k~0 24)} assume true; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,594 INFO L273 TraceCheckUtils]: 105: Hoare triple {22439#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,594 INFO L273 TraceCheckUtils]: 106: Hoare triple {22439#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22439#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:30,595 INFO L273 TraceCheckUtils]: 107: Hoare triple {22439#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {22440#(<= main_~k~0 25)} assume true; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,596 INFO L273 TraceCheckUtils]: 109: Hoare triple {22440#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,596 INFO L273 TraceCheckUtils]: 110: Hoare triple {22440#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22440#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:30,597 INFO L273 TraceCheckUtils]: 111: Hoare triple {22440#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {22441#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:30,597 INFO L273 TraceCheckUtils]: 112: Hoare triple {22441#(<= main_~k~0 26)} assume true; {22441#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:30,598 INFO L273 TraceCheckUtils]: 113: Hoare triple {22441#(<= main_~k~0 26)} assume !(~k~0 < 100000); {22413#false} is VALID [2018-11-18 22:44:30,598 INFO L273 TraceCheckUtils]: 114: Hoare triple {22413#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 115: Hoare triple {22413#false} ~x~0 := 0; {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 116: Hoare triple {22413#false} assume true; {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 117: Hoare triple {22413#false} assume !(~x~0 < ~i~0); {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 118: Hoare triple {22413#false} ~x~0 := 1 + ~i~0; {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 119: Hoare triple {22413#false} assume true; {22413#false} is VALID [2018-11-18 22:44:30,599 INFO L273 TraceCheckUtils]: 120: Hoare triple {22413#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22413#false} is VALID [2018-11-18 22:44:30,600 INFO L256 TraceCheckUtils]: 121: Hoare triple {22413#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22413#false} is VALID [2018-11-18 22:44:30,600 INFO L273 TraceCheckUtils]: 122: Hoare triple {22413#false} ~cond := #in~cond; {22413#false} is VALID [2018-11-18 22:44:30,600 INFO L273 TraceCheckUtils]: 123: Hoare triple {22413#false} assume 0 == ~cond; {22413#false} is VALID [2018-11-18 22:44:30,600 INFO L273 TraceCheckUtils]: 124: Hoare triple {22413#false} assume !false; {22413#false} is VALID [2018-11-18 22:44:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:30,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2018-11-18 22:44:30,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 125 [2018-11-18 22:44:30,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:30,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:44:30,837 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-18 22:44:30,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:44:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:44:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:44:30,838 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand 32 states. [2018-11-18 22:44:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:32,985 INFO L93 Difference]: Finished difference Result 215 states and 269 transitions. [2018-11-18 22:44:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:44:32,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 125 [2018-11-18 22:44:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:44:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 260 transitions. [2018-11-18 22:44:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:44:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 260 transitions. [2018-11-18 22:44:32,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 260 transitions. [2018-11-18 22:44:33,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:33,326 INFO L225 Difference]: With dead ends: 215 [2018-11-18 22:44:33,326 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 22:44:33,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-11-18 22:44:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 22:44:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2018-11-18 22:44:33,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:33,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 164 states. [2018-11-18 22:44:33,714 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 164 states. [2018-11-18 22:44:33,714 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 164 states. [2018-11-18 22:44:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:33,718 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2018-11-18 22:44:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2018-11-18 22:44:33,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:33,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:33,719 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 173 states. [2018-11-18 22:44:33,719 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 173 states. [2018-11-18 22:44:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:33,723 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2018-11-18 22:44:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 215 transitions. [2018-11-18 22:44:33,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:33,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:33,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:33,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 22:44:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 203 transitions. [2018-11-18 22:44:33,727 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 203 transitions. Word has length 125 [2018-11-18 22:44:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:33,727 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 203 transitions. [2018-11-18 22:44:33,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 22:44:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 203 transitions. [2018-11-18 22:44:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 22:44:33,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:33,728 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:33,729 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:33,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1003879931, now seen corresponding path program 16 times [2018-11-18 22:44:33,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:33,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:33,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:34,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {23703#true} call ULTIMATE.init(); {23703#true} is VALID [2018-11-18 22:44:34,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {23703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23703#true} is VALID [2018-11-18 22:44:34,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {23703#true} assume true; {23703#true} is VALID [2018-11-18 22:44:34,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23703#true} {23703#true} #137#return; {23703#true} is VALID [2018-11-18 22:44:34,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {23703#true} call #t~ret15 := main(); {23703#true} is VALID [2018-11-18 22:44:34,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {23703#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23705#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:34,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {23705#(= 0 main_~i~0)} assume true; {23705#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:34,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {23705#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {23706#(= main_~k~0 0)} is VALID [2018-11-18 22:44:34,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {23706#(= main_~k~0 0)} assume true; {23706#(= main_~k~0 0)} is VALID [2018-11-18 22:44:34,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {23706#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23706#(= main_~k~0 0)} is VALID [2018-11-18 22:44:34,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {23706#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23706#(= main_~k~0 0)} is VALID [2018-11-18 22:44:34,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {23706#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {23707#(<= main_~k~0 1)} assume true; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {23707#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {23707#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {23707#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {23708#(<= main_~k~0 2)} assume true; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {23708#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {23708#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {23708#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {23709#(<= main_~k~0 3)} assume true; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {23709#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {23709#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {23709#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {23710#(<= main_~k~0 4)} assume true; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {23710#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {23710#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {23710#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {23711#(<= main_~k~0 5)} assume true; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {23711#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {23711#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {23711#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {23712#(<= main_~k~0 6)} assume true; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {23712#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {23712#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {23712#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {23713#(<= main_~k~0 7)} assume true; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,397 INFO L273 TraceCheckUtils]: 37: Hoare triple {23713#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {23713#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {23713#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {23714#(<= main_~k~0 8)} assume true; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {23714#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,400 INFO L273 TraceCheckUtils]: 42: Hoare triple {23714#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,401 INFO L273 TraceCheckUtils]: 43: Hoare triple {23714#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {23715#(<= main_~k~0 9)} assume true; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {23715#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {23715#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {23715#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {23716#(<= main_~k~0 10)} assume true; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {23716#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,409 INFO L273 TraceCheckUtils]: 50: Hoare triple {23716#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {23716#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {23717#(<= main_~k~0 11)} assume true; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {23717#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {23717#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,410 INFO L273 TraceCheckUtils]: 55: Hoare triple {23717#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {23718#(<= main_~k~0 12)} assume true; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,411 INFO L273 TraceCheckUtils]: 57: Hoare triple {23718#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {23718#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,412 INFO L273 TraceCheckUtils]: 59: Hoare triple {23718#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {23719#(<= main_~k~0 13)} assume true; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,413 INFO L273 TraceCheckUtils]: 61: Hoare triple {23719#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {23719#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,414 INFO L273 TraceCheckUtils]: 63: Hoare triple {23719#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {23720#(<= main_~k~0 14)} assume true; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,416 INFO L273 TraceCheckUtils]: 65: Hoare triple {23720#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,416 INFO L273 TraceCheckUtils]: 66: Hoare triple {23720#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,417 INFO L273 TraceCheckUtils]: 67: Hoare triple {23720#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,417 INFO L273 TraceCheckUtils]: 68: Hoare triple {23721#(<= main_~k~0 15)} assume true; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {23721#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,418 INFO L273 TraceCheckUtils]: 70: Hoare triple {23721#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {23721#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,419 INFO L273 TraceCheckUtils]: 72: Hoare triple {23722#(<= main_~k~0 16)} assume true; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {23722#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {23722#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {23722#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {23723#(<= main_~k~0 17)} assume true; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {23723#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,423 INFO L273 TraceCheckUtils]: 78: Hoare triple {23723#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,423 INFO L273 TraceCheckUtils]: 79: Hoare triple {23723#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {23724#(<= main_~k~0 18)} assume true; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {23724#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,425 INFO L273 TraceCheckUtils]: 82: Hoare triple {23724#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,426 INFO L273 TraceCheckUtils]: 83: Hoare triple {23724#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,426 INFO L273 TraceCheckUtils]: 84: Hoare triple {23725#(<= main_~k~0 19)} assume true; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {23725#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,427 INFO L273 TraceCheckUtils]: 86: Hoare triple {23725#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,428 INFO L273 TraceCheckUtils]: 87: Hoare triple {23725#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,428 INFO L273 TraceCheckUtils]: 88: Hoare triple {23726#(<= main_~k~0 20)} assume true; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,429 INFO L273 TraceCheckUtils]: 89: Hoare triple {23726#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,430 INFO L273 TraceCheckUtils]: 90: Hoare triple {23726#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,430 INFO L273 TraceCheckUtils]: 91: Hoare triple {23726#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,431 INFO L273 TraceCheckUtils]: 92: Hoare triple {23727#(<= main_~k~0 21)} assume true; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {23727#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,432 INFO L273 TraceCheckUtils]: 94: Hoare triple {23727#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,433 INFO L273 TraceCheckUtils]: 95: Hoare triple {23727#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,433 INFO L273 TraceCheckUtils]: 96: Hoare triple {23728#(<= main_~k~0 22)} assume true; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,434 INFO L273 TraceCheckUtils]: 97: Hoare triple {23728#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,434 INFO L273 TraceCheckUtils]: 98: Hoare triple {23728#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,435 INFO L273 TraceCheckUtils]: 99: Hoare triple {23728#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,435 INFO L273 TraceCheckUtils]: 100: Hoare triple {23729#(<= main_~k~0 23)} assume true; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,436 INFO L273 TraceCheckUtils]: 101: Hoare triple {23729#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,436 INFO L273 TraceCheckUtils]: 102: Hoare triple {23729#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,437 INFO L273 TraceCheckUtils]: 103: Hoare triple {23729#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,438 INFO L273 TraceCheckUtils]: 104: Hoare triple {23730#(<= main_~k~0 24)} assume true; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,438 INFO L273 TraceCheckUtils]: 105: Hoare triple {23730#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,439 INFO L273 TraceCheckUtils]: 106: Hoare triple {23730#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,439 INFO L273 TraceCheckUtils]: 107: Hoare triple {23730#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,440 INFO L273 TraceCheckUtils]: 108: Hoare triple {23731#(<= main_~k~0 25)} assume true; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,440 INFO L273 TraceCheckUtils]: 109: Hoare triple {23731#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,441 INFO L273 TraceCheckUtils]: 110: Hoare triple {23731#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,442 INFO L273 TraceCheckUtils]: 111: Hoare triple {23731#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,442 INFO L273 TraceCheckUtils]: 112: Hoare triple {23732#(<= main_~k~0 26)} assume true; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,443 INFO L273 TraceCheckUtils]: 113: Hoare triple {23732#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,443 INFO L273 TraceCheckUtils]: 114: Hoare triple {23732#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,444 INFO L273 TraceCheckUtils]: 115: Hoare triple {23732#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {23733#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:34,444 INFO L273 TraceCheckUtils]: 116: Hoare triple {23733#(<= main_~k~0 27)} assume true; {23733#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:34,445 INFO L273 TraceCheckUtils]: 117: Hoare triple {23733#(<= main_~k~0 27)} assume !(~k~0 < 100000); {23704#false} is VALID [2018-11-18 22:44:34,445 INFO L273 TraceCheckUtils]: 118: Hoare triple {23704#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23704#false} is VALID [2018-11-18 22:44:34,445 INFO L273 TraceCheckUtils]: 119: Hoare triple {23704#false} ~x~0 := 0; {23704#false} is VALID [2018-11-18 22:44:34,446 INFO L273 TraceCheckUtils]: 120: Hoare triple {23704#false} assume true; {23704#false} is VALID [2018-11-18 22:44:34,446 INFO L273 TraceCheckUtils]: 121: Hoare triple {23704#false} assume !(~x~0 < ~i~0); {23704#false} is VALID [2018-11-18 22:44:34,446 INFO L273 TraceCheckUtils]: 122: Hoare triple {23704#false} ~x~0 := 1 + ~i~0; {23704#false} is VALID [2018-11-18 22:44:34,446 INFO L273 TraceCheckUtils]: 123: Hoare triple {23704#false} assume true; {23704#false} is VALID [2018-11-18 22:44:34,446 INFO L273 TraceCheckUtils]: 124: Hoare triple {23704#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23704#false} is VALID [2018-11-18 22:44:34,447 INFO L256 TraceCheckUtils]: 125: Hoare triple {23704#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23704#false} is VALID [2018-11-18 22:44:34,447 INFO L273 TraceCheckUtils]: 126: Hoare triple {23704#false} ~cond := #in~cond; {23704#false} is VALID [2018-11-18 22:44:34,447 INFO L273 TraceCheckUtils]: 127: Hoare triple {23704#false} assume 0 == ~cond; {23704#false} is VALID [2018-11-18 22:44:34,447 INFO L273 TraceCheckUtils]: 128: Hoare triple {23704#false} assume !false; {23704#false} is VALID [2018-11-18 22:44:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:34,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:34,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 22:44:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:44:34,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:44:34,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:34,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:34,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {23703#true} call ULTIMATE.init(); {23703#true} is VALID [2018-11-18 22:44:34,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {23703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23703#true} is VALID [2018-11-18 22:44:34,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {23703#true} assume true; {23703#true} is VALID [2018-11-18 22:44:34,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23703#true} {23703#true} #137#return; {23703#true} is VALID [2018-11-18 22:44:34,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {23703#true} call #t~ret15 := main(); {23703#true} is VALID [2018-11-18 22:44:34,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {23703#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23752#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:34,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {23752#(<= main_~i~0 0)} assume true; {23752#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:34,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {23752#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {23759#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:34,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {23759#(<= main_~k~0 0)} assume true; {23759#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:34,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {23759#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23759#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:34,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {23759#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23759#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:34,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {23759#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {23707#(<= main_~k~0 1)} assume true; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {23707#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {23707#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23707#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:34,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {23707#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {23708#(<= main_~k~0 2)} assume true; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {23708#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {23708#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23708#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:34,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {23708#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {23709#(<= main_~k~0 3)} assume true; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {23709#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {23709#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23709#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:34,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {23709#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {23710#(<= main_~k~0 4)} assume true; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {23710#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {23710#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23710#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:34,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {23710#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {23711#(<= main_~k~0 5)} assume true; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {23711#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {23711#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23711#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:34,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {23711#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {23712#(<= main_~k~0 6)} assume true; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {23712#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {23712#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23712#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:34,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {23712#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {23713#(<= main_~k~0 7)} assume true; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,891 INFO L273 TraceCheckUtils]: 37: Hoare triple {23713#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {23713#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23713#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:34,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {23713#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {23714#(<= main_~k~0 8)} assume true; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,892 INFO L273 TraceCheckUtils]: 41: Hoare triple {23714#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {23714#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23714#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:34,893 INFO L273 TraceCheckUtils]: 43: Hoare triple {23714#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {23715#(<= main_~k~0 9)} assume true; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {23715#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {23715#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23715#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:34,895 INFO L273 TraceCheckUtils]: 47: Hoare triple {23715#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {23716#(<= main_~k~0 10)} assume true; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {23716#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {23716#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23716#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:34,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {23716#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {23717#(<= main_~k~0 11)} assume true; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,898 INFO L273 TraceCheckUtils]: 53: Hoare triple {23717#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {23717#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23717#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:34,899 INFO L273 TraceCheckUtils]: 55: Hoare triple {23717#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {23718#(<= main_~k~0 12)} assume true; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,900 INFO L273 TraceCheckUtils]: 57: Hoare triple {23718#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,901 INFO L273 TraceCheckUtils]: 58: Hoare triple {23718#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23718#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:34,901 INFO L273 TraceCheckUtils]: 59: Hoare triple {23718#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,902 INFO L273 TraceCheckUtils]: 60: Hoare triple {23719#(<= main_~k~0 13)} assume true; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,902 INFO L273 TraceCheckUtils]: 61: Hoare triple {23719#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,903 INFO L273 TraceCheckUtils]: 62: Hoare triple {23719#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23719#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:34,903 INFO L273 TraceCheckUtils]: 63: Hoare triple {23719#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,904 INFO L273 TraceCheckUtils]: 64: Hoare triple {23720#(<= main_~k~0 14)} assume true; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,905 INFO L273 TraceCheckUtils]: 65: Hoare triple {23720#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {23720#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23720#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:34,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {23720#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,906 INFO L273 TraceCheckUtils]: 68: Hoare triple {23721#(<= main_~k~0 15)} assume true; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,907 INFO L273 TraceCheckUtils]: 69: Hoare triple {23721#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,907 INFO L273 TraceCheckUtils]: 70: Hoare triple {23721#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23721#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:34,908 INFO L273 TraceCheckUtils]: 71: Hoare triple {23721#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,908 INFO L273 TraceCheckUtils]: 72: Hoare triple {23722#(<= main_~k~0 16)} assume true; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,909 INFO L273 TraceCheckUtils]: 73: Hoare triple {23722#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,909 INFO L273 TraceCheckUtils]: 74: Hoare triple {23722#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23722#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:34,910 INFO L273 TraceCheckUtils]: 75: Hoare triple {23722#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,910 INFO L273 TraceCheckUtils]: 76: Hoare triple {23723#(<= main_~k~0 17)} assume true; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,911 INFO L273 TraceCheckUtils]: 77: Hoare triple {23723#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,911 INFO L273 TraceCheckUtils]: 78: Hoare triple {23723#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23723#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:34,912 INFO L273 TraceCheckUtils]: 79: Hoare triple {23723#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,913 INFO L273 TraceCheckUtils]: 80: Hoare triple {23724#(<= main_~k~0 18)} assume true; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,913 INFO L273 TraceCheckUtils]: 81: Hoare triple {23724#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,913 INFO L273 TraceCheckUtils]: 82: Hoare triple {23724#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23724#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:34,914 INFO L273 TraceCheckUtils]: 83: Hoare triple {23724#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,915 INFO L273 TraceCheckUtils]: 84: Hoare triple {23725#(<= main_~k~0 19)} assume true; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,915 INFO L273 TraceCheckUtils]: 85: Hoare triple {23725#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,916 INFO L273 TraceCheckUtils]: 86: Hoare triple {23725#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23725#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:34,916 INFO L273 TraceCheckUtils]: 87: Hoare triple {23725#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,917 INFO L273 TraceCheckUtils]: 88: Hoare triple {23726#(<= main_~k~0 20)} assume true; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,917 INFO L273 TraceCheckUtils]: 89: Hoare triple {23726#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,918 INFO L273 TraceCheckUtils]: 90: Hoare triple {23726#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23726#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:34,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {23726#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,919 INFO L273 TraceCheckUtils]: 92: Hoare triple {23727#(<= main_~k~0 21)} assume true; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,920 INFO L273 TraceCheckUtils]: 93: Hoare triple {23727#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,920 INFO L273 TraceCheckUtils]: 94: Hoare triple {23727#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23727#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:34,921 INFO L273 TraceCheckUtils]: 95: Hoare triple {23727#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,921 INFO L273 TraceCheckUtils]: 96: Hoare triple {23728#(<= main_~k~0 22)} assume true; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,922 INFO L273 TraceCheckUtils]: 97: Hoare triple {23728#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,922 INFO L273 TraceCheckUtils]: 98: Hoare triple {23728#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23728#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:34,923 INFO L273 TraceCheckUtils]: 99: Hoare triple {23728#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,923 INFO L273 TraceCheckUtils]: 100: Hoare triple {23729#(<= main_~k~0 23)} assume true; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,924 INFO L273 TraceCheckUtils]: 101: Hoare triple {23729#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,924 INFO L273 TraceCheckUtils]: 102: Hoare triple {23729#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23729#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:34,925 INFO L273 TraceCheckUtils]: 103: Hoare triple {23729#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,925 INFO L273 TraceCheckUtils]: 104: Hoare triple {23730#(<= main_~k~0 24)} assume true; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,926 INFO L273 TraceCheckUtils]: 105: Hoare triple {23730#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,926 INFO L273 TraceCheckUtils]: 106: Hoare triple {23730#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23730#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:34,927 INFO L273 TraceCheckUtils]: 107: Hoare triple {23730#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,928 INFO L273 TraceCheckUtils]: 108: Hoare triple {23731#(<= main_~k~0 25)} assume true; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {23731#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,929 INFO L273 TraceCheckUtils]: 110: Hoare triple {23731#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23731#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:34,929 INFO L273 TraceCheckUtils]: 111: Hoare triple {23731#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,930 INFO L273 TraceCheckUtils]: 112: Hoare triple {23732#(<= main_~k~0 26)} assume true; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,930 INFO L273 TraceCheckUtils]: 113: Hoare triple {23732#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,931 INFO L273 TraceCheckUtils]: 114: Hoare triple {23732#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23732#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:34,931 INFO L273 TraceCheckUtils]: 115: Hoare triple {23732#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {23733#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:34,932 INFO L273 TraceCheckUtils]: 116: Hoare triple {23733#(<= main_~k~0 27)} assume true; {23733#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:34,932 INFO L273 TraceCheckUtils]: 117: Hoare triple {23733#(<= main_~k~0 27)} assume !(~k~0 < 100000); {23704#false} is VALID [2018-11-18 22:44:34,933 INFO L273 TraceCheckUtils]: 118: Hoare triple {23704#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23704#false} is VALID [2018-11-18 22:44:34,933 INFO L273 TraceCheckUtils]: 119: Hoare triple {23704#false} ~x~0 := 0; {23704#false} is VALID [2018-11-18 22:44:34,933 INFO L273 TraceCheckUtils]: 120: Hoare triple {23704#false} assume true; {23704#false} is VALID [2018-11-18 22:44:34,933 INFO L273 TraceCheckUtils]: 121: Hoare triple {23704#false} assume !(~x~0 < ~i~0); {23704#false} is VALID [2018-11-18 22:44:34,933 INFO L273 TraceCheckUtils]: 122: Hoare triple {23704#false} ~x~0 := 1 + ~i~0; {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L273 TraceCheckUtils]: 123: Hoare triple {23704#false} assume true; {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L273 TraceCheckUtils]: 124: Hoare triple {23704#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L256 TraceCheckUtils]: 125: Hoare triple {23704#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L273 TraceCheckUtils]: 126: Hoare triple {23704#false} ~cond := #in~cond; {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L273 TraceCheckUtils]: 127: Hoare triple {23704#false} assume 0 == ~cond; {23704#false} is VALID [2018-11-18 22:44:34,934 INFO L273 TraceCheckUtils]: 128: Hoare triple {23704#false} assume !false; {23704#false} is VALID [2018-11-18 22:44:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:34,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:34,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-11-18 22:44:34,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2018-11-18 22:44:34,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:34,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-18 22:44:35,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 22:44:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 22:44:35,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:44:35,086 INFO L87 Difference]: Start difference. First operand 164 states and 203 transitions. Second operand 33 states. [2018-11-18 22:44:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:37,318 INFO L93 Difference]: Finished difference Result 219 states and 274 transitions. [2018-11-18 22:44:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 22:44:37,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2018-11-18 22:44:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:44:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 265 transitions. [2018-11-18 22:44:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:44:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 265 transitions. [2018-11-18 22:44:37,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 265 transitions. [2018-11-18 22:44:37,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:37,566 INFO L225 Difference]: With dead ends: 219 [2018-11-18 22:44:37,566 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 22:44:37,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-11-18 22:44:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 22:44:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2018-11-18 22:44:37,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:37,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 168 states. [2018-11-18 22:44:37,651 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 168 states. [2018-11-18 22:44:37,651 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 168 states. [2018-11-18 22:44:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:37,655 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2018-11-18 22:44:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2018-11-18 22:44:37,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:37,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:37,655 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 177 states. [2018-11-18 22:44:37,655 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 177 states. [2018-11-18 22:44:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:37,658 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2018-11-18 22:44:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2018-11-18 22:44:37,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:37,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:37,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:37,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-18 22:44:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2018-11-18 22:44:37,661 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 129 [2018-11-18 22:44:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:37,661 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2018-11-18 22:44:37,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-18 22:44:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2018-11-18 22:44:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-18 22:44:37,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:37,662 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:37,662 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:37,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1333059365, now seen corresponding path program 17 times [2018-11-18 22:44:37,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:37,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:37,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:38,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {25027#true} call ULTIMATE.init(); {25027#true} is VALID [2018-11-18 22:44:38,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {25027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25027#true} is VALID [2018-11-18 22:44:38,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {25027#true} assume true; {25027#true} is VALID [2018-11-18 22:44:38,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25027#true} {25027#true} #137#return; {25027#true} is VALID [2018-11-18 22:44:38,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {25027#true} call #t~ret15 := main(); {25027#true} is VALID [2018-11-18 22:44:38,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {25027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25029#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:38,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {25029#(= 0 main_~i~0)} assume true; {25029#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:38,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {25029#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {25030#(= main_~k~0 0)} is VALID [2018-11-18 22:44:38,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {25030#(= main_~k~0 0)} assume true; {25030#(= main_~k~0 0)} is VALID [2018-11-18 22:44:38,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {25030#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25030#(= main_~k~0 0)} is VALID [2018-11-18 22:44:38,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {25030#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25030#(= main_~k~0 0)} is VALID [2018-11-18 22:44:38,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {25030#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:38,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {25031#(<= main_~k~0 1)} assume true; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:38,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {25031#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:38,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {25031#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:38,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {25031#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:38,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {25032#(<= main_~k~0 2)} assume true; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:38,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {25032#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:38,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {25032#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:38,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {25032#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:38,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {25033#(<= main_~k~0 3)} assume true; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:38,385 INFO L273 TraceCheckUtils]: 21: Hoare triple {25033#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:38,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {25033#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:38,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {25033#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:38,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {25034#(<= main_~k~0 4)} assume true; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:38,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {25034#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:38,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {25034#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:38,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {25034#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:38,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {25035#(<= main_~k~0 5)} assume true; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:38,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {25035#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:38,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {25035#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:38,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {25035#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:38,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {25036#(<= main_~k~0 6)} assume true; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:38,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {25036#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:38,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {25036#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:38,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {25036#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:38,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {25037#(<= main_~k~0 7)} assume true; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:38,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {25037#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:38,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {25037#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:38,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {25037#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:38,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {25038#(<= main_~k~0 8)} assume true; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:38,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {25038#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:38,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {25038#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:38,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {25038#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:38,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {25039#(<= main_~k~0 9)} assume true; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:38,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {25039#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:38,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {25039#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:38,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {25039#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:38,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {25040#(<= main_~k~0 10)} assume true; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:38,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {25040#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:38,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {25040#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:38,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {25040#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:38,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {25041#(<= main_~k~0 11)} assume true; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:38,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {25041#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:38,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {25041#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:38,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {25041#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:38,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {25042#(<= main_~k~0 12)} assume true; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:38,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {25042#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:38,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {25042#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:38,426 INFO L273 TraceCheckUtils]: 59: Hoare triple {25042#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:38,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {25043#(<= main_~k~0 13)} assume true; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:38,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {25043#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:38,430 INFO L273 TraceCheckUtils]: 62: Hoare triple {25043#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:38,430 INFO L273 TraceCheckUtils]: 63: Hoare triple {25043#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:38,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {25044#(<= main_~k~0 14)} assume true; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:38,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {25044#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:38,436 INFO L273 TraceCheckUtils]: 66: Hoare triple {25044#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:38,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {25044#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:38,438 INFO L273 TraceCheckUtils]: 68: Hoare triple {25045#(<= main_~k~0 15)} assume true; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:38,438 INFO L273 TraceCheckUtils]: 69: Hoare triple {25045#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:38,440 INFO L273 TraceCheckUtils]: 70: Hoare triple {25045#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:38,440 INFO L273 TraceCheckUtils]: 71: Hoare triple {25045#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:38,442 INFO L273 TraceCheckUtils]: 72: Hoare triple {25046#(<= main_~k~0 16)} assume true; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:38,442 INFO L273 TraceCheckUtils]: 73: Hoare triple {25046#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:38,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {25046#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:38,447 INFO L273 TraceCheckUtils]: 75: Hoare triple {25046#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:38,447 INFO L273 TraceCheckUtils]: 76: Hoare triple {25047#(<= main_~k~0 17)} assume true; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:38,449 INFO L273 TraceCheckUtils]: 77: Hoare triple {25047#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:38,449 INFO L273 TraceCheckUtils]: 78: Hoare triple {25047#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:38,452 INFO L273 TraceCheckUtils]: 79: Hoare triple {25047#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:38,452 INFO L273 TraceCheckUtils]: 80: Hoare triple {25048#(<= main_~k~0 18)} assume true; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:38,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {25048#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:38,455 INFO L273 TraceCheckUtils]: 82: Hoare triple {25048#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:38,458 INFO L273 TraceCheckUtils]: 83: Hoare triple {25048#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:38,458 INFO L273 TraceCheckUtils]: 84: Hoare triple {25049#(<= main_~k~0 19)} assume true; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:38,461 INFO L273 TraceCheckUtils]: 85: Hoare triple {25049#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:38,461 INFO L273 TraceCheckUtils]: 86: Hoare triple {25049#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:38,463 INFO L273 TraceCheckUtils]: 87: Hoare triple {25049#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:38,463 INFO L273 TraceCheckUtils]: 88: Hoare triple {25050#(<= main_~k~0 20)} assume true; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:38,466 INFO L273 TraceCheckUtils]: 89: Hoare triple {25050#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:38,466 INFO L273 TraceCheckUtils]: 90: Hoare triple {25050#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:38,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {25050#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:38,468 INFO L273 TraceCheckUtils]: 92: Hoare triple {25051#(<= main_~k~0 21)} assume true; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:38,471 INFO L273 TraceCheckUtils]: 93: Hoare triple {25051#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:38,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {25051#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:38,473 INFO L273 TraceCheckUtils]: 95: Hoare triple {25051#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:38,473 INFO L273 TraceCheckUtils]: 96: Hoare triple {25052#(<= main_~k~0 22)} assume true; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:38,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {25052#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:38,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {25052#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:38,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {25052#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:38,479 INFO L273 TraceCheckUtils]: 100: Hoare triple {25053#(<= main_~k~0 23)} assume true; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:38,479 INFO L273 TraceCheckUtils]: 101: Hoare triple {25053#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:38,480 INFO L273 TraceCheckUtils]: 102: Hoare triple {25053#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:38,480 INFO L273 TraceCheckUtils]: 103: Hoare triple {25053#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:38,480 INFO L273 TraceCheckUtils]: 104: Hoare triple {25054#(<= main_~k~0 24)} assume true; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:38,481 INFO L273 TraceCheckUtils]: 105: Hoare triple {25054#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:38,481 INFO L273 TraceCheckUtils]: 106: Hoare triple {25054#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:38,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {25054#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:38,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {25055#(<= main_~k~0 25)} assume true; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:38,484 INFO L273 TraceCheckUtils]: 109: Hoare triple {25055#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:38,484 INFO L273 TraceCheckUtils]: 110: Hoare triple {25055#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:38,486 INFO L273 TraceCheckUtils]: 111: Hoare triple {25055#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:38,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {25056#(<= main_~k~0 26)} assume true; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:38,489 INFO L273 TraceCheckUtils]: 113: Hoare triple {25056#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:38,489 INFO L273 TraceCheckUtils]: 114: Hoare triple {25056#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:38,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {25056#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:38,492 INFO L273 TraceCheckUtils]: 116: Hoare triple {25057#(<= main_~k~0 27)} assume true; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:38,495 INFO L273 TraceCheckUtils]: 117: Hoare triple {25057#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:38,495 INFO L273 TraceCheckUtils]: 118: Hoare triple {25057#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:38,497 INFO L273 TraceCheckUtils]: 119: Hoare triple {25057#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {25058#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:38,497 INFO L273 TraceCheckUtils]: 120: Hoare triple {25058#(<= main_~k~0 28)} assume true; {25058#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:38,497 INFO L273 TraceCheckUtils]: 121: Hoare triple {25058#(<= main_~k~0 28)} assume !(~k~0 < 100000); {25028#false} is VALID [2018-11-18 22:44:38,497 INFO L273 TraceCheckUtils]: 122: Hoare triple {25028#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 123: Hoare triple {25028#false} ~x~0 := 0; {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 124: Hoare triple {25028#false} assume true; {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 125: Hoare triple {25028#false} assume !(~x~0 < ~i~0); {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 126: Hoare triple {25028#false} ~x~0 := 1 + ~i~0; {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 127: Hoare triple {25028#false} assume true; {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 128: Hoare triple {25028#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L256 TraceCheckUtils]: 129: Hoare triple {25028#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 130: Hoare triple {25028#false} ~cond := #in~cond; {25028#false} is VALID [2018-11-18 22:44:38,498 INFO L273 TraceCheckUtils]: 131: Hoare triple {25028#false} assume 0 == ~cond; {25028#false} is VALID [2018-11-18 22:44:38,499 INFO L273 TraceCheckUtils]: 132: Hoare triple {25028#false} assume !false; {25028#false} is VALID [2018-11-18 22:44:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:38,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:38,510 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-18 22:44:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:44:38,616 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-18 22:44:38,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:38,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:39,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {25027#true} call ULTIMATE.init(); {25027#true} is VALID [2018-11-18 22:44:39,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {25027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25027#true} is VALID [2018-11-18 22:44:39,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {25027#true} assume true; {25027#true} is VALID [2018-11-18 22:44:39,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25027#true} {25027#true} #137#return; {25027#true} is VALID [2018-11-18 22:44:39,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {25027#true} call #t~ret15 := main(); {25027#true} is VALID [2018-11-18 22:44:39,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {25027#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {25077#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:39,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {25077#(<= main_~i~0 0)} assume true; {25077#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:39,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {25077#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {25084#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:39,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {25084#(<= main_~k~0 0)} assume true; {25084#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:39,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {25084#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25084#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:39,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {25084#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25084#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:39,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {25084#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:39,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {25031#(<= main_~k~0 1)} assume true; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:39,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {25031#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:39,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {25031#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {25031#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:39,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {25031#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:39,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {25032#(<= main_~k~0 2)} assume true; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:39,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {25032#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:39,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {25032#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25032#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:39,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {25032#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:39,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {25033#(<= main_~k~0 3)} assume true; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:39,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {25033#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:39,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {25033#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25033#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:39,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {25033#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:39,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {25034#(<= main_~k~0 4)} assume true; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:39,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {25034#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:39,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {25034#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25034#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:39,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {25034#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:39,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {25035#(<= main_~k~0 5)} assume true; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:39,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {25035#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:39,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {25035#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25035#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:39,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {25035#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:39,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {25036#(<= main_~k~0 6)} assume true; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:39,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {25036#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:39,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {25036#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25036#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:39,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {25036#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:39,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {25037#(<= main_~k~0 7)} assume true; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:39,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {25037#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:39,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {25037#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25037#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:39,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {25037#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:39,937 INFO L273 TraceCheckUtils]: 40: Hoare triple {25038#(<= main_~k~0 8)} assume true; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:39,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {25038#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:39,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {25038#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25038#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:39,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {25038#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:39,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {25039#(<= main_~k~0 9)} assume true; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:39,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {25039#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:39,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {25039#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25039#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:39,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {25039#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:39,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {25040#(<= main_~k~0 10)} assume true; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:39,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {25040#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:39,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {25040#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25040#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:39,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {25040#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:39,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {25041#(<= main_~k~0 11)} assume true; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:39,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {25041#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:39,945 INFO L273 TraceCheckUtils]: 54: Hoare triple {25041#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25041#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:39,946 INFO L273 TraceCheckUtils]: 55: Hoare triple {25041#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:39,947 INFO L273 TraceCheckUtils]: 56: Hoare triple {25042#(<= main_~k~0 12)} assume true; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:39,947 INFO L273 TraceCheckUtils]: 57: Hoare triple {25042#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:39,948 INFO L273 TraceCheckUtils]: 58: Hoare triple {25042#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25042#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:39,949 INFO L273 TraceCheckUtils]: 59: Hoare triple {25042#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:39,949 INFO L273 TraceCheckUtils]: 60: Hoare triple {25043#(<= main_~k~0 13)} assume true; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:39,950 INFO L273 TraceCheckUtils]: 61: Hoare triple {25043#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:39,950 INFO L273 TraceCheckUtils]: 62: Hoare triple {25043#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25043#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:39,951 INFO L273 TraceCheckUtils]: 63: Hoare triple {25043#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:39,951 INFO L273 TraceCheckUtils]: 64: Hoare triple {25044#(<= main_~k~0 14)} assume true; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:39,952 INFO L273 TraceCheckUtils]: 65: Hoare triple {25044#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:39,952 INFO L273 TraceCheckUtils]: 66: Hoare triple {25044#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25044#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:39,953 INFO L273 TraceCheckUtils]: 67: Hoare triple {25044#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:39,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {25045#(<= main_~k~0 15)} assume true; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:39,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {25045#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:39,955 INFO L273 TraceCheckUtils]: 70: Hoare triple {25045#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25045#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:39,955 INFO L273 TraceCheckUtils]: 71: Hoare triple {25045#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:39,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {25046#(<= main_~k~0 16)} assume true; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:39,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {25046#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:39,957 INFO L273 TraceCheckUtils]: 74: Hoare triple {25046#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25046#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:39,957 INFO L273 TraceCheckUtils]: 75: Hoare triple {25046#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:39,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {25047#(<= main_~k~0 17)} assume true; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:39,958 INFO L273 TraceCheckUtils]: 77: Hoare triple {25047#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:39,959 INFO L273 TraceCheckUtils]: 78: Hoare triple {25047#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25047#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:39,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {25047#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:39,960 INFO L273 TraceCheckUtils]: 80: Hoare triple {25048#(<= main_~k~0 18)} assume true; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:39,960 INFO L273 TraceCheckUtils]: 81: Hoare triple {25048#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:39,961 INFO L273 TraceCheckUtils]: 82: Hoare triple {25048#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25048#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:39,961 INFO L273 TraceCheckUtils]: 83: Hoare triple {25048#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:39,962 INFO L273 TraceCheckUtils]: 84: Hoare triple {25049#(<= main_~k~0 19)} assume true; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:39,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {25049#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:39,963 INFO L273 TraceCheckUtils]: 86: Hoare triple {25049#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25049#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:39,964 INFO L273 TraceCheckUtils]: 87: Hoare triple {25049#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:39,964 INFO L273 TraceCheckUtils]: 88: Hoare triple {25050#(<= main_~k~0 20)} assume true; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:39,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {25050#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:39,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {25050#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25050#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:39,966 INFO L273 TraceCheckUtils]: 91: Hoare triple {25050#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:39,966 INFO L273 TraceCheckUtils]: 92: Hoare triple {25051#(<= main_~k~0 21)} assume true; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:39,967 INFO L273 TraceCheckUtils]: 93: Hoare triple {25051#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:39,967 INFO L273 TraceCheckUtils]: 94: Hoare triple {25051#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25051#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:39,968 INFO L273 TraceCheckUtils]: 95: Hoare triple {25051#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:39,968 INFO L273 TraceCheckUtils]: 96: Hoare triple {25052#(<= main_~k~0 22)} assume true; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:39,969 INFO L273 TraceCheckUtils]: 97: Hoare triple {25052#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:39,969 INFO L273 TraceCheckUtils]: 98: Hoare triple {25052#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25052#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:39,970 INFO L273 TraceCheckUtils]: 99: Hoare triple {25052#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:39,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {25053#(<= main_~k~0 23)} assume true; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:39,971 INFO L273 TraceCheckUtils]: 101: Hoare triple {25053#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:39,972 INFO L273 TraceCheckUtils]: 102: Hoare triple {25053#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25053#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:39,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {25053#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:39,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {25054#(<= main_~k~0 24)} assume true; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:39,974 INFO L273 TraceCheckUtils]: 105: Hoare triple {25054#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:39,974 INFO L273 TraceCheckUtils]: 106: Hoare triple {25054#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25054#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:39,975 INFO L273 TraceCheckUtils]: 107: Hoare triple {25054#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:39,976 INFO L273 TraceCheckUtils]: 108: Hoare triple {25055#(<= main_~k~0 25)} assume true; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:39,976 INFO L273 TraceCheckUtils]: 109: Hoare triple {25055#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:39,977 INFO L273 TraceCheckUtils]: 110: Hoare triple {25055#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25055#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:39,977 INFO L273 TraceCheckUtils]: 111: Hoare triple {25055#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:39,978 INFO L273 TraceCheckUtils]: 112: Hoare triple {25056#(<= main_~k~0 26)} assume true; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:39,979 INFO L273 TraceCheckUtils]: 113: Hoare triple {25056#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:39,979 INFO L273 TraceCheckUtils]: 114: Hoare triple {25056#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25056#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:39,980 INFO L273 TraceCheckUtils]: 115: Hoare triple {25056#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:39,980 INFO L273 TraceCheckUtils]: 116: Hoare triple {25057#(<= main_~k~0 27)} assume true; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:39,981 INFO L273 TraceCheckUtils]: 117: Hoare triple {25057#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:39,982 INFO L273 TraceCheckUtils]: 118: Hoare triple {25057#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {25057#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:39,982 INFO L273 TraceCheckUtils]: 119: Hoare triple {25057#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {25058#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:39,983 INFO L273 TraceCheckUtils]: 120: Hoare triple {25058#(<= main_~k~0 28)} assume true; {25058#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:39,984 INFO L273 TraceCheckUtils]: 121: Hoare triple {25058#(<= main_~k~0 28)} assume !(~k~0 < 100000); {25028#false} is VALID [2018-11-18 22:44:39,984 INFO L273 TraceCheckUtils]: 122: Hoare triple {25028#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25028#false} is VALID [2018-11-18 22:44:39,984 INFO L273 TraceCheckUtils]: 123: Hoare triple {25028#false} ~x~0 := 0; {25028#false} is VALID [2018-11-18 22:44:39,984 INFO L273 TraceCheckUtils]: 124: Hoare triple {25028#false} assume true; {25028#false} is VALID [2018-11-18 22:44:39,985 INFO L273 TraceCheckUtils]: 125: Hoare triple {25028#false} assume !(~x~0 < ~i~0); {25028#false} is VALID [2018-11-18 22:44:39,985 INFO L273 TraceCheckUtils]: 126: Hoare triple {25028#false} ~x~0 := 1 + ~i~0; {25028#false} is VALID [2018-11-18 22:44:39,985 INFO L273 TraceCheckUtils]: 127: Hoare triple {25028#false} assume true; {25028#false} is VALID [2018-11-18 22:44:39,985 INFO L273 TraceCheckUtils]: 128: Hoare triple {25028#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25028#false} is VALID [2018-11-18 22:44:39,985 INFO L256 TraceCheckUtils]: 129: Hoare triple {25028#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {25028#false} is VALID [2018-11-18 22:44:39,986 INFO L273 TraceCheckUtils]: 130: Hoare triple {25028#false} ~cond := #in~cond; {25028#false} is VALID [2018-11-18 22:44:39,986 INFO L273 TraceCheckUtils]: 131: Hoare triple {25028#false} assume 0 == ~cond; {25028#false} is VALID [2018-11-18 22:44:39,986 INFO L273 TraceCheckUtils]: 132: Hoare triple {25028#false} assume !false; {25028#false} is VALID [2018-11-18 22:44:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:40,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:40,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2018-11-18 22:44:40,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 133 [2018-11-18 22:44:40,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:40,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:44:40,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:44:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:44:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:44:40,191 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand 34 states. [2018-11-18 22:44:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:42,497 INFO L93 Difference]: Finished difference Result 223 states and 279 transitions. [2018-11-18 22:44:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 22:44:42,498 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 133 [2018-11-18 22:44:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:44:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 270 transitions. [2018-11-18 22:44:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:44:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 270 transitions. [2018-11-18 22:44:42,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 270 transitions. [2018-11-18 22:44:42,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:42,743 INFO L225 Difference]: With dead ends: 223 [2018-11-18 22:44:42,743 INFO L226 Difference]: Without dead ends: 181 [2018-11-18 22:44:42,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 22:44:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-18 22:44:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2018-11-18 22:44:42,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:42,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 172 states. [2018-11-18 22:44:42,858 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 172 states. [2018-11-18 22:44:42,858 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 172 states. [2018-11-18 22:44:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:42,861 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2018-11-18 22:44:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2018-11-18 22:44:42,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:42,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:42,862 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 181 states. [2018-11-18 22:44:42,862 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 181 states. [2018-11-18 22:44:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:42,865 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2018-11-18 22:44:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2018-11-18 22:44:42,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:42,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:42,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:42,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 22:44:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 213 transitions. [2018-11-18 22:44:42,870 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 213 transitions. Word has length 133 [2018-11-18 22:44:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:42,870 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 213 transitions. [2018-11-18 22:44:42,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 22:44:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2018-11-18 22:44:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 22:44:42,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:42,871 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:42,871 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:42,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash 922018993, now seen corresponding path program 18 times [2018-11-18 22:44:42,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:42,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:42,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:43,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {26384#true} call ULTIMATE.init(); {26384#true} is VALID [2018-11-18 22:44:43,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {26384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26384#true} is VALID [2018-11-18 22:44:43,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {26384#true} assume true; {26384#true} is VALID [2018-11-18 22:44:43,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26384#true} {26384#true} #137#return; {26384#true} is VALID [2018-11-18 22:44:43,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {26384#true} call #t~ret15 := main(); {26384#true} is VALID [2018-11-18 22:44:43,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {26384#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26386#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:43,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {26386#(= 0 main_~i~0)} assume true; {26386#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:43,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {26386#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {26387#(= main_~k~0 0)} is VALID [2018-11-18 22:44:43,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {26387#(= main_~k~0 0)} assume true; {26387#(= main_~k~0 0)} is VALID [2018-11-18 22:44:43,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {26387#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26387#(= main_~k~0 0)} is VALID [2018-11-18 22:44:43,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {26387#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26387#(= main_~k~0 0)} is VALID [2018-11-18 22:44:43,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {26387#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:43,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {26388#(<= main_~k~0 1)} assume true; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:43,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {26388#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:43,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {26388#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:43,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {26388#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:43,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {26389#(<= main_~k~0 2)} assume true; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:43,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {26389#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:43,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {26389#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:43,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {26389#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:43,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {26390#(<= main_~k~0 3)} assume true; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:43,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {26390#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:43,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {26390#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:43,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {26390#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:43,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {26391#(<= main_~k~0 4)} assume true; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:43,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {26391#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:43,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {26391#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:43,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {26391#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:43,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {26392#(<= main_~k~0 5)} assume true; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:43,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {26392#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:43,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {26392#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:43,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {26392#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:43,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {26393#(<= main_~k~0 6)} assume true; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:43,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {26393#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:43,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {26393#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:43,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {26393#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:43,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {26394#(<= main_~k~0 7)} assume true; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:43,916 INFO L273 TraceCheckUtils]: 37: Hoare triple {26394#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:43,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {26394#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:43,917 INFO L273 TraceCheckUtils]: 39: Hoare triple {26394#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:43,918 INFO L273 TraceCheckUtils]: 40: Hoare triple {26395#(<= main_~k~0 8)} assume true; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:43,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {26395#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:43,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {26395#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:43,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {26395#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:43,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {26396#(<= main_~k~0 9)} assume true; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:43,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {26396#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:43,921 INFO L273 TraceCheckUtils]: 46: Hoare triple {26396#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:43,921 INFO L273 TraceCheckUtils]: 47: Hoare triple {26396#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:43,922 INFO L273 TraceCheckUtils]: 48: Hoare triple {26397#(<= main_~k~0 10)} assume true; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:43,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {26397#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:43,923 INFO L273 TraceCheckUtils]: 50: Hoare triple {26397#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:43,923 INFO L273 TraceCheckUtils]: 51: Hoare triple {26397#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:43,924 INFO L273 TraceCheckUtils]: 52: Hoare triple {26398#(<= main_~k~0 11)} assume true; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:43,924 INFO L273 TraceCheckUtils]: 53: Hoare triple {26398#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:43,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {26398#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:43,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {26398#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:43,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {26399#(<= main_~k~0 12)} assume true; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:43,926 INFO L273 TraceCheckUtils]: 57: Hoare triple {26399#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:43,927 INFO L273 TraceCheckUtils]: 58: Hoare triple {26399#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:43,928 INFO L273 TraceCheckUtils]: 59: Hoare triple {26399#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:43,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {26400#(<= main_~k~0 13)} assume true; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:43,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {26400#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:43,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {26400#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:43,930 INFO L273 TraceCheckUtils]: 63: Hoare triple {26400#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:43,930 INFO L273 TraceCheckUtils]: 64: Hoare triple {26401#(<= main_~k~0 14)} assume true; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:43,931 INFO L273 TraceCheckUtils]: 65: Hoare triple {26401#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:43,931 INFO L273 TraceCheckUtils]: 66: Hoare triple {26401#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:43,932 INFO L273 TraceCheckUtils]: 67: Hoare triple {26401#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:43,932 INFO L273 TraceCheckUtils]: 68: Hoare triple {26402#(<= main_~k~0 15)} assume true; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:43,933 INFO L273 TraceCheckUtils]: 69: Hoare triple {26402#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:43,933 INFO L273 TraceCheckUtils]: 70: Hoare triple {26402#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:43,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {26402#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:43,934 INFO L273 TraceCheckUtils]: 72: Hoare triple {26403#(<= main_~k~0 16)} assume true; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:43,935 INFO L273 TraceCheckUtils]: 73: Hoare triple {26403#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:43,935 INFO L273 TraceCheckUtils]: 74: Hoare triple {26403#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:43,936 INFO L273 TraceCheckUtils]: 75: Hoare triple {26403#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:43,936 INFO L273 TraceCheckUtils]: 76: Hoare triple {26404#(<= main_~k~0 17)} assume true; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:43,937 INFO L273 TraceCheckUtils]: 77: Hoare triple {26404#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:43,937 INFO L273 TraceCheckUtils]: 78: Hoare triple {26404#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:43,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {26404#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:43,938 INFO L273 TraceCheckUtils]: 80: Hoare triple {26405#(<= main_~k~0 18)} assume true; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:43,939 INFO L273 TraceCheckUtils]: 81: Hoare triple {26405#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:43,939 INFO L273 TraceCheckUtils]: 82: Hoare triple {26405#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:43,940 INFO L273 TraceCheckUtils]: 83: Hoare triple {26405#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:43,940 INFO L273 TraceCheckUtils]: 84: Hoare triple {26406#(<= main_~k~0 19)} assume true; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:43,941 INFO L273 TraceCheckUtils]: 85: Hoare triple {26406#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:43,941 INFO L273 TraceCheckUtils]: 86: Hoare triple {26406#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:43,942 INFO L273 TraceCheckUtils]: 87: Hoare triple {26406#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:43,943 INFO L273 TraceCheckUtils]: 88: Hoare triple {26407#(<= main_~k~0 20)} assume true; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:43,943 INFO L273 TraceCheckUtils]: 89: Hoare triple {26407#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:43,943 INFO L273 TraceCheckUtils]: 90: Hoare triple {26407#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:43,944 INFO L273 TraceCheckUtils]: 91: Hoare triple {26407#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:43,945 INFO L273 TraceCheckUtils]: 92: Hoare triple {26408#(<= main_~k~0 21)} assume true; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:43,945 INFO L273 TraceCheckUtils]: 93: Hoare triple {26408#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:43,946 INFO L273 TraceCheckUtils]: 94: Hoare triple {26408#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:43,946 INFO L273 TraceCheckUtils]: 95: Hoare triple {26408#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:43,947 INFO L273 TraceCheckUtils]: 96: Hoare triple {26409#(<= main_~k~0 22)} assume true; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:43,947 INFO L273 TraceCheckUtils]: 97: Hoare triple {26409#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:43,948 INFO L273 TraceCheckUtils]: 98: Hoare triple {26409#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:43,948 INFO L273 TraceCheckUtils]: 99: Hoare triple {26409#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:43,949 INFO L273 TraceCheckUtils]: 100: Hoare triple {26410#(<= main_~k~0 23)} assume true; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:43,949 INFO L273 TraceCheckUtils]: 101: Hoare triple {26410#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:43,950 INFO L273 TraceCheckUtils]: 102: Hoare triple {26410#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:43,950 INFO L273 TraceCheckUtils]: 103: Hoare triple {26410#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:43,951 INFO L273 TraceCheckUtils]: 104: Hoare triple {26411#(<= main_~k~0 24)} assume true; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:43,951 INFO L273 TraceCheckUtils]: 105: Hoare triple {26411#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:43,952 INFO L273 TraceCheckUtils]: 106: Hoare triple {26411#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:43,953 INFO L273 TraceCheckUtils]: 107: Hoare triple {26411#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:43,953 INFO L273 TraceCheckUtils]: 108: Hoare triple {26412#(<= main_~k~0 25)} assume true; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:43,953 INFO L273 TraceCheckUtils]: 109: Hoare triple {26412#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:43,954 INFO L273 TraceCheckUtils]: 110: Hoare triple {26412#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:43,955 INFO L273 TraceCheckUtils]: 111: Hoare triple {26412#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:43,955 INFO L273 TraceCheckUtils]: 112: Hoare triple {26413#(<= main_~k~0 26)} assume true; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:43,956 INFO L273 TraceCheckUtils]: 113: Hoare triple {26413#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:43,956 INFO L273 TraceCheckUtils]: 114: Hoare triple {26413#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:43,957 INFO L273 TraceCheckUtils]: 115: Hoare triple {26413#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:43,957 INFO L273 TraceCheckUtils]: 116: Hoare triple {26414#(<= main_~k~0 27)} assume true; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:43,958 INFO L273 TraceCheckUtils]: 117: Hoare triple {26414#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:43,958 INFO L273 TraceCheckUtils]: 118: Hoare triple {26414#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:43,959 INFO L273 TraceCheckUtils]: 119: Hoare triple {26414#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:43,959 INFO L273 TraceCheckUtils]: 120: Hoare triple {26415#(<= main_~k~0 28)} assume true; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:43,960 INFO L273 TraceCheckUtils]: 121: Hoare triple {26415#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:43,960 INFO L273 TraceCheckUtils]: 122: Hoare triple {26415#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:43,961 INFO L273 TraceCheckUtils]: 123: Hoare triple {26415#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {26416#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:43,961 INFO L273 TraceCheckUtils]: 124: Hoare triple {26416#(<= main_~k~0 29)} assume true; {26416#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:43,962 INFO L273 TraceCheckUtils]: 125: Hoare triple {26416#(<= main_~k~0 29)} assume !(~k~0 < 100000); {26385#false} is VALID [2018-11-18 22:44:43,962 INFO L273 TraceCheckUtils]: 126: Hoare triple {26385#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26385#false} is VALID [2018-11-18 22:44:43,962 INFO L273 TraceCheckUtils]: 127: Hoare triple {26385#false} ~x~0 := 0; {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L273 TraceCheckUtils]: 128: Hoare triple {26385#false} assume true; {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L273 TraceCheckUtils]: 129: Hoare triple {26385#false} assume !(~x~0 < ~i~0); {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L273 TraceCheckUtils]: 130: Hoare triple {26385#false} ~x~0 := 1 + ~i~0; {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L273 TraceCheckUtils]: 131: Hoare triple {26385#false} assume true; {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L273 TraceCheckUtils]: 132: Hoare triple {26385#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26385#false} is VALID [2018-11-18 22:44:43,963 INFO L256 TraceCheckUtils]: 133: Hoare triple {26385#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26385#false} is VALID [2018-11-18 22:44:43,964 INFO L273 TraceCheckUtils]: 134: Hoare triple {26385#false} ~cond := #in~cond; {26385#false} is VALID [2018-11-18 22:44:43,964 INFO L273 TraceCheckUtils]: 135: Hoare triple {26385#false} assume 0 == ~cond; {26385#false} is VALID [2018-11-18 22:44:43,964 INFO L273 TraceCheckUtils]: 136: Hoare triple {26385#false} assume !false; {26385#false} is VALID [2018-11-18 22:44:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:43,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:43,978 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-18 22:44:43,988 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:44:44,164 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-11-18 22:44:44,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:44,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:44,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {26384#true} call ULTIMATE.init(); {26384#true} is VALID [2018-11-18 22:44:44,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {26384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26384#true} is VALID [2018-11-18 22:44:44,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {26384#true} assume true; {26384#true} is VALID [2018-11-18 22:44:44,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26384#true} {26384#true} #137#return; {26384#true} is VALID [2018-11-18 22:44:44,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {26384#true} call #t~ret15 := main(); {26384#true} is VALID [2018-11-18 22:44:44,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {26384#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26435#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:44,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {26435#(<= main_~i~0 0)} assume true; {26435#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:44,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {26435#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {26442#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:44,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {26442#(<= main_~k~0 0)} assume true; {26442#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:44,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {26442#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26442#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:44,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {26442#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26442#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:44,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {26442#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:44,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {26388#(<= main_~k~0 1)} assume true; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:44,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {26388#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:44,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {26388#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26388#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:44,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {26388#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:44,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {26389#(<= main_~k~0 2)} assume true; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:44,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {26389#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:44,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {26389#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26389#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:44,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {26389#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:44,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {26390#(<= main_~k~0 3)} assume true; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:44,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {26390#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:44,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {26390#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26390#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:44,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {26390#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:44,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {26391#(<= main_~k~0 4)} assume true; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:44,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {26391#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:44,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {26391#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26391#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:44,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {26391#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:44,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {26392#(<= main_~k~0 5)} assume true; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:44,461 INFO L273 TraceCheckUtils]: 29: Hoare triple {26392#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:44,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {26392#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26392#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:44,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {26392#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:44,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {26393#(<= main_~k~0 6)} assume true; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:44,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {26393#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:44,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {26393#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26393#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:44,464 INFO L273 TraceCheckUtils]: 35: Hoare triple {26393#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:44,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {26394#(<= main_~k~0 7)} assume true; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:44,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {26394#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:44,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {26394#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26394#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:44,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {26394#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:44,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {26395#(<= main_~k~0 8)} assume true; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:44,468 INFO L273 TraceCheckUtils]: 41: Hoare triple {26395#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:44,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {26395#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26395#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:44,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {26395#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:44,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {26396#(<= main_~k~0 9)} assume true; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:44,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {26396#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:44,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {26396#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26396#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:44,471 INFO L273 TraceCheckUtils]: 47: Hoare triple {26396#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:44,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {26397#(<= main_~k~0 10)} assume true; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:44,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {26397#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:44,473 INFO L273 TraceCheckUtils]: 50: Hoare triple {26397#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26397#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:44,473 INFO L273 TraceCheckUtils]: 51: Hoare triple {26397#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:44,474 INFO L273 TraceCheckUtils]: 52: Hoare triple {26398#(<= main_~k~0 11)} assume true; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:44,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {26398#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:44,475 INFO L273 TraceCheckUtils]: 54: Hoare triple {26398#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26398#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:44,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {26398#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:44,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {26399#(<= main_~k~0 12)} assume true; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:44,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {26399#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:44,477 INFO L273 TraceCheckUtils]: 58: Hoare triple {26399#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26399#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:44,478 INFO L273 TraceCheckUtils]: 59: Hoare triple {26399#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:44,478 INFO L273 TraceCheckUtils]: 60: Hoare triple {26400#(<= main_~k~0 13)} assume true; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:44,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {26400#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:44,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {26400#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26400#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:44,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {26400#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:44,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {26401#(<= main_~k~0 14)} assume true; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:44,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {26401#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:44,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {26401#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26401#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:44,482 INFO L273 TraceCheckUtils]: 67: Hoare triple {26401#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:44,483 INFO L273 TraceCheckUtils]: 68: Hoare triple {26402#(<= main_~k~0 15)} assume true; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:44,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {26402#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:44,484 INFO L273 TraceCheckUtils]: 70: Hoare triple {26402#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26402#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:44,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {26402#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:44,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {26403#(<= main_~k~0 16)} assume true; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:44,485 INFO L273 TraceCheckUtils]: 73: Hoare triple {26403#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:44,486 INFO L273 TraceCheckUtils]: 74: Hoare triple {26403#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26403#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:44,486 INFO L273 TraceCheckUtils]: 75: Hoare triple {26403#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:44,487 INFO L273 TraceCheckUtils]: 76: Hoare triple {26404#(<= main_~k~0 17)} assume true; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:44,487 INFO L273 TraceCheckUtils]: 77: Hoare triple {26404#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:44,488 INFO L273 TraceCheckUtils]: 78: Hoare triple {26404#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26404#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:44,489 INFO L273 TraceCheckUtils]: 79: Hoare triple {26404#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:44,489 INFO L273 TraceCheckUtils]: 80: Hoare triple {26405#(<= main_~k~0 18)} assume true; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:44,490 INFO L273 TraceCheckUtils]: 81: Hoare triple {26405#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:44,490 INFO L273 TraceCheckUtils]: 82: Hoare triple {26405#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26405#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:44,491 INFO L273 TraceCheckUtils]: 83: Hoare triple {26405#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:44,491 INFO L273 TraceCheckUtils]: 84: Hoare triple {26406#(<= main_~k~0 19)} assume true; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:44,492 INFO L273 TraceCheckUtils]: 85: Hoare triple {26406#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:44,492 INFO L273 TraceCheckUtils]: 86: Hoare triple {26406#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26406#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:44,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {26406#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:44,494 INFO L273 TraceCheckUtils]: 88: Hoare triple {26407#(<= main_~k~0 20)} assume true; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:44,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {26407#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:44,495 INFO L273 TraceCheckUtils]: 90: Hoare triple {26407#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26407#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:44,495 INFO L273 TraceCheckUtils]: 91: Hoare triple {26407#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:44,496 INFO L273 TraceCheckUtils]: 92: Hoare triple {26408#(<= main_~k~0 21)} assume true; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:44,496 INFO L273 TraceCheckUtils]: 93: Hoare triple {26408#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:44,497 INFO L273 TraceCheckUtils]: 94: Hoare triple {26408#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26408#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:44,498 INFO L273 TraceCheckUtils]: 95: Hoare triple {26408#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:44,498 INFO L273 TraceCheckUtils]: 96: Hoare triple {26409#(<= main_~k~0 22)} assume true; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:44,499 INFO L273 TraceCheckUtils]: 97: Hoare triple {26409#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:44,499 INFO L273 TraceCheckUtils]: 98: Hoare triple {26409#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26409#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:44,500 INFO L273 TraceCheckUtils]: 99: Hoare triple {26409#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:44,500 INFO L273 TraceCheckUtils]: 100: Hoare triple {26410#(<= main_~k~0 23)} assume true; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:44,501 INFO L273 TraceCheckUtils]: 101: Hoare triple {26410#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:44,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {26410#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26410#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:44,502 INFO L273 TraceCheckUtils]: 103: Hoare triple {26410#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:44,503 INFO L273 TraceCheckUtils]: 104: Hoare triple {26411#(<= main_~k~0 24)} assume true; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:44,503 INFO L273 TraceCheckUtils]: 105: Hoare triple {26411#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:44,504 INFO L273 TraceCheckUtils]: 106: Hoare triple {26411#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26411#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:44,504 INFO L273 TraceCheckUtils]: 107: Hoare triple {26411#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:44,505 INFO L273 TraceCheckUtils]: 108: Hoare triple {26412#(<= main_~k~0 25)} assume true; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:44,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {26412#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:44,506 INFO L273 TraceCheckUtils]: 110: Hoare triple {26412#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26412#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:44,507 INFO L273 TraceCheckUtils]: 111: Hoare triple {26412#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:44,507 INFO L273 TraceCheckUtils]: 112: Hoare triple {26413#(<= main_~k~0 26)} assume true; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:44,508 INFO L273 TraceCheckUtils]: 113: Hoare triple {26413#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:44,508 INFO L273 TraceCheckUtils]: 114: Hoare triple {26413#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26413#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:44,509 INFO L273 TraceCheckUtils]: 115: Hoare triple {26413#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:44,509 INFO L273 TraceCheckUtils]: 116: Hoare triple {26414#(<= main_~k~0 27)} assume true; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:44,510 INFO L273 TraceCheckUtils]: 117: Hoare triple {26414#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:44,510 INFO L273 TraceCheckUtils]: 118: Hoare triple {26414#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26414#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:44,511 INFO L273 TraceCheckUtils]: 119: Hoare triple {26414#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:44,511 INFO L273 TraceCheckUtils]: 120: Hoare triple {26415#(<= main_~k~0 28)} assume true; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:44,512 INFO L273 TraceCheckUtils]: 121: Hoare triple {26415#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:44,512 INFO L273 TraceCheckUtils]: 122: Hoare triple {26415#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26415#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:44,513 INFO L273 TraceCheckUtils]: 123: Hoare triple {26415#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {26416#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:44,514 INFO L273 TraceCheckUtils]: 124: Hoare triple {26416#(<= main_~k~0 29)} assume true; {26416#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:44,514 INFO L273 TraceCheckUtils]: 125: Hoare triple {26416#(<= main_~k~0 29)} assume !(~k~0 < 100000); {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 126: Hoare triple {26385#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 127: Hoare triple {26385#false} ~x~0 := 0; {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 128: Hoare triple {26385#false} assume true; {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 129: Hoare triple {26385#false} assume !(~x~0 < ~i~0); {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 130: Hoare triple {26385#false} ~x~0 := 1 + ~i~0; {26385#false} is VALID [2018-11-18 22:44:44,515 INFO L273 TraceCheckUtils]: 131: Hoare triple {26385#false} assume true; {26385#false} is VALID [2018-11-18 22:44:44,516 INFO L273 TraceCheckUtils]: 132: Hoare triple {26385#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26385#false} is VALID [2018-11-18 22:44:44,516 INFO L256 TraceCheckUtils]: 133: Hoare triple {26385#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26385#false} is VALID [2018-11-18 22:44:44,516 INFO L273 TraceCheckUtils]: 134: Hoare triple {26385#false} ~cond := #in~cond; {26385#false} is VALID [2018-11-18 22:44:44,516 INFO L273 TraceCheckUtils]: 135: Hoare triple {26385#false} assume 0 == ~cond; {26385#false} is VALID [2018-11-18 22:44:44,516 INFO L273 TraceCheckUtils]: 136: Hoare triple {26385#false} assume !false; {26385#false} is VALID [2018-11-18 22:44:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:44,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:44,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-11-18 22:44:44,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 137 [2018-11-18 22:44:44,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:44,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-18 22:44:44,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:44,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 22:44:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 22:44:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:44:44,684 INFO L87 Difference]: Start difference. First operand 172 states and 213 transitions. Second operand 35 states. [2018-11-18 22:44:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:47,141 INFO L93 Difference]: Finished difference Result 227 states and 284 transitions. [2018-11-18 22:44:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 22:44:47,141 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 137 [2018-11-18 22:44:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:44:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 275 transitions. [2018-11-18 22:44:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:44:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 275 transitions. [2018-11-18 22:44:47,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 275 transitions. [2018-11-18 22:44:47,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:47,424 INFO L225 Difference]: With dead ends: 227 [2018-11-18 22:44:47,425 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 22:44:47,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 22:44:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 22:44:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2018-11-18 22:44:47,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:47,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 176 states. [2018-11-18 22:44:47,500 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 176 states. [2018-11-18 22:44:47,501 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 176 states. [2018-11-18 22:44:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:47,504 INFO L93 Difference]: Finished difference Result 185 states and 230 transitions. [2018-11-18 22:44:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2018-11-18 22:44:47,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:47,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:47,505 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 185 states. [2018-11-18 22:44:47,505 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 185 states. [2018-11-18 22:44:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:47,508 INFO L93 Difference]: Finished difference Result 185 states and 230 transitions. [2018-11-18 22:44:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2018-11-18 22:44:47,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:47,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:47,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:47,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 22:44:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 218 transitions. [2018-11-18 22:44:47,512 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 218 transitions. Word has length 137 [2018-11-18 22:44:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:47,513 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 218 transitions. [2018-11-18 22:44:47,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 22:44:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 218 transitions. [2018-11-18 22:44:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 22:44:47,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:47,514 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:47,514 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:47,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 680316295, now seen corresponding path program 19 times [2018-11-18 22:44:47,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:47,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:47,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:48,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {27774#true} call ULTIMATE.init(); {27774#true} is VALID [2018-11-18 22:44:48,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {27774#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27774#true} is VALID [2018-11-18 22:44:48,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {27774#true} assume true; {27774#true} is VALID [2018-11-18 22:44:48,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27774#true} {27774#true} #137#return; {27774#true} is VALID [2018-11-18 22:44:48,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {27774#true} call #t~ret15 := main(); {27774#true} is VALID [2018-11-18 22:44:48,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {27774#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27776#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:48,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {27776#(= 0 main_~i~0)} assume true; {27776#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:48,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {27776#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {27777#(= main_~k~0 0)} is VALID [2018-11-18 22:44:48,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {27777#(= main_~k~0 0)} assume true; {27777#(= main_~k~0 0)} is VALID [2018-11-18 22:44:48,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {27777#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27777#(= main_~k~0 0)} is VALID [2018-11-18 22:44:48,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {27777#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27777#(= main_~k~0 0)} is VALID [2018-11-18 22:44:48,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {27777#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:48,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {27778#(<= main_~k~0 1)} assume true; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:48,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {27778#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:48,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {27778#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:48,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {27778#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:48,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {27779#(<= main_~k~0 2)} assume true; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:48,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {27779#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:48,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {27779#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:48,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {27779#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:48,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {27780#(<= main_~k~0 3)} assume true; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:48,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {27780#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:48,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:48,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:48,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~k~0 4)} assume true; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:48,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:48,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {27781#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:48,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {27781#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:48,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {27782#(<= main_~k~0 5)} assume true; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:48,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {27782#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:48,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {27782#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:48,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {27782#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:48,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {27783#(<= main_~k~0 6)} assume true; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:48,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {27783#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:48,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {27783#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:48,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {27783#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:48,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {27784#(<= main_~k~0 7)} assume true; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:48,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {27784#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:48,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {27784#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:48,720 INFO L273 TraceCheckUtils]: 39: Hoare triple {27784#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:48,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {27785#(<= main_~k~0 8)} assume true; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:48,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {27785#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:48,723 INFO L273 TraceCheckUtils]: 42: Hoare triple {27785#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:48,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {27785#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:48,725 INFO L273 TraceCheckUtils]: 44: Hoare triple {27786#(<= main_~k~0 9)} assume true; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:48,725 INFO L273 TraceCheckUtils]: 45: Hoare triple {27786#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:48,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {27786#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:48,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {27786#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:48,726 INFO L273 TraceCheckUtils]: 48: Hoare triple {27787#(<= main_~k~0 10)} assume true; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:48,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {27787#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:48,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {27787#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:48,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {27787#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:48,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {27788#(<= main_~k~0 11)} assume true; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:48,728 INFO L273 TraceCheckUtils]: 53: Hoare triple {27788#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:48,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {27788#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:48,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {27788#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:48,731 INFO L273 TraceCheckUtils]: 56: Hoare triple {27789#(<= main_~k~0 12)} assume true; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:48,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {27789#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:48,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {27789#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:48,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {27789#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:48,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {27790#(<= main_~k~0 13)} assume true; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:48,734 INFO L273 TraceCheckUtils]: 61: Hoare triple {27790#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:48,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {27790#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:48,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {27790#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:48,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {27791#(<= main_~k~0 14)} assume true; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:48,735 INFO L273 TraceCheckUtils]: 65: Hoare triple {27791#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:48,735 INFO L273 TraceCheckUtils]: 66: Hoare triple {27791#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:48,736 INFO L273 TraceCheckUtils]: 67: Hoare triple {27791#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:48,736 INFO L273 TraceCheckUtils]: 68: Hoare triple {27792#(<= main_~k~0 15)} assume true; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:48,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {27792#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:48,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {27792#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:48,737 INFO L273 TraceCheckUtils]: 71: Hoare triple {27792#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:48,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {27793#(<= main_~k~0 16)} assume true; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:48,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {27793#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:48,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {27793#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:48,740 INFO L273 TraceCheckUtils]: 75: Hoare triple {27793#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:48,740 INFO L273 TraceCheckUtils]: 76: Hoare triple {27794#(<= main_~k~0 17)} assume true; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:48,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {27794#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:48,741 INFO L273 TraceCheckUtils]: 78: Hoare triple {27794#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:48,742 INFO L273 TraceCheckUtils]: 79: Hoare triple {27794#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:48,742 INFO L273 TraceCheckUtils]: 80: Hoare triple {27795#(<= main_~k~0 18)} assume true; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:48,743 INFO L273 TraceCheckUtils]: 81: Hoare triple {27795#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:48,743 INFO L273 TraceCheckUtils]: 82: Hoare triple {27795#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:48,744 INFO L273 TraceCheckUtils]: 83: Hoare triple {27795#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:48,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {27796#(<= main_~k~0 19)} assume true; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:48,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {27796#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:48,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {27796#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:48,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {27796#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:48,747 INFO L273 TraceCheckUtils]: 88: Hoare triple {27797#(<= main_~k~0 20)} assume true; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:48,747 INFO L273 TraceCheckUtils]: 89: Hoare triple {27797#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:48,748 INFO L273 TraceCheckUtils]: 90: Hoare triple {27797#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:48,748 INFO L273 TraceCheckUtils]: 91: Hoare triple {27797#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:48,749 INFO L273 TraceCheckUtils]: 92: Hoare triple {27798#(<= main_~k~0 21)} assume true; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:48,749 INFO L273 TraceCheckUtils]: 93: Hoare triple {27798#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:48,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {27798#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:48,750 INFO L273 TraceCheckUtils]: 95: Hoare triple {27798#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:48,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {27799#(<= main_~k~0 22)} assume true; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:48,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {27799#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:48,752 INFO L273 TraceCheckUtils]: 98: Hoare triple {27799#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:48,753 INFO L273 TraceCheckUtils]: 99: Hoare triple {27799#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:48,753 INFO L273 TraceCheckUtils]: 100: Hoare triple {27800#(<= main_~k~0 23)} assume true; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:48,754 INFO L273 TraceCheckUtils]: 101: Hoare triple {27800#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:48,754 INFO L273 TraceCheckUtils]: 102: Hoare triple {27800#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:48,755 INFO L273 TraceCheckUtils]: 103: Hoare triple {27800#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:48,755 INFO L273 TraceCheckUtils]: 104: Hoare triple {27801#(<= main_~k~0 24)} assume true; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:48,756 INFO L273 TraceCheckUtils]: 105: Hoare triple {27801#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:48,756 INFO L273 TraceCheckUtils]: 106: Hoare triple {27801#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:48,757 INFO L273 TraceCheckUtils]: 107: Hoare triple {27801#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:48,757 INFO L273 TraceCheckUtils]: 108: Hoare triple {27802#(<= main_~k~0 25)} assume true; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:48,758 INFO L273 TraceCheckUtils]: 109: Hoare triple {27802#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:48,758 INFO L273 TraceCheckUtils]: 110: Hoare triple {27802#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:48,759 INFO L273 TraceCheckUtils]: 111: Hoare triple {27802#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:48,760 INFO L273 TraceCheckUtils]: 112: Hoare triple {27803#(<= main_~k~0 26)} assume true; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:48,760 INFO L273 TraceCheckUtils]: 113: Hoare triple {27803#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:48,761 INFO L273 TraceCheckUtils]: 114: Hoare triple {27803#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:48,761 INFO L273 TraceCheckUtils]: 115: Hoare triple {27803#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:48,762 INFO L273 TraceCheckUtils]: 116: Hoare triple {27804#(<= main_~k~0 27)} assume true; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:48,762 INFO L273 TraceCheckUtils]: 117: Hoare triple {27804#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:48,763 INFO L273 TraceCheckUtils]: 118: Hoare triple {27804#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:48,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {27804#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:48,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {27805#(<= main_~k~0 28)} assume true; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:48,765 INFO L273 TraceCheckUtils]: 121: Hoare triple {27805#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:48,765 INFO L273 TraceCheckUtils]: 122: Hoare triple {27805#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:48,766 INFO L273 TraceCheckUtils]: 123: Hoare triple {27805#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:48,766 INFO L273 TraceCheckUtils]: 124: Hoare triple {27806#(<= main_~k~0 29)} assume true; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:48,767 INFO L273 TraceCheckUtils]: 125: Hoare triple {27806#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:48,767 INFO L273 TraceCheckUtils]: 126: Hoare triple {27806#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:48,768 INFO L273 TraceCheckUtils]: 127: Hoare triple {27806#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {27807#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:48,768 INFO L273 TraceCheckUtils]: 128: Hoare triple {27807#(<= main_~k~0 30)} assume true; {27807#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:48,769 INFO L273 TraceCheckUtils]: 129: Hoare triple {27807#(<= main_~k~0 30)} assume !(~k~0 < 100000); {27775#false} is VALID [2018-11-18 22:44:48,769 INFO L273 TraceCheckUtils]: 130: Hoare triple {27775#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27775#false} is VALID [2018-11-18 22:44:48,769 INFO L273 TraceCheckUtils]: 131: Hoare triple {27775#false} ~x~0 := 0; {27775#false} is VALID [2018-11-18 22:44:48,770 INFO L273 TraceCheckUtils]: 132: Hoare triple {27775#false} assume true; {27775#false} is VALID [2018-11-18 22:44:48,770 INFO L273 TraceCheckUtils]: 133: Hoare triple {27775#false} assume !(~x~0 < ~i~0); {27775#false} is VALID [2018-11-18 22:44:48,770 INFO L273 TraceCheckUtils]: 134: Hoare triple {27775#false} ~x~0 := 1 + ~i~0; {27775#false} is VALID [2018-11-18 22:44:48,770 INFO L273 TraceCheckUtils]: 135: Hoare triple {27775#false} assume true; {27775#false} is VALID [2018-11-18 22:44:48,770 INFO L273 TraceCheckUtils]: 136: Hoare triple {27775#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27775#false} is VALID [2018-11-18 22:44:48,771 INFO L256 TraceCheckUtils]: 137: Hoare triple {27775#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27775#false} is VALID [2018-11-18 22:44:48,771 INFO L273 TraceCheckUtils]: 138: Hoare triple {27775#false} ~cond := #in~cond; {27775#false} is VALID [2018-11-18 22:44:48,771 INFO L273 TraceCheckUtils]: 139: Hoare triple {27775#false} assume 0 == ~cond; {27775#false} is VALID [2018-11-18 22:44:48,771 INFO L273 TraceCheckUtils]: 140: Hoare triple {27775#false} assume !false; {27775#false} is VALID [2018-11-18 22:44:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:48,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:48,784 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-18 22:44:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:48,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:49,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {27774#true} call ULTIMATE.init(); {27774#true} is VALID [2018-11-18 22:44:49,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {27774#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27774#true} is VALID [2018-11-18 22:44:49,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {27774#true} assume true; {27774#true} is VALID [2018-11-18 22:44:49,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27774#true} {27774#true} #137#return; {27774#true} is VALID [2018-11-18 22:44:49,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {27774#true} call #t~ret15 := main(); {27774#true} is VALID [2018-11-18 22:44:49,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {27774#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27826#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:49,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {27826#(<= main_~i~0 0)} assume true; {27826#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:49,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {27826#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {27833#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:49,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {27833#(<= main_~k~0 0)} assume true; {27833#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:49,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {27833#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27833#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:49,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {27833#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27833#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:49,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {27833#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:49,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {27778#(<= main_~k~0 1)} assume true; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:49,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {27778#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:49,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {27778#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {27778#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:49,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {27778#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:49,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {27779#(<= main_~k~0 2)} assume true; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:49,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {27779#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:49,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {27779#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27779#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:49,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {27779#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:49,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {27780#(<= main_~k~0 3)} assume true; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:49,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {27780#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:49,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27780#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:49,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:49,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~k~0 4)} assume true; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:49,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:49,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {27781#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27781#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:49,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {27781#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:49,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {27782#(<= main_~k~0 5)} assume true; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:49,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {27782#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:49,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {27782#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27782#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:49,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {27782#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:49,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {27783#(<= main_~k~0 6)} assume true; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:49,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {27783#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:49,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {27783#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27783#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:49,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {27783#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:49,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {27784#(<= main_~k~0 7)} assume true; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:49,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {27784#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:49,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {27784#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27784#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:49,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {27784#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:49,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {27785#(<= main_~k~0 8)} assume true; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:49,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {27785#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:49,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {27785#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27785#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:49,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {27785#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:49,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {27786#(<= main_~k~0 9)} assume true; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:49,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {27786#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:49,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {27786#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27786#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:49,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {27786#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:49,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {27787#(<= main_~k~0 10)} assume true; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:49,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {27787#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:49,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {27787#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27787#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:49,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {27787#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:49,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {27788#(<= main_~k~0 11)} assume true; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:49,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {27788#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:49,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {27788#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27788#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:49,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {27788#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:49,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {27789#(<= main_~k~0 12)} assume true; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:49,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {27789#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:49,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {27789#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27789#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:49,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {27789#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:49,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {27790#(<= main_~k~0 13)} assume true; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:49,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {27790#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:49,189 INFO L273 TraceCheckUtils]: 62: Hoare triple {27790#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27790#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:49,190 INFO L273 TraceCheckUtils]: 63: Hoare triple {27790#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:49,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {27791#(<= main_~k~0 14)} assume true; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:49,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {27791#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:49,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {27791#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27791#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:49,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {27791#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:49,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {27792#(<= main_~k~0 15)} assume true; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:49,193 INFO L273 TraceCheckUtils]: 69: Hoare triple {27792#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:49,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {27792#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27792#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:49,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {27792#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:49,195 INFO L273 TraceCheckUtils]: 72: Hoare triple {27793#(<= main_~k~0 16)} assume true; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:49,195 INFO L273 TraceCheckUtils]: 73: Hoare triple {27793#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:49,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {27793#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27793#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:49,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {27793#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:49,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {27794#(<= main_~k~0 17)} assume true; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:49,197 INFO L273 TraceCheckUtils]: 77: Hoare triple {27794#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:49,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {27794#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27794#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:49,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {27794#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:49,199 INFO L273 TraceCheckUtils]: 80: Hoare triple {27795#(<= main_~k~0 18)} assume true; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:49,199 INFO L273 TraceCheckUtils]: 81: Hoare triple {27795#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:49,200 INFO L273 TraceCheckUtils]: 82: Hoare triple {27795#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27795#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:49,200 INFO L273 TraceCheckUtils]: 83: Hoare triple {27795#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:49,201 INFO L273 TraceCheckUtils]: 84: Hoare triple {27796#(<= main_~k~0 19)} assume true; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:49,201 INFO L273 TraceCheckUtils]: 85: Hoare triple {27796#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:49,202 INFO L273 TraceCheckUtils]: 86: Hoare triple {27796#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27796#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:49,203 INFO L273 TraceCheckUtils]: 87: Hoare triple {27796#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:49,203 INFO L273 TraceCheckUtils]: 88: Hoare triple {27797#(<= main_~k~0 20)} assume true; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:49,203 INFO L273 TraceCheckUtils]: 89: Hoare triple {27797#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:49,204 INFO L273 TraceCheckUtils]: 90: Hoare triple {27797#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27797#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:49,205 INFO L273 TraceCheckUtils]: 91: Hoare triple {27797#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:49,205 INFO L273 TraceCheckUtils]: 92: Hoare triple {27798#(<= main_~k~0 21)} assume true; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:49,206 INFO L273 TraceCheckUtils]: 93: Hoare triple {27798#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:49,206 INFO L273 TraceCheckUtils]: 94: Hoare triple {27798#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27798#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:49,207 INFO L273 TraceCheckUtils]: 95: Hoare triple {27798#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:49,207 INFO L273 TraceCheckUtils]: 96: Hoare triple {27799#(<= main_~k~0 22)} assume true; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:49,208 INFO L273 TraceCheckUtils]: 97: Hoare triple {27799#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:49,208 INFO L273 TraceCheckUtils]: 98: Hoare triple {27799#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27799#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:49,209 INFO L273 TraceCheckUtils]: 99: Hoare triple {27799#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:49,209 INFO L273 TraceCheckUtils]: 100: Hoare triple {27800#(<= main_~k~0 23)} assume true; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:49,210 INFO L273 TraceCheckUtils]: 101: Hoare triple {27800#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:49,210 INFO L273 TraceCheckUtils]: 102: Hoare triple {27800#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27800#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:49,211 INFO L273 TraceCheckUtils]: 103: Hoare triple {27800#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:49,211 INFO L273 TraceCheckUtils]: 104: Hoare triple {27801#(<= main_~k~0 24)} assume true; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:49,212 INFO L273 TraceCheckUtils]: 105: Hoare triple {27801#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:49,212 INFO L273 TraceCheckUtils]: 106: Hoare triple {27801#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27801#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:49,213 INFO L273 TraceCheckUtils]: 107: Hoare triple {27801#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:49,213 INFO L273 TraceCheckUtils]: 108: Hoare triple {27802#(<= main_~k~0 25)} assume true; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:49,214 INFO L273 TraceCheckUtils]: 109: Hoare triple {27802#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:49,214 INFO L273 TraceCheckUtils]: 110: Hoare triple {27802#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27802#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:49,215 INFO L273 TraceCheckUtils]: 111: Hoare triple {27802#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:49,216 INFO L273 TraceCheckUtils]: 112: Hoare triple {27803#(<= main_~k~0 26)} assume true; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:49,216 INFO L273 TraceCheckUtils]: 113: Hoare triple {27803#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:49,216 INFO L273 TraceCheckUtils]: 114: Hoare triple {27803#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27803#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:49,217 INFO L273 TraceCheckUtils]: 115: Hoare triple {27803#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:49,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {27804#(<= main_~k~0 27)} assume true; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:49,218 INFO L273 TraceCheckUtils]: 117: Hoare triple {27804#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:49,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {27804#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27804#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:49,219 INFO L273 TraceCheckUtils]: 119: Hoare triple {27804#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:49,220 INFO L273 TraceCheckUtils]: 120: Hoare triple {27805#(<= main_~k~0 28)} assume true; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:49,220 INFO L273 TraceCheckUtils]: 121: Hoare triple {27805#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:49,221 INFO L273 TraceCheckUtils]: 122: Hoare triple {27805#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27805#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:49,221 INFO L273 TraceCheckUtils]: 123: Hoare triple {27805#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:49,222 INFO L273 TraceCheckUtils]: 124: Hoare triple {27806#(<= main_~k~0 29)} assume true; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:49,222 INFO L273 TraceCheckUtils]: 125: Hoare triple {27806#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:49,223 INFO L273 TraceCheckUtils]: 126: Hoare triple {27806#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27806#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:49,223 INFO L273 TraceCheckUtils]: 127: Hoare triple {27806#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {27807#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:49,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {27807#(<= main_~k~0 30)} assume true; {27807#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:49,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {27807#(<= main_~k~0 30)} assume !(~k~0 < 100000); {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 130: Hoare triple {27775#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 131: Hoare triple {27775#false} ~x~0 := 0; {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 132: Hoare triple {27775#false} assume true; {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 133: Hoare triple {27775#false} assume !(~x~0 < ~i~0); {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 134: Hoare triple {27775#false} ~x~0 := 1 + ~i~0; {27775#false} is VALID [2018-11-18 22:44:49,225 INFO L273 TraceCheckUtils]: 135: Hoare triple {27775#false} assume true; {27775#false} is VALID [2018-11-18 22:44:49,226 INFO L273 TraceCheckUtils]: 136: Hoare triple {27775#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {27775#false} is VALID [2018-11-18 22:44:49,226 INFO L256 TraceCheckUtils]: 137: Hoare triple {27775#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27775#false} is VALID [2018-11-18 22:44:49,226 INFO L273 TraceCheckUtils]: 138: Hoare triple {27775#false} ~cond := #in~cond; {27775#false} is VALID [2018-11-18 22:44:49,226 INFO L273 TraceCheckUtils]: 139: Hoare triple {27775#false} assume 0 == ~cond; {27775#false} is VALID [2018-11-18 22:44:49,226 INFO L273 TraceCheckUtils]: 140: Hoare triple {27775#false} assume !false; {27775#false} is VALID [2018-11-18 22:44:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:49,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:49,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2018-11-18 22:44:49,259 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 141 [2018-11-18 22:44:49,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:49,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-18 22:44:49,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:49,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 22:44:49,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 22:44:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:44:49,388 INFO L87 Difference]: Start difference. First operand 176 states and 218 transitions. Second operand 36 states. [2018-11-18 22:44:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:51,874 INFO L93 Difference]: Finished difference Result 231 states and 289 transitions. [2018-11-18 22:44:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 22:44:51,875 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 141 [2018-11-18 22:44:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:44:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 280 transitions. [2018-11-18 22:44:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:44:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 280 transitions. [2018-11-18 22:44:51,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 280 transitions. [2018-11-18 22:44:52,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:52,134 INFO L225 Difference]: With dead ends: 231 [2018-11-18 22:44:52,134 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 22:44:52,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-11-18 22:44:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 22:44:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2018-11-18 22:44:52,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:52,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 180 states. [2018-11-18 22:44:52,224 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 180 states. [2018-11-18 22:44:52,224 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 180 states. [2018-11-18 22:44:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:52,227 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2018-11-18 22:44:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2018-11-18 22:44:52,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:52,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:52,228 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 189 states. [2018-11-18 22:44:52,228 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 189 states. [2018-11-18 22:44:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:52,231 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2018-11-18 22:44:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2018-11-18 22:44:52,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:52,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:52,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:52,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-18 22:44:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 223 transitions. [2018-11-18 22:44:52,234 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 223 transitions. Word has length 141 [2018-11-18 22:44:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:52,234 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 223 transitions. [2018-11-18 22:44:52,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 22:44:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 223 transitions. [2018-11-18 22:44:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 22:44:52,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:52,235 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:52,235 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:52,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1203264349, now seen corresponding path program 20 times [2018-11-18 22:44:52,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:52,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:52,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:52,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:53,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {29197#true} call ULTIMATE.init(); {29197#true} is VALID [2018-11-18 22:44:53,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {29197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29197#true} is VALID [2018-11-18 22:44:53,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {29197#true} assume true; {29197#true} is VALID [2018-11-18 22:44:53,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29197#true} {29197#true} #137#return; {29197#true} is VALID [2018-11-18 22:44:53,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {29197#true} call #t~ret15 := main(); {29197#true} is VALID [2018-11-18 22:44:53,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {29197#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29199#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:53,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {29199#(= 0 main_~i~0)} assume true; {29199#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:53,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {29199#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {29200#(= main_~k~0 0)} is VALID [2018-11-18 22:44:53,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {29200#(= main_~k~0 0)} assume true; {29200#(= main_~k~0 0)} is VALID [2018-11-18 22:44:53,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {29200#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29200#(= main_~k~0 0)} is VALID [2018-11-18 22:44:53,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {29200#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29200#(= main_~k~0 0)} is VALID [2018-11-18 22:44:53,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {29200#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {29201#(<= main_~k~0 1)} assume true; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {29201#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {29201#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {29201#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {29202#(<= main_~k~0 2)} assume true; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {29202#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {29202#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {29202#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {29203#(<= main_~k~0 3)} assume true; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {29203#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {29203#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {29203#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {29204#(<= main_~k~0 4)} assume true; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {29204#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {29204#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {29204#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:53,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {29205#(<= main_~k~0 5)} assume true; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:53,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {29205#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:53,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {29205#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:53,355 INFO L273 TraceCheckUtils]: 31: Hoare triple {29205#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:53,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {29206#(<= main_~k~0 6)} assume true; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:53,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {29206#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:53,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {29206#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:53,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {29206#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:53,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {29207#(<= main_~k~0 7)} assume true; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:53,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {29207#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:53,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {29207#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:53,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {29207#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:53,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {29208#(<= main_~k~0 8)} assume true; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:53,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {29208#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:53,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {29208#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:53,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {29208#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:53,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {29209#(<= main_~k~0 9)} assume true; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:53,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {29209#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:53,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {29209#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:53,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {29209#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:53,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {29210#(<= main_~k~0 10)} assume true; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:53,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {29210#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:53,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {29210#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:53,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {29210#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:53,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {29211#(<= main_~k~0 11)} assume true; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:53,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {29211#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:53,366 INFO L273 TraceCheckUtils]: 54: Hoare triple {29211#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:53,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {29211#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:53,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {29212#(<= main_~k~0 12)} assume true; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:53,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {29212#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:53,368 INFO L273 TraceCheckUtils]: 58: Hoare triple {29212#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:53,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {29212#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:53,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {29213#(<= main_~k~0 13)} assume true; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:53,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {29213#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:53,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {29213#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:53,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {29213#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:53,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {29214#(<= main_~k~0 14)} assume true; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:53,372 INFO L273 TraceCheckUtils]: 65: Hoare triple {29214#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:53,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {29214#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:53,373 INFO L273 TraceCheckUtils]: 67: Hoare triple {29214#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:53,374 INFO L273 TraceCheckUtils]: 68: Hoare triple {29215#(<= main_~k~0 15)} assume true; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:53,374 INFO L273 TraceCheckUtils]: 69: Hoare triple {29215#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:53,375 INFO L273 TraceCheckUtils]: 70: Hoare triple {29215#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:53,375 INFO L273 TraceCheckUtils]: 71: Hoare triple {29215#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:53,376 INFO L273 TraceCheckUtils]: 72: Hoare triple {29216#(<= main_~k~0 16)} assume true; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:53,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {29216#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:53,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {29216#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:53,378 INFO L273 TraceCheckUtils]: 75: Hoare triple {29216#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:53,378 INFO L273 TraceCheckUtils]: 76: Hoare triple {29217#(<= main_~k~0 17)} assume true; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:53,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {29217#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:53,379 INFO L273 TraceCheckUtils]: 78: Hoare triple {29217#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:53,380 INFO L273 TraceCheckUtils]: 79: Hoare triple {29217#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:53,380 INFO L273 TraceCheckUtils]: 80: Hoare triple {29218#(<= main_~k~0 18)} assume true; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:53,381 INFO L273 TraceCheckUtils]: 81: Hoare triple {29218#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:53,381 INFO L273 TraceCheckUtils]: 82: Hoare triple {29218#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:53,382 INFO L273 TraceCheckUtils]: 83: Hoare triple {29218#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:53,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {29219#(<= main_~k~0 19)} assume true; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:53,383 INFO L273 TraceCheckUtils]: 85: Hoare triple {29219#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:53,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {29219#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:53,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {29219#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:53,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {29220#(<= main_~k~0 20)} assume true; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:53,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {29220#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:53,386 INFO L273 TraceCheckUtils]: 90: Hoare triple {29220#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:53,386 INFO L273 TraceCheckUtils]: 91: Hoare triple {29220#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:53,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {29221#(<= main_~k~0 21)} assume true; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:53,387 INFO L273 TraceCheckUtils]: 93: Hoare triple {29221#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:53,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {29221#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:53,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {29221#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:53,389 INFO L273 TraceCheckUtils]: 96: Hoare triple {29222#(<= main_~k~0 22)} assume true; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:53,389 INFO L273 TraceCheckUtils]: 97: Hoare triple {29222#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:53,390 INFO L273 TraceCheckUtils]: 98: Hoare triple {29222#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:53,391 INFO L273 TraceCheckUtils]: 99: Hoare triple {29222#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:53,391 INFO L273 TraceCheckUtils]: 100: Hoare triple {29223#(<= main_~k~0 23)} assume true; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:53,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {29223#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:53,392 INFO L273 TraceCheckUtils]: 102: Hoare triple {29223#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:53,393 INFO L273 TraceCheckUtils]: 103: Hoare triple {29223#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:53,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {29224#(<= main_~k~0 24)} assume true; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:53,394 INFO L273 TraceCheckUtils]: 105: Hoare triple {29224#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:53,394 INFO L273 TraceCheckUtils]: 106: Hoare triple {29224#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:53,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {29224#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:53,395 INFO L273 TraceCheckUtils]: 108: Hoare triple {29225#(<= main_~k~0 25)} assume true; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:53,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {29225#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:53,396 INFO L273 TraceCheckUtils]: 110: Hoare triple {29225#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:53,397 INFO L273 TraceCheckUtils]: 111: Hoare triple {29225#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:53,397 INFO L273 TraceCheckUtils]: 112: Hoare triple {29226#(<= main_~k~0 26)} assume true; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:53,398 INFO L273 TraceCheckUtils]: 113: Hoare triple {29226#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:53,398 INFO L273 TraceCheckUtils]: 114: Hoare triple {29226#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:53,399 INFO L273 TraceCheckUtils]: 115: Hoare triple {29226#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:53,399 INFO L273 TraceCheckUtils]: 116: Hoare triple {29227#(<= main_~k~0 27)} assume true; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:53,400 INFO L273 TraceCheckUtils]: 117: Hoare triple {29227#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:53,400 INFO L273 TraceCheckUtils]: 118: Hoare triple {29227#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:53,401 INFO L273 TraceCheckUtils]: 119: Hoare triple {29227#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:53,401 INFO L273 TraceCheckUtils]: 120: Hoare triple {29228#(<= main_~k~0 28)} assume true; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:53,402 INFO L273 TraceCheckUtils]: 121: Hoare triple {29228#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:53,402 INFO L273 TraceCheckUtils]: 122: Hoare triple {29228#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:53,403 INFO L273 TraceCheckUtils]: 123: Hoare triple {29228#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:53,404 INFO L273 TraceCheckUtils]: 124: Hoare triple {29229#(<= main_~k~0 29)} assume true; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:53,404 INFO L273 TraceCheckUtils]: 125: Hoare triple {29229#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:53,404 INFO L273 TraceCheckUtils]: 126: Hoare triple {29229#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:53,405 INFO L273 TraceCheckUtils]: 127: Hoare triple {29229#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:53,406 INFO L273 TraceCheckUtils]: 128: Hoare triple {29230#(<= main_~k~0 30)} assume true; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:53,406 INFO L273 TraceCheckUtils]: 129: Hoare triple {29230#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:53,407 INFO L273 TraceCheckUtils]: 130: Hoare triple {29230#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:53,407 INFO L273 TraceCheckUtils]: 131: Hoare triple {29230#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {29231#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:53,408 INFO L273 TraceCheckUtils]: 132: Hoare triple {29231#(<= main_~k~0 31)} assume true; {29231#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:53,408 INFO L273 TraceCheckUtils]: 133: Hoare triple {29231#(<= main_~k~0 31)} assume !(~k~0 < 100000); {29198#false} is VALID [2018-11-18 22:44:53,408 INFO L273 TraceCheckUtils]: 134: Hoare triple {29198#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 135: Hoare triple {29198#false} ~x~0 := 0; {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 136: Hoare triple {29198#false} assume true; {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 137: Hoare triple {29198#false} assume !(~x~0 < ~i~0); {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 138: Hoare triple {29198#false} ~x~0 := 1 + ~i~0; {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 139: Hoare triple {29198#false} assume true; {29198#false} is VALID [2018-11-18 22:44:53,409 INFO L273 TraceCheckUtils]: 140: Hoare triple {29198#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29198#false} is VALID [2018-11-18 22:44:53,410 INFO L256 TraceCheckUtils]: 141: Hoare triple {29198#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29198#false} is VALID [2018-11-18 22:44:53,410 INFO L273 TraceCheckUtils]: 142: Hoare triple {29198#false} ~cond := #in~cond; {29198#false} is VALID [2018-11-18 22:44:53,410 INFO L273 TraceCheckUtils]: 143: Hoare triple {29198#false} assume 0 == ~cond; {29198#false} is VALID [2018-11-18 22:44:53,410 INFO L273 TraceCheckUtils]: 144: Hoare triple {29198#false} assume !false; {29198#false} is VALID [2018-11-18 22:44:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:53,424 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-18 22:44:53,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:44:53,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:44:53,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:53,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:53,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {29197#true} call ULTIMATE.init(); {29197#true} is VALID [2018-11-18 22:44:53,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {29197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29197#true} is VALID [2018-11-18 22:44:53,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {29197#true} assume true; {29197#true} is VALID [2018-11-18 22:44:53,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29197#true} {29197#true} #137#return; {29197#true} is VALID [2018-11-18 22:44:53,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {29197#true} call #t~ret15 := main(); {29197#true} is VALID [2018-11-18 22:44:53,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {29197#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29250#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:53,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {29250#(<= main_~i~0 0)} assume true; {29250#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:53,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {29250#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {29257#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:53,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {29257#(<= main_~k~0 0)} assume true; {29257#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:53,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {29257#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29257#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:53,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {29257#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29257#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:53,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {29257#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {29201#(<= main_~k~0 1)} assume true; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {29201#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {29201#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {29201#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:53,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {29201#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {29202#(<= main_~k~0 2)} assume true; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {29202#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {29202#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29202#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:53,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {29202#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {29203#(<= main_~k~0 3)} assume true; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {29203#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {29203#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29203#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:53,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {29203#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {29204#(<= main_~k~0 4)} assume true; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {29204#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {29204#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29204#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:53,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {29204#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:53,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {29205#(<= main_~k~0 5)} assume true; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:54,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {29205#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:54,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {29205#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29205#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:54,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {29205#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:54,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {29206#(<= main_~k~0 6)} assume true; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:54,035 INFO L273 TraceCheckUtils]: 33: Hoare triple {29206#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:54,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {29206#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29206#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:54,035 INFO L273 TraceCheckUtils]: 35: Hoare triple {29206#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:54,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {29207#(<= main_~k~0 7)} assume true; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:54,036 INFO L273 TraceCheckUtils]: 37: Hoare triple {29207#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:54,036 INFO L273 TraceCheckUtils]: 38: Hoare triple {29207#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29207#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:54,037 INFO L273 TraceCheckUtils]: 39: Hoare triple {29207#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:54,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {29208#(<= main_~k~0 8)} assume true; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:54,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {29208#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:54,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {29208#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29208#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:54,038 INFO L273 TraceCheckUtils]: 43: Hoare triple {29208#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:54,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {29209#(<= main_~k~0 9)} assume true; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:54,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {29209#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:54,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {29209#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29209#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:54,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {29209#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:54,041 INFO L273 TraceCheckUtils]: 48: Hoare triple {29210#(<= main_~k~0 10)} assume true; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:54,041 INFO L273 TraceCheckUtils]: 49: Hoare triple {29210#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:54,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {29210#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29210#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:54,042 INFO L273 TraceCheckUtils]: 51: Hoare triple {29210#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:54,043 INFO L273 TraceCheckUtils]: 52: Hoare triple {29211#(<= main_~k~0 11)} assume true; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:54,043 INFO L273 TraceCheckUtils]: 53: Hoare triple {29211#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:54,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {29211#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29211#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:54,044 INFO L273 TraceCheckUtils]: 55: Hoare triple {29211#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:54,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {29212#(<= main_~k~0 12)} assume true; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:54,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {29212#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:54,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {29212#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29212#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:54,047 INFO L273 TraceCheckUtils]: 59: Hoare triple {29212#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:54,047 INFO L273 TraceCheckUtils]: 60: Hoare triple {29213#(<= main_~k~0 13)} assume true; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:54,047 INFO L273 TraceCheckUtils]: 61: Hoare triple {29213#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:54,048 INFO L273 TraceCheckUtils]: 62: Hoare triple {29213#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29213#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:54,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {29213#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:54,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {29214#(<= main_~k~0 14)} assume true; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:54,051 INFO L273 TraceCheckUtils]: 65: Hoare triple {29214#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:54,052 INFO L273 TraceCheckUtils]: 66: Hoare triple {29214#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29214#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:54,052 INFO L273 TraceCheckUtils]: 67: Hoare triple {29214#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:54,053 INFO L273 TraceCheckUtils]: 68: Hoare triple {29215#(<= main_~k~0 15)} assume true; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:54,053 INFO L273 TraceCheckUtils]: 69: Hoare triple {29215#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:54,053 INFO L273 TraceCheckUtils]: 70: Hoare triple {29215#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29215#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:54,054 INFO L273 TraceCheckUtils]: 71: Hoare triple {29215#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:54,054 INFO L273 TraceCheckUtils]: 72: Hoare triple {29216#(<= main_~k~0 16)} assume true; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:54,054 INFO L273 TraceCheckUtils]: 73: Hoare triple {29216#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:54,055 INFO L273 TraceCheckUtils]: 74: Hoare triple {29216#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29216#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:54,055 INFO L273 TraceCheckUtils]: 75: Hoare triple {29216#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:54,056 INFO L273 TraceCheckUtils]: 76: Hoare triple {29217#(<= main_~k~0 17)} assume true; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:54,056 INFO L273 TraceCheckUtils]: 77: Hoare triple {29217#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:54,057 INFO L273 TraceCheckUtils]: 78: Hoare triple {29217#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29217#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:54,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {29217#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:54,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {29218#(<= main_~k~0 18)} assume true; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:54,058 INFO L273 TraceCheckUtils]: 81: Hoare triple {29218#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:54,059 INFO L273 TraceCheckUtils]: 82: Hoare triple {29218#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29218#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:54,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {29218#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:54,060 INFO L273 TraceCheckUtils]: 84: Hoare triple {29219#(<= main_~k~0 19)} assume true; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:54,060 INFO L273 TraceCheckUtils]: 85: Hoare triple {29219#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:54,061 INFO L273 TraceCheckUtils]: 86: Hoare triple {29219#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29219#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:54,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {29219#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:54,062 INFO L273 TraceCheckUtils]: 88: Hoare triple {29220#(<= main_~k~0 20)} assume true; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:54,063 INFO L273 TraceCheckUtils]: 89: Hoare triple {29220#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:54,063 INFO L273 TraceCheckUtils]: 90: Hoare triple {29220#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29220#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:54,064 INFO L273 TraceCheckUtils]: 91: Hoare triple {29220#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:54,064 INFO L273 TraceCheckUtils]: 92: Hoare triple {29221#(<= main_~k~0 21)} assume true; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:54,065 INFO L273 TraceCheckUtils]: 93: Hoare triple {29221#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:54,065 INFO L273 TraceCheckUtils]: 94: Hoare triple {29221#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29221#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:54,066 INFO L273 TraceCheckUtils]: 95: Hoare triple {29221#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:54,066 INFO L273 TraceCheckUtils]: 96: Hoare triple {29222#(<= main_~k~0 22)} assume true; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:54,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {29222#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:54,067 INFO L273 TraceCheckUtils]: 98: Hoare triple {29222#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29222#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:54,068 INFO L273 TraceCheckUtils]: 99: Hoare triple {29222#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:54,068 INFO L273 TraceCheckUtils]: 100: Hoare triple {29223#(<= main_~k~0 23)} assume true; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:54,069 INFO L273 TraceCheckUtils]: 101: Hoare triple {29223#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:54,069 INFO L273 TraceCheckUtils]: 102: Hoare triple {29223#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29223#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:54,070 INFO L273 TraceCheckUtils]: 103: Hoare triple {29223#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:54,070 INFO L273 TraceCheckUtils]: 104: Hoare triple {29224#(<= main_~k~0 24)} assume true; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:54,071 INFO L273 TraceCheckUtils]: 105: Hoare triple {29224#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:54,071 INFO L273 TraceCheckUtils]: 106: Hoare triple {29224#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29224#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:54,072 INFO L273 TraceCheckUtils]: 107: Hoare triple {29224#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:54,072 INFO L273 TraceCheckUtils]: 108: Hoare triple {29225#(<= main_~k~0 25)} assume true; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:54,073 INFO L273 TraceCheckUtils]: 109: Hoare triple {29225#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:54,073 INFO L273 TraceCheckUtils]: 110: Hoare triple {29225#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29225#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:54,074 INFO L273 TraceCheckUtils]: 111: Hoare triple {29225#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:54,075 INFO L273 TraceCheckUtils]: 112: Hoare triple {29226#(<= main_~k~0 26)} assume true; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:54,075 INFO L273 TraceCheckUtils]: 113: Hoare triple {29226#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:54,075 INFO L273 TraceCheckUtils]: 114: Hoare triple {29226#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29226#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:54,076 INFO L273 TraceCheckUtils]: 115: Hoare triple {29226#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:54,077 INFO L273 TraceCheckUtils]: 116: Hoare triple {29227#(<= main_~k~0 27)} assume true; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:54,077 INFO L273 TraceCheckUtils]: 117: Hoare triple {29227#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:54,078 INFO L273 TraceCheckUtils]: 118: Hoare triple {29227#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29227#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:54,078 INFO L273 TraceCheckUtils]: 119: Hoare triple {29227#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:54,079 INFO L273 TraceCheckUtils]: 120: Hoare triple {29228#(<= main_~k~0 28)} assume true; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:54,079 INFO L273 TraceCheckUtils]: 121: Hoare triple {29228#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:54,080 INFO L273 TraceCheckUtils]: 122: Hoare triple {29228#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29228#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:54,080 INFO L273 TraceCheckUtils]: 123: Hoare triple {29228#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:54,081 INFO L273 TraceCheckUtils]: 124: Hoare triple {29229#(<= main_~k~0 29)} assume true; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:54,081 INFO L273 TraceCheckUtils]: 125: Hoare triple {29229#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:54,082 INFO L273 TraceCheckUtils]: 126: Hoare triple {29229#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29229#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:54,082 INFO L273 TraceCheckUtils]: 127: Hoare triple {29229#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:54,083 INFO L273 TraceCheckUtils]: 128: Hoare triple {29230#(<= main_~k~0 30)} assume true; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:54,083 INFO L273 TraceCheckUtils]: 129: Hoare triple {29230#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:54,084 INFO L273 TraceCheckUtils]: 130: Hoare triple {29230#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29230#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:54,084 INFO L273 TraceCheckUtils]: 131: Hoare triple {29230#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {29231#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:54,085 INFO L273 TraceCheckUtils]: 132: Hoare triple {29231#(<= main_~k~0 31)} assume true; {29231#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:54,085 INFO L273 TraceCheckUtils]: 133: Hoare triple {29231#(<= main_~k~0 31)} assume !(~k~0 < 100000); {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {29198#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 135: Hoare triple {29198#false} ~x~0 := 0; {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 136: Hoare triple {29198#false} assume true; {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 137: Hoare triple {29198#false} assume !(~x~0 < ~i~0); {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 138: Hoare triple {29198#false} ~x~0 := 1 + ~i~0; {29198#false} is VALID [2018-11-18 22:44:54,086 INFO L273 TraceCheckUtils]: 139: Hoare triple {29198#false} assume true; {29198#false} is VALID [2018-11-18 22:44:54,087 INFO L273 TraceCheckUtils]: 140: Hoare triple {29198#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29198#false} is VALID [2018-11-18 22:44:54,087 INFO L256 TraceCheckUtils]: 141: Hoare triple {29198#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29198#false} is VALID [2018-11-18 22:44:54,087 INFO L273 TraceCheckUtils]: 142: Hoare triple {29198#false} ~cond := #in~cond; {29198#false} is VALID [2018-11-18 22:44:54,087 INFO L273 TraceCheckUtils]: 143: Hoare triple {29198#false} assume 0 == ~cond; {29198#false} is VALID [2018-11-18 22:44:54,087 INFO L273 TraceCheckUtils]: 144: Hoare triple {29198#false} assume !false; {29198#false} is VALID [2018-11-18 22:44:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-11-18 22:44:54,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 145 [2018-11-18 22:44:54,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:54,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-18 22:44:54,251 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-18 22:44:54,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 22:44:54,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 22:44:54,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:44:54,253 INFO L87 Difference]: Start difference. First operand 180 states and 223 transitions. Second operand 37 states. [2018-11-18 22:44:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:56,873 INFO L93 Difference]: Finished difference Result 235 states and 294 transitions. [2018-11-18 22:44:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 22:44:56,873 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 145 [2018-11-18 22:44:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:44:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 285 transitions. [2018-11-18 22:44:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:44:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 285 transitions. [2018-11-18 22:44:56,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 285 transitions. [2018-11-18 22:44:57,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:57,128 INFO L225 Difference]: With dead ends: 235 [2018-11-18 22:44:57,128 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 22:44:57,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-11-18 22:44:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 22:44:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2018-11-18 22:44:57,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:57,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 184 states. [2018-11-18 22:44:57,213 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 184 states. [2018-11-18 22:44:57,213 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 184 states. [2018-11-18 22:44:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:57,217 INFO L93 Difference]: Finished difference Result 193 states and 240 transitions. [2018-11-18 22:44:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 240 transitions. [2018-11-18 22:44:57,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:57,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:57,217 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 193 states. [2018-11-18 22:44:57,217 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 193 states. [2018-11-18 22:44:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:57,220 INFO L93 Difference]: Finished difference Result 193 states and 240 transitions. [2018-11-18 22:44:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 240 transitions. [2018-11-18 22:44:57,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:57,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:57,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:57,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 22:44:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 228 transitions. [2018-11-18 22:44:57,223 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 228 transitions. Word has length 145 [2018-11-18 22:44:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:57,224 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 228 transitions. [2018-11-18 22:44:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 22:44:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 228 transitions. [2018-11-18 22:44:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 22:44:57,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:57,224 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:57,225 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:57,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1474490829, now seen corresponding path program 21 times [2018-11-18 22:44:57,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:57,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:57,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {30653#true} call ULTIMATE.init(); {30653#true} is VALID [2018-11-18 22:44:57,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {30653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30653#true} is VALID [2018-11-18 22:44:57,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {30653#true} assume true; {30653#true} is VALID [2018-11-18 22:44:57,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30653#true} {30653#true} #137#return; {30653#true} is VALID [2018-11-18 22:44:57,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {30653#true} call #t~ret15 := main(); {30653#true} is VALID [2018-11-18 22:44:57,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {30653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {30655#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:57,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {30655#(= 0 main_~i~0)} assume true; {30655#(= 0 main_~i~0)} is VALID [2018-11-18 22:44:57,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {30655#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {30656#(= main_~k~0 0)} is VALID [2018-11-18 22:44:57,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {30656#(= main_~k~0 0)} assume true; {30656#(= main_~k~0 0)} is VALID [2018-11-18 22:44:57,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {30656#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30656#(= main_~k~0 0)} is VALID [2018-11-18 22:44:57,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {30656#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30656#(= main_~k~0 0)} is VALID [2018-11-18 22:44:57,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {30656#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:57,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~k~0 1)} assume true; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:57,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:57,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {30657#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:57,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {30657#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:57,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {30658#(<= main_~k~0 2)} assume true; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:57,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {30658#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:57,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {30658#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:57,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {30658#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:57,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {30659#(<= main_~k~0 3)} assume true; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:57,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {30659#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {30659#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {30659#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {30660#(<= main_~k~0 4)} assume true; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {30660#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {30660#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {30660#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {30661#(<= main_~k~0 5)} assume true; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {30661#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {30661#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {30661#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {30662#(<= main_~k~0 6)} assume true; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {30662#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {30662#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {30662#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {30663#(<= main_~k~0 7)} assume true; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {30663#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,008 INFO L273 TraceCheckUtils]: 38: Hoare triple {30663#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {30663#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {30664#(<= main_~k~0 8)} assume true; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {30664#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {30664#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {30664#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {30665#(<= main_~k~0 9)} assume true; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {30665#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {30665#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {30665#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {30666#(<= main_~k~0 10)} assume true; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {30666#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,014 INFO L273 TraceCheckUtils]: 50: Hoare triple {30666#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {30666#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {30667#(<= main_~k~0 11)} assume true; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,016 INFO L273 TraceCheckUtils]: 53: Hoare triple {30667#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {30667#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,017 INFO L273 TraceCheckUtils]: 55: Hoare triple {30667#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {30668#(<= main_~k~0 12)} assume true; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {30668#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,019 INFO L273 TraceCheckUtils]: 58: Hoare triple {30668#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {30668#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {30669#(<= main_~k~0 13)} assume true; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {30669#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {30669#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {30669#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {30670#(<= main_~k~0 14)} assume true; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {30670#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,023 INFO L273 TraceCheckUtils]: 66: Hoare triple {30670#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,023 INFO L273 TraceCheckUtils]: 67: Hoare triple {30670#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,024 INFO L273 TraceCheckUtils]: 68: Hoare triple {30671#(<= main_~k~0 15)} assume true; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,024 INFO L273 TraceCheckUtils]: 69: Hoare triple {30671#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,025 INFO L273 TraceCheckUtils]: 70: Hoare triple {30671#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,025 INFO L273 TraceCheckUtils]: 71: Hoare triple {30671#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,026 INFO L273 TraceCheckUtils]: 72: Hoare triple {30672#(<= main_~k~0 16)} assume true; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,026 INFO L273 TraceCheckUtils]: 73: Hoare triple {30672#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,027 INFO L273 TraceCheckUtils]: 74: Hoare triple {30672#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,027 INFO L273 TraceCheckUtils]: 75: Hoare triple {30672#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,028 INFO L273 TraceCheckUtils]: 76: Hoare triple {30673#(<= main_~k~0 17)} assume true; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,028 INFO L273 TraceCheckUtils]: 77: Hoare triple {30673#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,029 INFO L273 TraceCheckUtils]: 78: Hoare triple {30673#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,030 INFO L273 TraceCheckUtils]: 79: Hoare triple {30673#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,030 INFO L273 TraceCheckUtils]: 80: Hoare triple {30674#(<= main_~k~0 18)} assume true; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,030 INFO L273 TraceCheckUtils]: 81: Hoare triple {30674#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,031 INFO L273 TraceCheckUtils]: 82: Hoare triple {30674#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,032 INFO L273 TraceCheckUtils]: 83: Hoare triple {30674#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,032 INFO L273 TraceCheckUtils]: 84: Hoare triple {30675#(<= main_~k~0 19)} assume true; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,033 INFO L273 TraceCheckUtils]: 85: Hoare triple {30675#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,033 INFO L273 TraceCheckUtils]: 86: Hoare triple {30675#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,034 INFO L273 TraceCheckUtils]: 87: Hoare triple {30675#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,034 INFO L273 TraceCheckUtils]: 88: Hoare triple {30676#(<= main_~k~0 20)} assume true; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,035 INFO L273 TraceCheckUtils]: 89: Hoare triple {30676#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,035 INFO L273 TraceCheckUtils]: 90: Hoare triple {30676#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,036 INFO L273 TraceCheckUtils]: 91: Hoare triple {30676#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,036 INFO L273 TraceCheckUtils]: 92: Hoare triple {30677#(<= main_~k~0 21)} assume true; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,037 INFO L273 TraceCheckUtils]: 93: Hoare triple {30677#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,037 INFO L273 TraceCheckUtils]: 94: Hoare triple {30677#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,038 INFO L273 TraceCheckUtils]: 95: Hoare triple {30677#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,038 INFO L273 TraceCheckUtils]: 96: Hoare triple {30678#(<= main_~k~0 22)} assume true; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,039 INFO L273 TraceCheckUtils]: 97: Hoare triple {30678#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {30678#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {30678#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {30679#(<= main_~k~0 23)} assume true; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,041 INFO L273 TraceCheckUtils]: 101: Hoare triple {30679#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,041 INFO L273 TraceCheckUtils]: 102: Hoare triple {30679#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,042 INFO L273 TraceCheckUtils]: 103: Hoare triple {30679#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {30680#(<= main_~k~0 24)} assume true; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,043 INFO L273 TraceCheckUtils]: 105: Hoare triple {30680#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,043 INFO L273 TraceCheckUtils]: 106: Hoare triple {30680#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {30680#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,045 INFO L273 TraceCheckUtils]: 108: Hoare triple {30681#(<= main_~k~0 25)} assume true; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,045 INFO L273 TraceCheckUtils]: 109: Hoare triple {30681#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,045 INFO L273 TraceCheckUtils]: 110: Hoare triple {30681#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,046 INFO L273 TraceCheckUtils]: 111: Hoare triple {30681#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,047 INFO L273 TraceCheckUtils]: 112: Hoare triple {30682#(<= main_~k~0 26)} assume true; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,047 INFO L273 TraceCheckUtils]: 113: Hoare triple {30682#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,047 INFO L273 TraceCheckUtils]: 114: Hoare triple {30682#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,048 INFO L273 TraceCheckUtils]: 115: Hoare triple {30682#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,049 INFO L273 TraceCheckUtils]: 116: Hoare triple {30683#(<= main_~k~0 27)} assume true; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,049 INFO L273 TraceCheckUtils]: 117: Hoare triple {30683#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,050 INFO L273 TraceCheckUtils]: 118: Hoare triple {30683#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,050 INFO L273 TraceCheckUtils]: 119: Hoare triple {30683#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,051 INFO L273 TraceCheckUtils]: 120: Hoare triple {30684#(<= main_~k~0 28)} assume true; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,051 INFO L273 TraceCheckUtils]: 121: Hoare triple {30684#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,052 INFO L273 TraceCheckUtils]: 122: Hoare triple {30684#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,052 INFO L273 TraceCheckUtils]: 123: Hoare triple {30684#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,053 INFO L273 TraceCheckUtils]: 124: Hoare triple {30685#(<= main_~k~0 29)} assume true; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,053 INFO L273 TraceCheckUtils]: 125: Hoare triple {30685#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,054 INFO L273 TraceCheckUtils]: 126: Hoare triple {30685#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {30685#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,055 INFO L273 TraceCheckUtils]: 128: Hoare triple {30686#(<= main_~k~0 30)} assume true; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,055 INFO L273 TraceCheckUtils]: 129: Hoare triple {30686#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,056 INFO L273 TraceCheckUtils]: 130: Hoare triple {30686#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,056 INFO L273 TraceCheckUtils]: 131: Hoare triple {30686#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,057 INFO L273 TraceCheckUtils]: 132: Hoare triple {30687#(<= main_~k~0 31)} assume true; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,057 INFO L273 TraceCheckUtils]: 133: Hoare triple {30687#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,058 INFO L273 TraceCheckUtils]: 134: Hoare triple {30687#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,059 INFO L273 TraceCheckUtils]: 135: Hoare triple {30687#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {30688#(<= main_~k~0 32)} is VALID [2018-11-18 22:44:58,059 INFO L273 TraceCheckUtils]: 136: Hoare triple {30688#(<= main_~k~0 32)} assume true; {30688#(<= main_~k~0 32)} is VALID [2018-11-18 22:44:58,060 INFO L273 TraceCheckUtils]: 137: Hoare triple {30688#(<= main_~k~0 32)} assume !(~k~0 < 100000); {30654#false} is VALID [2018-11-18 22:44:58,060 INFO L273 TraceCheckUtils]: 138: Hoare triple {30654#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30654#false} is VALID [2018-11-18 22:44:58,060 INFO L273 TraceCheckUtils]: 139: Hoare triple {30654#false} ~x~0 := 0; {30654#false} is VALID [2018-11-18 22:44:58,060 INFO L273 TraceCheckUtils]: 140: Hoare triple {30654#false} assume true; {30654#false} is VALID [2018-11-18 22:44:58,061 INFO L273 TraceCheckUtils]: 141: Hoare triple {30654#false} assume !(~x~0 < ~i~0); {30654#false} is VALID [2018-11-18 22:44:58,061 INFO L273 TraceCheckUtils]: 142: Hoare triple {30654#false} ~x~0 := 1 + ~i~0; {30654#false} is VALID [2018-11-18 22:44:58,061 INFO L273 TraceCheckUtils]: 143: Hoare triple {30654#false} assume true; {30654#false} is VALID [2018-11-18 22:44:58,061 INFO L273 TraceCheckUtils]: 144: Hoare triple {30654#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30654#false} is VALID [2018-11-18 22:44:58,061 INFO L256 TraceCheckUtils]: 145: Hoare triple {30654#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30654#false} is VALID [2018-11-18 22:44:58,062 INFO L273 TraceCheckUtils]: 146: Hoare triple {30654#false} ~cond := #in~cond; {30654#false} is VALID [2018-11-18 22:44:58,062 INFO L273 TraceCheckUtils]: 147: Hoare triple {30654#false} assume 0 == ~cond; {30654#false} is VALID [2018-11-18 22:44:58,062 INFO L273 TraceCheckUtils]: 148: Hoare triple {30654#false} assume !false; {30654#false} is VALID [2018-11-18 22:44:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:58,077 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-18 22:44:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:44:58,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-18 22:44:58,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:58,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:58,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {30653#true} call ULTIMATE.init(); {30653#true} is VALID [2018-11-18 22:44:58,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {30653#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30653#true} is VALID [2018-11-18 22:44:58,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {30653#true} assume true; {30653#true} is VALID [2018-11-18 22:44:58,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30653#true} {30653#true} #137#return; {30653#true} is VALID [2018-11-18 22:44:58,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {30653#true} call #t~ret15 := main(); {30653#true} is VALID [2018-11-18 22:44:58,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {30653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {30707#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:58,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {30707#(<= main_~i~0 0)} assume true; {30707#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:58,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {30707#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {30714#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:58,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {30714#(<= main_~k~0 0)} assume true; {30714#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:58,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {30714#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30714#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:58,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {30714#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30714#(<= main_~k~0 0)} is VALID [2018-11-18 22:44:58,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {30714#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:58,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {30657#(<= main_~k~0 1)} assume true; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:58,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {30657#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:58,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {30657#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {30657#(<= main_~k~0 1)} is VALID [2018-11-18 22:44:58,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {30657#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:58,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {30658#(<= main_~k~0 2)} assume true; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:58,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {30658#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:58,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {30658#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30658#(<= main_~k~0 2)} is VALID [2018-11-18 22:44:58,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {30658#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {30659#(<= main_~k~0 3)} assume true; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {30659#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {30659#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30659#(<= main_~k~0 3)} is VALID [2018-11-18 22:44:58,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {30659#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {30660#(<= main_~k~0 4)} assume true; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {30660#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {30660#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30660#(<= main_~k~0 4)} is VALID [2018-11-18 22:44:58,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {30660#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {30661#(<= main_~k~0 5)} assume true; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {30661#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,623 INFO L273 TraceCheckUtils]: 30: Hoare triple {30661#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30661#(<= main_~k~0 5)} is VALID [2018-11-18 22:44:58,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {30661#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {30662#(<= main_~k~0 6)} assume true; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {30662#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {30662#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30662#(<= main_~k~0 6)} is VALID [2018-11-18 22:44:58,628 INFO L273 TraceCheckUtils]: 35: Hoare triple {30662#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {30663#(<= main_~k~0 7)} assume true; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {30663#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {30663#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30663#(<= main_~k~0 7)} is VALID [2018-11-18 22:44:58,673 INFO L273 TraceCheckUtils]: 39: Hoare triple {30663#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {30664#(<= main_~k~0 8)} assume true; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {30664#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {30664#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30664#(<= main_~k~0 8)} is VALID [2018-11-18 22:44:58,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {30664#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {30665#(<= main_~k~0 9)} assume true; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {30665#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,676 INFO L273 TraceCheckUtils]: 46: Hoare triple {30665#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30665#(<= main_~k~0 9)} is VALID [2018-11-18 22:44:58,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {30665#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {30666#(<= main_~k~0 10)} assume true; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {30666#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,677 INFO L273 TraceCheckUtils]: 50: Hoare triple {30666#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30666#(<= main_~k~0 10)} is VALID [2018-11-18 22:44:58,677 INFO L273 TraceCheckUtils]: 51: Hoare triple {30666#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,678 INFO L273 TraceCheckUtils]: 52: Hoare triple {30667#(<= main_~k~0 11)} assume true; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,678 INFO L273 TraceCheckUtils]: 53: Hoare triple {30667#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {30667#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30667#(<= main_~k~0 11)} is VALID [2018-11-18 22:44:58,680 INFO L273 TraceCheckUtils]: 55: Hoare triple {30667#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {30668#(<= main_~k~0 12)} assume true; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,681 INFO L273 TraceCheckUtils]: 57: Hoare triple {30668#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,681 INFO L273 TraceCheckUtils]: 58: Hoare triple {30668#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30668#(<= main_~k~0 12)} is VALID [2018-11-18 22:44:58,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {30668#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,682 INFO L273 TraceCheckUtils]: 60: Hoare triple {30669#(<= main_~k~0 13)} assume true; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,683 INFO L273 TraceCheckUtils]: 61: Hoare triple {30669#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,683 INFO L273 TraceCheckUtils]: 62: Hoare triple {30669#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30669#(<= main_~k~0 13)} is VALID [2018-11-18 22:44:58,684 INFO L273 TraceCheckUtils]: 63: Hoare triple {30669#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,685 INFO L273 TraceCheckUtils]: 64: Hoare triple {30670#(<= main_~k~0 14)} assume true; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,685 INFO L273 TraceCheckUtils]: 65: Hoare triple {30670#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,686 INFO L273 TraceCheckUtils]: 66: Hoare triple {30670#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30670#(<= main_~k~0 14)} is VALID [2018-11-18 22:44:58,686 INFO L273 TraceCheckUtils]: 67: Hoare triple {30670#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,687 INFO L273 TraceCheckUtils]: 68: Hoare triple {30671#(<= main_~k~0 15)} assume true; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,687 INFO L273 TraceCheckUtils]: 69: Hoare triple {30671#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,688 INFO L273 TraceCheckUtils]: 70: Hoare triple {30671#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30671#(<= main_~k~0 15)} is VALID [2018-11-18 22:44:58,688 INFO L273 TraceCheckUtils]: 71: Hoare triple {30671#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,689 INFO L273 TraceCheckUtils]: 72: Hoare triple {30672#(<= main_~k~0 16)} assume true; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,689 INFO L273 TraceCheckUtils]: 73: Hoare triple {30672#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,690 INFO L273 TraceCheckUtils]: 74: Hoare triple {30672#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30672#(<= main_~k~0 16)} is VALID [2018-11-18 22:44:58,691 INFO L273 TraceCheckUtils]: 75: Hoare triple {30672#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,691 INFO L273 TraceCheckUtils]: 76: Hoare triple {30673#(<= main_~k~0 17)} assume true; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,692 INFO L273 TraceCheckUtils]: 77: Hoare triple {30673#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,692 INFO L273 TraceCheckUtils]: 78: Hoare triple {30673#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30673#(<= main_~k~0 17)} is VALID [2018-11-18 22:44:58,693 INFO L273 TraceCheckUtils]: 79: Hoare triple {30673#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {30674#(<= main_~k~0 18)} assume true; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,694 INFO L273 TraceCheckUtils]: 81: Hoare triple {30674#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,696 INFO L273 TraceCheckUtils]: 82: Hoare triple {30674#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30674#(<= main_~k~0 18)} is VALID [2018-11-18 22:44:58,696 INFO L273 TraceCheckUtils]: 83: Hoare triple {30674#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,697 INFO L273 TraceCheckUtils]: 84: Hoare triple {30675#(<= main_~k~0 19)} assume true; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,697 INFO L273 TraceCheckUtils]: 85: Hoare triple {30675#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,698 INFO L273 TraceCheckUtils]: 86: Hoare triple {30675#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30675#(<= main_~k~0 19)} is VALID [2018-11-18 22:44:58,698 INFO L273 TraceCheckUtils]: 87: Hoare triple {30675#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,700 INFO L273 TraceCheckUtils]: 88: Hoare triple {30676#(<= main_~k~0 20)} assume true; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,700 INFO L273 TraceCheckUtils]: 89: Hoare triple {30676#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,702 INFO L273 TraceCheckUtils]: 90: Hoare triple {30676#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30676#(<= main_~k~0 20)} is VALID [2018-11-18 22:44:58,702 INFO L273 TraceCheckUtils]: 91: Hoare triple {30676#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {30677#(<= main_~k~0 21)} assume true; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {30677#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,707 INFO L273 TraceCheckUtils]: 94: Hoare triple {30677#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30677#(<= main_~k~0 21)} is VALID [2018-11-18 22:44:58,707 INFO L273 TraceCheckUtils]: 95: Hoare triple {30677#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,707 INFO L273 TraceCheckUtils]: 96: Hoare triple {30678#(<= main_~k~0 22)} assume true; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {30678#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {30678#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30678#(<= main_~k~0 22)} is VALID [2018-11-18 22:44:58,708 INFO L273 TraceCheckUtils]: 99: Hoare triple {30678#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {30679#(<= main_~k~0 23)} assume true; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {30679#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,712 INFO L273 TraceCheckUtils]: 102: Hoare triple {30679#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30679#(<= main_~k~0 23)} is VALID [2018-11-18 22:44:58,712 INFO L273 TraceCheckUtils]: 103: Hoare triple {30679#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,713 INFO L273 TraceCheckUtils]: 104: Hoare triple {30680#(<= main_~k~0 24)} assume true; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,713 INFO L273 TraceCheckUtils]: 105: Hoare triple {30680#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,714 INFO L273 TraceCheckUtils]: 106: Hoare triple {30680#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30680#(<= main_~k~0 24)} is VALID [2018-11-18 22:44:58,714 INFO L273 TraceCheckUtils]: 107: Hoare triple {30680#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,719 INFO L273 TraceCheckUtils]: 108: Hoare triple {30681#(<= main_~k~0 25)} assume true; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,722 INFO L273 TraceCheckUtils]: 109: Hoare triple {30681#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,722 INFO L273 TraceCheckUtils]: 110: Hoare triple {30681#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30681#(<= main_~k~0 25)} is VALID [2018-11-18 22:44:58,726 INFO L273 TraceCheckUtils]: 111: Hoare triple {30681#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,729 INFO L273 TraceCheckUtils]: 112: Hoare triple {30682#(<= main_~k~0 26)} assume true; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,729 INFO L273 TraceCheckUtils]: 113: Hoare triple {30682#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,733 INFO L273 TraceCheckUtils]: 114: Hoare triple {30682#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30682#(<= main_~k~0 26)} is VALID [2018-11-18 22:44:58,735 INFO L273 TraceCheckUtils]: 115: Hoare triple {30682#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,735 INFO L273 TraceCheckUtils]: 116: Hoare triple {30683#(<= main_~k~0 27)} assume true; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,737 INFO L273 TraceCheckUtils]: 117: Hoare triple {30683#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,737 INFO L273 TraceCheckUtils]: 118: Hoare triple {30683#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30683#(<= main_~k~0 27)} is VALID [2018-11-18 22:44:58,739 INFO L273 TraceCheckUtils]: 119: Hoare triple {30683#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,739 INFO L273 TraceCheckUtils]: 120: Hoare triple {30684#(<= main_~k~0 28)} assume true; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,741 INFO L273 TraceCheckUtils]: 121: Hoare triple {30684#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,741 INFO L273 TraceCheckUtils]: 122: Hoare triple {30684#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30684#(<= main_~k~0 28)} is VALID [2018-11-18 22:44:58,743 INFO L273 TraceCheckUtils]: 123: Hoare triple {30684#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,743 INFO L273 TraceCheckUtils]: 124: Hoare triple {30685#(<= main_~k~0 29)} assume true; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,746 INFO L273 TraceCheckUtils]: 125: Hoare triple {30685#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,746 INFO L273 TraceCheckUtils]: 126: Hoare triple {30685#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30685#(<= main_~k~0 29)} is VALID [2018-11-18 22:44:58,749 INFO L273 TraceCheckUtils]: 127: Hoare triple {30685#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,749 INFO L273 TraceCheckUtils]: 128: Hoare triple {30686#(<= main_~k~0 30)} assume true; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,752 INFO L273 TraceCheckUtils]: 129: Hoare triple {30686#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,752 INFO L273 TraceCheckUtils]: 130: Hoare triple {30686#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30686#(<= main_~k~0 30)} is VALID [2018-11-18 22:44:58,755 INFO L273 TraceCheckUtils]: 131: Hoare triple {30686#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,755 INFO L273 TraceCheckUtils]: 132: Hoare triple {30687#(<= main_~k~0 31)} assume true; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,758 INFO L273 TraceCheckUtils]: 133: Hoare triple {30687#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,758 INFO L273 TraceCheckUtils]: 134: Hoare triple {30687#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {30687#(<= main_~k~0 31)} is VALID [2018-11-18 22:44:58,761 INFO L273 TraceCheckUtils]: 135: Hoare triple {30687#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {30688#(<= main_~k~0 32)} is VALID [2018-11-18 22:44:58,761 INFO L273 TraceCheckUtils]: 136: Hoare triple {30688#(<= main_~k~0 32)} assume true; {30688#(<= main_~k~0 32)} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 137: Hoare triple {30688#(<= main_~k~0 32)} assume !(~k~0 < 100000); {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 138: Hoare triple {30654#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 139: Hoare triple {30654#false} ~x~0 := 0; {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 140: Hoare triple {30654#false} assume true; {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 141: Hoare triple {30654#false} assume !(~x~0 < ~i~0); {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 142: Hoare triple {30654#false} ~x~0 := 1 + ~i~0; {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 143: Hoare triple {30654#false} assume true; {30654#false} is VALID [2018-11-18 22:44:58,764 INFO L273 TraceCheckUtils]: 144: Hoare triple {30654#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30654#false} is VALID [2018-11-18 22:44:58,765 INFO L256 TraceCheckUtils]: 145: Hoare triple {30654#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {30654#false} is VALID [2018-11-18 22:44:58,765 INFO L273 TraceCheckUtils]: 146: Hoare triple {30654#false} ~cond := #in~cond; {30654#false} is VALID [2018-11-18 22:44:58,765 INFO L273 TraceCheckUtils]: 147: Hoare triple {30654#false} assume 0 == ~cond; {30654#false} is VALID [2018-11-18 22:44:58,765 INFO L273 TraceCheckUtils]: 148: Hoare triple {30654#false} assume !false; {30654#false} is VALID [2018-11-18 22:44:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:44:58,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2018-11-18 22:44:58,799 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-11-18 22:44:58,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:58,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-18 22:44:59,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:59,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 22:44:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 22:44:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:44:59,036 INFO L87 Difference]: Start difference. First operand 184 states and 228 transitions. Second operand 38 states. [2018-11-18 22:45:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:01,757 INFO L93 Difference]: Finished difference Result 239 states and 299 transitions. [2018-11-18 22:45:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 22:45:01,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-11-18 22:45:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:45:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 290 transitions. [2018-11-18 22:45:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:45:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 290 transitions. [2018-11-18 22:45:01,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 290 transitions. [2018-11-18 22:45:02,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:02,017 INFO L225 Difference]: With dead ends: 239 [2018-11-18 22:45:02,017 INFO L226 Difference]: Without dead ends: 197 [2018-11-18 22:45:02,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-11-18 22:45:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-18 22:45:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2018-11-18 22:45:02,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:02,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 188 states. [2018-11-18 22:45:02,113 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 188 states. [2018-11-18 22:45:02,113 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 188 states. [2018-11-18 22:45:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:02,117 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-11-18 22:45:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2018-11-18 22:45:02,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:02,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:02,118 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 197 states. [2018-11-18 22:45:02,118 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 197 states. [2018-11-18 22:45:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:02,122 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-11-18 22:45:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2018-11-18 22:45:02,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:02,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:02,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:02,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 22:45:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 233 transitions. [2018-11-18 22:45:02,126 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 233 transitions. Word has length 149 [2018-11-18 22:45:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:02,127 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 233 transitions. [2018-11-18 22:45:02,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 22:45:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 233 transitions. [2018-11-18 22:45:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 22:45:02,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:02,128 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:02,128 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:02,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 245392905, now seen corresponding path program 22 times [2018-11-18 22:45:02,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:02,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:02,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:03,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {32142#true} call ULTIMATE.init(); {32142#true} is VALID [2018-11-18 22:45:03,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {32142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32142#true} is VALID [2018-11-18 22:45:03,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {32142#true} assume true; {32142#true} is VALID [2018-11-18 22:45:03,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32142#true} {32142#true} #137#return; {32142#true} is VALID [2018-11-18 22:45:03,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {32142#true} call #t~ret15 := main(); {32142#true} is VALID [2018-11-18 22:45:03,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {32142#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32144#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:03,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {32144#(= 0 main_~i~0)} assume true; {32144#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:03,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {32144#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {32145#(= main_~k~0 0)} is VALID [2018-11-18 22:45:03,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {32145#(= main_~k~0 0)} assume true; {32145#(= main_~k~0 0)} is VALID [2018-11-18 22:45:03,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {32145#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32145#(= main_~k~0 0)} is VALID [2018-11-18 22:45:03,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {32145#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32145#(= main_~k~0 0)} is VALID [2018-11-18 22:45:03,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {32145#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:03,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {32146#(<= main_~k~0 1)} assume true; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:03,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {32146#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:03,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {32146#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:03,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {32146#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:03,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {32147#(<= main_~k~0 2)} assume true; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:03,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {32147#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:03,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {32147#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:03,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {32147#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:03,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {32148#(<= main_~k~0 3)} assume true; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:03,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {32148#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:03,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {32148#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:03,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {32148#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:03,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {32149#(<= main_~k~0 4)} assume true; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:03,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {32149#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:03,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {32149#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:03,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {32149#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:03,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {32150#(<= main_~k~0 5)} assume true; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:03,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {32150#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:03,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {32150#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:03,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {32150#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:03,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {32151#(<= main_~k~0 6)} assume true; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:03,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {32151#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:03,540 INFO L273 TraceCheckUtils]: 34: Hoare triple {32151#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:03,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {32151#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:03,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {32152#(<= main_~k~0 7)} assume true; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:03,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {32152#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:03,541 INFO L273 TraceCheckUtils]: 38: Hoare triple {32152#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:03,542 INFO L273 TraceCheckUtils]: 39: Hoare triple {32152#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:03,542 INFO L273 TraceCheckUtils]: 40: Hoare triple {32153#(<= main_~k~0 8)} assume true; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:03,542 INFO L273 TraceCheckUtils]: 41: Hoare triple {32153#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:03,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {32153#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:03,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {32153#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:03,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {32154#(<= main_~k~0 9)} assume true; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:03,544 INFO L273 TraceCheckUtils]: 45: Hoare triple {32154#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:03,545 INFO L273 TraceCheckUtils]: 46: Hoare triple {32154#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:03,545 INFO L273 TraceCheckUtils]: 47: Hoare triple {32154#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:03,546 INFO L273 TraceCheckUtils]: 48: Hoare triple {32155#(<= main_~k~0 10)} assume true; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:03,546 INFO L273 TraceCheckUtils]: 49: Hoare triple {32155#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:03,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {32155#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:03,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {32155#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:03,548 INFO L273 TraceCheckUtils]: 52: Hoare triple {32156#(<= main_~k~0 11)} assume true; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:03,548 INFO L273 TraceCheckUtils]: 53: Hoare triple {32156#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:03,549 INFO L273 TraceCheckUtils]: 54: Hoare triple {32156#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:03,550 INFO L273 TraceCheckUtils]: 55: Hoare triple {32156#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:03,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {32157#(<= main_~k~0 12)} assume true; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:03,551 INFO L273 TraceCheckUtils]: 57: Hoare triple {32157#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:03,551 INFO L273 TraceCheckUtils]: 58: Hoare triple {32157#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:03,552 INFO L273 TraceCheckUtils]: 59: Hoare triple {32157#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:03,552 INFO L273 TraceCheckUtils]: 60: Hoare triple {32158#(<= main_~k~0 13)} assume true; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:03,553 INFO L273 TraceCheckUtils]: 61: Hoare triple {32158#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:03,553 INFO L273 TraceCheckUtils]: 62: Hoare triple {32158#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:03,554 INFO L273 TraceCheckUtils]: 63: Hoare triple {32158#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:03,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {32159#(<= main_~k~0 14)} assume true; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:03,555 INFO L273 TraceCheckUtils]: 65: Hoare triple {32159#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:03,555 INFO L273 TraceCheckUtils]: 66: Hoare triple {32159#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:03,556 INFO L273 TraceCheckUtils]: 67: Hoare triple {32159#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:03,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {32160#(<= main_~k~0 15)} assume true; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:03,557 INFO L273 TraceCheckUtils]: 69: Hoare triple {32160#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:03,557 INFO L273 TraceCheckUtils]: 70: Hoare triple {32160#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:03,558 INFO L273 TraceCheckUtils]: 71: Hoare triple {32160#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:03,559 INFO L273 TraceCheckUtils]: 72: Hoare triple {32161#(<= main_~k~0 16)} assume true; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:03,559 INFO L273 TraceCheckUtils]: 73: Hoare triple {32161#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:03,560 INFO L273 TraceCheckUtils]: 74: Hoare triple {32161#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:03,560 INFO L273 TraceCheckUtils]: 75: Hoare triple {32161#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:03,561 INFO L273 TraceCheckUtils]: 76: Hoare triple {32162#(<= main_~k~0 17)} assume true; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:03,561 INFO L273 TraceCheckUtils]: 77: Hoare triple {32162#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:03,562 INFO L273 TraceCheckUtils]: 78: Hoare triple {32162#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:03,562 INFO L273 TraceCheckUtils]: 79: Hoare triple {32162#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:03,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {32163#(<= main_~k~0 18)} assume true; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:03,563 INFO L273 TraceCheckUtils]: 81: Hoare triple {32163#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:03,564 INFO L273 TraceCheckUtils]: 82: Hoare triple {32163#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:03,564 INFO L273 TraceCheckUtils]: 83: Hoare triple {32163#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:03,565 INFO L273 TraceCheckUtils]: 84: Hoare triple {32164#(<= main_~k~0 19)} assume true; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:03,565 INFO L273 TraceCheckUtils]: 85: Hoare triple {32164#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:03,566 INFO L273 TraceCheckUtils]: 86: Hoare triple {32164#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:03,567 INFO L273 TraceCheckUtils]: 87: Hoare triple {32164#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:03,567 INFO L273 TraceCheckUtils]: 88: Hoare triple {32165#(<= main_~k~0 20)} assume true; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:03,568 INFO L273 TraceCheckUtils]: 89: Hoare triple {32165#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:03,568 INFO L273 TraceCheckUtils]: 90: Hoare triple {32165#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:03,569 INFO L273 TraceCheckUtils]: 91: Hoare triple {32165#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:03,569 INFO L273 TraceCheckUtils]: 92: Hoare triple {32166#(<= main_~k~0 21)} assume true; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:03,570 INFO L273 TraceCheckUtils]: 93: Hoare triple {32166#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:03,570 INFO L273 TraceCheckUtils]: 94: Hoare triple {32166#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:03,571 INFO L273 TraceCheckUtils]: 95: Hoare triple {32166#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:03,571 INFO L273 TraceCheckUtils]: 96: Hoare triple {32167#(<= main_~k~0 22)} assume true; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:03,572 INFO L273 TraceCheckUtils]: 97: Hoare triple {32167#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:03,572 INFO L273 TraceCheckUtils]: 98: Hoare triple {32167#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:03,573 INFO L273 TraceCheckUtils]: 99: Hoare triple {32167#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:03,573 INFO L273 TraceCheckUtils]: 100: Hoare triple {32168#(<= main_~k~0 23)} assume true; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:03,574 INFO L273 TraceCheckUtils]: 101: Hoare triple {32168#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:03,574 INFO L273 TraceCheckUtils]: 102: Hoare triple {32168#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:03,575 INFO L273 TraceCheckUtils]: 103: Hoare triple {32168#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:03,576 INFO L273 TraceCheckUtils]: 104: Hoare triple {32169#(<= main_~k~0 24)} assume true; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:03,576 INFO L273 TraceCheckUtils]: 105: Hoare triple {32169#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:03,576 INFO L273 TraceCheckUtils]: 106: Hoare triple {32169#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:03,577 INFO L273 TraceCheckUtils]: 107: Hoare triple {32169#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:03,578 INFO L273 TraceCheckUtils]: 108: Hoare triple {32170#(<= main_~k~0 25)} assume true; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:03,578 INFO L273 TraceCheckUtils]: 109: Hoare triple {32170#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:03,578 INFO L273 TraceCheckUtils]: 110: Hoare triple {32170#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:03,579 INFO L273 TraceCheckUtils]: 111: Hoare triple {32170#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:03,580 INFO L273 TraceCheckUtils]: 112: Hoare triple {32171#(<= main_~k~0 26)} assume true; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:03,580 INFO L273 TraceCheckUtils]: 113: Hoare triple {32171#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:03,581 INFO L273 TraceCheckUtils]: 114: Hoare triple {32171#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:03,581 INFO L273 TraceCheckUtils]: 115: Hoare triple {32171#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:03,582 INFO L273 TraceCheckUtils]: 116: Hoare triple {32172#(<= main_~k~0 27)} assume true; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:03,582 INFO L273 TraceCheckUtils]: 117: Hoare triple {32172#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:03,583 INFO L273 TraceCheckUtils]: 118: Hoare triple {32172#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:03,583 INFO L273 TraceCheckUtils]: 119: Hoare triple {32172#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:03,584 INFO L273 TraceCheckUtils]: 120: Hoare triple {32173#(<= main_~k~0 28)} assume true; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:03,584 INFO L273 TraceCheckUtils]: 121: Hoare triple {32173#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:03,585 INFO L273 TraceCheckUtils]: 122: Hoare triple {32173#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:03,585 INFO L273 TraceCheckUtils]: 123: Hoare triple {32173#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:03,586 INFO L273 TraceCheckUtils]: 124: Hoare triple {32174#(<= main_~k~0 29)} assume true; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:03,586 INFO L273 TraceCheckUtils]: 125: Hoare triple {32174#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:03,587 INFO L273 TraceCheckUtils]: 126: Hoare triple {32174#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:03,588 INFO L273 TraceCheckUtils]: 127: Hoare triple {32174#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:03,588 INFO L273 TraceCheckUtils]: 128: Hoare triple {32175#(<= main_~k~0 30)} assume true; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:03,588 INFO L273 TraceCheckUtils]: 129: Hoare triple {32175#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:03,589 INFO L273 TraceCheckUtils]: 130: Hoare triple {32175#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:03,590 INFO L273 TraceCheckUtils]: 131: Hoare triple {32175#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:03,590 INFO L273 TraceCheckUtils]: 132: Hoare triple {32176#(<= main_~k~0 31)} assume true; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:03,591 INFO L273 TraceCheckUtils]: 133: Hoare triple {32176#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:03,591 INFO L273 TraceCheckUtils]: 134: Hoare triple {32176#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:03,592 INFO L273 TraceCheckUtils]: 135: Hoare triple {32176#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:03,592 INFO L273 TraceCheckUtils]: 136: Hoare triple {32177#(<= main_~k~0 32)} assume true; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:03,593 INFO L273 TraceCheckUtils]: 137: Hoare triple {32177#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:03,593 INFO L273 TraceCheckUtils]: 138: Hoare triple {32177#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:03,594 INFO L273 TraceCheckUtils]: 139: Hoare triple {32177#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {32178#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:03,594 INFO L273 TraceCheckUtils]: 140: Hoare triple {32178#(<= main_~k~0 33)} assume true; {32178#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:03,595 INFO L273 TraceCheckUtils]: 141: Hoare triple {32178#(<= main_~k~0 33)} assume !(~k~0 < 100000); {32143#false} is VALID [2018-11-18 22:45:03,595 INFO L273 TraceCheckUtils]: 142: Hoare triple {32143#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32143#false} is VALID [2018-11-18 22:45:03,595 INFO L273 TraceCheckUtils]: 143: Hoare triple {32143#false} ~x~0 := 0; {32143#false} is VALID [2018-11-18 22:45:03,595 INFO L273 TraceCheckUtils]: 144: Hoare triple {32143#false} assume true; {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L273 TraceCheckUtils]: 145: Hoare triple {32143#false} assume !(~x~0 < ~i~0); {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L273 TraceCheckUtils]: 146: Hoare triple {32143#false} ~x~0 := 1 + ~i~0; {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L273 TraceCheckUtils]: 147: Hoare triple {32143#false} assume true; {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L273 TraceCheckUtils]: 148: Hoare triple {32143#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L256 TraceCheckUtils]: 149: Hoare triple {32143#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32143#false} is VALID [2018-11-18 22:45:03,596 INFO L273 TraceCheckUtils]: 150: Hoare triple {32143#false} ~cond := #in~cond; {32143#false} is VALID [2018-11-18 22:45:03,597 INFO L273 TraceCheckUtils]: 151: Hoare triple {32143#false} assume 0 == ~cond; {32143#false} is VALID [2018-11-18 22:45:03,597 INFO L273 TraceCheckUtils]: 152: Hoare triple {32143#false} assume !false; {32143#false} is VALID [2018-11-18 22:45:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:03,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:03,613 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-18 22:45:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:45:03,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:45:03,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:03,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:04,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {32142#true} call ULTIMATE.init(); {32142#true} is VALID [2018-11-18 22:45:04,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {32142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32142#true} is VALID [2018-11-18 22:45:04,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {32142#true} assume true; {32142#true} is VALID [2018-11-18 22:45:04,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32142#true} {32142#true} #137#return; {32142#true} is VALID [2018-11-18 22:45:04,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {32142#true} call #t~ret15 := main(); {32142#true} is VALID [2018-11-18 22:45:04,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {32142#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32197#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:04,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {32197#(<= main_~i~0 0)} assume true; {32197#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:04,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {32197#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {32204#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:04,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {32204#(<= main_~k~0 0)} assume true; {32204#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:04,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {32204#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32204#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:04,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {32204#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32204#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:04,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {32204#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:04,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {32146#(<= main_~k~0 1)} assume true; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:04,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {32146#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:04,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {32146#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32146#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:04,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {32146#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:04,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {32147#(<= main_~k~0 2)} assume true; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:04,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {32147#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:04,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {32147#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32147#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:04,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {32147#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:04,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {32148#(<= main_~k~0 3)} assume true; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:04,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {32148#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:04,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {32148#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32148#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:04,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {32148#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:04,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {32149#(<= main_~k~0 4)} assume true; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:04,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {32149#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:04,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {32149#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32149#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:04,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {32149#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:04,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {32150#(<= main_~k~0 5)} assume true; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:04,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {32150#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:04,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {32150#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32150#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:04,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {32150#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:04,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {32151#(<= main_~k~0 6)} assume true; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:04,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {32151#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:04,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {32151#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32151#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:04,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {32151#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:04,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {32152#(<= main_~k~0 7)} assume true; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:04,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {32152#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:04,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {32152#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32152#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:04,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {32152#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:04,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {32153#(<= main_~k~0 8)} assume true; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:04,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {32153#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:04,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {32153#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32153#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:04,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {32153#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:04,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {32154#(<= main_~k~0 9)} assume true; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:04,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {32154#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:04,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {32154#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32154#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:04,330 INFO L273 TraceCheckUtils]: 47: Hoare triple {32154#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:04,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {32155#(<= main_~k~0 10)} assume true; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:04,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {32155#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:04,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {32155#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32155#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:04,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {32155#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:04,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {32156#(<= main_~k~0 11)} assume true; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:04,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {32156#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:04,334 INFO L273 TraceCheckUtils]: 54: Hoare triple {32156#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32156#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:04,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {32156#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:04,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {32157#(<= main_~k~0 12)} assume true; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:04,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {32157#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:04,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {32157#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32157#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:04,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {32157#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:04,337 INFO L273 TraceCheckUtils]: 60: Hoare triple {32158#(<= main_~k~0 13)} assume true; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:04,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {32158#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:04,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {32158#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32158#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:04,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {32158#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:04,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {32159#(<= main_~k~0 14)} assume true; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:04,340 INFO L273 TraceCheckUtils]: 65: Hoare triple {32159#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:04,341 INFO L273 TraceCheckUtils]: 66: Hoare triple {32159#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32159#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:04,341 INFO L273 TraceCheckUtils]: 67: Hoare triple {32159#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:04,342 INFO L273 TraceCheckUtils]: 68: Hoare triple {32160#(<= main_~k~0 15)} assume true; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:04,342 INFO L273 TraceCheckUtils]: 69: Hoare triple {32160#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:04,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {32160#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32160#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:04,344 INFO L273 TraceCheckUtils]: 71: Hoare triple {32160#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:04,344 INFO L273 TraceCheckUtils]: 72: Hoare triple {32161#(<= main_~k~0 16)} assume true; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:04,345 INFO L273 TraceCheckUtils]: 73: Hoare triple {32161#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:04,345 INFO L273 TraceCheckUtils]: 74: Hoare triple {32161#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32161#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:04,346 INFO L273 TraceCheckUtils]: 75: Hoare triple {32161#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:04,346 INFO L273 TraceCheckUtils]: 76: Hoare triple {32162#(<= main_~k~0 17)} assume true; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:04,347 INFO L273 TraceCheckUtils]: 77: Hoare triple {32162#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:04,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {32162#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32162#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:04,348 INFO L273 TraceCheckUtils]: 79: Hoare triple {32162#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:04,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {32163#(<= main_~k~0 18)} assume true; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:04,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {32163#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:04,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {32163#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32163#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:04,350 INFO L273 TraceCheckUtils]: 83: Hoare triple {32163#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:04,351 INFO L273 TraceCheckUtils]: 84: Hoare triple {32164#(<= main_~k~0 19)} assume true; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:04,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {32164#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:04,352 INFO L273 TraceCheckUtils]: 86: Hoare triple {32164#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32164#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:04,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {32164#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:04,353 INFO L273 TraceCheckUtils]: 88: Hoare triple {32165#(<= main_~k~0 20)} assume true; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:04,353 INFO L273 TraceCheckUtils]: 89: Hoare triple {32165#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:04,354 INFO L273 TraceCheckUtils]: 90: Hoare triple {32165#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32165#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:04,355 INFO L273 TraceCheckUtils]: 91: Hoare triple {32165#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:04,355 INFO L273 TraceCheckUtils]: 92: Hoare triple {32166#(<= main_~k~0 21)} assume true; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:04,356 INFO L273 TraceCheckUtils]: 93: Hoare triple {32166#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:04,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {32166#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32166#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:04,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {32166#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:04,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {32167#(<= main_~k~0 22)} assume true; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:04,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {32167#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:04,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {32167#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32167#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:04,359 INFO L273 TraceCheckUtils]: 99: Hoare triple {32167#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:04,359 INFO L273 TraceCheckUtils]: 100: Hoare triple {32168#(<= main_~k~0 23)} assume true; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:04,360 INFO L273 TraceCheckUtils]: 101: Hoare triple {32168#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:04,360 INFO L273 TraceCheckUtils]: 102: Hoare triple {32168#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32168#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:04,361 INFO L273 TraceCheckUtils]: 103: Hoare triple {32168#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:04,362 INFO L273 TraceCheckUtils]: 104: Hoare triple {32169#(<= main_~k~0 24)} assume true; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:04,362 INFO L273 TraceCheckUtils]: 105: Hoare triple {32169#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:04,363 INFO L273 TraceCheckUtils]: 106: Hoare triple {32169#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32169#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:04,363 INFO L273 TraceCheckUtils]: 107: Hoare triple {32169#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:04,364 INFO L273 TraceCheckUtils]: 108: Hoare triple {32170#(<= main_~k~0 25)} assume true; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:04,364 INFO L273 TraceCheckUtils]: 109: Hoare triple {32170#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:04,365 INFO L273 TraceCheckUtils]: 110: Hoare triple {32170#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32170#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:04,366 INFO L273 TraceCheckUtils]: 111: Hoare triple {32170#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:04,366 INFO L273 TraceCheckUtils]: 112: Hoare triple {32171#(<= main_~k~0 26)} assume true; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:04,367 INFO L273 TraceCheckUtils]: 113: Hoare triple {32171#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:04,367 INFO L273 TraceCheckUtils]: 114: Hoare triple {32171#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32171#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:04,368 INFO L273 TraceCheckUtils]: 115: Hoare triple {32171#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:04,368 INFO L273 TraceCheckUtils]: 116: Hoare triple {32172#(<= main_~k~0 27)} assume true; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:04,369 INFO L273 TraceCheckUtils]: 117: Hoare triple {32172#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:04,369 INFO L273 TraceCheckUtils]: 118: Hoare triple {32172#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32172#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:04,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {32172#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:04,370 INFO L273 TraceCheckUtils]: 120: Hoare triple {32173#(<= main_~k~0 28)} assume true; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:04,371 INFO L273 TraceCheckUtils]: 121: Hoare triple {32173#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:04,371 INFO L273 TraceCheckUtils]: 122: Hoare triple {32173#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32173#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:04,372 INFO L273 TraceCheckUtils]: 123: Hoare triple {32173#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:04,373 INFO L273 TraceCheckUtils]: 124: Hoare triple {32174#(<= main_~k~0 29)} assume true; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:04,373 INFO L273 TraceCheckUtils]: 125: Hoare triple {32174#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:04,374 INFO L273 TraceCheckUtils]: 126: Hoare triple {32174#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32174#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:04,374 INFO L273 TraceCheckUtils]: 127: Hoare triple {32174#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:04,375 INFO L273 TraceCheckUtils]: 128: Hoare triple {32175#(<= main_~k~0 30)} assume true; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:04,375 INFO L273 TraceCheckUtils]: 129: Hoare triple {32175#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:04,376 INFO L273 TraceCheckUtils]: 130: Hoare triple {32175#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32175#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:04,377 INFO L273 TraceCheckUtils]: 131: Hoare triple {32175#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:04,377 INFO L273 TraceCheckUtils]: 132: Hoare triple {32176#(<= main_~k~0 31)} assume true; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:04,378 INFO L273 TraceCheckUtils]: 133: Hoare triple {32176#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:04,378 INFO L273 TraceCheckUtils]: 134: Hoare triple {32176#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32176#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:04,379 INFO L273 TraceCheckUtils]: 135: Hoare triple {32176#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:04,379 INFO L273 TraceCheckUtils]: 136: Hoare triple {32177#(<= main_~k~0 32)} assume true; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:04,380 INFO L273 TraceCheckUtils]: 137: Hoare triple {32177#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:04,380 INFO L273 TraceCheckUtils]: 138: Hoare triple {32177#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32177#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:04,381 INFO L273 TraceCheckUtils]: 139: Hoare triple {32177#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {32178#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:04,381 INFO L273 TraceCheckUtils]: 140: Hoare triple {32178#(<= main_~k~0 33)} assume true; {32178#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:04,382 INFO L273 TraceCheckUtils]: 141: Hoare triple {32178#(<= main_~k~0 33)} assume !(~k~0 < 100000); {32143#false} is VALID [2018-11-18 22:45:04,382 INFO L273 TraceCheckUtils]: 142: Hoare triple {32143#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32143#false} is VALID [2018-11-18 22:45:04,382 INFO L273 TraceCheckUtils]: 143: Hoare triple {32143#false} ~x~0 := 0; {32143#false} is VALID [2018-11-18 22:45:04,383 INFO L273 TraceCheckUtils]: 144: Hoare triple {32143#false} assume true; {32143#false} is VALID [2018-11-18 22:45:04,383 INFO L273 TraceCheckUtils]: 145: Hoare triple {32143#false} assume !(~x~0 < ~i~0); {32143#false} is VALID [2018-11-18 22:45:04,383 INFO L273 TraceCheckUtils]: 146: Hoare triple {32143#false} ~x~0 := 1 + ~i~0; {32143#false} is VALID [2018-11-18 22:45:04,383 INFO L273 TraceCheckUtils]: 147: Hoare triple {32143#false} assume true; {32143#false} is VALID [2018-11-18 22:45:04,383 INFO L273 TraceCheckUtils]: 148: Hoare triple {32143#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32143#false} is VALID [2018-11-18 22:45:04,384 INFO L256 TraceCheckUtils]: 149: Hoare triple {32143#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32143#false} is VALID [2018-11-18 22:45:04,384 INFO L273 TraceCheckUtils]: 150: Hoare triple {32143#false} ~cond := #in~cond; {32143#false} is VALID [2018-11-18 22:45:04,384 INFO L273 TraceCheckUtils]: 151: Hoare triple {32143#false} assume 0 == ~cond; {32143#false} is VALID [2018-11-18 22:45:04,384 INFO L273 TraceCheckUtils]: 152: Hoare triple {32143#false} assume !false; {32143#false} is VALID [2018-11-18 22:45:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-11-18 22:45:04,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 153 [2018-11-18 22:45:04,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:04,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-18 22:45:04,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:04,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 22:45:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 22:45:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:45:04,566 INFO L87 Difference]: Start difference. First operand 188 states and 233 transitions. Second operand 39 states. [2018-11-18 22:45:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:07,402 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2018-11-18 22:45:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 22:45:07,402 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 153 [2018-11-18 22:45:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:45:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 295 transitions. [2018-11-18 22:45:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:45:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 295 transitions. [2018-11-18 22:45:07,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 295 transitions. [2018-11-18 22:45:07,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:07,688 INFO L225 Difference]: With dead ends: 243 [2018-11-18 22:45:07,688 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 22:45:07,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-11-18 22:45:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 22:45:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2018-11-18 22:45:07,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:07,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 192 states. [2018-11-18 22:45:07,852 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 192 states. [2018-11-18 22:45:07,853 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 192 states. [2018-11-18 22:45:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:07,857 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2018-11-18 22:45:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2018-11-18 22:45:07,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:07,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:07,858 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 201 states. [2018-11-18 22:45:07,858 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 201 states. [2018-11-18 22:45:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:07,862 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2018-11-18 22:45:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2018-11-18 22:45:07,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:07,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:07,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:07,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 22:45:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2018-11-18 22:45:07,866 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 153 [2018-11-18 22:45:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:07,867 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2018-11-18 22:45:07,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 22:45:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2018-11-18 22:45:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-18 22:45:07,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:07,868 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:07,868 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:07,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1365762783, now seen corresponding path program 23 times [2018-11-18 22:45:07,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:07,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:07,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:09,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {33664#true} call ULTIMATE.init(); {33664#true} is VALID [2018-11-18 22:45:09,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {33664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33664#true} is VALID [2018-11-18 22:45:09,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {33664#true} assume true; {33664#true} is VALID [2018-11-18 22:45:09,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33664#true} {33664#true} #137#return; {33664#true} is VALID [2018-11-18 22:45:09,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {33664#true} call #t~ret15 := main(); {33664#true} is VALID [2018-11-18 22:45:09,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {33664#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33666#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:09,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {33666#(= 0 main_~i~0)} assume true; {33666#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:09,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {33666#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {33667#(= main_~k~0 0)} is VALID [2018-11-18 22:45:09,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {33667#(= main_~k~0 0)} assume true; {33667#(= main_~k~0 0)} is VALID [2018-11-18 22:45:09,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {33667#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33667#(= main_~k~0 0)} is VALID [2018-11-18 22:45:09,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {33667#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33667#(= main_~k~0 0)} is VALID [2018-11-18 22:45:09,755 INFO L273 TraceCheckUtils]: 11: Hoare triple {33667#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:09,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {33668#(<= main_~k~0 1)} assume true; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:09,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {33668#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:09,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {33668#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:09,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {33668#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:09,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {33669#(<= main_~k~0 2)} assume true; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:09,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {33669#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:09,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {33669#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:09,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {33669#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:09,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {33670#(<= main_~k~0 3)} assume true; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:09,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {33670#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:09,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {33670#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:09,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {33670#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:09,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {33671#(<= main_~k~0 4)} assume true; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:09,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {33671#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:09,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {33671#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:09,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {33671#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:09,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {33672#(<= main_~k~0 5)} assume true; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:09,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {33672#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:09,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {33672#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:09,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {33672#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:09,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {33673#(<= main_~k~0 6)} assume true; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:09,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {33673#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:09,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {33673#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:09,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {33673#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:09,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {33674#(<= main_~k~0 7)} assume true; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:09,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {33674#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:09,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {33674#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:09,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {33674#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:09,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {33675#(<= main_~k~0 8)} assume true; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:09,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {33675#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:09,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {33675#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:09,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {33675#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:09,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {33676#(<= main_~k~0 9)} assume true; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:09,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {33676#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:09,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {33676#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:09,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {33676#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:09,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {33677#(<= main_~k~0 10)} assume true; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:09,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {33677#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:09,776 INFO L273 TraceCheckUtils]: 50: Hoare triple {33677#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:09,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {33677#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:09,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {33678#(<= main_~k~0 11)} assume true; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:09,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {33678#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:09,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {33678#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:09,779 INFO L273 TraceCheckUtils]: 55: Hoare triple {33678#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:09,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {33679#(<= main_~k~0 12)} assume true; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:09,780 INFO L273 TraceCheckUtils]: 57: Hoare triple {33679#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:09,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {33679#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:09,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {33679#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:09,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {33680#(<= main_~k~0 13)} assume true; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:09,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {33680#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:09,782 INFO L273 TraceCheckUtils]: 62: Hoare triple {33680#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:09,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {33680#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:09,784 INFO L273 TraceCheckUtils]: 64: Hoare triple {33681#(<= main_~k~0 14)} assume true; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:09,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {33681#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:09,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {33681#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:09,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {33681#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:09,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {33682#(<= main_~k~0 15)} assume true; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:09,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {33682#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:09,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {33682#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:09,788 INFO L273 TraceCheckUtils]: 71: Hoare triple {33682#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:09,788 INFO L273 TraceCheckUtils]: 72: Hoare triple {33683#(<= main_~k~0 16)} assume true; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:09,789 INFO L273 TraceCheckUtils]: 73: Hoare triple {33683#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:09,789 INFO L273 TraceCheckUtils]: 74: Hoare triple {33683#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:09,790 INFO L273 TraceCheckUtils]: 75: Hoare triple {33683#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:09,790 INFO L273 TraceCheckUtils]: 76: Hoare triple {33684#(<= main_~k~0 17)} assume true; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:09,791 INFO L273 TraceCheckUtils]: 77: Hoare triple {33684#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:09,791 INFO L273 TraceCheckUtils]: 78: Hoare triple {33684#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:09,792 INFO L273 TraceCheckUtils]: 79: Hoare triple {33684#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:09,792 INFO L273 TraceCheckUtils]: 80: Hoare triple {33685#(<= main_~k~0 18)} assume true; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:09,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {33685#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:09,793 INFO L273 TraceCheckUtils]: 82: Hoare triple {33685#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:09,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {33685#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:09,794 INFO L273 TraceCheckUtils]: 84: Hoare triple {33686#(<= main_~k~0 19)} assume true; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:09,795 INFO L273 TraceCheckUtils]: 85: Hoare triple {33686#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:09,795 INFO L273 TraceCheckUtils]: 86: Hoare triple {33686#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:09,796 INFO L273 TraceCheckUtils]: 87: Hoare triple {33686#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:09,796 INFO L273 TraceCheckUtils]: 88: Hoare triple {33687#(<= main_~k~0 20)} assume true; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:09,797 INFO L273 TraceCheckUtils]: 89: Hoare triple {33687#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:09,797 INFO L273 TraceCheckUtils]: 90: Hoare triple {33687#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:09,798 INFO L273 TraceCheckUtils]: 91: Hoare triple {33687#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:09,799 INFO L273 TraceCheckUtils]: 92: Hoare triple {33688#(<= main_~k~0 21)} assume true; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:09,799 INFO L273 TraceCheckUtils]: 93: Hoare triple {33688#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:09,799 INFO L273 TraceCheckUtils]: 94: Hoare triple {33688#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:09,800 INFO L273 TraceCheckUtils]: 95: Hoare triple {33688#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:09,801 INFO L273 TraceCheckUtils]: 96: Hoare triple {33689#(<= main_~k~0 22)} assume true; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:09,801 INFO L273 TraceCheckUtils]: 97: Hoare triple {33689#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:09,802 INFO L273 TraceCheckUtils]: 98: Hoare triple {33689#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:09,802 INFO L273 TraceCheckUtils]: 99: Hoare triple {33689#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:09,803 INFO L273 TraceCheckUtils]: 100: Hoare triple {33690#(<= main_~k~0 23)} assume true; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:09,803 INFO L273 TraceCheckUtils]: 101: Hoare triple {33690#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:09,804 INFO L273 TraceCheckUtils]: 102: Hoare triple {33690#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:09,804 INFO L273 TraceCheckUtils]: 103: Hoare triple {33690#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:09,805 INFO L273 TraceCheckUtils]: 104: Hoare triple {33691#(<= main_~k~0 24)} assume true; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:09,805 INFO L273 TraceCheckUtils]: 105: Hoare triple {33691#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:09,806 INFO L273 TraceCheckUtils]: 106: Hoare triple {33691#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:09,806 INFO L273 TraceCheckUtils]: 107: Hoare triple {33691#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:09,807 INFO L273 TraceCheckUtils]: 108: Hoare triple {33692#(<= main_~k~0 25)} assume true; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:09,807 INFO L273 TraceCheckUtils]: 109: Hoare triple {33692#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:09,808 INFO L273 TraceCheckUtils]: 110: Hoare triple {33692#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:09,809 INFO L273 TraceCheckUtils]: 111: Hoare triple {33692#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:09,809 INFO L273 TraceCheckUtils]: 112: Hoare triple {33693#(<= main_~k~0 26)} assume true; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:09,809 INFO L273 TraceCheckUtils]: 113: Hoare triple {33693#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:09,810 INFO L273 TraceCheckUtils]: 114: Hoare triple {33693#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:09,811 INFO L273 TraceCheckUtils]: 115: Hoare triple {33693#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:09,811 INFO L273 TraceCheckUtils]: 116: Hoare triple {33694#(<= main_~k~0 27)} assume true; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:09,812 INFO L273 TraceCheckUtils]: 117: Hoare triple {33694#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:09,812 INFO L273 TraceCheckUtils]: 118: Hoare triple {33694#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:09,813 INFO L273 TraceCheckUtils]: 119: Hoare triple {33694#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:09,813 INFO L273 TraceCheckUtils]: 120: Hoare triple {33695#(<= main_~k~0 28)} assume true; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:09,814 INFO L273 TraceCheckUtils]: 121: Hoare triple {33695#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:09,814 INFO L273 TraceCheckUtils]: 122: Hoare triple {33695#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:09,815 INFO L273 TraceCheckUtils]: 123: Hoare triple {33695#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:09,815 INFO L273 TraceCheckUtils]: 124: Hoare triple {33696#(<= main_~k~0 29)} assume true; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:09,816 INFO L273 TraceCheckUtils]: 125: Hoare triple {33696#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:09,816 INFO L273 TraceCheckUtils]: 126: Hoare triple {33696#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:09,817 INFO L273 TraceCheckUtils]: 127: Hoare triple {33696#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:09,817 INFO L273 TraceCheckUtils]: 128: Hoare triple {33697#(<= main_~k~0 30)} assume true; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:09,818 INFO L273 TraceCheckUtils]: 129: Hoare triple {33697#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:09,818 INFO L273 TraceCheckUtils]: 130: Hoare triple {33697#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:09,819 INFO L273 TraceCheckUtils]: 131: Hoare triple {33697#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:09,819 INFO L273 TraceCheckUtils]: 132: Hoare triple {33698#(<= main_~k~0 31)} assume true; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:09,820 INFO L273 TraceCheckUtils]: 133: Hoare triple {33698#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:09,820 INFO L273 TraceCheckUtils]: 134: Hoare triple {33698#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:09,821 INFO L273 TraceCheckUtils]: 135: Hoare triple {33698#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:09,821 INFO L273 TraceCheckUtils]: 136: Hoare triple {33699#(<= main_~k~0 32)} assume true; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:09,822 INFO L273 TraceCheckUtils]: 137: Hoare triple {33699#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:09,822 INFO L273 TraceCheckUtils]: 138: Hoare triple {33699#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:09,823 INFO L273 TraceCheckUtils]: 139: Hoare triple {33699#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:09,824 INFO L273 TraceCheckUtils]: 140: Hoare triple {33700#(<= main_~k~0 33)} assume true; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:09,824 INFO L273 TraceCheckUtils]: 141: Hoare triple {33700#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:09,824 INFO L273 TraceCheckUtils]: 142: Hoare triple {33700#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:09,825 INFO L273 TraceCheckUtils]: 143: Hoare triple {33700#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {33701#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:09,826 INFO L273 TraceCheckUtils]: 144: Hoare triple {33701#(<= main_~k~0 34)} assume true; {33701#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:09,826 INFO L273 TraceCheckUtils]: 145: Hoare triple {33701#(<= main_~k~0 34)} assume !(~k~0 < 100000); {33665#false} is VALID [2018-11-18 22:45:09,826 INFO L273 TraceCheckUtils]: 146: Hoare triple {33665#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 147: Hoare triple {33665#false} ~x~0 := 0; {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 148: Hoare triple {33665#false} assume true; {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 149: Hoare triple {33665#false} assume !(~x~0 < ~i~0); {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 150: Hoare triple {33665#false} ~x~0 := 1 + ~i~0; {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 151: Hoare triple {33665#false} assume true; {33665#false} is VALID [2018-11-18 22:45:09,827 INFO L273 TraceCheckUtils]: 152: Hoare triple {33665#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33665#false} is VALID [2018-11-18 22:45:09,828 INFO L256 TraceCheckUtils]: 153: Hoare triple {33665#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33665#false} is VALID [2018-11-18 22:45:09,828 INFO L273 TraceCheckUtils]: 154: Hoare triple {33665#false} ~cond := #in~cond; {33665#false} is VALID [2018-11-18 22:45:09,828 INFO L273 TraceCheckUtils]: 155: Hoare triple {33665#false} assume 0 == ~cond; {33665#false} is VALID [2018-11-18 22:45:09,828 INFO L273 TraceCheckUtils]: 156: Hoare triple {33665#false} assume !false; {33665#false} is VALID [2018-11-18 22:45:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:09,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:09,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:09,852 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:45:10,017 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-18 22:45:10,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:10,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:10,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {33664#true} call ULTIMATE.init(); {33664#true} is VALID [2018-11-18 22:45:10,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {33664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33664#true} is VALID [2018-11-18 22:45:10,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {33664#true} assume true; {33664#true} is VALID [2018-11-18 22:45:10,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33664#true} {33664#true} #137#return; {33664#true} is VALID [2018-11-18 22:45:10,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {33664#true} call #t~ret15 := main(); {33664#true} is VALID [2018-11-18 22:45:10,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {33664#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33720#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:10,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {33720#(<= main_~i~0 0)} assume true; {33720#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:10,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {33720#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {33727#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:10,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {33727#(<= main_~k~0 0)} assume true; {33727#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:10,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {33727#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33727#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:10,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {33727#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33727#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:10,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {33727#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:10,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {33668#(<= main_~k~0 1)} assume true; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:10,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {33668#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:10,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {33668#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33668#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:10,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {33668#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:10,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {33669#(<= main_~k~0 2)} assume true; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:10,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {33669#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:10,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {33669#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33669#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:10,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {33669#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:10,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {33670#(<= main_~k~0 3)} assume true; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:10,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {33670#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:10,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {33670#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33670#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:10,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {33670#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:10,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {33671#(<= main_~k~0 4)} assume true; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:10,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {33671#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:10,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {33671#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33671#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:10,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {33671#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:10,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {33672#(<= main_~k~0 5)} assume true; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:10,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {33672#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:10,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {33672#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33672#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:10,355 INFO L273 TraceCheckUtils]: 31: Hoare triple {33672#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:10,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {33673#(<= main_~k~0 6)} assume true; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:10,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {33673#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:10,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {33673#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33673#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:10,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {33673#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:10,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {33674#(<= main_~k~0 7)} assume true; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:10,358 INFO L273 TraceCheckUtils]: 37: Hoare triple {33674#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:10,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {33674#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33674#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:10,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {33674#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:10,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {33675#(<= main_~k~0 8)} assume true; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:10,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {33675#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:10,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {33675#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33675#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:10,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {33675#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:10,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {33676#(<= main_~k~0 9)} assume true; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:10,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {33676#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:10,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {33676#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33676#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:10,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {33676#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:10,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {33677#(<= main_~k~0 10)} assume true; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:10,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {33677#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:10,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {33677#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33677#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:10,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {33677#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:10,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {33678#(<= main_~k~0 11)} assume true; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:10,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {33678#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:10,367 INFO L273 TraceCheckUtils]: 54: Hoare triple {33678#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33678#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:10,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {33678#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:10,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {33679#(<= main_~k~0 12)} assume true; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:10,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {33679#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:10,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {33679#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33679#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:10,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {33679#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:10,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {33680#(<= main_~k~0 13)} assume true; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:10,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {33680#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:10,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {33680#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33680#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:10,372 INFO L273 TraceCheckUtils]: 63: Hoare triple {33680#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:10,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {33681#(<= main_~k~0 14)} assume true; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:10,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {33681#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:10,374 INFO L273 TraceCheckUtils]: 66: Hoare triple {33681#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33681#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:10,374 INFO L273 TraceCheckUtils]: 67: Hoare triple {33681#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:10,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {33682#(<= main_~k~0 15)} assume true; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:10,375 INFO L273 TraceCheckUtils]: 69: Hoare triple {33682#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:10,376 INFO L273 TraceCheckUtils]: 70: Hoare triple {33682#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33682#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:10,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {33682#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:10,377 INFO L273 TraceCheckUtils]: 72: Hoare triple {33683#(<= main_~k~0 16)} assume true; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:10,377 INFO L273 TraceCheckUtils]: 73: Hoare triple {33683#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:10,378 INFO L273 TraceCheckUtils]: 74: Hoare triple {33683#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33683#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:10,379 INFO L273 TraceCheckUtils]: 75: Hoare triple {33683#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:10,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {33684#(<= main_~k~0 17)} assume true; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:10,380 INFO L273 TraceCheckUtils]: 77: Hoare triple {33684#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:10,380 INFO L273 TraceCheckUtils]: 78: Hoare triple {33684#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33684#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:10,381 INFO L273 TraceCheckUtils]: 79: Hoare triple {33684#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:10,381 INFO L273 TraceCheckUtils]: 80: Hoare triple {33685#(<= main_~k~0 18)} assume true; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:10,382 INFO L273 TraceCheckUtils]: 81: Hoare triple {33685#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:10,382 INFO L273 TraceCheckUtils]: 82: Hoare triple {33685#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33685#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:10,383 INFO L273 TraceCheckUtils]: 83: Hoare triple {33685#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:10,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {33686#(<= main_~k~0 19)} assume true; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:10,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {33686#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:10,384 INFO L273 TraceCheckUtils]: 86: Hoare triple {33686#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33686#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:10,385 INFO L273 TraceCheckUtils]: 87: Hoare triple {33686#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:10,385 INFO L273 TraceCheckUtils]: 88: Hoare triple {33687#(<= main_~k~0 20)} assume true; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:10,386 INFO L273 TraceCheckUtils]: 89: Hoare triple {33687#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:10,386 INFO L273 TraceCheckUtils]: 90: Hoare triple {33687#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33687#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:10,387 INFO L273 TraceCheckUtils]: 91: Hoare triple {33687#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:10,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {33688#(<= main_~k~0 21)} assume true; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:10,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {33688#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:10,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {33688#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33688#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:10,389 INFO L273 TraceCheckUtils]: 95: Hoare triple {33688#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:10,389 INFO L273 TraceCheckUtils]: 96: Hoare triple {33689#(<= main_~k~0 22)} assume true; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:10,390 INFO L273 TraceCheckUtils]: 97: Hoare triple {33689#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:10,390 INFO L273 TraceCheckUtils]: 98: Hoare triple {33689#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33689#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:10,391 INFO L273 TraceCheckUtils]: 99: Hoare triple {33689#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:10,391 INFO L273 TraceCheckUtils]: 100: Hoare triple {33690#(<= main_~k~0 23)} assume true; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:10,392 INFO L273 TraceCheckUtils]: 101: Hoare triple {33690#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:10,392 INFO L273 TraceCheckUtils]: 102: Hoare triple {33690#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33690#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:10,393 INFO L273 TraceCheckUtils]: 103: Hoare triple {33690#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:10,393 INFO L273 TraceCheckUtils]: 104: Hoare triple {33691#(<= main_~k~0 24)} assume true; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:10,394 INFO L273 TraceCheckUtils]: 105: Hoare triple {33691#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:10,394 INFO L273 TraceCheckUtils]: 106: Hoare triple {33691#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33691#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:10,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {33691#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:10,396 INFO L273 TraceCheckUtils]: 108: Hoare triple {33692#(<= main_~k~0 25)} assume true; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:10,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {33692#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:10,396 INFO L273 TraceCheckUtils]: 110: Hoare triple {33692#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33692#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:10,397 INFO L273 TraceCheckUtils]: 111: Hoare triple {33692#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:10,398 INFO L273 TraceCheckUtils]: 112: Hoare triple {33693#(<= main_~k~0 26)} assume true; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:10,398 INFO L273 TraceCheckUtils]: 113: Hoare triple {33693#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:10,398 INFO L273 TraceCheckUtils]: 114: Hoare triple {33693#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33693#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:10,399 INFO L273 TraceCheckUtils]: 115: Hoare triple {33693#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:10,400 INFO L273 TraceCheckUtils]: 116: Hoare triple {33694#(<= main_~k~0 27)} assume true; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:10,400 INFO L273 TraceCheckUtils]: 117: Hoare triple {33694#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:10,401 INFO L273 TraceCheckUtils]: 118: Hoare triple {33694#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33694#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:10,401 INFO L273 TraceCheckUtils]: 119: Hoare triple {33694#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:10,402 INFO L273 TraceCheckUtils]: 120: Hoare triple {33695#(<= main_~k~0 28)} assume true; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:10,402 INFO L273 TraceCheckUtils]: 121: Hoare triple {33695#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:10,403 INFO L273 TraceCheckUtils]: 122: Hoare triple {33695#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33695#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:10,403 INFO L273 TraceCheckUtils]: 123: Hoare triple {33695#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:10,404 INFO L273 TraceCheckUtils]: 124: Hoare triple {33696#(<= main_~k~0 29)} assume true; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:10,404 INFO L273 TraceCheckUtils]: 125: Hoare triple {33696#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:10,405 INFO L273 TraceCheckUtils]: 126: Hoare triple {33696#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33696#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:10,405 INFO L273 TraceCheckUtils]: 127: Hoare triple {33696#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:10,406 INFO L273 TraceCheckUtils]: 128: Hoare triple {33697#(<= main_~k~0 30)} assume true; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:10,406 INFO L273 TraceCheckUtils]: 129: Hoare triple {33697#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:10,407 INFO L273 TraceCheckUtils]: 130: Hoare triple {33697#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33697#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:10,407 INFO L273 TraceCheckUtils]: 131: Hoare triple {33697#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:10,408 INFO L273 TraceCheckUtils]: 132: Hoare triple {33698#(<= main_~k~0 31)} assume true; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:10,408 INFO L273 TraceCheckUtils]: 133: Hoare triple {33698#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:10,409 INFO L273 TraceCheckUtils]: 134: Hoare triple {33698#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33698#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:10,409 INFO L273 TraceCheckUtils]: 135: Hoare triple {33698#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:10,410 INFO L273 TraceCheckUtils]: 136: Hoare triple {33699#(<= main_~k~0 32)} assume true; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:10,410 INFO L273 TraceCheckUtils]: 137: Hoare triple {33699#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:10,411 INFO L273 TraceCheckUtils]: 138: Hoare triple {33699#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33699#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:10,411 INFO L273 TraceCheckUtils]: 139: Hoare triple {33699#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:10,412 INFO L273 TraceCheckUtils]: 140: Hoare triple {33700#(<= main_~k~0 33)} assume true; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:10,412 INFO L273 TraceCheckUtils]: 141: Hoare triple {33700#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:10,413 INFO L273 TraceCheckUtils]: 142: Hoare triple {33700#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33700#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:10,414 INFO L273 TraceCheckUtils]: 143: Hoare triple {33700#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {33701#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:10,414 INFO L273 TraceCheckUtils]: 144: Hoare triple {33701#(<= main_~k~0 34)} assume true; {33701#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 145: Hoare triple {33701#(<= main_~k~0 34)} assume !(~k~0 < 100000); {33665#false} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 146: Hoare triple {33665#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33665#false} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 147: Hoare triple {33665#false} ~x~0 := 0; {33665#false} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 148: Hoare triple {33665#false} assume true; {33665#false} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 149: Hoare triple {33665#false} assume !(~x~0 < ~i~0); {33665#false} is VALID [2018-11-18 22:45:10,415 INFO L273 TraceCheckUtils]: 150: Hoare triple {33665#false} ~x~0 := 1 + ~i~0; {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L273 TraceCheckUtils]: 151: Hoare triple {33665#false} assume true; {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L273 TraceCheckUtils]: 152: Hoare triple {33665#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L256 TraceCheckUtils]: 153: Hoare triple {33665#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L273 TraceCheckUtils]: 154: Hoare triple {33665#false} ~cond := #in~cond; {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L273 TraceCheckUtils]: 155: Hoare triple {33665#false} assume 0 == ~cond; {33665#false} is VALID [2018-11-18 22:45:10,416 INFO L273 TraceCheckUtils]: 156: Hoare triple {33665#false} assume !false; {33665#false} is VALID [2018-11-18 22:45:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2018-11-18 22:45:10,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 157 [2018-11-18 22:45:10,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:10,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-18 22:45:10,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:10,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 22:45:10,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 22:45:10,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 22:45:10,599 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand 40 states. [2018-11-18 22:45:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:13,425 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2018-11-18 22:45:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:45:13,426 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 157 [2018-11-18 22:45:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:45:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 300 transitions. [2018-11-18 22:45:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:45:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 300 transitions. [2018-11-18 22:45:13,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 300 transitions. [2018-11-18 22:45:13,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:13,694 INFO L225 Difference]: With dead ends: 247 [2018-11-18 22:45:13,695 INFO L226 Difference]: Without dead ends: 205 [2018-11-18 22:45:13,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-11-18 22:45:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-18 22:45:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2018-11-18 22:45:13,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:13,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 196 states. [2018-11-18 22:45:13,793 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 196 states. [2018-11-18 22:45:13,793 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 196 states. [2018-11-18 22:45:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:13,797 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-11-18 22:45:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-11-18 22:45:13,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:13,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:13,798 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 205 states. [2018-11-18 22:45:13,798 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 205 states. [2018-11-18 22:45:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:13,801 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-11-18 22:45:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-11-18 22:45:13,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:13,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:13,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:13,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-18 22:45:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2018-11-18 22:45:13,806 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 157 [2018-11-18 22:45:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:13,806 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2018-11-18 22:45:13,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 22:45:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2018-11-18 22:45:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 22:45:13,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:13,807 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:13,808 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:13,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1210514251, now seen corresponding path program 24 times [2018-11-18 22:45:13,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:13,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:14,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {35219#true} call ULTIMATE.init(); {35219#true} is VALID [2018-11-18 22:45:14,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {35219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35219#true} is VALID [2018-11-18 22:45:14,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {35219#true} assume true; {35219#true} is VALID [2018-11-18 22:45:14,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35219#true} {35219#true} #137#return; {35219#true} is VALID [2018-11-18 22:45:14,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {35219#true} call #t~ret15 := main(); {35219#true} is VALID [2018-11-18 22:45:14,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {35219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {35221#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:14,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {35221#(= 0 main_~i~0)} assume true; {35221#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:14,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {35221#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {35222#(= main_~k~0 0)} is VALID [2018-11-18 22:45:14,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {35222#(= main_~k~0 0)} assume true; {35222#(= main_~k~0 0)} is VALID [2018-11-18 22:45:14,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {35222#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35222#(= main_~k~0 0)} is VALID [2018-11-18 22:45:14,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {35222#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35222#(= main_~k~0 0)} is VALID [2018-11-18 22:45:14,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {35222#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:14,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {35223#(<= main_~k~0 1)} assume true; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:14,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {35223#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:14,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {35223#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:14,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {35223#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:14,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {35224#(<= main_~k~0 2)} assume true; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:14,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {35224#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:14,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {35224#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:14,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {35224#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:14,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {35225#(<= main_~k~0 3)} assume true; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:14,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {35225#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:14,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {35225#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:14,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {35225#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:14,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {35226#(<= main_~k~0 4)} assume true; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:14,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {35226#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:14,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {35226#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:14,814 INFO L273 TraceCheckUtils]: 27: Hoare triple {35226#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:14,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {35227#(<= main_~k~0 5)} assume true; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:14,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {35227#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:14,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {35227#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:14,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {35227#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:14,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {35228#(<= main_~k~0 6)} assume true; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:14,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {35228#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:14,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {35228#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:14,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {35228#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:14,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {35229#(<= main_~k~0 7)} assume true; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:14,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {35229#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:14,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {35229#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:14,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {35229#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:14,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {35230#(<= main_~k~0 8)} assume true; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:14,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {35230#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:14,821 INFO L273 TraceCheckUtils]: 42: Hoare triple {35230#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:14,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {35230#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:14,822 INFO L273 TraceCheckUtils]: 44: Hoare triple {35231#(<= main_~k~0 9)} assume true; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:14,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {35231#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:14,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {35231#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:14,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {35231#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:14,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {35232#(<= main_~k~0 10)} assume true; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:14,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {35232#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:14,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {35232#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:14,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {35232#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:14,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {35233#(<= main_~k~0 11)} assume true; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:14,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {35233#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:14,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {35233#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:14,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {35233#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:14,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {35234#(<= main_~k~0 12)} assume true; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:14,829 INFO L273 TraceCheckUtils]: 57: Hoare triple {35234#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:14,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {35234#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:14,830 INFO L273 TraceCheckUtils]: 59: Hoare triple {35234#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:14,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {35235#(<= main_~k~0 13)} assume true; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:14,831 INFO L273 TraceCheckUtils]: 61: Hoare triple {35235#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:14,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {35235#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:14,832 INFO L273 TraceCheckUtils]: 63: Hoare triple {35235#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:14,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {35236#(<= main_~k~0 14)} assume true; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:14,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {35236#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:14,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {35236#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:14,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {35236#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:14,835 INFO L273 TraceCheckUtils]: 68: Hoare triple {35237#(<= main_~k~0 15)} assume true; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:14,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {35237#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:14,836 INFO L273 TraceCheckUtils]: 70: Hoare triple {35237#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:14,837 INFO L273 TraceCheckUtils]: 71: Hoare triple {35237#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:14,837 INFO L273 TraceCheckUtils]: 72: Hoare triple {35238#(<= main_~k~0 16)} assume true; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:14,837 INFO L273 TraceCheckUtils]: 73: Hoare triple {35238#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:14,838 INFO L273 TraceCheckUtils]: 74: Hoare triple {35238#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:14,839 INFO L273 TraceCheckUtils]: 75: Hoare triple {35238#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:14,839 INFO L273 TraceCheckUtils]: 76: Hoare triple {35239#(<= main_~k~0 17)} assume true; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:14,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {35239#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:14,840 INFO L273 TraceCheckUtils]: 78: Hoare triple {35239#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:14,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {35239#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:14,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {35240#(<= main_~k~0 18)} assume true; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:14,842 INFO L273 TraceCheckUtils]: 81: Hoare triple {35240#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:14,842 INFO L273 TraceCheckUtils]: 82: Hoare triple {35240#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:14,843 INFO L273 TraceCheckUtils]: 83: Hoare triple {35240#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:14,843 INFO L273 TraceCheckUtils]: 84: Hoare triple {35241#(<= main_~k~0 19)} assume true; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:14,844 INFO L273 TraceCheckUtils]: 85: Hoare triple {35241#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:14,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {35241#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:14,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {35241#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:14,845 INFO L273 TraceCheckUtils]: 88: Hoare triple {35242#(<= main_~k~0 20)} assume true; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:14,846 INFO L273 TraceCheckUtils]: 89: Hoare triple {35242#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:14,846 INFO L273 TraceCheckUtils]: 90: Hoare triple {35242#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:14,847 INFO L273 TraceCheckUtils]: 91: Hoare triple {35242#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:14,847 INFO L273 TraceCheckUtils]: 92: Hoare triple {35243#(<= main_~k~0 21)} assume true; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:14,848 INFO L273 TraceCheckUtils]: 93: Hoare triple {35243#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:14,848 INFO L273 TraceCheckUtils]: 94: Hoare triple {35243#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:14,849 INFO L273 TraceCheckUtils]: 95: Hoare triple {35243#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:14,849 INFO L273 TraceCheckUtils]: 96: Hoare triple {35244#(<= main_~k~0 22)} assume true; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:14,850 INFO L273 TraceCheckUtils]: 97: Hoare triple {35244#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:14,850 INFO L273 TraceCheckUtils]: 98: Hoare triple {35244#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:14,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {35244#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:14,851 INFO L273 TraceCheckUtils]: 100: Hoare triple {35245#(<= main_~k~0 23)} assume true; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:14,852 INFO L273 TraceCheckUtils]: 101: Hoare triple {35245#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:14,852 INFO L273 TraceCheckUtils]: 102: Hoare triple {35245#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:14,853 INFO L273 TraceCheckUtils]: 103: Hoare triple {35245#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:14,853 INFO L273 TraceCheckUtils]: 104: Hoare triple {35246#(<= main_~k~0 24)} assume true; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:14,854 INFO L273 TraceCheckUtils]: 105: Hoare triple {35246#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:14,854 INFO L273 TraceCheckUtils]: 106: Hoare triple {35246#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:14,855 INFO L273 TraceCheckUtils]: 107: Hoare triple {35246#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:14,855 INFO L273 TraceCheckUtils]: 108: Hoare triple {35247#(<= main_~k~0 25)} assume true; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:14,856 INFO L273 TraceCheckUtils]: 109: Hoare triple {35247#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:14,856 INFO L273 TraceCheckUtils]: 110: Hoare triple {35247#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:14,857 INFO L273 TraceCheckUtils]: 111: Hoare triple {35247#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:14,858 INFO L273 TraceCheckUtils]: 112: Hoare triple {35248#(<= main_~k~0 26)} assume true; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:14,858 INFO L273 TraceCheckUtils]: 113: Hoare triple {35248#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:14,858 INFO L273 TraceCheckUtils]: 114: Hoare triple {35248#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:14,859 INFO L273 TraceCheckUtils]: 115: Hoare triple {35248#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:14,860 INFO L273 TraceCheckUtils]: 116: Hoare triple {35249#(<= main_~k~0 27)} assume true; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:14,860 INFO L273 TraceCheckUtils]: 117: Hoare triple {35249#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:14,860 INFO L273 TraceCheckUtils]: 118: Hoare triple {35249#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:14,861 INFO L273 TraceCheckUtils]: 119: Hoare triple {35249#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:14,862 INFO L273 TraceCheckUtils]: 120: Hoare triple {35250#(<= main_~k~0 28)} assume true; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:14,862 INFO L273 TraceCheckUtils]: 121: Hoare triple {35250#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:14,863 INFO L273 TraceCheckUtils]: 122: Hoare triple {35250#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:14,863 INFO L273 TraceCheckUtils]: 123: Hoare triple {35250#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:14,864 INFO L273 TraceCheckUtils]: 124: Hoare triple {35251#(<= main_~k~0 29)} assume true; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:14,864 INFO L273 TraceCheckUtils]: 125: Hoare triple {35251#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:14,865 INFO L273 TraceCheckUtils]: 126: Hoare triple {35251#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:14,865 INFO L273 TraceCheckUtils]: 127: Hoare triple {35251#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:14,866 INFO L273 TraceCheckUtils]: 128: Hoare triple {35252#(<= main_~k~0 30)} assume true; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:14,866 INFO L273 TraceCheckUtils]: 129: Hoare triple {35252#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:14,867 INFO L273 TraceCheckUtils]: 130: Hoare triple {35252#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:14,867 INFO L273 TraceCheckUtils]: 131: Hoare triple {35252#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:14,868 INFO L273 TraceCheckUtils]: 132: Hoare triple {35253#(<= main_~k~0 31)} assume true; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:14,868 INFO L273 TraceCheckUtils]: 133: Hoare triple {35253#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:14,869 INFO L273 TraceCheckUtils]: 134: Hoare triple {35253#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:14,869 INFO L273 TraceCheckUtils]: 135: Hoare triple {35253#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:14,870 INFO L273 TraceCheckUtils]: 136: Hoare triple {35254#(<= main_~k~0 32)} assume true; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:14,870 INFO L273 TraceCheckUtils]: 137: Hoare triple {35254#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:14,871 INFO L273 TraceCheckUtils]: 138: Hoare triple {35254#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:14,871 INFO L273 TraceCheckUtils]: 139: Hoare triple {35254#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:14,872 INFO L273 TraceCheckUtils]: 140: Hoare triple {35255#(<= main_~k~0 33)} assume true; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:14,872 INFO L273 TraceCheckUtils]: 141: Hoare triple {35255#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:14,873 INFO L273 TraceCheckUtils]: 142: Hoare triple {35255#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:14,873 INFO L273 TraceCheckUtils]: 143: Hoare triple {35255#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:14,874 INFO L273 TraceCheckUtils]: 144: Hoare triple {35256#(<= main_~k~0 34)} assume true; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:14,874 INFO L273 TraceCheckUtils]: 145: Hoare triple {35256#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:14,875 INFO L273 TraceCheckUtils]: 146: Hoare triple {35256#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:14,876 INFO L273 TraceCheckUtils]: 147: Hoare triple {35256#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {35257#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:14,876 INFO L273 TraceCheckUtils]: 148: Hoare triple {35257#(<= main_~k~0 35)} assume true; {35257#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 149: Hoare triple {35257#(<= main_~k~0 35)} assume !(~k~0 < 100000); {35220#false} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 150: Hoare triple {35220#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35220#false} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 151: Hoare triple {35220#false} ~x~0 := 0; {35220#false} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 152: Hoare triple {35220#false} assume true; {35220#false} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 153: Hoare triple {35220#false} assume !(~x~0 < ~i~0); {35220#false} is VALID [2018-11-18 22:45:14,877 INFO L273 TraceCheckUtils]: 154: Hoare triple {35220#false} ~x~0 := 1 + ~i~0; {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L273 TraceCheckUtils]: 155: Hoare triple {35220#false} assume true; {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L273 TraceCheckUtils]: 156: Hoare triple {35220#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L256 TraceCheckUtils]: 157: Hoare triple {35220#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L273 TraceCheckUtils]: 158: Hoare triple {35220#false} ~cond := #in~cond; {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L273 TraceCheckUtils]: 159: Hoare triple {35220#false} assume 0 == ~cond; {35220#false} is VALID [2018-11-18 22:45:14,878 INFO L273 TraceCheckUtils]: 160: Hoare triple {35220#false} assume !false; {35220#false} is VALID [2018-11-18 22:45:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:14,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:14,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:14,905 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:45:15,144 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-11-18 22:45:15,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:15,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:15,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {35219#true} call ULTIMATE.init(); {35219#true} is VALID [2018-11-18 22:45:15,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {35219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35219#true} is VALID [2018-11-18 22:45:15,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {35219#true} assume true; {35219#true} is VALID [2018-11-18 22:45:15,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35219#true} {35219#true} #137#return; {35219#true} is VALID [2018-11-18 22:45:15,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {35219#true} call #t~ret15 := main(); {35219#true} is VALID [2018-11-18 22:45:15,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {35219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {35276#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:15,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {35276#(<= main_~i~0 0)} assume true; {35276#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:15,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {35276#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {35283#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:15,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {35283#(<= main_~k~0 0)} assume true; {35283#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:15,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {35283#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35283#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:15,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {35283#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35283#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:15,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {35283#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:15,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {35223#(<= main_~k~0 1)} assume true; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:15,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {35223#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:15,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {35223#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35223#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:15,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {35223#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:15,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {35224#(<= main_~k~0 2)} assume true; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:15,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {35224#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:15,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {35224#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35224#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:15,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {35224#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:15,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {35225#(<= main_~k~0 3)} assume true; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:15,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {35225#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:15,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {35225#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35225#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:15,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {35225#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:15,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {35226#(<= main_~k~0 4)} assume true; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:15,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {35226#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:15,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {35226#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35226#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:15,997 INFO L273 TraceCheckUtils]: 27: Hoare triple {35226#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:15,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {35227#(<= main_~k~0 5)} assume true; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:15,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {35227#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:15,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {35227#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35227#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:15,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {35227#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:15,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {35228#(<= main_~k~0 6)} assume true; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:16,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {35228#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:16,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {35228#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35228#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:16,001 INFO L273 TraceCheckUtils]: 35: Hoare triple {35228#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:16,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {35229#(<= main_~k~0 7)} assume true; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:16,002 INFO L273 TraceCheckUtils]: 37: Hoare triple {35229#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:16,002 INFO L273 TraceCheckUtils]: 38: Hoare triple {35229#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35229#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:16,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {35229#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:16,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {35230#(<= main_~k~0 8)} assume true; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:16,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {35230#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:16,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {35230#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35230#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:16,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {35230#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:16,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {35231#(<= main_~k~0 9)} assume true; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:16,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {35231#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:16,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {35231#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35231#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:16,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {35231#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:16,008 INFO L273 TraceCheckUtils]: 48: Hoare triple {35232#(<= main_~k~0 10)} assume true; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:16,008 INFO L273 TraceCheckUtils]: 49: Hoare triple {35232#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:16,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {35232#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35232#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:16,009 INFO L273 TraceCheckUtils]: 51: Hoare triple {35232#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:16,010 INFO L273 TraceCheckUtils]: 52: Hoare triple {35233#(<= main_~k~0 11)} assume true; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:16,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {35233#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:16,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {35233#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35233#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:16,011 INFO L273 TraceCheckUtils]: 55: Hoare triple {35233#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:16,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {35234#(<= main_~k~0 12)} assume true; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:16,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {35234#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:16,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {35234#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35234#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:16,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {35234#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:16,014 INFO L273 TraceCheckUtils]: 60: Hoare triple {35235#(<= main_~k~0 13)} assume true; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:16,014 INFO L273 TraceCheckUtils]: 61: Hoare triple {35235#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:16,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {35235#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35235#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:16,015 INFO L273 TraceCheckUtils]: 63: Hoare triple {35235#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:16,016 INFO L273 TraceCheckUtils]: 64: Hoare triple {35236#(<= main_~k~0 14)} assume true; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:16,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {35236#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:16,017 INFO L273 TraceCheckUtils]: 66: Hoare triple {35236#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35236#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:16,017 INFO L273 TraceCheckUtils]: 67: Hoare triple {35236#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:16,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {35237#(<= main_~k~0 15)} assume true; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:16,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {35237#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:16,019 INFO L273 TraceCheckUtils]: 70: Hoare triple {35237#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35237#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:16,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {35237#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:16,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {35238#(<= main_~k~0 16)} assume true; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:16,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {35238#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:16,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {35238#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35238#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:16,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {35238#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:16,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {35239#(<= main_~k~0 17)} assume true; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:16,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {35239#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:16,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {35239#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35239#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:16,024 INFO L273 TraceCheckUtils]: 79: Hoare triple {35239#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:16,024 INFO L273 TraceCheckUtils]: 80: Hoare triple {35240#(<= main_~k~0 18)} assume true; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:16,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {35240#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:16,025 INFO L273 TraceCheckUtils]: 82: Hoare triple {35240#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35240#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:16,026 INFO L273 TraceCheckUtils]: 83: Hoare triple {35240#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:16,027 INFO L273 TraceCheckUtils]: 84: Hoare triple {35241#(<= main_~k~0 19)} assume true; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:16,027 INFO L273 TraceCheckUtils]: 85: Hoare triple {35241#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:16,028 INFO L273 TraceCheckUtils]: 86: Hoare triple {35241#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35241#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:16,028 INFO L273 TraceCheckUtils]: 87: Hoare triple {35241#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:16,029 INFO L273 TraceCheckUtils]: 88: Hoare triple {35242#(<= main_~k~0 20)} assume true; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:16,029 INFO L273 TraceCheckUtils]: 89: Hoare triple {35242#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:16,030 INFO L273 TraceCheckUtils]: 90: Hoare triple {35242#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35242#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:16,030 INFO L273 TraceCheckUtils]: 91: Hoare triple {35242#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:16,031 INFO L273 TraceCheckUtils]: 92: Hoare triple {35243#(<= main_~k~0 21)} assume true; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:16,031 INFO L273 TraceCheckUtils]: 93: Hoare triple {35243#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:16,032 INFO L273 TraceCheckUtils]: 94: Hoare triple {35243#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35243#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:16,033 INFO L273 TraceCheckUtils]: 95: Hoare triple {35243#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:16,033 INFO L273 TraceCheckUtils]: 96: Hoare triple {35244#(<= main_~k~0 22)} assume true; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:16,034 INFO L273 TraceCheckUtils]: 97: Hoare triple {35244#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:16,034 INFO L273 TraceCheckUtils]: 98: Hoare triple {35244#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35244#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:16,035 INFO L273 TraceCheckUtils]: 99: Hoare triple {35244#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:16,035 INFO L273 TraceCheckUtils]: 100: Hoare triple {35245#(<= main_~k~0 23)} assume true; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:16,036 INFO L273 TraceCheckUtils]: 101: Hoare triple {35245#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:16,036 INFO L273 TraceCheckUtils]: 102: Hoare triple {35245#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35245#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:16,037 INFO L273 TraceCheckUtils]: 103: Hoare triple {35245#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:16,038 INFO L273 TraceCheckUtils]: 104: Hoare triple {35246#(<= main_~k~0 24)} assume true; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:16,038 INFO L273 TraceCheckUtils]: 105: Hoare triple {35246#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:16,039 INFO L273 TraceCheckUtils]: 106: Hoare triple {35246#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35246#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:16,039 INFO L273 TraceCheckUtils]: 107: Hoare triple {35246#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:16,040 INFO L273 TraceCheckUtils]: 108: Hoare triple {35247#(<= main_~k~0 25)} assume true; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:16,040 INFO L273 TraceCheckUtils]: 109: Hoare triple {35247#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:16,041 INFO L273 TraceCheckUtils]: 110: Hoare triple {35247#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35247#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:16,042 INFO L273 TraceCheckUtils]: 111: Hoare triple {35247#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:16,042 INFO L273 TraceCheckUtils]: 112: Hoare triple {35248#(<= main_~k~0 26)} assume true; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:16,043 INFO L273 TraceCheckUtils]: 113: Hoare triple {35248#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:16,043 INFO L273 TraceCheckUtils]: 114: Hoare triple {35248#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35248#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:16,044 INFO L273 TraceCheckUtils]: 115: Hoare triple {35248#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:16,044 INFO L273 TraceCheckUtils]: 116: Hoare triple {35249#(<= main_~k~0 27)} assume true; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:16,045 INFO L273 TraceCheckUtils]: 117: Hoare triple {35249#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:16,045 INFO L273 TraceCheckUtils]: 118: Hoare triple {35249#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35249#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:16,046 INFO L273 TraceCheckUtils]: 119: Hoare triple {35249#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:16,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {35250#(<= main_~k~0 28)} assume true; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:16,047 INFO L273 TraceCheckUtils]: 121: Hoare triple {35250#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:16,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {35250#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35250#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:16,048 INFO L273 TraceCheckUtils]: 123: Hoare triple {35250#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:16,049 INFO L273 TraceCheckUtils]: 124: Hoare triple {35251#(<= main_~k~0 29)} assume true; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:16,049 INFO L273 TraceCheckUtils]: 125: Hoare triple {35251#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:16,050 INFO L273 TraceCheckUtils]: 126: Hoare triple {35251#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35251#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:16,050 INFO L273 TraceCheckUtils]: 127: Hoare triple {35251#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:16,051 INFO L273 TraceCheckUtils]: 128: Hoare triple {35252#(<= main_~k~0 30)} assume true; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:16,051 INFO L273 TraceCheckUtils]: 129: Hoare triple {35252#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:16,052 INFO L273 TraceCheckUtils]: 130: Hoare triple {35252#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35252#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:16,052 INFO L273 TraceCheckUtils]: 131: Hoare triple {35252#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:16,053 INFO L273 TraceCheckUtils]: 132: Hoare triple {35253#(<= main_~k~0 31)} assume true; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:16,053 INFO L273 TraceCheckUtils]: 133: Hoare triple {35253#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:16,054 INFO L273 TraceCheckUtils]: 134: Hoare triple {35253#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35253#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:16,055 INFO L273 TraceCheckUtils]: 135: Hoare triple {35253#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:16,055 INFO L273 TraceCheckUtils]: 136: Hoare triple {35254#(<= main_~k~0 32)} assume true; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:16,056 INFO L273 TraceCheckUtils]: 137: Hoare triple {35254#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:16,056 INFO L273 TraceCheckUtils]: 138: Hoare triple {35254#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35254#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:16,057 INFO L273 TraceCheckUtils]: 139: Hoare triple {35254#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:16,057 INFO L273 TraceCheckUtils]: 140: Hoare triple {35255#(<= main_~k~0 33)} assume true; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:16,058 INFO L273 TraceCheckUtils]: 141: Hoare triple {35255#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:16,058 INFO L273 TraceCheckUtils]: 142: Hoare triple {35255#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35255#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:16,059 INFO L273 TraceCheckUtils]: 143: Hoare triple {35255#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:16,059 INFO L273 TraceCheckUtils]: 144: Hoare triple {35256#(<= main_~k~0 34)} assume true; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:16,060 INFO L273 TraceCheckUtils]: 145: Hoare triple {35256#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:16,060 INFO L273 TraceCheckUtils]: 146: Hoare triple {35256#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35256#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:16,061 INFO L273 TraceCheckUtils]: 147: Hoare triple {35256#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {35257#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:16,061 INFO L273 TraceCheckUtils]: 148: Hoare triple {35257#(<= main_~k~0 35)} assume true; {35257#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:16,062 INFO L273 TraceCheckUtils]: 149: Hoare triple {35257#(<= main_~k~0 35)} assume !(~k~0 < 100000); {35220#false} is VALID [2018-11-18 22:45:16,062 INFO L273 TraceCheckUtils]: 150: Hoare triple {35220#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35220#false} is VALID [2018-11-18 22:45:16,062 INFO L273 TraceCheckUtils]: 151: Hoare triple {35220#false} ~x~0 := 0; {35220#false} is VALID [2018-11-18 22:45:16,062 INFO L273 TraceCheckUtils]: 152: Hoare triple {35220#false} assume true; {35220#false} is VALID [2018-11-18 22:45:16,063 INFO L273 TraceCheckUtils]: 153: Hoare triple {35220#false} assume !(~x~0 < ~i~0); {35220#false} is VALID [2018-11-18 22:45:16,063 INFO L273 TraceCheckUtils]: 154: Hoare triple {35220#false} ~x~0 := 1 + ~i~0; {35220#false} is VALID [2018-11-18 22:45:16,063 INFO L273 TraceCheckUtils]: 155: Hoare triple {35220#false} assume true; {35220#false} is VALID [2018-11-18 22:45:16,063 INFO L273 TraceCheckUtils]: 156: Hoare triple {35220#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35220#false} is VALID [2018-11-18 22:45:16,063 INFO L256 TraceCheckUtils]: 157: Hoare triple {35220#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {35220#false} is VALID [2018-11-18 22:45:16,064 INFO L273 TraceCheckUtils]: 158: Hoare triple {35220#false} ~cond := #in~cond; {35220#false} is VALID [2018-11-18 22:45:16,064 INFO L273 TraceCheckUtils]: 159: Hoare triple {35220#false} assume 0 == ~cond; {35220#false} is VALID [2018-11-18 22:45:16,064 INFO L273 TraceCheckUtils]: 160: Hoare triple {35220#false} assume !false; {35220#false} is VALID [2018-11-18 22:45:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:16,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:16,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2018-11-18 22:45:16,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 161 [2018-11-18 22:45:16,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:16,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-18 22:45:16,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:16,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 22:45:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 22:45:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:45:16,252 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand 41 states. [2018-11-18 22:45:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:19,359 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2018-11-18 22:45:19,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 22:45:19,359 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 161 [2018-11-18 22:45:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:45:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 305 transitions. [2018-11-18 22:45:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:45:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 305 transitions. [2018-11-18 22:45:19,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 305 transitions. [2018-11-18 22:45:19,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:19,693 INFO L225 Difference]: With dead ends: 251 [2018-11-18 22:45:19,694 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 22:45:19,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-11-18 22:45:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 22:45:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 200. [2018-11-18 22:45:19,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:19,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 200 states. [2018-11-18 22:45:19,800 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 200 states. [2018-11-18 22:45:19,800 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 200 states. [2018-11-18 22:45:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:19,804 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2018-11-18 22:45:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-11-18 22:45:19,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:19,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:19,805 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 209 states. [2018-11-18 22:45:19,805 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 209 states. [2018-11-18 22:45:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:19,809 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2018-11-18 22:45:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-11-18 22:45:19,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:19,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:19,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:19,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 22:45:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-11-18 22:45:19,813 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 161 [2018-11-18 22:45:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:19,814 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-11-18 22:45:19,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 22:45:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-11-18 22:45:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 22:45:19,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:19,815 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:19,815 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:19,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:19,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1519995787, now seen corresponding path program 25 times [2018-11-18 22:45:19,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:19,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:19,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:19,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:19,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:20,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {36807#true} call ULTIMATE.init(); {36807#true} is VALID [2018-11-18 22:45:20,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {36807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36807#true} is VALID [2018-11-18 22:45:20,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {36807#true} assume true; {36807#true} is VALID [2018-11-18 22:45:20,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36807#true} {36807#true} #137#return; {36807#true} is VALID [2018-11-18 22:45:20,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {36807#true} call #t~ret15 := main(); {36807#true} is VALID [2018-11-18 22:45:20,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {36807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36809#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:20,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {36809#(= 0 main_~i~0)} assume true; {36809#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:20,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {36809#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {36810#(= main_~k~0 0)} is VALID [2018-11-18 22:45:20,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {36810#(= main_~k~0 0)} assume true; {36810#(= main_~k~0 0)} is VALID [2018-11-18 22:45:20,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {36810#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36810#(= main_~k~0 0)} is VALID [2018-11-18 22:45:20,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {36810#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36810#(= main_~k~0 0)} is VALID [2018-11-18 22:45:20,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {36810#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:20,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {36811#(<= main_~k~0 1)} assume true; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:20,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {36811#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:20,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {36811#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:20,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {36811#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:20,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {36812#(<= main_~k~0 2)} assume true; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:20,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {36812#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:20,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {36812#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:20,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {36812#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:20,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {36813#(<= main_~k~0 3)} assume true; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:20,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {36813#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:20,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {36813#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:20,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {36813#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:20,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {36814#(<= main_~k~0 4)} assume true; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:20,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {36814#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:20,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {36814#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:20,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {36814#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:20,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {36815#(<= main_~k~0 5)} assume true; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:20,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {36815#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:20,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {36815#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:20,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {36815#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:20,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {36816#(<= main_~k~0 6)} assume true; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:20,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {36816#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:20,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {36816#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:20,667 INFO L273 TraceCheckUtils]: 35: Hoare triple {36816#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:20,667 INFO L273 TraceCheckUtils]: 36: Hoare triple {36817#(<= main_~k~0 7)} assume true; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:20,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {36817#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:20,668 INFO L273 TraceCheckUtils]: 38: Hoare triple {36817#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:20,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {36817#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:20,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {36818#(<= main_~k~0 8)} assume true; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:20,670 INFO L273 TraceCheckUtils]: 41: Hoare triple {36818#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:20,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {36818#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:20,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {36818#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:20,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {36819#(<= main_~k~0 9)} assume true; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:20,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {36819#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:20,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {36819#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:20,673 INFO L273 TraceCheckUtils]: 47: Hoare triple {36819#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:20,674 INFO L273 TraceCheckUtils]: 48: Hoare triple {36820#(<= main_~k~0 10)} assume true; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:20,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {36820#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:20,675 INFO L273 TraceCheckUtils]: 50: Hoare triple {36820#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:20,675 INFO L273 TraceCheckUtils]: 51: Hoare triple {36820#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:20,676 INFO L273 TraceCheckUtils]: 52: Hoare triple {36821#(<= main_~k~0 11)} assume true; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:20,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {36821#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:20,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {36821#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:20,677 INFO L273 TraceCheckUtils]: 55: Hoare triple {36821#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:20,678 INFO L273 TraceCheckUtils]: 56: Hoare triple {36822#(<= main_~k~0 12)} assume true; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:20,678 INFO L273 TraceCheckUtils]: 57: Hoare triple {36822#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:20,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {36822#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:20,680 INFO L273 TraceCheckUtils]: 59: Hoare triple {36822#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:20,680 INFO L273 TraceCheckUtils]: 60: Hoare triple {36823#(<= main_~k~0 13)} assume true; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:20,681 INFO L273 TraceCheckUtils]: 61: Hoare triple {36823#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:20,681 INFO L273 TraceCheckUtils]: 62: Hoare triple {36823#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:20,682 INFO L273 TraceCheckUtils]: 63: Hoare triple {36823#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:20,682 INFO L273 TraceCheckUtils]: 64: Hoare triple {36824#(<= main_~k~0 14)} assume true; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:20,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {36824#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:20,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {36824#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:20,684 INFO L273 TraceCheckUtils]: 67: Hoare triple {36824#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:20,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {36825#(<= main_~k~0 15)} assume true; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:20,685 INFO L273 TraceCheckUtils]: 69: Hoare triple {36825#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:20,685 INFO L273 TraceCheckUtils]: 70: Hoare triple {36825#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:20,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {36825#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:20,687 INFO L273 TraceCheckUtils]: 72: Hoare triple {36826#(<= main_~k~0 16)} assume true; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:20,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {36826#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:20,688 INFO L273 TraceCheckUtils]: 74: Hoare triple {36826#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:20,688 INFO L273 TraceCheckUtils]: 75: Hoare triple {36826#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:20,689 INFO L273 TraceCheckUtils]: 76: Hoare triple {36827#(<= main_~k~0 17)} assume true; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:20,689 INFO L273 TraceCheckUtils]: 77: Hoare triple {36827#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:20,690 INFO L273 TraceCheckUtils]: 78: Hoare triple {36827#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:20,690 INFO L273 TraceCheckUtils]: 79: Hoare triple {36827#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:20,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {36828#(<= main_~k~0 18)} assume true; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:20,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {36828#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:20,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {36828#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:20,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {36828#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:20,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {36829#(<= main_~k~0 19)} assume true; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:20,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {36829#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:20,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {36829#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:20,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {36829#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:20,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {36830#(<= main_~k~0 20)} assume true; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:20,696 INFO L273 TraceCheckUtils]: 89: Hoare triple {36830#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:20,696 INFO L273 TraceCheckUtils]: 90: Hoare triple {36830#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:20,697 INFO L273 TraceCheckUtils]: 91: Hoare triple {36830#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:20,697 INFO L273 TraceCheckUtils]: 92: Hoare triple {36831#(<= main_~k~0 21)} assume true; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:20,698 INFO L273 TraceCheckUtils]: 93: Hoare triple {36831#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:20,698 INFO L273 TraceCheckUtils]: 94: Hoare triple {36831#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:20,699 INFO L273 TraceCheckUtils]: 95: Hoare triple {36831#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:20,700 INFO L273 TraceCheckUtils]: 96: Hoare triple {36832#(<= main_~k~0 22)} assume true; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:20,719 INFO L273 TraceCheckUtils]: 97: Hoare triple {36832#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:20,735 INFO L273 TraceCheckUtils]: 98: Hoare triple {36832#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:20,743 INFO L273 TraceCheckUtils]: 99: Hoare triple {36832#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:20,747 INFO L273 TraceCheckUtils]: 100: Hoare triple {36833#(<= main_~k~0 23)} assume true; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:20,747 INFO L273 TraceCheckUtils]: 101: Hoare triple {36833#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:20,748 INFO L273 TraceCheckUtils]: 102: Hoare triple {36833#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:20,748 INFO L273 TraceCheckUtils]: 103: Hoare triple {36833#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:20,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {36834#(<= main_~k~0 24)} assume true; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:20,749 INFO L273 TraceCheckUtils]: 105: Hoare triple {36834#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:20,749 INFO L273 TraceCheckUtils]: 106: Hoare triple {36834#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:20,749 INFO L273 TraceCheckUtils]: 107: Hoare triple {36834#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:20,750 INFO L273 TraceCheckUtils]: 108: Hoare triple {36835#(<= main_~k~0 25)} assume true; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:20,750 INFO L273 TraceCheckUtils]: 109: Hoare triple {36835#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:20,750 INFO L273 TraceCheckUtils]: 110: Hoare triple {36835#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:20,751 INFO L273 TraceCheckUtils]: 111: Hoare triple {36835#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:20,751 INFO L273 TraceCheckUtils]: 112: Hoare triple {36836#(<= main_~k~0 26)} assume true; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:20,752 INFO L273 TraceCheckUtils]: 113: Hoare triple {36836#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:20,752 INFO L273 TraceCheckUtils]: 114: Hoare triple {36836#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:20,753 INFO L273 TraceCheckUtils]: 115: Hoare triple {36836#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:20,753 INFO L273 TraceCheckUtils]: 116: Hoare triple {36837#(<= main_~k~0 27)} assume true; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:20,754 INFO L273 TraceCheckUtils]: 117: Hoare triple {36837#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:20,754 INFO L273 TraceCheckUtils]: 118: Hoare triple {36837#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:20,755 INFO L273 TraceCheckUtils]: 119: Hoare triple {36837#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:20,755 INFO L273 TraceCheckUtils]: 120: Hoare triple {36838#(<= main_~k~0 28)} assume true; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:20,756 INFO L273 TraceCheckUtils]: 121: Hoare triple {36838#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:20,756 INFO L273 TraceCheckUtils]: 122: Hoare triple {36838#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:20,757 INFO L273 TraceCheckUtils]: 123: Hoare triple {36838#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:20,757 INFO L273 TraceCheckUtils]: 124: Hoare triple {36839#(<= main_~k~0 29)} assume true; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:20,758 INFO L273 TraceCheckUtils]: 125: Hoare triple {36839#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:20,758 INFO L273 TraceCheckUtils]: 126: Hoare triple {36839#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:20,759 INFO L273 TraceCheckUtils]: 127: Hoare triple {36839#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:20,759 INFO L273 TraceCheckUtils]: 128: Hoare triple {36840#(<= main_~k~0 30)} assume true; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:20,760 INFO L273 TraceCheckUtils]: 129: Hoare triple {36840#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:20,760 INFO L273 TraceCheckUtils]: 130: Hoare triple {36840#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:20,761 INFO L273 TraceCheckUtils]: 131: Hoare triple {36840#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:20,761 INFO L273 TraceCheckUtils]: 132: Hoare triple {36841#(<= main_~k~0 31)} assume true; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:20,762 INFO L273 TraceCheckUtils]: 133: Hoare triple {36841#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:20,762 INFO L273 TraceCheckUtils]: 134: Hoare triple {36841#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:20,763 INFO L273 TraceCheckUtils]: 135: Hoare triple {36841#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:20,763 INFO L273 TraceCheckUtils]: 136: Hoare triple {36842#(<= main_~k~0 32)} assume true; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:20,764 INFO L273 TraceCheckUtils]: 137: Hoare triple {36842#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:20,764 INFO L273 TraceCheckUtils]: 138: Hoare triple {36842#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:20,765 INFO L273 TraceCheckUtils]: 139: Hoare triple {36842#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:20,765 INFO L273 TraceCheckUtils]: 140: Hoare triple {36843#(<= main_~k~0 33)} assume true; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:20,766 INFO L273 TraceCheckUtils]: 141: Hoare triple {36843#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:20,766 INFO L273 TraceCheckUtils]: 142: Hoare triple {36843#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:20,767 INFO L273 TraceCheckUtils]: 143: Hoare triple {36843#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:20,768 INFO L273 TraceCheckUtils]: 144: Hoare triple {36844#(<= main_~k~0 34)} assume true; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:20,768 INFO L273 TraceCheckUtils]: 145: Hoare triple {36844#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:20,768 INFO L273 TraceCheckUtils]: 146: Hoare triple {36844#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:20,769 INFO L273 TraceCheckUtils]: 147: Hoare triple {36844#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:20,770 INFO L273 TraceCheckUtils]: 148: Hoare triple {36845#(<= main_~k~0 35)} assume true; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:20,770 INFO L273 TraceCheckUtils]: 149: Hoare triple {36845#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:20,771 INFO L273 TraceCheckUtils]: 150: Hoare triple {36845#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:20,771 INFO L273 TraceCheckUtils]: 151: Hoare triple {36845#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {36846#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:20,772 INFO L273 TraceCheckUtils]: 152: Hoare triple {36846#(<= main_~k~0 36)} assume true; {36846#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:20,772 INFO L273 TraceCheckUtils]: 153: Hoare triple {36846#(<= main_~k~0 36)} assume !(~k~0 < 100000); {36808#false} is VALID [2018-11-18 22:45:20,772 INFO L273 TraceCheckUtils]: 154: Hoare triple {36808#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 155: Hoare triple {36808#false} ~x~0 := 0; {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 156: Hoare triple {36808#false} assume true; {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 157: Hoare triple {36808#false} assume !(~x~0 < ~i~0); {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 158: Hoare triple {36808#false} ~x~0 := 1 + ~i~0; {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 159: Hoare triple {36808#false} assume true; {36808#false} is VALID [2018-11-18 22:45:20,773 INFO L273 TraceCheckUtils]: 160: Hoare triple {36808#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36808#false} is VALID [2018-11-18 22:45:20,774 INFO L256 TraceCheckUtils]: 161: Hoare triple {36808#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36808#false} is VALID [2018-11-18 22:45:20,774 INFO L273 TraceCheckUtils]: 162: Hoare triple {36808#false} ~cond := #in~cond; {36808#false} is VALID [2018-11-18 22:45:20,774 INFO L273 TraceCheckUtils]: 163: Hoare triple {36808#false} assume 0 == ~cond; {36808#false} is VALID [2018-11-18 22:45:20,774 INFO L273 TraceCheckUtils]: 164: Hoare triple {36808#false} assume !false; {36808#false} is VALID [2018-11-18 22:45:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:20,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:20,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:20,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:21,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {36807#true} call ULTIMATE.init(); {36807#true} is VALID [2018-11-18 22:45:21,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {36807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36807#true} is VALID [2018-11-18 22:45:21,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {36807#true} assume true; {36807#true} is VALID [2018-11-18 22:45:21,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36807#true} {36807#true} #137#return; {36807#true} is VALID [2018-11-18 22:45:21,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {36807#true} call #t~ret15 := main(); {36807#true} is VALID [2018-11-18 22:45:21,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {36807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36865#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:21,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {36865#(<= main_~i~0 0)} assume true; {36865#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:21,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {36865#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {36872#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:21,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {36872#(<= main_~k~0 0)} assume true; {36872#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:21,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {36872#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36872#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:21,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {36872#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36872#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:21,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {36872#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:21,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {36811#(<= main_~k~0 1)} assume true; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:21,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {36811#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:21,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {36811#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36811#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:21,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {36811#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:21,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {36812#(<= main_~k~0 2)} assume true; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:21,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {36812#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:21,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {36812#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36812#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:21,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {36812#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:21,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {36813#(<= main_~k~0 3)} assume true; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:21,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {36813#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:21,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {36813#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36813#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:21,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {36813#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:21,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {36814#(<= main_~k~0 4)} assume true; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:21,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {36814#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:21,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {36814#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36814#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:21,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {36814#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:21,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {36815#(<= main_~k~0 5)} assume true; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:21,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {36815#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:21,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {36815#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36815#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:21,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {36815#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:21,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {36816#(<= main_~k~0 6)} assume true; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:21,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {36816#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:21,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {36816#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36816#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:21,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {36816#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:21,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {36817#(<= main_~k~0 7)} assume true; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:21,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {36817#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:21,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {36817#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36817#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:21,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {36817#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:21,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {36818#(<= main_~k~0 8)} assume true; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:21,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {36818#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:21,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {36818#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36818#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:21,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {36818#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:21,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {36819#(<= main_~k~0 9)} assume true; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:21,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {36819#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:21,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {36819#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36819#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:21,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {36819#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:21,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {36820#(<= main_~k~0 10)} assume true; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:21,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {36820#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:21,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {36820#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36820#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:21,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {36820#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:21,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {36821#(<= main_~k~0 11)} assume true; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:21,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {36821#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:21,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {36821#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36821#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:21,292 INFO L273 TraceCheckUtils]: 55: Hoare triple {36821#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:21,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {36822#(<= main_~k~0 12)} assume true; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:21,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {36822#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:21,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {36822#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36822#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:21,294 INFO L273 TraceCheckUtils]: 59: Hoare triple {36822#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:21,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {36823#(<= main_~k~0 13)} assume true; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:21,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {36823#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:21,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {36823#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36823#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:21,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {36823#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:21,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {36824#(<= main_~k~0 14)} assume true; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:21,297 INFO L273 TraceCheckUtils]: 65: Hoare triple {36824#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:21,297 INFO L273 TraceCheckUtils]: 66: Hoare triple {36824#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36824#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:21,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {36824#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:21,299 INFO L273 TraceCheckUtils]: 68: Hoare triple {36825#(<= main_~k~0 15)} assume true; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:21,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {36825#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:21,300 INFO L273 TraceCheckUtils]: 70: Hoare triple {36825#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36825#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:21,300 INFO L273 TraceCheckUtils]: 71: Hoare triple {36825#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:21,301 INFO L273 TraceCheckUtils]: 72: Hoare triple {36826#(<= main_~k~0 16)} assume true; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:21,301 INFO L273 TraceCheckUtils]: 73: Hoare triple {36826#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:21,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {36826#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36826#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:21,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {36826#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:21,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {36827#(<= main_~k~0 17)} assume true; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:21,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {36827#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:21,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {36827#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36827#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:21,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {36827#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:21,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {36828#(<= main_~k~0 18)} assume true; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:21,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {36828#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:21,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {36828#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36828#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:21,307 INFO L273 TraceCheckUtils]: 83: Hoare triple {36828#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:21,307 INFO L273 TraceCheckUtils]: 84: Hoare triple {36829#(<= main_~k~0 19)} assume true; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:21,308 INFO L273 TraceCheckUtils]: 85: Hoare triple {36829#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:21,308 INFO L273 TraceCheckUtils]: 86: Hoare triple {36829#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36829#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:21,309 INFO L273 TraceCheckUtils]: 87: Hoare triple {36829#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:21,310 INFO L273 TraceCheckUtils]: 88: Hoare triple {36830#(<= main_~k~0 20)} assume true; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:21,310 INFO L273 TraceCheckUtils]: 89: Hoare triple {36830#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:21,311 INFO L273 TraceCheckUtils]: 90: Hoare triple {36830#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36830#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:21,311 INFO L273 TraceCheckUtils]: 91: Hoare triple {36830#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:21,312 INFO L273 TraceCheckUtils]: 92: Hoare triple {36831#(<= main_~k~0 21)} assume true; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:21,312 INFO L273 TraceCheckUtils]: 93: Hoare triple {36831#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:21,313 INFO L273 TraceCheckUtils]: 94: Hoare triple {36831#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36831#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:21,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {36831#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:21,314 INFO L273 TraceCheckUtils]: 96: Hoare triple {36832#(<= main_~k~0 22)} assume true; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:21,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {36832#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:21,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {36832#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36832#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:21,316 INFO L273 TraceCheckUtils]: 99: Hoare triple {36832#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:21,316 INFO L273 TraceCheckUtils]: 100: Hoare triple {36833#(<= main_~k~0 23)} assume true; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:21,317 INFO L273 TraceCheckUtils]: 101: Hoare triple {36833#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:21,317 INFO L273 TraceCheckUtils]: 102: Hoare triple {36833#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36833#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:21,318 INFO L273 TraceCheckUtils]: 103: Hoare triple {36833#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:21,318 INFO L273 TraceCheckUtils]: 104: Hoare triple {36834#(<= main_~k~0 24)} assume true; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:21,319 INFO L273 TraceCheckUtils]: 105: Hoare triple {36834#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:21,319 INFO L273 TraceCheckUtils]: 106: Hoare triple {36834#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36834#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:21,320 INFO L273 TraceCheckUtils]: 107: Hoare triple {36834#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:21,321 INFO L273 TraceCheckUtils]: 108: Hoare triple {36835#(<= main_~k~0 25)} assume true; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:21,321 INFO L273 TraceCheckUtils]: 109: Hoare triple {36835#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:21,322 INFO L273 TraceCheckUtils]: 110: Hoare triple {36835#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36835#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:21,322 INFO L273 TraceCheckUtils]: 111: Hoare triple {36835#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:21,323 INFO L273 TraceCheckUtils]: 112: Hoare triple {36836#(<= main_~k~0 26)} assume true; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:21,323 INFO L273 TraceCheckUtils]: 113: Hoare triple {36836#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:21,324 INFO L273 TraceCheckUtils]: 114: Hoare triple {36836#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36836#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:21,325 INFO L273 TraceCheckUtils]: 115: Hoare triple {36836#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:21,325 INFO L273 TraceCheckUtils]: 116: Hoare triple {36837#(<= main_~k~0 27)} assume true; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:21,326 INFO L273 TraceCheckUtils]: 117: Hoare triple {36837#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:21,326 INFO L273 TraceCheckUtils]: 118: Hoare triple {36837#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36837#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:21,327 INFO L273 TraceCheckUtils]: 119: Hoare triple {36837#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:21,327 INFO L273 TraceCheckUtils]: 120: Hoare triple {36838#(<= main_~k~0 28)} assume true; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:21,328 INFO L273 TraceCheckUtils]: 121: Hoare triple {36838#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:21,328 INFO L273 TraceCheckUtils]: 122: Hoare triple {36838#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36838#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:21,329 INFO L273 TraceCheckUtils]: 123: Hoare triple {36838#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:21,329 INFO L273 TraceCheckUtils]: 124: Hoare triple {36839#(<= main_~k~0 29)} assume true; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:21,330 INFO L273 TraceCheckUtils]: 125: Hoare triple {36839#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:21,330 INFO L273 TraceCheckUtils]: 126: Hoare triple {36839#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36839#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:21,331 INFO L273 TraceCheckUtils]: 127: Hoare triple {36839#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:21,332 INFO L273 TraceCheckUtils]: 128: Hoare triple {36840#(<= main_~k~0 30)} assume true; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:21,332 INFO L273 TraceCheckUtils]: 129: Hoare triple {36840#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:21,333 INFO L273 TraceCheckUtils]: 130: Hoare triple {36840#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36840#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:21,333 INFO L273 TraceCheckUtils]: 131: Hoare triple {36840#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:21,334 INFO L273 TraceCheckUtils]: 132: Hoare triple {36841#(<= main_~k~0 31)} assume true; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:21,334 INFO L273 TraceCheckUtils]: 133: Hoare triple {36841#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:21,335 INFO L273 TraceCheckUtils]: 134: Hoare triple {36841#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36841#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:21,336 INFO L273 TraceCheckUtils]: 135: Hoare triple {36841#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:21,336 INFO L273 TraceCheckUtils]: 136: Hoare triple {36842#(<= main_~k~0 32)} assume true; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:21,336 INFO L273 TraceCheckUtils]: 137: Hoare triple {36842#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:21,337 INFO L273 TraceCheckUtils]: 138: Hoare triple {36842#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36842#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:21,338 INFO L273 TraceCheckUtils]: 139: Hoare triple {36842#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:21,338 INFO L273 TraceCheckUtils]: 140: Hoare triple {36843#(<= main_~k~0 33)} assume true; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:21,339 INFO L273 TraceCheckUtils]: 141: Hoare triple {36843#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:21,339 INFO L273 TraceCheckUtils]: 142: Hoare triple {36843#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36843#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:21,340 INFO L273 TraceCheckUtils]: 143: Hoare triple {36843#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:21,340 INFO L273 TraceCheckUtils]: 144: Hoare triple {36844#(<= main_~k~0 34)} assume true; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:21,341 INFO L273 TraceCheckUtils]: 145: Hoare triple {36844#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:21,341 INFO L273 TraceCheckUtils]: 146: Hoare triple {36844#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36844#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:21,342 INFO L273 TraceCheckUtils]: 147: Hoare triple {36844#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:21,343 INFO L273 TraceCheckUtils]: 148: Hoare triple {36845#(<= main_~k~0 35)} assume true; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:21,343 INFO L273 TraceCheckUtils]: 149: Hoare triple {36845#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:21,344 INFO L273 TraceCheckUtils]: 150: Hoare triple {36845#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36845#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:21,344 INFO L273 TraceCheckUtils]: 151: Hoare triple {36845#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {36846#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:21,345 INFO L273 TraceCheckUtils]: 152: Hoare triple {36846#(<= main_~k~0 36)} assume true; {36846#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:21,345 INFO L273 TraceCheckUtils]: 153: Hoare triple {36846#(<= main_~k~0 36)} assume !(~k~0 < 100000); {36808#false} is VALID [2018-11-18 22:45:21,346 INFO L273 TraceCheckUtils]: 154: Hoare triple {36808#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36808#false} is VALID [2018-11-18 22:45:21,346 INFO L273 TraceCheckUtils]: 155: Hoare triple {36808#false} ~x~0 := 0; {36808#false} is VALID [2018-11-18 22:45:21,346 INFO L273 TraceCheckUtils]: 156: Hoare triple {36808#false} assume true; {36808#false} is VALID [2018-11-18 22:45:21,346 INFO L273 TraceCheckUtils]: 157: Hoare triple {36808#false} assume !(~x~0 < ~i~0); {36808#false} is VALID [2018-11-18 22:45:21,346 INFO L273 TraceCheckUtils]: 158: Hoare triple {36808#false} ~x~0 := 1 + ~i~0; {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L273 TraceCheckUtils]: 159: Hoare triple {36808#false} assume true; {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L273 TraceCheckUtils]: 160: Hoare triple {36808#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L256 TraceCheckUtils]: 161: Hoare triple {36808#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L273 TraceCheckUtils]: 162: Hoare triple {36808#false} ~cond := #in~cond; {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L273 TraceCheckUtils]: 163: Hoare triple {36808#false} assume 0 == ~cond; {36808#false} is VALID [2018-11-18 22:45:21,347 INFO L273 TraceCheckUtils]: 164: Hoare triple {36808#false} assume !false; {36808#false} is VALID [2018-11-18 22:45:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:21,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:21,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2018-11-18 22:45:21,385 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-11-18 22:45:21,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:21,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-18 22:45:21,544 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-18 22:45:21,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-18 22:45:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 22:45:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:45:21,546 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 42 states. [2018-11-18 22:45:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:24,866 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2018-11-18 22:45:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-18 22:45:24,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-11-18 22:45:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:45:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 310 transitions. [2018-11-18 22:45:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:45:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 310 transitions. [2018-11-18 22:45:24,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 310 transitions. [2018-11-18 22:45:25,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:25,147 INFO L225 Difference]: With dead ends: 255 [2018-11-18 22:45:25,147 INFO L226 Difference]: Without dead ends: 213 [2018-11-18 22:45:25,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-11-18 22:45:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-18 22:45:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2018-11-18 22:45:25,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:25,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 204 states. [2018-11-18 22:45:25,260 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 204 states. [2018-11-18 22:45:25,261 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 204 states. [2018-11-18 22:45:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:25,264 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2018-11-18 22:45:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2018-11-18 22:45:25,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:25,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:25,265 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 213 states. [2018-11-18 22:45:25,265 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 213 states. [2018-11-18 22:45:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:25,268 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2018-11-18 22:45:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2018-11-18 22:45:25,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:25,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:25,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:25,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 22:45:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-11-18 22:45:25,272 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 165 [2018-11-18 22:45:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:25,272 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-11-18 22:45:25,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-18 22:45:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-11-18 22:45:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 22:45:25,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:25,273 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:25,273 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:25,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2087831711, now seen corresponding path program 26 times [2018-11-18 22:45:25,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:26,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {38428#true} call ULTIMATE.init(); {38428#true} is VALID [2018-11-18 22:45:26,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {38428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38428#true} is VALID [2018-11-18 22:45:26,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {38428#true} assume true; {38428#true} is VALID [2018-11-18 22:45:26,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38428#true} {38428#true} #137#return; {38428#true} is VALID [2018-11-18 22:45:26,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {38428#true} call #t~ret15 := main(); {38428#true} is VALID [2018-11-18 22:45:26,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {38428#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {38430#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:26,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {38430#(= 0 main_~i~0)} assume true; {38430#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:26,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {38430#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {38431#(= main_~k~0 0)} is VALID [2018-11-18 22:45:26,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {38431#(= main_~k~0 0)} assume true; {38431#(= main_~k~0 0)} is VALID [2018-11-18 22:45:26,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {38431#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38431#(= main_~k~0 0)} is VALID [2018-11-18 22:45:26,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {38431#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38431#(= main_~k~0 0)} is VALID [2018-11-18 22:45:26,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {38431#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:26,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {38432#(<= main_~k~0 1)} assume true; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:26,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {38432#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:26,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {38432#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:26,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {38432#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:26,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {38433#(<= main_~k~0 2)} assume true; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:26,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {38433#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:26,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {38433#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:26,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {38433#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:26,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {38434#(<= main_~k~0 3)} assume true; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:26,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {38434#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:26,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {38434#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:26,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {38434#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:26,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {38435#(<= main_~k~0 4)} assume true; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:26,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {38435#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:26,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {38435#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:26,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {38435#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:26,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {38436#(<= main_~k~0 5)} assume true; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:26,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {38436#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:26,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {38436#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:26,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {38436#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:26,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {38437#(<= main_~k~0 6)} assume true; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:26,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {38437#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:26,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {38437#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:26,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {38437#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:26,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {38438#(<= main_~k~0 7)} assume true; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:26,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {38438#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:26,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {38438#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:26,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {38438#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:26,389 INFO L273 TraceCheckUtils]: 40: Hoare triple {38439#(<= main_~k~0 8)} assume true; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:26,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {38439#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:26,390 INFO L273 TraceCheckUtils]: 42: Hoare triple {38439#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:26,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {38439#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:26,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {38440#(<= main_~k~0 9)} assume true; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:26,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {38440#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:26,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {38440#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:26,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {38440#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:26,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {38441#(<= main_~k~0 10)} assume true; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:26,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {38441#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:26,395 INFO L273 TraceCheckUtils]: 50: Hoare triple {38441#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:26,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {38441#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:26,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {38442#(<= main_~k~0 11)} assume true; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:26,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {38442#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:26,397 INFO L273 TraceCheckUtils]: 54: Hoare triple {38442#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:26,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {38442#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:26,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {38443#(<= main_~k~0 12)} assume true; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:26,398 INFO L273 TraceCheckUtils]: 57: Hoare triple {38443#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:26,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {38443#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:26,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {38443#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:26,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {38444#(<= main_~k~0 13)} assume true; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:26,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {38444#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:26,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {38444#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:26,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {38444#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:26,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {38445#(<= main_~k~0 14)} assume true; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:26,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {38445#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:26,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {38445#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:26,404 INFO L273 TraceCheckUtils]: 67: Hoare triple {38445#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:26,404 INFO L273 TraceCheckUtils]: 68: Hoare triple {38446#(<= main_~k~0 15)} assume true; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:26,405 INFO L273 TraceCheckUtils]: 69: Hoare triple {38446#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:26,405 INFO L273 TraceCheckUtils]: 70: Hoare triple {38446#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:26,406 INFO L273 TraceCheckUtils]: 71: Hoare triple {38446#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:26,407 INFO L273 TraceCheckUtils]: 72: Hoare triple {38447#(<= main_~k~0 16)} assume true; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:26,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {38447#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:26,408 INFO L273 TraceCheckUtils]: 74: Hoare triple {38447#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:26,408 INFO L273 TraceCheckUtils]: 75: Hoare triple {38447#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:26,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {38448#(<= main_~k~0 17)} assume true; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:26,409 INFO L273 TraceCheckUtils]: 77: Hoare triple {38448#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:26,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {38448#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:26,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {38448#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:26,411 INFO L273 TraceCheckUtils]: 80: Hoare triple {38449#(<= main_~k~0 18)} assume true; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:26,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {38449#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:26,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {38449#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:26,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {38449#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:26,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {38450#(<= main_~k~0 19)} assume true; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:26,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {38450#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:26,414 INFO L273 TraceCheckUtils]: 86: Hoare triple {38450#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:26,415 INFO L273 TraceCheckUtils]: 87: Hoare triple {38450#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:26,415 INFO L273 TraceCheckUtils]: 88: Hoare triple {38451#(<= main_~k~0 20)} assume true; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:26,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {38451#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:26,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {38451#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:26,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {38451#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:26,417 INFO L273 TraceCheckUtils]: 92: Hoare triple {38452#(<= main_~k~0 21)} assume true; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:26,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {38452#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:26,418 INFO L273 TraceCheckUtils]: 94: Hoare triple {38452#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:26,419 INFO L273 TraceCheckUtils]: 95: Hoare triple {38452#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:26,420 INFO L273 TraceCheckUtils]: 96: Hoare triple {38453#(<= main_~k~0 22)} assume true; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:26,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {38453#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:26,421 INFO L273 TraceCheckUtils]: 98: Hoare triple {38453#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:26,421 INFO L273 TraceCheckUtils]: 99: Hoare triple {38453#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:26,422 INFO L273 TraceCheckUtils]: 100: Hoare triple {38454#(<= main_~k~0 23)} assume true; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:26,422 INFO L273 TraceCheckUtils]: 101: Hoare triple {38454#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:26,423 INFO L273 TraceCheckUtils]: 102: Hoare triple {38454#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:26,423 INFO L273 TraceCheckUtils]: 103: Hoare triple {38454#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:26,424 INFO L273 TraceCheckUtils]: 104: Hoare triple {38455#(<= main_~k~0 24)} assume true; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:26,424 INFO L273 TraceCheckUtils]: 105: Hoare triple {38455#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:26,425 INFO L273 TraceCheckUtils]: 106: Hoare triple {38455#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:26,426 INFO L273 TraceCheckUtils]: 107: Hoare triple {38455#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:26,426 INFO L273 TraceCheckUtils]: 108: Hoare triple {38456#(<= main_~k~0 25)} assume true; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:26,426 INFO L273 TraceCheckUtils]: 109: Hoare triple {38456#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:26,427 INFO L273 TraceCheckUtils]: 110: Hoare triple {38456#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:26,428 INFO L273 TraceCheckUtils]: 111: Hoare triple {38456#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:26,428 INFO L273 TraceCheckUtils]: 112: Hoare triple {38457#(<= main_~k~0 26)} assume true; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:26,429 INFO L273 TraceCheckUtils]: 113: Hoare triple {38457#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:26,429 INFO L273 TraceCheckUtils]: 114: Hoare triple {38457#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:26,430 INFO L273 TraceCheckUtils]: 115: Hoare triple {38457#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:26,430 INFO L273 TraceCheckUtils]: 116: Hoare triple {38458#(<= main_~k~0 27)} assume true; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:26,431 INFO L273 TraceCheckUtils]: 117: Hoare triple {38458#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:26,431 INFO L273 TraceCheckUtils]: 118: Hoare triple {38458#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:26,432 INFO L273 TraceCheckUtils]: 119: Hoare triple {38458#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:26,433 INFO L273 TraceCheckUtils]: 120: Hoare triple {38459#(<= main_~k~0 28)} assume true; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:26,433 INFO L273 TraceCheckUtils]: 121: Hoare triple {38459#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:26,433 INFO L273 TraceCheckUtils]: 122: Hoare triple {38459#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:26,434 INFO L273 TraceCheckUtils]: 123: Hoare triple {38459#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:26,435 INFO L273 TraceCheckUtils]: 124: Hoare triple {38460#(<= main_~k~0 29)} assume true; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:26,435 INFO L273 TraceCheckUtils]: 125: Hoare triple {38460#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:26,436 INFO L273 TraceCheckUtils]: 126: Hoare triple {38460#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:26,436 INFO L273 TraceCheckUtils]: 127: Hoare triple {38460#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:26,437 INFO L273 TraceCheckUtils]: 128: Hoare triple {38461#(<= main_~k~0 30)} assume true; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:26,437 INFO L273 TraceCheckUtils]: 129: Hoare triple {38461#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:26,438 INFO L273 TraceCheckUtils]: 130: Hoare triple {38461#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:26,438 INFO L273 TraceCheckUtils]: 131: Hoare triple {38461#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:26,439 INFO L273 TraceCheckUtils]: 132: Hoare triple {38462#(<= main_~k~0 31)} assume true; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:26,439 INFO L273 TraceCheckUtils]: 133: Hoare triple {38462#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:26,440 INFO L273 TraceCheckUtils]: 134: Hoare triple {38462#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:26,441 INFO L273 TraceCheckUtils]: 135: Hoare triple {38462#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:26,441 INFO L273 TraceCheckUtils]: 136: Hoare triple {38463#(<= main_~k~0 32)} assume true; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:26,442 INFO L273 TraceCheckUtils]: 137: Hoare triple {38463#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:26,442 INFO L273 TraceCheckUtils]: 138: Hoare triple {38463#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:26,443 INFO L273 TraceCheckUtils]: 139: Hoare triple {38463#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:26,443 INFO L273 TraceCheckUtils]: 140: Hoare triple {38464#(<= main_~k~0 33)} assume true; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:26,444 INFO L273 TraceCheckUtils]: 141: Hoare triple {38464#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:26,444 INFO L273 TraceCheckUtils]: 142: Hoare triple {38464#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:26,445 INFO L273 TraceCheckUtils]: 143: Hoare triple {38464#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:26,445 INFO L273 TraceCheckUtils]: 144: Hoare triple {38465#(<= main_~k~0 34)} assume true; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:26,446 INFO L273 TraceCheckUtils]: 145: Hoare triple {38465#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:26,446 INFO L273 TraceCheckUtils]: 146: Hoare triple {38465#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:26,447 INFO L273 TraceCheckUtils]: 147: Hoare triple {38465#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:26,447 INFO L273 TraceCheckUtils]: 148: Hoare triple {38466#(<= main_~k~0 35)} assume true; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:26,448 INFO L273 TraceCheckUtils]: 149: Hoare triple {38466#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:26,448 INFO L273 TraceCheckUtils]: 150: Hoare triple {38466#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:26,449 INFO L273 TraceCheckUtils]: 151: Hoare triple {38466#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:26,450 INFO L273 TraceCheckUtils]: 152: Hoare triple {38467#(<= main_~k~0 36)} assume true; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:26,450 INFO L273 TraceCheckUtils]: 153: Hoare triple {38467#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:26,451 INFO L273 TraceCheckUtils]: 154: Hoare triple {38467#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:26,451 INFO L273 TraceCheckUtils]: 155: Hoare triple {38467#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {38468#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:26,452 INFO L273 TraceCheckUtils]: 156: Hoare triple {38468#(<= main_~k~0 37)} assume true; {38468#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:26,452 INFO L273 TraceCheckUtils]: 157: Hoare triple {38468#(<= main_~k~0 37)} assume !(~k~0 < 100000); {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 158: Hoare triple {38429#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 159: Hoare triple {38429#false} ~x~0 := 0; {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 160: Hoare triple {38429#false} assume true; {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 161: Hoare triple {38429#false} assume !(~x~0 < ~i~0); {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 162: Hoare triple {38429#false} ~x~0 := 1 + ~i~0; {38429#false} is VALID [2018-11-18 22:45:26,453 INFO L273 TraceCheckUtils]: 163: Hoare triple {38429#false} assume true; {38429#false} is VALID [2018-11-18 22:45:26,454 INFO L273 TraceCheckUtils]: 164: Hoare triple {38429#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38429#false} is VALID [2018-11-18 22:45:26,454 INFO L256 TraceCheckUtils]: 165: Hoare triple {38429#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38429#false} is VALID [2018-11-18 22:45:26,454 INFO L273 TraceCheckUtils]: 166: Hoare triple {38429#false} ~cond := #in~cond; {38429#false} is VALID [2018-11-18 22:45:26,454 INFO L273 TraceCheckUtils]: 167: Hoare triple {38429#false} assume 0 == ~cond; {38429#false} is VALID [2018-11-18 22:45:26,454 INFO L273 TraceCheckUtils]: 168: Hoare triple {38429#false} assume !false; {38429#false} is VALID [2018-11-18 22:45:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:26,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:26,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:45:26,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:45:26,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:26,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:27,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {38428#true} call ULTIMATE.init(); {38428#true} is VALID [2018-11-18 22:45:27,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {38428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38428#true} is VALID [2018-11-18 22:45:27,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {38428#true} assume true; {38428#true} is VALID [2018-11-18 22:45:27,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38428#true} {38428#true} #137#return; {38428#true} is VALID [2018-11-18 22:45:27,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {38428#true} call #t~ret15 := main(); {38428#true} is VALID [2018-11-18 22:45:27,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {38428#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {38487#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:27,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {38487#(<= main_~i~0 0)} assume true; {38487#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:27,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {38487#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {38494#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:27,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {38494#(<= main_~k~0 0)} assume true; {38494#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:27,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {38494#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38494#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:27,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {38494#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38494#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:27,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {38494#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:27,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {38432#(<= main_~k~0 1)} assume true; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:27,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {38432#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:27,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {38432#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {38432#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:27,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {38432#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:27,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {38433#(<= main_~k~0 2)} assume true; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:27,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {38433#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:27,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {38433#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38433#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:27,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {38433#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:27,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {38434#(<= main_~k~0 3)} assume true; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:27,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {38434#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:27,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {38434#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38434#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:27,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {38434#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:27,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {38435#(<= main_~k~0 4)} assume true; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:27,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {38435#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:27,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {38435#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38435#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:27,014 INFO L273 TraceCheckUtils]: 27: Hoare triple {38435#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:27,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {38436#(<= main_~k~0 5)} assume true; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:27,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {38436#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:27,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {38436#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38436#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:27,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {38436#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:27,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {38437#(<= main_~k~0 6)} assume true; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:27,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {38437#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:27,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {38437#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38437#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:27,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {38437#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:27,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {38438#(<= main_~k~0 7)} assume true; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:27,019 INFO L273 TraceCheckUtils]: 37: Hoare triple {38438#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:27,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {38438#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38438#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:27,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {38438#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:27,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {38439#(<= main_~k~0 8)} assume true; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:27,022 INFO L273 TraceCheckUtils]: 41: Hoare triple {38439#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:27,022 INFO L273 TraceCheckUtils]: 42: Hoare triple {38439#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38439#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:27,023 INFO L273 TraceCheckUtils]: 43: Hoare triple {38439#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:27,023 INFO L273 TraceCheckUtils]: 44: Hoare triple {38440#(<= main_~k~0 9)} assume true; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:27,024 INFO L273 TraceCheckUtils]: 45: Hoare triple {38440#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:27,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {38440#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38440#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:27,025 INFO L273 TraceCheckUtils]: 47: Hoare triple {38440#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:27,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {38441#(<= main_~k~0 10)} assume true; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:27,026 INFO L273 TraceCheckUtils]: 49: Hoare triple {38441#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:27,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {38441#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38441#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:27,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {38441#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:27,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {38442#(<= main_~k~0 11)} assume true; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:27,028 INFO L273 TraceCheckUtils]: 53: Hoare triple {38442#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:27,028 INFO L273 TraceCheckUtils]: 54: Hoare triple {38442#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38442#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:27,029 INFO L273 TraceCheckUtils]: 55: Hoare triple {38442#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:27,029 INFO L273 TraceCheckUtils]: 56: Hoare triple {38443#(<= main_~k~0 12)} assume true; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:27,030 INFO L273 TraceCheckUtils]: 57: Hoare triple {38443#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:27,030 INFO L273 TraceCheckUtils]: 58: Hoare triple {38443#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38443#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:27,031 INFO L273 TraceCheckUtils]: 59: Hoare triple {38443#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:27,031 INFO L273 TraceCheckUtils]: 60: Hoare triple {38444#(<= main_~k~0 13)} assume true; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:27,032 INFO L273 TraceCheckUtils]: 61: Hoare triple {38444#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:27,032 INFO L273 TraceCheckUtils]: 62: Hoare triple {38444#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38444#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:27,033 INFO L273 TraceCheckUtils]: 63: Hoare triple {38444#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:27,033 INFO L273 TraceCheckUtils]: 64: Hoare triple {38445#(<= main_~k~0 14)} assume true; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:27,034 INFO L273 TraceCheckUtils]: 65: Hoare triple {38445#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:27,034 INFO L273 TraceCheckUtils]: 66: Hoare triple {38445#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38445#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:27,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {38445#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:27,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {38446#(<= main_~k~0 15)} assume true; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:27,036 INFO L273 TraceCheckUtils]: 69: Hoare triple {38446#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:27,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {38446#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38446#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:27,037 INFO L273 TraceCheckUtils]: 71: Hoare triple {38446#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:27,038 INFO L273 TraceCheckUtils]: 72: Hoare triple {38447#(<= main_~k~0 16)} assume true; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:27,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {38447#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:27,039 INFO L273 TraceCheckUtils]: 74: Hoare triple {38447#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38447#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:27,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {38447#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:27,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {38448#(<= main_~k~0 17)} assume true; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:27,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {38448#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:27,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {38448#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38448#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:27,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {38448#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:27,042 INFO L273 TraceCheckUtils]: 80: Hoare triple {38449#(<= main_~k~0 18)} assume true; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:27,042 INFO L273 TraceCheckUtils]: 81: Hoare triple {38449#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:27,043 INFO L273 TraceCheckUtils]: 82: Hoare triple {38449#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38449#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:27,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {38449#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:27,044 INFO L273 TraceCheckUtils]: 84: Hoare triple {38450#(<= main_~k~0 19)} assume true; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:27,044 INFO L273 TraceCheckUtils]: 85: Hoare triple {38450#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:27,045 INFO L273 TraceCheckUtils]: 86: Hoare triple {38450#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38450#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:27,046 INFO L273 TraceCheckUtils]: 87: Hoare triple {38450#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:27,046 INFO L273 TraceCheckUtils]: 88: Hoare triple {38451#(<= main_~k~0 20)} assume true; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:27,046 INFO L273 TraceCheckUtils]: 89: Hoare triple {38451#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:27,047 INFO L273 TraceCheckUtils]: 90: Hoare triple {38451#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38451#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:27,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {38451#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:27,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {38452#(<= main_~k~0 21)} assume true; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:27,049 INFO L273 TraceCheckUtils]: 93: Hoare triple {38452#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:27,049 INFO L273 TraceCheckUtils]: 94: Hoare triple {38452#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38452#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:27,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {38452#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:27,050 INFO L273 TraceCheckUtils]: 96: Hoare triple {38453#(<= main_~k~0 22)} assume true; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:27,051 INFO L273 TraceCheckUtils]: 97: Hoare triple {38453#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:27,051 INFO L273 TraceCheckUtils]: 98: Hoare triple {38453#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38453#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:27,052 INFO L273 TraceCheckUtils]: 99: Hoare triple {38453#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:27,052 INFO L273 TraceCheckUtils]: 100: Hoare triple {38454#(<= main_~k~0 23)} assume true; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:27,053 INFO L273 TraceCheckUtils]: 101: Hoare triple {38454#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:27,053 INFO L273 TraceCheckUtils]: 102: Hoare triple {38454#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38454#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:27,054 INFO L273 TraceCheckUtils]: 103: Hoare triple {38454#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:27,054 INFO L273 TraceCheckUtils]: 104: Hoare triple {38455#(<= main_~k~0 24)} assume true; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:27,055 INFO L273 TraceCheckUtils]: 105: Hoare triple {38455#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:27,055 INFO L273 TraceCheckUtils]: 106: Hoare triple {38455#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38455#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:27,056 INFO L273 TraceCheckUtils]: 107: Hoare triple {38455#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:27,056 INFO L273 TraceCheckUtils]: 108: Hoare triple {38456#(<= main_~k~0 25)} assume true; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:27,057 INFO L273 TraceCheckUtils]: 109: Hoare triple {38456#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:27,057 INFO L273 TraceCheckUtils]: 110: Hoare triple {38456#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38456#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:27,058 INFO L273 TraceCheckUtils]: 111: Hoare triple {38456#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:27,058 INFO L273 TraceCheckUtils]: 112: Hoare triple {38457#(<= main_~k~0 26)} assume true; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:27,059 INFO L273 TraceCheckUtils]: 113: Hoare triple {38457#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:27,059 INFO L273 TraceCheckUtils]: 114: Hoare triple {38457#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38457#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:27,060 INFO L273 TraceCheckUtils]: 115: Hoare triple {38457#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:27,060 INFO L273 TraceCheckUtils]: 116: Hoare triple {38458#(<= main_~k~0 27)} assume true; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:27,061 INFO L273 TraceCheckUtils]: 117: Hoare triple {38458#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:27,061 INFO L273 TraceCheckUtils]: 118: Hoare triple {38458#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38458#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:27,062 INFO L273 TraceCheckUtils]: 119: Hoare triple {38458#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:27,063 INFO L273 TraceCheckUtils]: 120: Hoare triple {38459#(<= main_~k~0 28)} assume true; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:27,063 INFO L273 TraceCheckUtils]: 121: Hoare triple {38459#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:27,063 INFO L273 TraceCheckUtils]: 122: Hoare triple {38459#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38459#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:27,064 INFO L273 TraceCheckUtils]: 123: Hoare triple {38459#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:27,065 INFO L273 TraceCheckUtils]: 124: Hoare triple {38460#(<= main_~k~0 29)} assume true; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:27,065 INFO L273 TraceCheckUtils]: 125: Hoare triple {38460#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:27,066 INFO L273 TraceCheckUtils]: 126: Hoare triple {38460#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38460#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:27,066 INFO L273 TraceCheckUtils]: 127: Hoare triple {38460#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:27,067 INFO L273 TraceCheckUtils]: 128: Hoare triple {38461#(<= main_~k~0 30)} assume true; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:27,067 INFO L273 TraceCheckUtils]: 129: Hoare triple {38461#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:27,068 INFO L273 TraceCheckUtils]: 130: Hoare triple {38461#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38461#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:27,068 INFO L273 TraceCheckUtils]: 131: Hoare triple {38461#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:27,069 INFO L273 TraceCheckUtils]: 132: Hoare triple {38462#(<= main_~k~0 31)} assume true; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:27,069 INFO L273 TraceCheckUtils]: 133: Hoare triple {38462#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:27,070 INFO L273 TraceCheckUtils]: 134: Hoare triple {38462#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38462#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:27,070 INFO L273 TraceCheckUtils]: 135: Hoare triple {38462#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:27,071 INFO L273 TraceCheckUtils]: 136: Hoare triple {38463#(<= main_~k~0 32)} assume true; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:27,071 INFO L273 TraceCheckUtils]: 137: Hoare triple {38463#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:27,072 INFO L273 TraceCheckUtils]: 138: Hoare triple {38463#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38463#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:27,072 INFO L273 TraceCheckUtils]: 139: Hoare triple {38463#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:27,073 INFO L273 TraceCheckUtils]: 140: Hoare triple {38464#(<= main_~k~0 33)} assume true; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:27,073 INFO L273 TraceCheckUtils]: 141: Hoare triple {38464#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:27,074 INFO L273 TraceCheckUtils]: 142: Hoare triple {38464#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38464#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:27,074 INFO L273 TraceCheckUtils]: 143: Hoare triple {38464#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:27,075 INFO L273 TraceCheckUtils]: 144: Hoare triple {38465#(<= main_~k~0 34)} assume true; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:27,075 INFO L273 TraceCheckUtils]: 145: Hoare triple {38465#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:27,076 INFO L273 TraceCheckUtils]: 146: Hoare triple {38465#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38465#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:27,076 INFO L273 TraceCheckUtils]: 147: Hoare triple {38465#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:27,077 INFO L273 TraceCheckUtils]: 148: Hoare triple {38466#(<= main_~k~0 35)} assume true; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:27,077 INFO L273 TraceCheckUtils]: 149: Hoare triple {38466#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:27,078 INFO L273 TraceCheckUtils]: 150: Hoare triple {38466#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38466#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:27,079 INFO L273 TraceCheckUtils]: 151: Hoare triple {38466#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:27,079 INFO L273 TraceCheckUtils]: 152: Hoare triple {38467#(<= main_~k~0 36)} assume true; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:27,079 INFO L273 TraceCheckUtils]: 153: Hoare triple {38467#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:27,080 INFO L273 TraceCheckUtils]: 154: Hoare triple {38467#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38467#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:27,081 INFO L273 TraceCheckUtils]: 155: Hoare triple {38467#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {38468#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:27,081 INFO L273 TraceCheckUtils]: 156: Hoare triple {38468#(<= main_~k~0 37)} assume true; {38468#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:27,082 INFO L273 TraceCheckUtils]: 157: Hoare triple {38468#(<= main_~k~0 37)} assume !(~k~0 < 100000); {38429#false} is VALID [2018-11-18 22:45:27,082 INFO L273 TraceCheckUtils]: 158: Hoare triple {38429#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38429#false} is VALID [2018-11-18 22:45:27,082 INFO L273 TraceCheckUtils]: 159: Hoare triple {38429#false} ~x~0 := 0; {38429#false} is VALID [2018-11-18 22:45:27,082 INFO L273 TraceCheckUtils]: 160: Hoare triple {38429#false} assume true; {38429#false} is VALID [2018-11-18 22:45:27,082 INFO L273 TraceCheckUtils]: 161: Hoare triple {38429#false} assume !(~x~0 < ~i~0); {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L273 TraceCheckUtils]: 162: Hoare triple {38429#false} ~x~0 := 1 + ~i~0; {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L273 TraceCheckUtils]: 163: Hoare triple {38429#false} assume true; {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L273 TraceCheckUtils]: 164: Hoare triple {38429#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L256 TraceCheckUtils]: 165: Hoare triple {38429#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L273 TraceCheckUtils]: 166: Hoare triple {38429#false} ~cond := #in~cond; {38429#false} is VALID [2018-11-18 22:45:27,083 INFO L273 TraceCheckUtils]: 167: Hoare triple {38429#false} assume 0 == ~cond; {38429#false} is VALID [2018-11-18 22:45:27,084 INFO L273 TraceCheckUtils]: 168: Hoare triple {38429#false} assume !false; {38429#false} is VALID [2018-11-18 22:45:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2018-11-18 22:45:27,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-11-18 22:45:27,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:27,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-18 22:45:27,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:27,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 22:45:27,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 22:45:27,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:45:27,275 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 43 states. [2018-11-18 22:45:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:29,170 INFO L93 Difference]: Finished difference Result 259 states and 324 transitions. [2018-11-18 22:45:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 22:45:29,170 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-11-18 22:45:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:45:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 315 transitions. [2018-11-18 22:45:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:45:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 315 transitions. [2018-11-18 22:45:29,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 315 transitions. [2018-11-18 22:45:29,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:29,536 INFO L225 Difference]: With dead ends: 259 [2018-11-18 22:45:29,536 INFO L226 Difference]: Without dead ends: 217 [2018-11-18 22:45:29,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-11-18 22:45:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-18 22:45:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2018-11-18 22:45:30,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:30,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 208 states. [2018-11-18 22:45:30,133 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 208 states. [2018-11-18 22:45:30,133 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 208 states. [2018-11-18 22:45:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:30,137 INFO L93 Difference]: Finished difference Result 217 states and 270 transitions. [2018-11-18 22:45:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 270 transitions. [2018-11-18 22:45:30,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:30,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:30,137 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 217 states. [2018-11-18 22:45:30,137 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 217 states. [2018-11-18 22:45:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:30,141 INFO L93 Difference]: Finished difference Result 217 states and 270 transitions. [2018-11-18 22:45:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 270 transitions. [2018-11-18 22:45:30,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:30,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:30,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:30,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 22:45:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2018-11-18 22:45:30,144 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 169 [2018-11-18 22:45:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2018-11-18 22:45:30,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 22:45:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2018-11-18 22:45:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 22:45:30,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:30,146 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:30,146 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:30,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 232605751, now seen corresponding path program 27 times [2018-11-18 22:45:30,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:30,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:30,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:30,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {40082#true} call ULTIMATE.init(); {40082#true} is VALID [2018-11-18 22:45:30,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {40082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40082#true} is VALID [2018-11-18 22:45:30,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {40082#true} assume true; {40082#true} is VALID [2018-11-18 22:45:30,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40082#true} {40082#true} #137#return; {40082#true} is VALID [2018-11-18 22:45:30,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {40082#true} call #t~ret15 := main(); {40082#true} is VALID [2018-11-18 22:45:30,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {40082#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40084#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:30,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {40084#(= 0 main_~i~0)} assume true; {40084#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:30,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {40084#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {40085#(= main_~k~0 0)} is VALID [2018-11-18 22:45:30,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {40085#(= main_~k~0 0)} assume true; {40085#(= main_~k~0 0)} is VALID [2018-11-18 22:45:30,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {40085#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40085#(= main_~k~0 0)} is VALID [2018-11-18 22:45:30,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {40085#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40085#(= main_~k~0 0)} is VALID [2018-11-18 22:45:30,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {40085#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:30,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {40086#(<= main_~k~0 1)} assume true; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:30,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {40086#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:30,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {40086#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:30,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {40086#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:30,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {40087#(<= main_~k~0 2)} assume true; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:30,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {40087#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:30,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {40087#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:30,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {40087#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:30,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {40088#(<= main_~k~0 3)} assume true; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:30,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {40088#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:30,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {40088#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:30,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {40088#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:30,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {40089#(<= main_~k~0 4)} assume true; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:30,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {40089#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:30,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {40089#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:30,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {40089#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {40090#(<= main_~k~0 5)} assume true; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {40090#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {40090#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {40090#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {40091#(<= main_~k~0 6)} assume true; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {40091#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {40091#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {40091#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {40092#(<= main_~k~0 7)} assume true; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {40092#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {40092#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {40092#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {40093#(<= main_~k~0 8)} assume true; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,007 INFO L273 TraceCheckUtils]: 41: Hoare triple {40093#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {40093#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,008 INFO L273 TraceCheckUtils]: 43: Hoare triple {40093#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,008 INFO L273 TraceCheckUtils]: 44: Hoare triple {40094#(<= main_~k~0 9)} assume true; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,009 INFO L273 TraceCheckUtils]: 45: Hoare triple {40094#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,009 INFO L273 TraceCheckUtils]: 46: Hoare triple {40094#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,010 INFO L273 TraceCheckUtils]: 47: Hoare triple {40094#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,011 INFO L273 TraceCheckUtils]: 48: Hoare triple {40095#(<= main_~k~0 10)} assume true; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,011 INFO L273 TraceCheckUtils]: 49: Hoare triple {40095#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {40095#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {40095#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,013 INFO L273 TraceCheckUtils]: 52: Hoare triple {40096#(<= main_~k~0 11)} assume true; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,013 INFO L273 TraceCheckUtils]: 53: Hoare triple {40096#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {40096#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {40096#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,015 INFO L273 TraceCheckUtils]: 56: Hoare triple {40097#(<= main_~k~0 12)} assume true; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,015 INFO L273 TraceCheckUtils]: 57: Hoare triple {40097#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,016 INFO L273 TraceCheckUtils]: 58: Hoare triple {40097#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {40097#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {40098#(<= main_~k~0 13)} assume true; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,018 INFO L273 TraceCheckUtils]: 61: Hoare triple {40098#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {40098#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {40098#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {40099#(<= main_~k~0 14)} assume true; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {40099#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,020 INFO L273 TraceCheckUtils]: 66: Hoare triple {40099#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {40099#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {40100#(<= main_~k~0 15)} assume true; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {40100#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {40100#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,023 INFO L273 TraceCheckUtils]: 71: Hoare triple {40100#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,024 INFO L273 TraceCheckUtils]: 72: Hoare triple {40101#(<= main_~k~0 16)} assume true; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,024 INFO L273 TraceCheckUtils]: 73: Hoare triple {40101#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,025 INFO L273 TraceCheckUtils]: 74: Hoare triple {40101#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,025 INFO L273 TraceCheckUtils]: 75: Hoare triple {40101#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,026 INFO L273 TraceCheckUtils]: 76: Hoare triple {40102#(<= main_~k~0 17)} assume true; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,026 INFO L273 TraceCheckUtils]: 77: Hoare triple {40102#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,027 INFO L273 TraceCheckUtils]: 78: Hoare triple {40102#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {40102#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,028 INFO L273 TraceCheckUtils]: 80: Hoare triple {40103#(<= main_~k~0 18)} assume true; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {40103#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,029 INFO L273 TraceCheckUtils]: 82: Hoare triple {40103#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {40103#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,030 INFO L273 TraceCheckUtils]: 84: Hoare triple {40104#(<= main_~k~0 19)} assume true; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {40104#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,031 INFO L273 TraceCheckUtils]: 86: Hoare triple {40104#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,032 INFO L273 TraceCheckUtils]: 87: Hoare triple {40104#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,032 INFO L273 TraceCheckUtils]: 88: Hoare triple {40105#(<= main_~k~0 20)} assume true; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,033 INFO L273 TraceCheckUtils]: 89: Hoare triple {40105#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,033 INFO L273 TraceCheckUtils]: 90: Hoare triple {40105#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,034 INFO L273 TraceCheckUtils]: 91: Hoare triple {40105#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,035 INFO L273 TraceCheckUtils]: 92: Hoare triple {40106#(<= main_~k~0 21)} assume true; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,035 INFO L273 TraceCheckUtils]: 93: Hoare triple {40106#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,036 INFO L273 TraceCheckUtils]: 94: Hoare triple {40106#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,036 INFO L273 TraceCheckUtils]: 95: Hoare triple {40106#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,037 INFO L273 TraceCheckUtils]: 96: Hoare triple {40107#(<= main_~k~0 22)} assume true; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,037 INFO L273 TraceCheckUtils]: 97: Hoare triple {40107#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,038 INFO L273 TraceCheckUtils]: 98: Hoare triple {40107#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,039 INFO L273 TraceCheckUtils]: 99: Hoare triple {40107#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,039 INFO L273 TraceCheckUtils]: 100: Hoare triple {40108#(<= main_~k~0 23)} assume true; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,039 INFO L273 TraceCheckUtils]: 101: Hoare triple {40108#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {40108#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,041 INFO L273 TraceCheckUtils]: 103: Hoare triple {40108#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,041 INFO L273 TraceCheckUtils]: 104: Hoare triple {40109#(<= main_~k~0 24)} assume true; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,042 INFO L273 TraceCheckUtils]: 105: Hoare triple {40109#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,042 INFO L273 TraceCheckUtils]: 106: Hoare triple {40109#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,043 INFO L273 TraceCheckUtils]: 107: Hoare triple {40109#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,043 INFO L273 TraceCheckUtils]: 108: Hoare triple {40110#(<= main_~k~0 25)} assume true; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,044 INFO L273 TraceCheckUtils]: 109: Hoare triple {40110#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {40110#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {40110#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,046 INFO L273 TraceCheckUtils]: 112: Hoare triple {40111#(<= main_~k~0 26)} assume true; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {40111#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,047 INFO L273 TraceCheckUtils]: 114: Hoare triple {40111#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,047 INFO L273 TraceCheckUtils]: 115: Hoare triple {40111#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,048 INFO L273 TraceCheckUtils]: 116: Hoare triple {40112#(<= main_~k~0 27)} assume true; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,048 INFO L273 TraceCheckUtils]: 117: Hoare triple {40112#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,049 INFO L273 TraceCheckUtils]: 118: Hoare triple {40112#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,049 INFO L273 TraceCheckUtils]: 119: Hoare triple {40112#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,050 INFO L273 TraceCheckUtils]: 120: Hoare triple {40113#(<= main_~k~0 28)} assume true; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,050 INFO L273 TraceCheckUtils]: 121: Hoare triple {40113#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,051 INFO L273 TraceCheckUtils]: 122: Hoare triple {40113#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,052 INFO L273 TraceCheckUtils]: 123: Hoare triple {40113#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,052 INFO L273 TraceCheckUtils]: 124: Hoare triple {40114#(<= main_~k~0 29)} assume true; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,053 INFO L273 TraceCheckUtils]: 125: Hoare triple {40114#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,053 INFO L273 TraceCheckUtils]: 126: Hoare triple {40114#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {40114#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,054 INFO L273 TraceCheckUtils]: 128: Hoare triple {40115#(<= main_~k~0 30)} assume true; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,055 INFO L273 TraceCheckUtils]: 129: Hoare triple {40115#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,055 INFO L273 TraceCheckUtils]: 130: Hoare triple {40115#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,056 INFO L273 TraceCheckUtils]: 131: Hoare triple {40115#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,056 INFO L273 TraceCheckUtils]: 132: Hoare triple {40116#(<= main_~k~0 31)} assume true; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,057 INFO L273 TraceCheckUtils]: 133: Hoare triple {40116#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,057 INFO L273 TraceCheckUtils]: 134: Hoare triple {40116#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,058 INFO L273 TraceCheckUtils]: 135: Hoare triple {40116#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,058 INFO L273 TraceCheckUtils]: 136: Hoare triple {40117#(<= main_~k~0 32)} assume true; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,059 INFO L273 TraceCheckUtils]: 137: Hoare triple {40117#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,059 INFO L273 TraceCheckUtils]: 138: Hoare triple {40117#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,060 INFO L273 TraceCheckUtils]: 139: Hoare triple {40117#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,060 INFO L273 TraceCheckUtils]: 140: Hoare triple {40118#(<= main_~k~0 33)} assume true; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,061 INFO L273 TraceCheckUtils]: 141: Hoare triple {40118#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,061 INFO L273 TraceCheckUtils]: 142: Hoare triple {40118#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,062 INFO L273 TraceCheckUtils]: 143: Hoare triple {40118#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,063 INFO L273 TraceCheckUtils]: 144: Hoare triple {40119#(<= main_~k~0 34)} assume true; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,063 INFO L273 TraceCheckUtils]: 145: Hoare triple {40119#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,063 INFO L273 TraceCheckUtils]: 146: Hoare triple {40119#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,064 INFO L273 TraceCheckUtils]: 147: Hoare triple {40119#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,065 INFO L273 TraceCheckUtils]: 148: Hoare triple {40120#(<= main_~k~0 35)} assume true; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,065 INFO L273 TraceCheckUtils]: 149: Hoare triple {40120#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,065 INFO L273 TraceCheckUtils]: 150: Hoare triple {40120#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,066 INFO L273 TraceCheckUtils]: 151: Hoare triple {40120#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,067 INFO L273 TraceCheckUtils]: 152: Hoare triple {40121#(<= main_~k~0 36)} assume true; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,067 INFO L273 TraceCheckUtils]: 153: Hoare triple {40121#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,068 INFO L273 TraceCheckUtils]: 154: Hoare triple {40121#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,068 INFO L273 TraceCheckUtils]: 155: Hoare triple {40121#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,069 INFO L273 TraceCheckUtils]: 156: Hoare triple {40122#(<= main_~k~0 37)} assume true; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,069 INFO L273 TraceCheckUtils]: 157: Hoare triple {40122#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,070 INFO L273 TraceCheckUtils]: 158: Hoare triple {40122#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,070 INFO L273 TraceCheckUtils]: 159: Hoare triple {40122#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {40123#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:31,071 INFO L273 TraceCheckUtils]: 160: Hoare triple {40123#(<= main_~k~0 38)} assume true; {40123#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:31,071 INFO L273 TraceCheckUtils]: 161: Hoare triple {40123#(<= main_~k~0 38)} assume !(~k~0 < 100000); {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 162: Hoare triple {40083#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 163: Hoare triple {40083#false} ~x~0 := 0; {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 164: Hoare triple {40083#false} assume true; {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 165: Hoare triple {40083#false} assume !(~x~0 < ~i~0); {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 166: Hoare triple {40083#false} ~x~0 := 1 + ~i~0; {40083#false} is VALID [2018-11-18 22:45:31,072 INFO L273 TraceCheckUtils]: 167: Hoare triple {40083#false} assume true; {40083#false} is VALID [2018-11-18 22:45:31,073 INFO L273 TraceCheckUtils]: 168: Hoare triple {40083#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40083#false} is VALID [2018-11-18 22:45:31,073 INFO L256 TraceCheckUtils]: 169: Hoare triple {40083#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40083#false} is VALID [2018-11-18 22:45:31,073 INFO L273 TraceCheckUtils]: 170: Hoare triple {40083#false} ~cond := #in~cond; {40083#false} is VALID [2018-11-18 22:45:31,073 INFO L273 TraceCheckUtils]: 171: Hoare triple {40083#false} assume 0 == ~cond; {40083#false} is VALID [2018-11-18 22:45:31,073 INFO L273 TraceCheckUtils]: 172: Hoare triple {40083#false} assume !false; {40083#false} is VALID [2018-11-18 22:45:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:31,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:31,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:45:31,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-18 22:45:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:31,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:31,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {40082#true} call ULTIMATE.init(); {40082#true} is VALID [2018-11-18 22:45:31,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {40082#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40082#true} is VALID [2018-11-18 22:45:31,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {40082#true} assume true; {40082#true} is VALID [2018-11-18 22:45:31,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40082#true} {40082#true} #137#return; {40082#true} is VALID [2018-11-18 22:45:31,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {40082#true} call #t~ret15 := main(); {40082#true} is VALID [2018-11-18 22:45:31,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {40082#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40142#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:31,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {40142#(<= main_~i~0 0)} assume true; {40142#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:31,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {40142#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {40149#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:31,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {40149#(<= main_~k~0 0)} assume true; {40149#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:31,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {40149#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40149#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:31,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {40149#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40149#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:31,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {40149#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:31,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {40086#(<= main_~k~0 1)} assume true; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:31,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {40086#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:31,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {40086#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40086#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:31,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {40086#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:31,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {40087#(<= main_~k~0 2)} assume true; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:31,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {40087#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:31,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {40087#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40087#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:31,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {40087#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:31,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {40088#(<= main_~k~0 3)} assume true; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:31,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {40088#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:31,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {40088#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40088#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:31,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {40088#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:31,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {40089#(<= main_~k~0 4)} assume true; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:31,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {40089#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:31,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {40089#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40089#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:31,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {40089#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {40090#(<= main_~k~0 5)} assume true; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {40090#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {40090#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40090#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:31,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {40090#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {40091#(<= main_~k~0 6)} assume true; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {40091#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {40091#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40091#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:31,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {40091#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {40092#(<= main_~k~0 7)} assume true; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {40092#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {40092#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40092#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:31,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {40092#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {40093#(<= main_~k~0 8)} assume true; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {40093#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {40093#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40093#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:31,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {40093#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {40094#(<= main_~k~0 9)} assume true; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {40094#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {40094#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40094#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:31,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {40094#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {40095#(<= main_~k~0 10)} assume true; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {40095#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {40095#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40095#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:31,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {40095#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {40096#(<= main_~k~0 11)} assume true; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,765 INFO L273 TraceCheckUtils]: 53: Hoare triple {40096#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {40096#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40096#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:31,766 INFO L273 TraceCheckUtils]: 55: Hoare triple {40096#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,767 INFO L273 TraceCheckUtils]: 56: Hoare triple {40097#(<= main_~k~0 12)} assume true; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,767 INFO L273 TraceCheckUtils]: 57: Hoare triple {40097#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,768 INFO L273 TraceCheckUtils]: 58: Hoare triple {40097#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40097#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:31,768 INFO L273 TraceCheckUtils]: 59: Hoare triple {40097#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,769 INFO L273 TraceCheckUtils]: 60: Hoare triple {40098#(<= main_~k~0 13)} assume true; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,769 INFO L273 TraceCheckUtils]: 61: Hoare triple {40098#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {40098#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40098#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:31,770 INFO L273 TraceCheckUtils]: 63: Hoare triple {40098#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {40099#(<= main_~k~0 14)} assume true; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {40099#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {40099#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40099#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:31,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {40099#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {40100#(<= main_~k~0 15)} assume true; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {40100#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,774 INFO L273 TraceCheckUtils]: 70: Hoare triple {40100#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40100#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:31,775 INFO L273 TraceCheckUtils]: 71: Hoare triple {40100#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,775 INFO L273 TraceCheckUtils]: 72: Hoare triple {40101#(<= main_~k~0 16)} assume true; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,775 INFO L273 TraceCheckUtils]: 73: Hoare triple {40101#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {40101#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40101#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:31,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {40101#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {40102#(<= main_~k~0 17)} assume true; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,778 INFO L273 TraceCheckUtils]: 77: Hoare triple {40102#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,778 INFO L273 TraceCheckUtils]: 78: Hoare triple {40102#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40102#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:31,779 INFO L273 TraceCheckUtils]: 79: Hoare triple {40102#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,779 INFO L273 TraceCheckUtils]: 80: Hoare triple {40103#(<= main_~k~0 18)} assume true; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,780 INFO L273 TraceCheckUtils]: 81: Hoare triple {40103#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {40103#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40103#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:31,781 INFO L273 TraceCheckUtils]: 83: Hoare triple {40103#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {40104#(<= main_~k~0 19)} assume true; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,782 INFO L273 TraceCheckUtils]: 85: Hoare triple {40104#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,782 INFO L273 TraceCheckUtils]: 86: Hoare triple {40104#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40104#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:31,783 INFO L273 TraceCheckUtils]: 87: Hoare triple {40104#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,783 INFO L273 TraceCheckUtils]: 88: Hoare triple {40105#(<= main_~k~0 20)} assume true; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,784 INFO L273 TraceCheckUtils]: 89: Hoare triple {40105#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,784 INFO L273 TraceCheckUtils]: 90: Hoare triple {40105#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40105#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:31,785 INFO L273 TraceCheckUtils]: 91: Hoare triple {40105#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,785 INFO L273 TraceCheckUtils]: 92: Hoare triple {40106#(<= main_~k~0 21)} assume true; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,786 INFO L273 TraceCheckUtils]: 93: Hoare triple {40106#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,786 INFO L273 TraceCheckUtils]: 94: Hoare triple {40106#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40106#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:31,787 INFO L273 TraceCheckUtils]: 95: Hoare triple {40106#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,787 INFO L273 TraceCheckUtils]: 96: Hoare triple {40107#(<= main_~k~0 22)} assume true; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,788 INFO L273 TraceCheckUtils]: 97: Hoare triple {40107#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,788 INFO L273 TraceCheckUtils]: 98: Hoare triple {40107#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40107#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:31,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {40107#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,789 INFO L273 TraceCheckUtils]: 100: Hoare triple {40108#(<= main_~k~0 23)} assume true; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {40108#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {40108#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40108#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:31,791 INFO L273 TraceCheckUtils]: 103: Hoare triple {40108#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,791 INFO L273 TraceCheckUtils]: 104: Hoare triple {40109#(<= main_~k~0 24)} assume true; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,792 INFO L273 TraceCheckUtils]: 105: Hoare triple {40109#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,792 INFO L273 TraceCheckUtils]: 106: Hoare triple {40109#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40109#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:31,793 INFO L273 TraceCheckUtils]: 107: Hoare triple {40109#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,794 INFO L273 TraceCheckUtils]: 108: Hoare triple {40110#(<= main_~k~0 25)} assume true; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,794 INFO L273 TraceCheckUtils]: 109: Hoare triple {40110#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,794 INFO L273 TraceCheckUtils]: 110: Hoare triple {40110#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40110#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:31,795 INFO L273 TraceCheckUtils]: 111: Hoare triple {40110#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,796 INFO L273 TraceCheckUtils]: 112: Hoare triple {40111#(<= main_~k~0 26)} assume true; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,796 INFO L273 TraceCheckUtils]: 113: Hoare triple {40111#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,797 INFO L273 TraceCheckUtils]: 114: Hoare triple {40111#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40111#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:31,797 INFO L273 TraceCheckUtils]: 115: Hoare triple {40111#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,798 INFO L273 TraceCheckUtils]: 116: Hoare triple {40112#(<= main_~k~0 27)} assume true; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,798 INFO L273 TraceCheckUtils]: 117: Hoare triple {40112#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,799 INFO L273 TraceCheckUtils]: 118: Hoare triple {40112#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40112#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:31,799 INFO L273 TraceCheckUtils]: 119: Hoare triple {40112#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,800 INFO L273 TraceCheckUtils]: 120: Hoare triple {40113#(<= main_~k~0 28)} assume true; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,800 INFO L273 TraceCheckUtils]: 121: Hoare triple {40113#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,801 INFO L273 TraceCheckUtils]: 122: Hoare triple {40113#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40113#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:31,801 INFO L273 TraceCheckUtils]: 123: Hoare triple {40113#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,802 INFO L273 TraceCheckUtils]: 124: Hoare triple {40114#(<= main_~k~0 29)} assume true; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,802 INFO L273 TraceCheckUtils]: 125: Hoare triple {40114#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,803 INFO L273 TraceCheckUtils]: 126: Hoare triple {40114#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40114#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:31,804 INFO L273 TraceCheckUtils]: 127: Hoare triple {40114#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,804 INFO L273 TraceCheckUtils]: 128: Hoare triple {40115#(<= main_~k~0 30)} assume true; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,805 INFO L273 TraceCheckUtils]: 129: Hoare triple {40115#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,805 INFO L273 TraceCheckUtils]: 130: Hoare triple {40115#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40115#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:31,806 INFO L273 TraceCheckUtils]: 131: Hoare triple {40115#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,806 INFO L273 TraceCheckUtils]: 132: Hoare triple {40116#(<= main_~k~0 31)} assume true; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,807 INFO L273 TraceCheckUtils]: 133: Hoare triple {40116#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,807 INFO L273 TraceCheckUtils]: 134: Hoare triple {40116#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40116#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:31,808 INFO L273 TraceCheckUtils]: 135: Hoare triple {40116#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,808 INFO L273 TraceCheckUtils]: 136: Hoare triple {40117#(<= main_~k~0 32)} assume true; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,809 INFO L273 TraceCheckUtils]: 137: Hoare triple {40117#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,809 INFO L273 TraceCheckUtils]: 138: Hoare triple {40117#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40117#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:31,810 INFO L273 TraceCheckUtils]: 139: Hoare triple {40117#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,810 INFO L273 TraceCheckUtils]: 140: Hoare triple {40118#(<= main_~k~0 33)} assume true; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,811 INFO L273 TraceCheckUtils]: 141: Hoare triple {40118#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,811 INFO L273 TraceCheckUtils]: 142: Hoare triple {40118#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40118#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:31,812 INFO L273 TraceCheckUtils]: 143: Hoare triple {40118#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,812 INFO L273 TraceCheckUtils]: 144: Hoare triple {40119#(<= main_~k~0 34)} assume true; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,813 INFO L273 TraceCheckUtils]: 145: Hoare triple {40119#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,813 INFO L273 TraceCheckUtils]: 146: Hoare triple {40119#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40119#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:31,814 INFO L273 TraceCheckUtils]: 147: Hoare triple {40119#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,815 INFO L273 TraceCheckUtils]: 148: Hoare triple {40120#(<= main_~k~0 35)} assume true; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,815 INFO L273 TraceCheckUtils]: 149: Hoare triple {40120#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,816 INFO L273 TraceCheckUtils]: 150: Hoare triple {40120#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40120#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:31,816 INFO L273 TraceCheckUtils]: 151: Hoare triple {40120#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,817 INFO L273 TraceCheckUtils]: 152: Hoare triple {40121#(<= main_~k~0 36)} assume true; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,817 INFO L273 TraceCheckUtils]: 153: Hoare triple {40121#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,818 INFO L273 TraceCheckUtils]: 154: Hoare triple {40121#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40121#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:31,818 INFO L273 TraceCheckUtils]: 155: Hoare triple {40121#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,819 INFO L273 TraceCheckUtils]: 156: Hoare triple {40122#(<= main_~k~0 37)} assume true; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,819 INFO L273 TraceCheckUtils]: 157: Hoare triple {40122#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,820 INFO L273 TraceCheckUtils]: 158: Hoare triple {40122#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40122#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:31,821 INFO L273 TraceCheckUtils]: 159: Hoare triple {40122#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {40123#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:31,821 INFO L273 TraceCheckUtils]: 160: Hoare triple {40123#(<= main_~k~0 38)} assume true; {40123#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:31,822 INFO L273 TraceCheckUtils]: 161: Hoare triple {40123#(<= main_~k~0 38)} assume !(~k~0 < 100000); {40083#false} is VALID [2018-11-18 22:45:31,822 INFO L273 TraceCheckUtils]: 162: Hoare triple {40083#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40083#false} is VALID [2018-11-18 22:45:31,822 INFO L273 TraceCheckUtils]: 163: Hoare triple {40083#false} ~x~0 := 0; {40083#false} is VALID [2018-11-18 22:45:31,822 INFO L273 TraceCheckUtils]: 164: Hoare triple {40083#false} assume true; {40083#false} is VALID [2018-11-18 22:45:31,822 INFO L273 TraceCheckUtils]: 165: Hoare triple {40083#false} assume !(~x~0 < ~i~0); {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L273 TraceCheckUtils]: 166: Hoare triple {40083#false} ~x~0 := 1 + ~i~0; {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L273 TraceCheckUtils]: 167: Hoare triple {40083#false} assume true; {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L273 TraceCheckUtils]: 168: Hoare triple {40083#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L256 TraceCheckUtils]: 169: Hoare triple {40083#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L273 TraceCheckUtils]: 170: Hoare triple {40083#false} ~cond := #in~cond; {40083#false} is VALID [2018-11-18 22:45:31,823 INFO L273 TraceCheckUtils]: 171: Hoare triple {40083#false} assume 0 == ~cond; {40083#false} is VALID [2018-11-18 22:45:31,824 INFO L273 TraceCheckUtils]: 172: Hoare triple {40083#false} assume !false; {40083#false} is VALID [2018-11-18 22:45:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:31,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:31,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2018-11-18 22:45:31,865 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 173 [2018-11-18 22:45:31,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:31,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-18 22:45:32,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:32,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 22:45:32,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 22:45:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 22:45:32,020 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand 44 states. [2018-11-18 22:45:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:35,675 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2018-11-18 22:45:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 22:45:35,675 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 173 [2018-11-18 22:45:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:45:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 320 transitions. [2018-11-18 22:45:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:45:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 320 transitions. [2018-11-18 22:45:35,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 320 transitions. [2018-11-18 22:45:35,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:35,962 INFO L225 Difference]: With dead ends: 263 [2018-11-18 22:45:35,962 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 22:45:35,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-11-18 22:45:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 22:45:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 212. [2018-11-18 22:45:36,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:36,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand 212 states. [2018-11-18 22:45:36,222 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 212 states. [2018-11-18 22:45:36,222 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 212 states. [2018-11-18 22:45:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:36,226 INFO L93 Difference]: Finished difference Result 221 states and 275 transitions. [2018-11-18 22:45:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 275 transitions. [2018-11-18 22:45:36,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:36,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:36,226 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 221 states. [2018-11-18 22:45:36,226 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 221 states. [2018-11-18 22:45:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:36,229 INFO L93 Difference]: Finished difference Result 221 states and 275 transitions. [2018-11-18 22:45:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 275 transitions. [2018-11-18 22:45:36,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:36,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:36,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:36,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 22:45:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 263 transitions. [2018-11-18 22:45:36,233 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 263 transitions. Word has length 173 [2018-11-18 22:45:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:36,233 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 263 transitions. [2018-11-18 22:45:36,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 22:45:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 263 transitions. [2018-11-18 22:45:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 22:45:36,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:36,234 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:36,234 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:36,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -974389747, now seen corresponding path program 28 times [2018-11-18 22:45:36,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:36,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:37,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {41769#true} call ULTIMATE.init(); {41769#true} is VALID [2018-11-18 22:45:37,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {41769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41769#true} is VALID [2018-11-18 22:45:37,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {41769#true} assume true; {41769#true} is VALID [2018-11-18 22:45:37,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41769#true} {41769#true} #137#return; {41769#true} is VALID [2018-11-18 22:45:37,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {41769#true} call #t~ret15 := main(); {41769#true} is VALID [2018-11-18 22:45:37,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {41769#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {41771#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:37,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {41771#(= 0 main_~i~0)} assume true; {41771#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:37,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {41771#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {41772#(= main_~k~0 0)} is VALID [2018-11-18 22:45:37,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {41772#(= main_~k~0 0)} assume true; {41772#(= main_~k~0 0)} is VALID [2018-11-18 22:45:37,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {41772#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41772#(= main_~k~0 0)} is VALID [2018-11-18 22:45:37,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {41772#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41772#(= main_~k~0 0)} is VALID [2018-11-18 22:45:37,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {41772#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {41773#(<= main_~k~0 1)} assume true; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {41773#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,137 INFO L273 TraceCheckUtils]: 14: Hoare triple {41773#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {41773#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {41774#(<= main_~k~0 2)} assume true; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {41774#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {41774#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {41774#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {41775#(<= main_~k~0 3)} assume true; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {41775#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {41775#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {41775#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {41776#(<= main_~k~0 4)} assume true; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {41776#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {41776#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {41776#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {41777#(<= main_~k~0 5)} assume true; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,145 INFO L273 TraceCheckUtils]: 29: Hoare triple {41777#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {41777#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,147 INFO L273 TraceCheckUtils]: 31: Hoare triple {41777#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {41778#(<= main_~k~0 6)} assume true; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,148 INFO L273 TraceCheckUtils]: 33: Hoare triple {41778#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {41778#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,149 INFO L273 TraceCheckUtils]: 35: Hoare triple {41778#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,149 INFO L273 TraceCheckUtils]: 36: Hoare triple {41779#(<= main_~k~0 7)} assume true; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {41779#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {41779#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {41779#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {41780#(<= main_~k~0 8)} assume true; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {41780#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {41780#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {41780#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {41781#(<= main_~k~0 9)} assume true; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {41781#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {41781#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {41781#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {41782#(<= main_~k~0 10)} assume true; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {41782#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,157 INFO L273 TraceCheckUtils]: 50: Hoare triple {41782#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {41782#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {41783#(<= main_~k~0 11)} assume true; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {41783#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {41783#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {41783#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {41784#(<= main_~k~0 12)} assume true; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,161 INFO L273 TraceCheckUtils]: 57: Hoare triple {41784#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {41784#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {41784#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {41785#(<= main_~k~0 13)} assume true; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {41785#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {41785#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {41785#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {41786#(<= main_~k~0 14)} assume true; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,165 INFO L273 TraceCheckUtils]: 65: Hoare triple {41786#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,166 INFO L273 TraceCheckUtils]: 66: Hoare triple {41786#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,166 INFO L273 TraceCheckUtils]: 67: Hoare triple {41786#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,167 INFO L273 TraceCheckUtils]: 68: Hoare triple {41787#(<= main_~k~0 15)} assume true; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,167 INFO L273 TraceCheckUtils]: 69: Hoare triple {41787#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {41787#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,169 INFO L273 TraceCheckUtils]: 71: Hoare triple {41787#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,169 INFO L273 TraceCheckUtils]: 72: Hoare triple {41788#(<= main_~k~0 16)} assume true; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,170 INFO L273 TraceCheckUtils]: 73: Hoare triple {41788#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,170 INFO L273 TraceCheckUtils]: 74: Hoare triple {41788#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,171 INFO L273 TraceCheckUtils]: 75: Hoare triple {41788#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {41789#(<= main_~k~0 17)} assume true; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,172 INFO L273 TraceCheckUtils]: 77: Hoare triple {41789#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {41789#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,173 INFO L273 TraceCheckUtils]: 79: Hoare triple {41789#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,173 INFO L273 TraceCheckUtils]: 80: Hoare triple {41790#(<= main_~k~0 18)} assume true; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,174 INFO L273 TraceCheckUtils]: 81: Hoare triple {41790#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {41790#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,175 INFO L273 TraceCheckUtils]: 83: Hoare triple {41790#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,176 INFO L273 TraceCheckUtils]: 84: Hoare triple {41791#(<= main_~k~0 19)} assume true; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,176 INFO L273 TraceCheckUtils]: 85: Hoare triple {41791#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,177 INFO L273 TraceCheckUtils]: 86: Hoare triple {41791#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,177 INFO L273 TraceCheckUtils]: 87: Hoare triple {41791#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,178 INFO L273 TraceCheckUtils]: 88: Hoare triple {41792#(<= main_~k~0 20)} assume true; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,178 INFO L273 TraceCheckUtils]: 89: Hoare triple {41792#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {41792#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,179 INFO L273 TraceCheckUtils]: 91: Hoare triple {41792#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,180 INFO L273 TraceCheckUtils]: 92: Hoare triple {41793#(<= main_~k~0 21)} assume true; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,180 INFO L273 TraceCheckUtils]: 93: Hoare triple {41793#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,181 INFO L273 TraceCheckUtils]: 94: Hoare triple {41793#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,181 INFO L273 TraceCheckUtils]: 95: Hoare triple {41793#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,182 INFO L273 TraceCheckUtils]: 96: Hoare triple {41794#(<= main_~k~0 22)} assume true; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {41794#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,183 INFO L273 TraceCheckUtils]: 98: Hoare triple {41794#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,184 INFO L273 TraceCheckUtils]: 99: Hoare triple {41794#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,184 INFO L273 TraceCheckUtils]: 100: Hoare triple {41795#(<= main_~k~0 23)} assume true; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,185 INFO L273 TraceCheckUtils]: 101: Hoare triple {41795#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,185 INFO L273 TraceCheckUtils]: 102: Hoare triple {41795#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,186 INFO L273 TraceCheckUtils]: 103: Hoare triple {41795#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,186 INFO L273 TraceCheckUtils]: 104: Hoare triple {41796#(<= main_~k~0 24)} assume true; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,187 INFO L273 TraceCheckUtils]: 105: Hoare triple {41796#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,187 INFO L273 TraceCheckUtils]: 106: Hoare triple {41796#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,188 INFO L273 TraceCheckUtils]: 107: Hoare triple {41796#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,188 INFO L273 TraceCheckUtils]: 108: Hoare triple {41797#(<= main_~k~0 25)} assume true; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,189 INFO L273 TraceCheckUtils]: 109: Hoare triple {41797#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,189 INFO L273 TraceCheckUtils]: 110: Hoare triple {41797#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,190 INFO L273 TraceCheckUtils]: 111: Hoare triple {41797#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,191 INFO L273 TraceCheckUtils]: 112: Hoare triple {41798#(<= main_~k~0 26)} assume true; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,191 INFO L273 TraceCheckUtils]: 113: Hoare triple {41798#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,192 INFO L273 TraceCheckUtils]: 114: Hoare triple {41798#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,192 INFO L273 TraceCheckUtils]: 115: Hoare triple {41798#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,193 INFO L273 TraceCheckUtils]: 116: Hoare triple {41799#(<= main_~k~0 27)} assume true; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,193 INFO L273 TraceCheckUtils]: 117: Hoare triple {41799#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,194 INFO L273 TraceCheckUtils]: 118: Hoare triple {41799#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,194 INFO L273 TraceCheckUtils]: 119: Hoare triple {41799#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {41800#(<= main_~k~0 28)} assume true; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,214 INFO L273 TraceCheckUtils]: 121: Hoare triple {41800#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,215 INFO L273 TraceCheckUtils]: 122: Hoare triple {41800#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,216 INFO L273 TraceCheckUtils]: 123: Hoare triple {41800#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,217 INFO L273 TraceCheckUtils]: 124: Hoare triple {41801#(<= main_~k~0 29)} assume true; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,217 INFO L273 TraceCheckUtils]: 125: Hoare triple {41801#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,217 INFO L273 TraceCheckUtils]: 126: Hoare triple {41801#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,218 INFO L273 TraceCheckUtils]: 127: Hoare triple {41801#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,218 INFO L273 TraceCheckUtils]: 128: Hoare triple {41802#(<= main_~k~0 30)} assume true; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,218 INFO L273 TraceCheckUtils]: 129: Hoare triple {41802#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,219 INFO L273 TraceCheckUtils]: 130: Hoare triple {41802#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,219 INFO L273 TraceCheckUtils]: 131: Hoare triple {41802#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {41803#(<= main_~k~0 31)} assume true; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,220 INFO L273 TraceCheckUtils]: 133: Hoare triple {41803#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,220 INFO L273 TraceCheckUtils]: 134: Hoare triple {41803#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {41803#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,221 INFO L273 TraceCheckUtils]: 136: Hoare triple {41804#(<= main_~k~0 32)} assume true; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,222 INFO L273 TraceCheckUtils]: 137: Hoare triple {41804#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,222 INFO L273 TraceCheckUtils]: 138: Hoare triple {41804#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,223 INFO L273 TraceCheckUtils]: 139: Hoare triple {41804#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,223 INFO L273 TraceCheckUtils]: 140: Hoare triple {41805#(<= main_~k~0 33)} assume true; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,224 INFO L273 TraceCheckUtils]: 141: Hoare triple {41805#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,224 INFO L273 TraceCheckUtils]: 142: Hoare triple {41805#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,225 INFO L273 TraceCheckUtils]: 143: Hoare triple {41805#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,225 INFO L273 TraceCheckUtils]: 144: Hoare triple {41806#(<= main_~k~0 34)} assume true; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,226 INFO L273 TraceCheckUtils]: 145: Hoare triple {41806#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,226 INFO L273 TraceCheckUtils]: 146: Hoare triple {41806#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,227 INFO L273 TraceCheckUtils]: 147: Hoare triple {41806#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,227 INFO L273 TraceCheckUtils]: 148: Hoare triple {41807#(<= main_~k~0 35)} assume true; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,228 INFO L273 TraceCheckUtils]: 149: Hoare triple {41807#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,228 INFO L273 TraceCheckUtils]: 150: Hoare triple {41807#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,229 INFO L273 TraceCheckUtils]: 151: Hoare triple {41807#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,230 INFO L273 TraceCheckUtils]: 152: Hoare triple {41808#(<= main_~k~0 36)} assume true; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,230 INFO L273 TraceCheckUtils]: 153: Hoare triple {41808#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,230 INFO L273 TraceCheckUtils]: 154: Hoare triple {41808#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,231 INFO L273 TraceCheckUtils]: 155: Hoare triple {41808#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,232 INFO L273 TraceCheckUtils]: 156: Hoare triple {41809#(<= main_~k~0 37)} assume true; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,232 INFO L273 TraceCheckUtils]: 157: Hoare triple {41809#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,233 INFO L273 TraceCheckUtils]: 158: Hoare triple {41809#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,233 INFO L273 TraceCheckUtils]: 159: Hoare triple {41809#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,234 INFO L273 TraceCheckUtils]: 160: Hoare triple {41810#(<= main_~k~0 38)} assume true; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,234 INFO L273 TraceCheckUtils]: 161: Hoare triple {41810#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,235 INFO L273 TraceCheckUtils]: 162: Hoare triple {41810#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,235 INFO L273 TraceCheckUtils]: 163: Hoare triple {41810#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {41811#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:37,236 INFO L273 TraceCheckUtils]: 164: Hoare triple {41811#(<= main_~k~0 39)} assume true; {41811#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:37,236 INFO L273 TraceCheckUtils]: 165: Hoare triple {41811#(<= main_~k~0 39)} assume !(~k~0 < 100000); {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 166: Hoare triple {41770#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 167: Hoare triple {41770#false} ~x~0 := 0; {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 168: Hoare triple {41770#false} assume true; {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 169: Hoare triple {41770#false} assume !(~x~0 < ~i~0); {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 170: Hoare triple {41770#false} ~x~0 := 1 + ~i~0; {41770#false} is VALID [2018-11-18 22:45:37,237 INFO L273 TraceCheckUtils]: 171: Hoare triple {41770#false} assume true; {41770#false} is VALID [2018-11-18 22:45:37,238 INFO L273 TraceCheckUtils]: 172: Hoare triple {41770#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41770#false} is VALID [2018-11-18 22:45:37,238 INFO L256 TraceCheckUtils]: 173: Hoare triple {41770#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41770#false} is VALID [2018-11-18 22:45:37,238 INFO L273 TraceCheckUtils]: 174: Hoare triple {41770#false} ~cond := #in~cond; {41770#false} is VALID [2018-11-18 22:45:37,238 INFO L273 TraceCheckUtils]: 175: Hoare triple {41770#false} assume 0 == ~cond; {41770#false} is VALID [2018-11-18 22:45:37,238 INFO L273 TraceCheckUtils]: 176: Hoare triple {41770#false} assume !false; {41770#false} is VALID [2018-11-18 22:45:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:37,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:37,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:37,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:45:37,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:45:37,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:37,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:37,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {41769#true} call ULTIMATE.init(); {41769#true} is VALID [2018-11-18 22:45:37,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {41769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41769#true} is VALID [2018-11-18 22:45:37,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {41769#true} assume true; {41769#true} is VALID [2018-11-18 22:45:37,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41769#true} {41769#true} #137#return; {41769#true} is VALID [2018-11-18 22:45:37,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {41769#true} call #t~ret15 := main(); {41769#true} is VALID [2018-11-18 22:45:37,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {41769#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {41830#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:37,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {41830#(<= main_~i~0 0)} assume true; {41830#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:37,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {41830#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {41837#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:37,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {41837#(<= main_~k~0 0)} assume true; {41837#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:37,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {41837#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41837#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:37,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {41837#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41837#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:37,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {41837#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {41773#(<= main_~k~0 1)} assume true; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {41773#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {41773#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {41773#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:37,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {41773#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {41774#(<= main_~k~0 2)} assume true; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {41774#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {41774#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41774#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:37,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {41774#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {41775#(<= main_~k~0 3)} assume true; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {41775#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {41775#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41775#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:37,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {41775#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {41776#(<= main_~k~0 4)} assume true; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {41776#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {41776#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41776#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:37,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {41776#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {41777#(<= main_~k~0 5)} assume true; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {41777#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {41777#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41777#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:37,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {41777#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {41778#(<= main_~k~0 6)} assume true; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {41778#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {41778#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41778#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:37,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {41778#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {41779#(<= main_~k~0 7)} assume true; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {41779#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {41779#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41779#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:37,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {41779#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {41780#(<= main_~k~0 8)} assume true; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {41780#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {41780#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41780#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:37,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {41780#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {41781#(<= main_~k~0 9)} assume true; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {41781#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {41781#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41781#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:37,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {41781#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {41782#(<= main_~k~0 10)} assume true; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {41782#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,722 INFO L273 TraceCheckUtils]: 50: Hoare triple {41782#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41782#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:37,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {41782#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {41783#(<= main_~k~0 11)} assume true; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {41783#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,724 INFO L273 TraceCheckUtils]: 54: Hoare triple {41783#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41783#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:37,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {41783#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {41784#(<= main_~k~0 12)} assume true; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,725 INFO L273 TraceCheckUtils]: 57: Hoare triple {41784#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,726 INFO L273 TraceCheckUtils]: 58: Hoare triple {41784#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41784#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:37,726 INFO L273 TraceCheckUtils]: 59: Hoare triple {41784#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {41785#(<= main_~k~0 13)} assume true; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {41785#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,728 INFO L273 TraceCheckUtils]: 62: Hoare triple {41785#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41785#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:37,729 INFO L273 TraceCheckUtils]: 63: Hoare triple {41785#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,729 INFO L273 TraceCheckUtils]: 64: Hoare triple {41786#(<= main_~k~0 14)} assume true; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,730 INFO L273 TraceCheckUtils]: 65: Hoare triple {41786#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,730 INFO L273 TraceCheckUtils]: 66: Hoare triple {41786#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41786#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:37,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {41786#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {41787#(<= main_~k~0 15)} assume true; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,732 INFO L273 TraceCheckUtils]: 69: Hoare triple {41787#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,732 INFO L273 TraceCheckUtils]: 70: Hoare triple {41787#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41787#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:37,733 INFO L273 TraceCheckUtils]: 71: Hoare triple {41787#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,733 INFO L273 TraceCheckUtils]: 72: Hoare triple {41788#(<= main_~k~0 16)} assume true; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,734 INFO L273 TraceCheckUtils]: 73: Hoare triple {41788#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,734 INFO L273 TraceCheckUtils]: 74: Hoare triple {41788#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41788#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:37,735 INFO L273 TraceCheckUtils]: 75: Hoare triple {41788#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {41789#(<= main_~k~0 17)} assume true; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,736 INFO L273 TraceCheckUtils]: 77: Hoare triple {41789#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,736 INFO L273 TraceCheckUtils]: 78: Hoare triple {41789#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41789#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:37,737 INFO L273 TraceCheckUtils]: 79: Hoare triple {41789#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,738 INFO L273 TraceCheckUtils]: 80: Hoare triple {41790#(<= main_~k~0 18)} assume true; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,738 INFO L273 TraceCheckUtils]: 81: Hoare triple {41790#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,739 INFO L273 TraceCheckUtils]: 82: Hoare triple {41790#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41790#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:37,739 INFO L273 TraceCheckUtils]: 83: Hoare triple {41790#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,740 INFO L273 TraceCheckUtils]: 84: Hoare triple {41791#(<= main_~k~0 19)} assume true; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,740 INFO L273 TraceCheckUtils]: 85: Hoare triple {41791#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,741 INFO L273 TraceCheckUtils]: 86: Hoare triple {41791#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41791#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:37,741 INFO L273 TraceCheckUtils]: 87: Hoare triple {41791#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,742 INFO L273 TraceCheckUtils]: 88: Hoare triple {41792#(<= main_~k~0 20)} assume true; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,742 INFO L273 TraceCheckUtils]: 89: Hoare triple {41792#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,743 INFO L273 TraceCheckUtils]: 90: Hoare triple {41792#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41792#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:37,744 INFO L273 TraceCheckUtils]: 91: Hoare triple {41792#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,744 INFO L273 TraceCheckUtils]: 92: Hoare triple {41793#(<= main_~k~0 21)} assume true; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,745 INFO L273 TraceCheckUtils]: 93: Hoare triple {41793#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,745 INFO L273 TraceCheckUtils]: 94: Hoare triple {41793#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41793#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:37,746 INFO L273 TraceCheckUtils]: 95: Hoare triple {41793#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,746 INFO L273 TraceCheckUtils]: 96: Hoare triple {41794#(<= main_~k~0 22)} assume true; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,747 INFO L273 TraceCheckUtils]: 97: Hoare triple {41794#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {41794#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41794#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:37,748 INFO L273 TraceCheckUtils]: 99: Hoare triple {41794#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,748 INFO L273 TraceCheckUtils]: 100: Hoare triple {41795#(<= main_~k~0 23)} assume true; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,749 INFO L273 TraceCheckUtils]: 101: Hoare triple {41795#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,749 INFO L273 TraceCheckUtils]: 102: Hoare triple {41795#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41795#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:37,750 INFO L273 TraceCheckUtils]: 103: Hoare triple {41795#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,750 INFO L273 TraceCheckUtils]: 104: Hoare triple {41796#(<= main_~k~0 24)} assume true; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,751 INFO L273 TraceCheckUtils]: 105: Hoare triple {41796#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,751 INFO L273 TraceCheckUtils]: 106: Hoare triple {41796#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41796#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:37,752 INFO L273 TraceCheckUtils]: 107: Hoare triple {41796#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,753 INFO L273 TraceCheckUtils]: 108: Hoare triple {41797#(<= main_~k~0 25)} assume true; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,753 INFO L273 TraceCheckUtils]: 109: Hoare triple {41797#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,754 INFO L273 TraceCheckUtils]: 110: Hoare triple {41797#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41797#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:37,754 INFO L273 TraceCheckUtils]: 111: Hoare triple {41797#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,755 INFO L273 TraceCheckUtils]: 112: Hoare triple {41798#(<= main_~k~0 26)} assume true; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,755 INFO L273 TraceCheckUtils]: 113: Hoare triple {41798#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,756 INFO L273 TraceCheckUtils]: 114: Hoare triple {41798#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41798#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:37,756 INFO L273 TraceCheckUtils]: 115: Hoare triple {41798#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,757 INFO L273 TraceCheckUtils]: 116: Hoare triple {41799#(<= main_~k~0 27)} assume true; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,757 INFO L273 TraceCheckUtils]: 117: Hoare triple {41799#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,758 INFO L273 TraceCheckUtils]: 118: Hoare triple {41799#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41799#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:37,758 INFO L273 TraceCheckUtils]: 119: Hoare triple {41799#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,759 INFO L273 TraceCheckUtils]: 120: Hoare triple {41800#(<= main_~k~0 28)} assume true; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,759 INFO L273 TraceCheckUtils]: 121: Hoare triple {41800#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,760 INFO L273 TraceCheckUtils]: 122: Hoare triple {41800#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41800#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:37,761 INFO L273 TraceCheckUtils]: 123: Hoare triple {41800#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,761 INFO L273 TraceCheckUtils]: 124: Hoare triple {41801#(<= main_~k~0 29)} assume true; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,762 INFO L273 TraceCheckUtils]: 125: Hoare triple {41801#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,762 INFO L273 TraceCheckUtils]: 126: Hoare triple {41801#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41801#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:37,763 INFO L273 TraceCheckUtils]: 127: Hoare triple {41801#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,763 INFO L273 TraceCheckUtils]: 128: Hoare triple {41802#(<= main_~k~0 30)} assume true; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,764 INFO L273 TraceCheckUtils]: 129: Hoare triple {41802#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,764 INFO L273 TraceCheckUtils]: 130: Hoare triple {41802#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41802#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:37,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {41802#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {41803#(<= main_~k~0 31)} assume true; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,766 INFO L273 TraceCheckUtils]: 133: Hoare triple {41803#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,766 INFO L273 TraceCheckUtils]: 134: Hoare triple {41803#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41803#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:37,767 INFO L273 TraceCheckUtils]: 135: Hoare triple {41803#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,767 INFO L273 TraceCheckUtils]: 136: Hoare triple {41804#(<= main_~k~0 32)} assume true; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,768 INFO L273 TraceCheckUtils]: 137: Hoare triple {41804#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,768 INFO L273 TraceCheckUtils]: 138: Hoare triple {41804#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41804#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:37,769 INFO L273 TraceCheckUtils]: 139: Hoare triple {41804#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,770 INFO L273 TraceCheckUtils]: 140: Hoare triple {41805#(<= main_~k~0 33)} assume true; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,770 INFO L273 TraceCheckUtils]: 141: Hoare triple {41805#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,770 INFO L273 TraceCheckUtils]: 142: Hoare triple {41805#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41805#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:37,771 INFO L273 TraceCheckUtils]: 143: Hoare triple {41805#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,772 INFO L273 TraceCheckUtils]: 144: Hoare triple {41806#(<= main_~k~0 34)} assume true; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,772 INFO L273 TraceCheckUtils]: 145: Hoare triple {41806#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,773 INFO L273 TraceCheckUtils]: 146: Hoare triple {41806#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41806#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:37,773 INFO L273 TraceCheckUtils]: 147: Hoare triple {41806#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,774 INFO L273 TraceCheckUtils]: 148: Hoare triple {41807#(<= main_~k~0 35)} assume true; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,774 INFO L273 TraceCheckUtils]: 149: Hoare triple {41807#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,775 INFO L273 TraceCheckUtils]: 150: Hoare triple {41807#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41807#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:37,775 INFO L273 TraceCheckUtils]: 151: Hoare triple {41807#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,776 INFO L273 TraceCheckUtils]: 152: Hoare triple {41808#(<= main_~k~0 36)} assume true; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,776 INFO L273 TraceCheckUtils]: 153: Hoare triple {41808#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,777 INFO L273 TraceCheckUtils]: 154: Hoare triple {41808#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41808#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:37,778 INFO L273 TraceCheckUtils]: 155: Hoare triple {41808#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,778 INFO L273 TraceCheckUtils]: 156: Hoare triple {41809#(<= main_~k~0 37)} assume true; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,779 INFO L273 TraceCheckUtils]: 157: Hoare triple {41809#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,779 INFO L273 TraceCheckUtils]: 158: Hoare triple {41809#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41809#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:37,780 INFO L273 TraceCheckUtils]: 159: Hoare triple {41809#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,780 INFO L273 TraceCheckUtils]: 160: Hoare triple {41810#(<= main_~k~0 38)} assume true; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,781 INFO L273 TraceCheckUtils]: 161: Hoare triple {41810#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,781 INFO L273 TraceCheckUtils]: 162: Hoare triple {41810#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {41810#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:37,782 INFO L273 TraceCheckUtils]: 163: Hoare triple {41810#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {41811#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:37,782 INFO L273 TraceCheckUtils]: 164: Hoare triple {41811#(<= main_~k~0 39)} assume true; {41811#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:37,783 INFO L273 TraceCheckUtils]: 165: Hoare triple {41811#(<= main_~k~0 39)} assume !(~k~0 < 100000); {41770#false} is VALID [2018-11-18 22:45:37,783 INFO L273 TraceCheckUtils]: 166: Hoare triple {41770#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41770#false} is VALID [2018-11-18 22:45:37,783 INFO L273 TraceCheckUtils]: 167: Hoare triple {41770#false} ~x~0 := 0; {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L273 TraceCheckUtils]: 168: Hoare triple {41770#false} assume true; {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L273 TraceCheckUtils]: 169: Hoare triple {41770#false} assume !(~x~0 < ~i~0); {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L273 TraceCheckUtils]: 170: Hoare triple {41770#false} ~x~0 := 1 + ~i~0; {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L273 TraceCheckUtils]: 171: Hoare triple {41770#false} assume true; {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L273 TraceCheckUtils]: 172: Hoare triple {41770#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41770#false} is VALID [2018-11-18 22:45:37,784 INFO L256 TraceCheckUtils]: 173: Hoare triple {41770#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {41770#false} is VALID [2018-11-18 22:45:37,785 INFO L273 TraceCheckUtils]: 174: Hoare triple {41770#false} ~cond := #in~cond; {41770#false} is VALID [2018-11-18 22:45:37,785 INFO L273 TraceCheckUtils]: 175: Hoare triple {41770#false} assume 0 == ~cond; {41770#false} is VALID [2018-11-18 22:45:37,785 INFO L273 TraceCheckUtils]: 176: Hoare triple {41770#false} assume !false; {41770#false} is VALID [2018-11-18 22:45:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:37,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2018-11-18 22:45:37,825 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-11-18 22:45:37,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:37,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-18 22:45:38,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:38,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-18 22:45:38,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-18 22:45:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 22:45:38,007 INFO L87 Difference]: Start difference. First operand 212 states and 263 transitions. Second operand 45 states. [2018-11-18 22:45:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:40,812 INFO L93 Difference]: Finished difference Result 267 states and 334 transitions. [2018-11-18 22:45:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 22:45:40,812 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-11-18 22:45:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:45:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 325 transitions. [2018-11-18 22:45:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:45:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 325 transitions. [2018-11-18 22:45:40,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 325 transitions. [2018-11-18 22:45:41,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:41,118 INFO L225 Difference]: With dead ends: 267 [2018-11-18 22:45:41,118 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 22:45:41,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-11-18 22:45:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 22:45:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2018-11-18 22:45:41,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:41,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 216 states. [2018-11-18 22:45:41,245 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 216 states. [2018-11-18 22:45:41,245 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 216 states. [2018-11-18 22:45:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:41,249 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2018-11-18 22:45:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-11-18 22:45:41,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:41,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:41,250 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 225 states. [2018-11-18 22:45:41,250 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 225 states. [2018-11-18 22:45:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:41,254 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2018-11-18 22:45:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-11-18 22:45:41,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:41,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:41,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:41,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-18 22:45:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 268 transitions. [2018-11-18 22:45:41,257 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 268 transitions. Word has length 177 [2018-11-18 22:45:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:41,258 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 268 transitions. [2018-11-18 22:45:41,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-18 22:45:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 268 transitions. [2018-11-18 22:45:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 22:45:41,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:41,258 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:41,259 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:41,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash -916465437, now seen corresponding path program 29 times [2018-11-18 22:45:41,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:41,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:41,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:42,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {43489#true} call ULTIMATE.init(); {43489#true} is VALID [2018-11-18 22:45:42,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {43489#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43489#true} is VALID [2018-11-18 22:45:42,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {43489#true} assume true; {43489#true} is VALID [2018-11-18 22:45:42,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43489#true} {43489#true} #137#return; {43489#true} is VALID [2018-11-18 22:45:42,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {43489#true} call #t~ret15 := main(); {43489#true} is VALID [2018-11-18 22:45:42,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {43489#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {43491#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:42,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {43491#(= 0 main_~i~0)} assume true; {43491#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:42,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {43491#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {43492#(= main_~k~0 0)} is VALID [2018-11-18 22:45:42,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {43492#(= main_~k~0 0)} assume true; {43492#(= main_~k~0 0)} is VALID [2018-11-18 22:45:42,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {43492#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43492#(= main_~k~0 0)} is VALID [2018-11-18 22:45:42,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {43492#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43492#(= main_~k~0 0)} is VALID [2018-11-18 22:45:42,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {43492#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:42,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {43493#(<= main_~k~0 1)} assume true; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:42,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {43493#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:42,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {43493#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:42,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {43493#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:42,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {43494#(<= main_~k~0 2)} assume true; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:42,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {43494#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:42,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {43494#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:42,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {43494#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:42,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {43495#(<= main_~k~0 3)} assume true; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:42,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {43495#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:42,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {43495#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:42,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {43495#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:42,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {43496#(<= main_~k~0 4)} assume true; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:42,522 INFO L273 TraceCheckUtils]: 25: Hoare triple {43496#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:42,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {43496#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:42,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {43496#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:42,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {43497#(<= main_~k~0 5)} assume true; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:42,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {43497#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:42,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {43497#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:42,526 INFO L273 TraceCheckUtils]: 31: Hoare triple {43497#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:42,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {43498#(<= main_~k~0 6)} assume true; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:42,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {43498#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:42,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {43498#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:42,528 INFO L273 TraceCheckUtils]: 35: Hoare triple {43498#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:42,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {43499#(<= main_~k~0 7)} assume true; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:42,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {43499#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:42,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {43499#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:42,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {43499#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:42,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {43500#(<= main_~k~0 8)} assume true; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:42,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {43500#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:42,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {43500#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:42,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {43500#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:42,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {43501#(<= main_~k~0 9)} assume true; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:42,533 INFO L273 TraceCheckUtils]: 45: Hoare triple {43501#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:42,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {43501#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:42,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {43501#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:42,535 INFO L273 TraceCheckUtils]: 48: Hoare triple {43502#(<= main_~k~0 10)} assume true; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:42,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {43502#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:42,536 INFO L273 TraceCheckUtils]: 50: Hoare triple {43502#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:42,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {43502#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:42,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {43503#(<= main_~k~0 11)} assume true; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:42,538 INFO L273 TraceCheckUtils]: 53: Hoare triple {43503#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:42,538 INFO L273 TraceCheckUtils]: 54: Hoare triple {43503#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:42,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {43503#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:42,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {43504#(<= main_~k~0 12)} assume true; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:42,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {43504#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:42,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {43504#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:42,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {43504#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:42,541 INFO L273 TraceCheckUtils]: 60: Hoare triple {43505#(<= main_~k~0 13)} assume true; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:42,542 INFO L273 TraceCheckUtils]: 61: Hoare triple {43505#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:42,542 INFO L273 TraceCheckUtils]: 62: Hoare triple {43505#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:42,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {43505#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:42,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {43506#(<= main_~k~0 14)} assume true; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:42,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {43506#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:42,545 INFO L273 TraceCheckUtils]: 66: Hoare triple {43506#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:42,545 INFO L273 TraceCheckUtils]: 67: Hoare triple {43506#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:42,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {43507#(<= main_~k~0 15)} assume true; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:42,546 INFO L273 TraceCheckUtils]: 69: Hoare triple {43507#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:42,547 INFO L273 TraceCheckUtils]: 70: Hoare triple {43507#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:42,547 INFO L273 TraceCheckUtils]: 71: Hoare triple {43507#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:42,548 INFO L273 TraceCheckUtils]: 72: Hoare triple {43508#(<= main_~k~0 16)} assume true; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:42,548 INFO L273 TraceCheckUtils]: 73: Hoare triple {43508#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:42,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {43508#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:42,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {43508#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:42,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {43509#(<= main_~k~0 17)} assume true; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:42,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {43509#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:42,551 INFO L273 TraceCheckUtils]: 78: Hoare triple {43509#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:42,552 INFO L273 TraceCheckUtils]: 79: Hoare triple {43509#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:42,552 INFO L273 TraceCheckUtils]: 80: Hoare triple {43510#(<= main_~k~0 18)} assume true; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:42,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {43510#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:42,553 INFO L273 TraceCheckUtils]: 82: Hoare triple {43510#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:42,554 INFO L273 TraceCheckUtils]: 83: Hoare triple {43510#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:42,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {43511#(<= main_~k~0 19)} assume true; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:42,555 INFO L273 TraceCheckUtils]: 85: Hoare triple {43511#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:42,555 INFO L273 TraceCheckUtils]: 86: Hoare triple {43511#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:42,556 INFO L273 TraceCheckUtils]: 87: Hoare triple {43511#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:42,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {43512#(<= main_~k~0 20)} assume true; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:42,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {43512#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:42,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {43512#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:42,558 INFO L273 TraceCheckUtils]: 91: Hoare triple {43512#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:42,559 INFO L273 TraceCheckUtils]: 92: Hoare triple {43513#(<= main_~k~0 21)} assume true; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:42,559 INFO L273 TraceCheckUtils]: 93: Hoare triple {43513#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:42,560 INFO L273 TraceCheckUtils]: 94: Hoare triple {43513#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:42,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {43513#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:42,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {43514#(<= main_~k~0 22)} assume true; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:42,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {43514#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:42,562 INFO L273 TraceCheckUtils]: 98: Hoare triple {43514#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:42,563 INFO L273 TraceCheckUtils]: 99: Hoare triple {43514#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:42,563 INFO L273 TraceCheckUtils]: 100: Hoare triple {43515#(<= main_~k~0 23)} assume true; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:42,564 INFO L273 TraceCheckUtils]: 101: Hoare triple {43515#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:42,564 INFO L273 TraceCheckUtils]: 102: Hoare triple {43515#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:42,565 INFO L273 TraceCheckUtils]: 103: Hoare triple {43515#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:42,565 INFO L273 TraceCheckUtils]: 104: Hoare triple {43516#(<= main_~k~0 24)} assume true; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:42,566 INFO L273 TraceCheckUtils]: 105: Hoare triple {43516#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:42,566 INFO L273 TraceCheckUtils]: 106: Hoare triple {43516#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:42,567 INFO L273 TraceCheckUtils]: 107: Hoare triple {43516#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:42,567 INFO L273 TraceCheckUtils]: 108: Hoare triple {43517#(<= main_~k~0 25)} assume true; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:42,568 INFO L273 TraceCheckUtils]: 109: Hoare triple {43517#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:42,568 INFO L273 TraceCheckUtils]: 110: Hoare triple {43517#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:42,569 INFO L273 TraceCheckUtils]: 111: Hoare triple {43517#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:42,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {43518#(<= main_~k~0 26)} assume true; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:42,570 INFO L273 TraceCheckUtils]: 113: Hoare triple {43518#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:42,571 INFO L273 TraceCheckUtils]: 114: Hoare triple {43518#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:42,571 INFO L273 TraceCheckUtils]: 115: Hoare triple {43518#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:42,572 INFO L273 TraceCheckUtils]: 116: Hoare triple {43519#(<= main_~k~0 27)} assume true; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:42,572 INFO L273 TraceCheckUtils]: 117: Hoare triple {43519#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:42,573 INFO L273 TraceCheckUtils]: 118: Hoare triple {43519#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:42,574 INFO L273 TraceCheckUtils]: 119: Hoare triple {43519#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:42,574 INFO L273 TraceCheckUtils]: 120: Hoare triple {43520#(<= main_~k~0 28)} assume true; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:42,575 INFO L273 TraceCheckUtils]: 121: Hoare triple {43520#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:42,575 INFO L273 TraceCheckUtils]: 122: Hoare triple {43520#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:42,576 INFO L273 TraceCheckUtils]: 123: Hoare triple {43520#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:42,576 INFO L273 TraceCheckUtils]: 124: Hoare triple {43521#(<= main_~k~0 29)} assume true; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:42,577 INFO L273 TraceCheckUtils]: 125: Hoare triple {43521#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:42,577 INFO L273 TraceCheckUtils]: 126: Hoare triple {43521#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:42,578 INFO L273 TraceCheckUtils]: 127: Hoare triple {43521#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:42,578 INFO L273 TraceCheckUtils]: 128: Hoare triple {43522#(<= main_~k~0 30)} assume true; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:42,579 INFO L273 TraceCheckUtils]: 129: Hoare triple {43522#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:42,579 INFO L273 TraceCheckUtils]: 130: Hoare triple {43522#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:42,580 INFO L273 TraceCheckUtils]: 131: Hoare triple {43522#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:42,581 INFO L273 TraceCheckUtils]: 132: Hoare triple {43523#(<= main_~k~0 31)} assume true; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:42,581 INFO L273 TraceCheckUtils]: 133: Hoare triple {43523#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:42,582 INFO L273 TraceCheckUtils]: 134: Hoare triple {43523#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:42,582 INFO L273 TraceCheckUtils]: 135: Hoare triple {43523#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:42,583 INFO L273 TraceCheckUtils]: 136: Hoare triple {43524#(<= main_~k~0 32)} assume true; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:42,583 INFO L273 TraceCheckUtils]: 137: Hoare triple {43524#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:42,584 INFO L273 TraceCheckUtils]: 138: Hoare triple {43524#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:42,585 INFO L273 TraceCheckUtils]: 139: Hoare triple {43524#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:42,585 INFO L273 TraceCheckUtils]: 140: Hoare triple {43525#(<= main_~k~0 33)} assume true; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:42,586 INFO L273 TraceCheckUtils]: 141: Hoare triple {43525#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:42,586 INFO L273 TraceCheckUtils]: 142: Hoare triple {43525#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:42,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {43525#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:42,587 INFO L273 TraceCheckUtils]: 144: Hoare triple {43526#(<= main_~k~0 34)} assume true; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:42,588 INFO L273 TraceCheckUtils]: 145: Hoare triple {43526#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:42,588 INFO L273 TraceCheckUtils]: 146: Hoare triple {43526#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:42,589 INFO L273 TraceCheckUtils]: 147: Hoare triple {43526#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:42,589 INFO L273 TraceCheckUtils]: 148: Hoare triple {43527#(<= main_~k~0 35)} assume true; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:42,590 INFO L273 TraceCheckUtils]: 149: Hoare triple {43527#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:42,590 INFO L273 TraceCheckUtils]: 150: Hoare triple {43527#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:42,591 INFO L273 TraceCheckUtils]: 151: Hoare triple {43527#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:42,592 INFO L273 TraceCheckUtils]: 152: Hoare triple {43528#(<= main_~k~0 36)} assume true; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:42,592 INFO L273 TraceCheckUtils]: 153: Hoare triple {43528#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:42,593 INFO L273 TraceCheckUtils]: 154: Hoare triple {43528#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:42,593 INFO L273 TraceCheckUtils]: 155: Hoare triple {43528#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:42,594 INFO L273 TraceCheckUtils]: 156: Hoare triple {43529#(<= main_~k~0 37)} assume true; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:42,594 INFO L273 TraceCheckUtils]: 157: Hoare triple {43529#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:42,595 INFO L273 TraceCheckUtils]: 158: Hoare triple {43529#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:42,596 INFO L273 TraceCheckUtils]: 159: Hoare triple {43529#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:42,596 INFO L273 TraceCheckUtils]: 160: Hoare triple {43530#(<= main_~k~0 38)} assume true; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:42,597 INFO L273 TraceCheckUtils]: 161: Hoare triple {43530#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:42,597 INFO L273 TraceCheckUtils]: 162: Hoare triple {43530#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:42,598 INFO L273 TraceCheckUtils]: 163: Hoare triple {43530#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:42,598 INFO L273 TraceCheckUtils]: 164: Hoare triple {43531#(<= main_~k~0 39)} assume true; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:42,599 INFO L273 TraceCheckUtils]: 165: Hoare triple {43531#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:42,599 INFO L273 TraceCheckUtils]: 166: Hoare triple {43531#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:42,600 INFO L273 TraceCheckUtils]: 167: Hoare triple {43531#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {43532#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:42,600 INFO L273 TraceCheckUtils]: 168: Hoare triple {43532#(<= main_~k~0 40)} assume true; {43532#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:42,601 INFO L273 TraceCheckUtils]: 169: Hoare triple {43532#(<= main_~k~0 40)} assume !(~k~0 < 100000); {43490#false} is VALID [2018-11-18 22:45:42,601 INFO L273 TraceCheckUtils]: 170: Hoare triple {43490#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43490#false} is VALID [2018-11-18 22:45:42,601 INFO L273 TraceCheckUtils]: 171: Hoare triple {43490#false} ~x~0 := 0; {43490#false} is VALID [2018-11-18 22:45:42,602 INFO L273 TraceCheckUtils]: 172: Hoare triple {43490#false} assume true; {43490#false} is VALID [2018-11-18 22:45:42,602 INFO L273 TraceCheckUtils]: 173: Hoare triple {43490#false} assume !(~x~0 < ~i~0); {43490#false} is VALID [2018-11-18 22:45:42,602 INFO L273 TraceCheckUtils]: 174: Hoare triple {43490#false} ~x~0 := 1 + ~i~0; {43490#false} is VALID [2018-11-18 22:45:42,602 INFO L273 TraceCheckUtils]: 175: Hoare triple {43490#false} assume true; {43490#false} is VALID [2018-11-18 22:45:42,602 INFO L273 TraceCheckUtils]: 176: Hoare triple {43490#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43490#false} is VALID [2018-11-18 22:45:42,603 INFO L256 TraceCheckUtils]: 177: Hoare triple {43490#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43490#false} is VALID [2018-11-18 22:45:42,603 INFO L273 TraceCheckUtils]: 178: Hoare triple {43490#false} ~cond := #in~cond; {43490#false} is VALID [2018-11-18 22:45:42,603 INFO L273 TraceCheckUtils]: 179: Hoare triple {43490#false} assume 0 == ~cond; {43490#false} is VALID [2018-11-18 22:45:42,603 INFO L273 TraceCheckUtils]: 180: Hoare triple {43490#false} assume !false; {43490#false} is VALID [2018-11-18 22:45:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:42,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:42,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:45:42,804 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-11-18 22:45:42,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:42,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:43,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {43489#true} call ULTIMATE.init(); {43489#true} is VALID [2018-11-18 22:45:43,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {43489#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43489#true} is VALID [2018-11-18 22:45:43,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {43489#true} assume true; {43489#true} is VALID [2018-11-18 22:45:43,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43489#true} {43489#true} #137#return; {43489#true} is VALID [2018-11-18 22:45:43,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {43489#true} call #t~ret15 := main(); {43489#true} is VALID [2018-11-18 22:45:43,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {43489#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {43551#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:43,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {43551#(<= main_~i~0 0)} assume true; {43551#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:43,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {43551#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {43558#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:43,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {43558#(<= main_~k~0 0)} assume true; {43558#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:43,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {43558#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43558#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:43,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {43558#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43558#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:43,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {43558#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:43,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {43493#(<= main_~k~0 1)} assume true; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:43,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {43493#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:43,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {43493#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {43493#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:43,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {43493#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:43,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {43494#(<= main_~k~0 2)} assume true; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:43,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {43494#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:43,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {43494#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43494#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:43,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {43494#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:43,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {43495#(<= main_~k~0 3)} assume true; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:43,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {43495#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:43,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {43495#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43495#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:43,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {43495#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:43,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {43496#(<= main_~k~0 4)} assume true; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:43,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {43496#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:43,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {43496#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43496#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:43,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {43496#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:43,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {43497#(<= main_~k~0 5)} assume true; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:43,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {43497#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:43,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {43497#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43497#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:43,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {43497#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:43,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {43498#(<= main_~k~0 6)} assume true; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:43,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {43498#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:43,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {43498#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43498#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:43,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {43498#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:43,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {43499#(<= main_~k~0 7)} assume true; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:43,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {43499#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:43,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {43499#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43499#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:43,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {43499#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:43,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {43500#(<= main_~k~0 8)} assume true; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:43,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {43500#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:43,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {43500#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43500#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:43,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {43500#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:43,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {43501#(<= main_~k~0 9)} assume true; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:43,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {43501#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:43,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {43501#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43501#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:43,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {43501#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:43,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {43502#(<= main_~k~0 10)} assume true; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:43,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {43502#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:43,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {43502#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43502#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:43,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {43502#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:43,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {43503#(<= main_~k~0 11)} assume true; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:43,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {43503#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:43,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {43503#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43503#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:43,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {43503#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:43,587 INFO L273 TraceCheckUtils]: 56: Hoare triple {43504#(<= main_~k~0 12)} assume true; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:43,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {43504#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:43,588 INFO L273 TraceCheckUtils]: 58: Hoare triple {43504#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43504#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:43,589 INFO L273 TraceCheckUtils]: 59: Hoare triple {43504#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:43,589 INFO L273 TraceCheckUtils]: 60: Hoare triple {43505#(<= main_~k~0 13)} assume true; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:43,590 INFO L273 TraceCheckUtils]: 61: Hoare triple {43505#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:43,590 INFO L273 TraceCheckUtils]: 62: Hoare triple {43505#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43505#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:43,591 INFO L273 TraceCheckUtils]: 63: Hoare triple {43505#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:43,591 INFO L273 TraceCheckUtils]: 64: Hoare triple {43506#(<= main_~k~0 14)} assume true; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:43,592 INFO L273 TraceCheckUtils]: 65: Hoare triple {43506#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:43,592 INFO L273 TraceCheckUtils]: 66: Hoare triple {43506#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43506#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:43,593 INFO L273 TraceCheckUtils]: 67: Hoare triple {43506#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:43,593 INFO L273 TraceCheckUtils]: 68: Hoare triple {43507#(<= main_~k~0 15)} assume true; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:43,594 INFO L273 TraceCheckUtils]: 69: Hoare triple {43507#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:43,594 INFO L273 TraceCheckUtils]: 70: Hoare triple {43507#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43507#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:43,595 INFO L273 TraceCheckUtils]: 71: Hoare triple {43507#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:43,596 INFO L273 TraceCheckUtils]: 72: Hoare triple {43508#(<= main_~k~0 16)} assume true; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:43,596 INFO L273 TraceCheckUtils]: 73: Hoare triple {43508#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:43,596 INFO L273 TraceCheckUtils]: 74: Hoare triple {43508#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43508#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:43,597 INFO L273 TraceCheckUtils]: 75: Hoare triple {43508#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:43,598 INFO L273 TraceCheckUtils]: 76: Hoare triple {43509#(<= main_~k~0 17)} assume true; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:43,598 INFO L273 TraceCheckUtils]: 77: Hoare triple {43509#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:43,599 INFO L273 TraceCheckUtils]: 78: Hoare triple {43509#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43509#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:43,599 INFO L273 TraceCheckUtils]: 79: Hoare triple {43509#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:43,600 INFO L273 TraceCheckUtils]: 80: Hoare triple {43510#(<= main_~k~0 18)} assume true; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:43,600 INFO L273 TraceCheckUtils]: 81: Hoare triple {43510#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:43,601 INFO L273 TraceCheckUtils]: 82: Hoare triple {43510#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43510#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:43,601 INFO L273 TraceCheckUtils]: 83: Hoare triple {43510#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:43,602 INFO L273 TraceCheckUtils]: 84: Hoare triple {43511#(<= main_~k~0 19)} assume true; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:43,602 INFO L273 TraceCheckUtils]: 85: Hoare triple {43511#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:43,603 INFO L273 TraceCheckUtils]: 86: Hoare triple {43511#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43511#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:43,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {43511#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:43,604 INFO L273 TraceCheckUtils]: 88: Hoare triple {43512#(<= main_~k~0 20)} assume true; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:43,604 INFO L273 TraceCheckUtils]: 89: Hoare triple {43512#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:43,605 INFO L273 TraceCheckUtils]: 90: Hoare triple {43512#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43512#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:43,605 INFO L273 TraceCheckUtils]: 91: Hoare triple {43512#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:43,606 INFO L273 TraceCheckUtils]: 92: Hoare triple {43513#(<= main_~k~0 21)} assume true; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:43,606 INFO L273 TraceCheckUtils]: 93: Hoare triple {43513#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:43,607 INFO L273 TraceCheckUtils]: 94: Hoare triple {43513#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43513#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:43,607 INFO L273 TraceCheckUtils]: 95: Hoare triple {43513#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:43,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {43514#(<= main_~k~0 22)} assume true; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:43,608 INFO L273 TraceCheckUtils]: 97: Hoare triple {43514#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:43,609 INFO L273 TraceCheckUtils]: 98: Hoare triple {43514#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43514#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:43,609 INFO L273 TraceCheckUtils]: 99: Hoare triple {43514#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:43,610 INFO L273 TraceCheckUtils]: 100: Hoare triple {43515#(<= main_~k~0 23)} assume true; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:43,610 INFO L273 TraceCheckUtils]: 101: Hoare triple {43515#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:43,611 INFO L273 TraceCheckUtils]: 102: Hoare triple {43515#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43515#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:43,611 INFO L273 TraceCheckUtils]: 103: Hoare triple {43515#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:43,612 INFO L273 TraceCheckUtils]: 104: Hoare triple {43516#(<= main_~k~0 24)} assume true; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:43,612 INFO L273 TraceCheckUtils]: 105: Hoare triple {43516#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:43,613 INFO L273 TraceCheckUtils]: 106: Hoare triple {43516#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43516#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:43,614 INFO L273 TraceCheckUtils]: 107: Hoare triple {43516#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:43,614 INFO L273 TraceCheckUtils]: 108: Hoare triple {43517#(<= main_~k~0 25)} assume true; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:43,614 INFO L273 TraceCheckUtils]: 109: Hoare triple {43517#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:43,615 INFO L273 TraceCheckUtils]: 110: Hoare triple {43517#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43517#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:43,616 INFO L273 TraceCheckUtils]: 111: Hoare triple {43517#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:43,616 INFO L273 TraceCheckUtils]: 112: Hoare triple {43518#(<= main_~k~0 26)} assume true; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:43,617 INFO L273 TraceCheckUtils]: 113: Hoare triple {43518#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:43,617 INFO L273 TraceCheckUtils]: 114: Hoare triple {43518#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43518#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:43,618 INFO L273 TraceCheckUtils]: 115: Hoare triple {43518#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:43,618 INFO L273 TraceCheckUtils]: 116: Hoare triple {43519#(<= main_~k~0 27)} assume true; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:43,619 INFO L273 TraceCheckUtils]: 117: Hoare triple {43519#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:43,619 INFO L273 TraceCheckUtils]: 118: Hoare triple {43519#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43519#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:43,620 INFO L273 TraceCheckUtils]: 119: Hoare triple {43519#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:43,620 INFO L273 TraceCheckUtils]: 120: Hoare triple {43520#(<= main_~k~0 28)} assume true; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:43,621 INFO L273 TraceCheckUtils]: 121: Hoare triple {43520#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:43,621 INFO L273 TraceCheckUtils]: 122: Hoare triple {43520#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43520#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:43,622 INFO L273 TraceCheckUtils]: 123: Hoare triple {43520#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:43,622 INFO L273 TraceCheckUtils]: 124: Hoare triple {43521#(<= main_~k~0 29)} assume true; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:43,623 INFO L273 TraceCheckUtils]: 125: Hoare triple {43521#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:43,623 INFO L273 TraceCheckUtils]: 126: Hoare triple {43521#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43521#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:43,624 INFO L273 TraceCheckUtils]: 127: Hoare triple {43521#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:43,624 INFO L273 TraceCheckUtils]: 128: Hoare triple {43522#(<= main_~k~0 30)} assume true; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:43,625 INFO L273 TraceCheckUtils]: 129: Hoare triple {43522#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:43,625 INFO L273 TraceCheckUtils]: 130: Hoare triple {43522#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43522#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:43,626 INFO L273 TraceCheckUtils]: 131: Hoare triple {43522#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:43,626 INFO L273 TraceCheckUtils]: 132: Hoare triple {43523#(<= main_~k~0 31)} assume true; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:43,627 INFO L273 TraceCheckUtils]: 133: Hoare triple {43523#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:43,627 INFO L273 TraceCheckUtils]: 134: Hoare triple {43523#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43523#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:43,628 INFO L273 TraceCheckUtils]: 135: Hoare triple {43523#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:43,628 INFO L273 TraceCheckUtils]: 136: Hoare triple {43524#(<= main_~k~0 32)} assume true; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:43,629 INFO L273 TraceCheckUtils]: 137: Hoare triple {43524#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:43,629 INFO L273 TraceCheckUtils]: 138: Hoare triple {43524#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43524#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:43,630 INFO L273 TraceCheckUtils]: 139: Hoare triple {43524#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:43,630 INFO L273 TraceCheckUtils]: 140: Hoare triple {43525#(<= main_~k~0 33)} assume true; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:43,631 INFO L273 TraceCheckUtils]: 141: Hoare triple {43525#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:43,631 INFO L273 TraceCheckUtils]: 142: Hoare triple {43525#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43525#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:43,632 INFO L273 TraceCheckUtils]: 143: Hoare triple {43525#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:43,632 INFO L273 TraceCheckUtils]: 144: Hoare triple {43526#(<= main_~k~0 34)} assume true; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:43,633 INFO L273 TraceCheckUtils]: 145: Hoare triple {43526#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:43,633 INFO L273 TraceCheckUtils]: 146: Hoare triple {43526#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43526#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:43,634 INFO L273 TraceCheckUtils]: 147: Hoare triple {43526#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:43,634 INFO L273 TraceCheckUtils]: 148: Hoare triple {43527#(<= main_~k~0 35)} assume true; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:43,635 INFO L273 TraceCheckUtils]: 149: Hoare triple {43527#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:43,635 INFO L273 TraceCheckUtils]: 150: Hoare triple {43527#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43527#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:43,636 INFO L273 TraceCheckUtils]: 151: Hoare triple {43527#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:43,637 INFO L273 TraceCheckUtils]: 152: Hoare triple {43528#(<= main_~k~0 36)} assume true; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:43,637 INFO L273 TraceCheckUtils]: 153: Hoare triple {43528#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:43,637 INFO L273 TraceCheckUtils]: 154: Hoare triple {43528#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43528#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:43,638 INFO L273 TraceCheckUtils]: 155: Hoare triple {43528#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:43,639 INFO L273 TraceCheckUtils]: 156: Hoare triple {43529#(<= main_~k~0 37)} assume true; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:43,639 INFO L273 TraceCheckUtils]: 157: Hoare triple {43529#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:43,639 INFO L273 TraceCheckUtils]: 158: Hoare triple {43529#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43529#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:43,640 INFO L273 TraceCheckUtils]: 159: Hoare triple {43529#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:43,641 INFO L273 TraceCheckUtils]: 160: Hoare triple {43530#(<= main_~k~0 38)} assume true; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:43,641 INFO L273 TraceCheckUtils]: 161: Hoare triple {43530#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:43,642 INFO L273 TraceCheckUtils]: 162: Hoare triple {43530#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43530#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:43,642 INFO L273 TraceCheckUtils]: 163: Hoare triple {43530#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:43,643 INFO L273 TraceCheckUtils]: 164: Hoare triple {43531#(<= main_~k~0 39)} assume true; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:43,643 INFO L273 TraceCheckUtils]: 165: Hoare triple {43531#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:43,644 INFO L273 TraceCheckUtils]: 166: Hoare triple {43531#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43531#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:43,644 INFO L273 TraceCheckUtils]: 167: Hoare triple {43531#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {43532#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:43,645 INFO L273 TraceCheckUtils]: 168: Hoare triple {43532#(<= main_~k~0 40)} assume true; {43532#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:43,645 INFO L273 TraceCheckUtils]: 169: Hoare triple {43532#(<= main_~k~0 40)} assume !(~k~0 < 100000); {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 170: Hoare triple {43490#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 171: Hoare triple {43490#false} ~x~0 := 0; {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 172: Hoare triple {43490#false} assume true; {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 173: Hoare triple {43490#false} assume !(~x~0 < ~i~0); {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 174: Hoare triple {43490#false} ~x~0 := 1 + ~i~0; {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 175: Hoare triple {43490#false} assume true; {43490#false} is VALID [2018-11-18 22:45:43,646 INFO L273 TraceCheckUtils]: 176: Hoare triple {43490#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {43490#false} is VALID [2018-11-18 22:45:43,647 INFO L256 TraceCheckUtils]: 177: Hoare triple {43490#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43490#false} is VALID [2018-11-18 22:45:43,647 INFO L273 TraceCheckUtils]: 178: Hoare triple {43490#false} ~cond := #in~cond; {43490#false} is VALID [2018-11-18 22:45:43,647 INFO L273 TraceCheckUtils]: 179: Hoare triple {43490#false} assume 0 == ~cond; {43490#false} is VALID [2018-11-18 22:45:43,647 INFO L273 TraceCheckUtils]: 180: Hoare triple {43490#false} assume !false; {43490#false} is VALID [2018-11-18 22:45:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:43,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:43,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2018-11-18 22:45:43,687 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 181 [2018-11-18 22:45:43,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:43,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-18 22:45:43,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:43,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-18 22:45:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 22:45:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:45:43,852 INFO L87 Difference]: Start difference. First operand 216 states and 268 transitions. Second operand 46 states. [2018-11-18 22:45:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,479 INFO L93 Difference]: Finished difference Result 271 states and 339 transitions. [2018-11-18 22:45:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 22:45:46,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 181 [2018-11-18 22:45:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:45:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 330 transitions. [2018-11-18 22:45:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:45:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 330 transitions. [2018-11-18 22:45:46,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 330 transitions. [2018-11-18 22:45:46,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:46,784 INFO L225 Difference]: With dead ends: 271 [2018-11-18 22:45:46,784 INFO L226 Difference]: Without dead ends: 229 [2018-11-18 22:45:46,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-11-18 22:45:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-18 22:45:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2018-11-18 22:45:46,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:46,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 220 states. [2018-11-18 22:45:46,908 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 220 states. [2018-11-18 22:45:46,908 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 220 states. [2018-11-18 22:45:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,912 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2018-11-18 22:45:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 285 transitions. [2018-11-18 22:45:46,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:46,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:46,913 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 229 states. [2018-11-18 22:45:46,913 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 229 states. [2018-11-18 22:45:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:46,917 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2018-11-18 22:45:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 285 transitions. [2018-11-18 22:45:46,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:46,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:46,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:46,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-18 22:45:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 273 transitions. [2018-11-18 22:45:46,921 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 273 transitions. Word has length 181 [2018-11-18 22:45:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:46,921 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 273 transitions. [2018-11-18 22:45:46,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-18 22:45:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 273 transitions. [2018-11-18 22:45:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 22:45:46,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:46,922 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:46,922 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -417441607, now seen corresponding path program 30 times [2018-11-18 22:45:46,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:46,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:47,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {45242#true} call ULTIMATE.init(); {45242#true} is VALID [2018-11-18 22:45:47,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {45242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45242#true} is VALID [2018-11-18 22:45:47,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {45242#true} assume true; {45242#true} is VALID [2018-11-18 22:45:47,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45242#true} {45242#true} #137#return; {45242#true} is VALID [2018-11-18 22:45:47,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {45242#true} call #t~ret15 := main(); {45242#true} is VALID [2018-11-18 22:45:47,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {45242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45244#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:47,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {45244#(= 0 main_~i~0)} assume true; {45244#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:47,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {45244#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {45245#(= main_~k~0 0)} is VALID [2018-11-18 22:45:47,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {45245#(= main_~k~0 0)} assume true; {45245#(= main_~k~0 0)} is VALID [2018-11-18 22:45:47,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {45245#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45245#(= main_~k~0 0)} is VALID [2018-11-18 22:45:47,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {45245#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45245#(= main_~k~0 0)} is VALID [2018-11-18 22:45:47,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {45245#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:47,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {45246#(<= main_~k~0 1)} assume true; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:47,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {45246#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:47,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {45246#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:47,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {45246#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:47,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {45247#(<= main_~k~0 2)} assume true; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:47,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {45247#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:47,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {45247#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:47,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {45247#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:47,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {45248#(<= main_~k~0 3)} assume true; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:47,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {45248#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:47,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {45248#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:47,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {45248#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:47,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {45249#(<= main_~k~0 4)} assume true; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:47,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {45249#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:47,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {45249#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:47,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {45249#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:47,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {45250#(<= main_~k~0 5)} assume true; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:47,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {45250#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:47,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {45250#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:47,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {45250#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:47,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {45251#(<= main_~k~0 6)} assume true; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:47,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {45251#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:47,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {45251#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:47,938 INFO L273 TraceCheckUtils]: 35: Hoare triple {45251#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:47,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {45252#(<= main_~k~0 7)} assume true; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:47,939 INFO L273 TraceCheckUtils]: 37: Hoare triple {45252#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:47,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {45252#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:47,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {45252#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:47,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {45253#(<= main_~k~0 8)} assume true; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:47,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {45253#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:47,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {45253#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:47,942 INFO L273 TraceCheckUtils]: 43: Hoare triple {45253#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:47,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {45254#(<= main_~k~0 9)} assume true; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:47,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {45254#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:47,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {45254#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:47,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {45254#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:47,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {45255#(<= main_~k~0 10)} assume true; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:47,945 INFO L273 TraceCheckUtils]: 49: Hoare triple {45255#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:47,946 INFO L273 TraceCheckUtils]: 50: Hoare triple {45255#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:47,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {45255#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:47,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {45256#(<= main_~k~0 11)} assume true; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:47,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {45256#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:47,948 INFO L273 TraceCheckUtils]: 54: Hoare triple {45256#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:47,948 INFO L273 TraceCheckUtils]: 55: Hoare triple {45256#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:47,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {45257#(<= main_~k~0 12)} assume true; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:47,949 INFO L273 TraceCheckUtils]: 57: Hoare triple {45257#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:47,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {45257#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:47,950 INFO L273 TraceCheckUtils]: 59: Hoare triple {45257#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:47,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {45258#(<= main_~k~0 13)} assume true; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:47,951 INFO L273 TraceCheckUtils]: 61: Hoare triple {45258#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:47,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {45258#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:47,952 INFO L273 TraceCheckUtils]: 63: Hoare triple {45258#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:47,953 INFO L273 TraceCheckUtils]: 64: Hoare triple {45259#(<= main_~k~0 14)} assume true; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:47,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {45259#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:47,954 INFO L273 TraceCheckUtils]: 66: Hoare triple {45259#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:47,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {45259#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:47,955 INFO L273 TraceCheckUtils]: 68: Hoare triple {45260#(<= main_~k~0 15)} assume true; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:47,955 INFO L273 TraceCheckUtils]: 69: Hoare triple {45260#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:47,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {45260#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:47,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {45260#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:47,957 INFO L273 TraceCheckUtils]: 72: Hoare triple {45261#(<= main_~k~0 16)} assume true; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:47,957 INFO L273 TraceCheckUtils]: 73: Hoare triple {45261#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:47,958 INFO L273 TraceCheckUtils]: 74: Hoare triple {45261#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:47,959 INFO L273 TraceCheckUtils]: 75: Hoare triple {45261#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:47,959 INFO L273 TraceCheckUtils]: 76: Hoare triple {45262#(<= main_~k~0 17)} assume true; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:47,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {45262#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:47,960 INFO L273 TraceCheckUtils]: 78: Hoare triple {45262#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:47,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {45262#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:47,961 INFO L273 TraceCheckUtils]: 80: Hoare triple {45263#(<= main_~k~0 18)} assume true; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:47,962 INFO L273 TraceCheckUtils]: 81: Hoare triple {45263#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:47,962 INFO L273 TraceCheckUtils]: 82: Hoare triple {45263#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:47,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {45263#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:47,963 INFO L273 TraceCheckUtils]: 84: Hoare triple {45264#(<= main_~k~0 19)} assume true; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:47,964 INFO L273 TraceCheckUtils]: 85: Hoare triple {45264#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:47,964 INFO L273 TraceCheckUtils]: 86: Hoare triple {45264#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:47,965 INFO L273 TraceCheckUtils]: 87: Hoare triple {45264#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:47,965 INFO L273 TraceCheckUtils]: 88: Hoare triple {45265#(<= main_~k~0 20)} assume true; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:47,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {45265#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:47,966 INFO L273 TraceCheckUtils]: 90: Hoare triple {45265#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:47,967 INFO L273 TraceCheckUtils]: 91: Hoare triple {45265#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:47,967 INFO L273 TraceCheckUtils]: 92: Hoare triple {45266#(<= main_~k~0 21)} assume true; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:47,968 INFO L273 TraceCheckUtils]: 93: Hoare triple {45266#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:47,968 INFO L273 TraceCheckUtils]: 94: Hoare triple {45266#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:47,969 INFO L273 TraceCheckUtils]: 95: Hoare triple {45266#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:47,969 INFO L273 TraceCheckUtils]: 96: Hoare triple {45267#(<= main_~k~0 22)} assume true; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:47,970 INFO L273 TraceCheckUtils]: 97: Hoare triple {45267#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:47,970 INFO L273 TraceCheckUtils]: 98: Hoare triple {45267#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:47,971 INFO L273 TraceCheckUtils]: 99: Hoare triple {45267#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:47,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {45268#(<= main_~k~0 23)} assume true; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:47,972 INFO L273 TraceCheckUtils]: 101: Hoare triple {45268#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:47,972 INFO L273 TraceCheckUtils]: 102: Hoare triple {45268#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:47,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {45268#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:47,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {45269#(<= main_~k~0 24)} assume true; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:47,974 INFO L273 TraceCheckUtils]: 105: Hoare triple {45269#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:47,974 INFO L273 TraceCheckUtils]: 106: Hoare triple {45269#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:47,975 INFO L273 TraceCheckUtils]: 107: Hoare triple {45269#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:47,976 INFO L273 TraceCheckUtils]: 108: Hoare triple {45270#(<= main_~k~0 25)} assume true; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:47,976 INFO L273 TraceCheckUtils]: 109: Hoare triple {45270#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:47,976 INFO L273 TraceCheckUtils]: 110: Hoare triple {45270#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:47,977 INFO L273 TraceCheckUtils]: 111: Hoare triple {45270#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:47,978 INFO L273 TraceCheckUtils]: 112: Hoare triple {45271#(<= main_~k~0 26)} assume true; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:47,978 INFO L273 TraceCheckUtils]: 113: Hoare triple {45271#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:47,979 INFO L273 TraceCheckUtils]: 114: Hoare triple {45271#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:47,979 INFO L273 TraceCheckUtils]: 115: Hoare triple {45271#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:47,980 INFO L273 TraceCheckUtils]: 116: Hoare triple {45272#(<= main_~k~0 27)} assume true; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:47,980 INFO L273 TraceCheckUtils]: 117: Hoare triple {45272#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:47,981 INFO L273 TraceCheckUtils]: 118: Hoare triple {45272#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:47,981 INFO L273 TraceCheckUtils]: 119: Hoare triple {45272#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:47,982 INFO L273 TraceCheckUtils]: 120: Hoare triple {45273#(<= main_~k~0 28)} assume true; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:47,982 INFO L273 TraceCheckUtils]: 121: Hoare triple {45273#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:47,983 INFO L273 TraceCheckUtils]: 122: Hoare triple {45273#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:47,983 INFO L273 TraceCheckUtils]: 123: Hoare triple {45273#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:47,984 INFO L273 TraceCheckUtils]: 124: Hoare triple {45274#(<= main_~k~0 29)} assume true; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:47,984 INFO L273 TraceCheckUtils]: 125: Hoare triple {45274#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:47,985 INFO L273 TraceCheckUtils]: 126: Hoare triple {45274#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:47,985 INFO L273 TraceCheckUtils]: 127: Hoare triple {45274#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:47,986 INFO L273 TraceCheckUtils]: 128: Hoare triple {45275#(<= main_~k~0 30)} assume true; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:47,986 INFO L273 TraceCheckUtils]: 129: Hoare triple {45275#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:47,987 INFO L273 TraceCheckUtils]: 130: Hoare triple {45275#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:47,987 INFO L273 TraceCheckUtils]: 131: Hoare triple {45275#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:47,988 INFO L273 TraceCheckUtils]: 132: Hoare triple {45276#(<= main_~k~0 31)} assume true; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:47,988 INFO L273 TraceCheckUtils]: 133: Hoare triple {45276#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:47,989 INFO L273 TraceCheckUtils]: 134: Hoare triple {45276#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:47,989 INFO L273 TraceCheckUtils]: 135: Hoare triple {45276#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:47,990 INFO L273 TraceCheckUtils]: 136: Hoare triple {45277#(<= main_~k~0 32)} assume true; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:47,990 INFO L273 TraceCheckUtils]: 137: Hoare triple {45277#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:47,991 INFO L273 TraceCheckUtils]: 138: Hoare triple {45277#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:47,992 INFO L273 TraceCheckUtils]: 139: Hoare triple {45277#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:47,992 INFO L273 TraceCheckUtils]: 140: Hoare triple {45278#(<= main_~k~0 33)} assume true; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:47,993 INFO L273 TraceCheckUtils]: 141: Hoare triple {45278#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:47,993 INFO L273 TraceCheckUtils]: 142: Hoare triple {45278#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:47,994 INFO L273 TraceCheckUtils]: 143: Hoare triple {45278#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:47,994 INFO L273 TraceCheckUtils]: 144: Hoare triple {45279#(<= main_~k~0 34)} assume true; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:47,995 INFO L273 TraceCheckUtils]: 145: Hoare triple {45279#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:47,995 INFO L273 TraceCheckUtils]: 146: Hoare triple {45279#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:47,996 INFO L273 TraceCheckUtils]: 147: Hoare triple {45279#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:47,996 INFO L273 TraceCheckUtils]: 148: Hoare triple {45280#(<= main_~k~0 35)} assume true; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:47,997 INFO L273 TraceCheckUtils]: 149: Hoare triple {45280#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:47,997 INFO L273 TraceCheckUtils]: 150: Hoare triple {45280#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:47,998 INFO L273 TraceCheckUtils]: 151: Hoare triple {45280#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:47,998 INFO L273 TraceCheckUtils]: 152: Hoare triple {45281#(<= main_~k~0 36)} assume true; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:47,999 INFO L273 TraceCheckUtils]: 153: Hoare triple {45281#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:47,999 INFO L273 TraceCheckUtils]: 154: Hoare triple {45281#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:48,000 INFO L273 TraceCheckUtils]: 155: Hoare triple {45281#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:48,000 INFO L273 TraceCheckUtils]: 156: Hoare triple {45282#(<= main_~k~0 37)} assume true; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:48,001 INFO L273 TraceCheckUtils]: 157: Hoare triple {45282#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:48,001 INFO L273 TraceCheckUtils]: 158: Hoare triple {45282#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:48,002 INFO L273 TraceCheckUtils]: 159: Hoare triple {45282#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:48,002 INFO L273 TraceCheckUtils]: 160: Hoare triple {45283#(<= main_~k~0 38)} assume true; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:48,003 INFO L273 TraceCheckUtils]: 161: Hoare triple {45283#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:48,003 INFO L273 TraceCheckUtils]: 162: Hoare triple {45283#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:48,004 INFO L273 TraceCheckUtils]: 163: Hoare triple {45283#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:48,004 INFO L273 TraceCheckUtils]: 164: Hoare triple {45284#(<= main_~k~0 39)} assume true; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:48,005 INFO L273 TraceCheckUtils]: 165: Hoare triple {45284#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:48,005 INFO L273 TraceCheckUtils]: 166: Hoare triple {45284#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:48,006 INFO L273 TraceCheckUtils]: 167: Hoare triple {45284#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:48,006 INFO L273 TraceCheckUtils]: 168: Hoare triple {45285#(<= main_~k~0 40)} assume true; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:48,007 INFO L273 TraceCheckUtils]: 169: Hoare triple {45285#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:48,007 INFO L273 TraceCheckUtils]: 170: Hoare triple {45285#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:48,008 INFO L273 TraceCheckUtils]: 171: Hoare triple {45285#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {45286#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:48,009 INFO L273 TraceCheckUtils]: 172: Hoare triple {45286#(<= main_~k~0 41)} assume true; {45286#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:48,009 INFO L273 TraceCheckUtils]: 173: Hoare triple {45286#(<= main_~k~0 41)} assume !(~k~0 < 100000); {45243#false} is VALID [2018-11-18 22:45:48,009 INFO L273 TraceCheckUtils]: 174: Hoare triple {45243#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 175: Hoare triple {45243#false} ~x~0 := 0; {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 176: Hoare triple {45243#false} assume true; {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 177: Hoare triple {45243#false} assume !(~x~0 < ~i~0); {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 178: Hoare triple {45243#false} ~x~0 := 1 + ~i~0; {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 179: Hoare triple {45243#false} assume true; {45243#false} is VALID [2018-11-18 22:45:48,010 INFO L273 TraceCheckUtils]: 180: Hoare triple {45243#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45243#false} is VALID [2018-11-18 22:45:48,011 INFO L256 TraceCheckUtils]: 181: Hoare triple {45243#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45243#false} is VALID [2018-11-18 22:45:48,011 INFO L273 TraceCheckUtils]: 182: Hoare triple {45243#false} ~cond := #in~cond; {45243#false} is VALID [2018-11-18 22:45:48,011 INFO L273 TraceCheckUtils]: 183: Hoare triple {45243#false} assume 0 == ~cond; {45243#false} is VALID [2018-11-18 22:45:48,011 INFO L273 TraceCheckUtils]: 184: Hoare triple {45243#false} assume !false; {45243#false} is VALID [2018-11-18 22:45:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:48,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:48,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:48,054 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:45:48,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2018-11-18 22:45:48,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:48,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:49,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {45242#true} call ULTIMATE.init(); {45242#true} is VALID [2018-11-18 22:45:49,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {45242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45242#true} is VALID [2018-11-18 22:45:49,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {45242#true} assume true; {45242#true} is VALID [2018-11-18 22:45:49,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45242#true} {45242#true} #137#return; {45242#true} is VALID [2018-11-18 22:45:49,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {45242#true} call #t~ret15 := main(); {45242#true} is VALID [2018-11-18 22:45:49,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {45242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45305#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:49,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {45305#(<= main_~i~0 0)} assume true; {45305#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:49,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {45305#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {45312#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:49,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {45312#(<= main_~k~0 0)} assume true; {45312#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:49,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {45312#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45312#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:49,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {45312#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45312#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:49,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {45312#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:49,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {45246#(<= main_~k~0 1)} assume true; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:49,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {45246#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:49,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {45246#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {45246#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:49,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {45246#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:49,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {45247#(<= main_~k~0 2)} assume true; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:49,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {45247#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:49,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {45247#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45247#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:49,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {45247#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:49,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {45248#(<= main_~k~0 3)} assume true; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:49,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {45248#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:49,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {45248#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45248#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:49,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {45248#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:49,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {45249#(<= main_~k~0 4)} assume true; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:49,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {45249#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:49,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {45249#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45249#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:49,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {45249#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:49,152 INFO L273 TraceCheckUtils]: 28: Hoare triple {45250#(<= main_~k~0 5)} assume true; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:49,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {45250#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:49,153 INFO L273 TraceCheckUtils]: 30: Hoare triple {45250#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45250#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:49,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {45250#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:49,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {45251#(<= main_~k~0 6)} assume true; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:49,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {45251#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:49,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {45251#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45251#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:49,156 INFO L273 TraceCheckUtils]: 35: Hoare triple {45251#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:49,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {45252#(<= main_~k~0 7)} assume true; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:49,157 INFO L273 TraceCheckUtils]: 37: Hoare triple {45252#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:49,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {45252#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45252#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:49,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {45252#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:49,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {45253#(<= main_~k~0 8)} assume true; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:49,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {45253#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:49,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {45253#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45253#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:49,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {45253#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:49,161 INFO L273 TraceCheckUtils]: 44: Hoare triple {45254#(<= main_~k~0 9)} assume true; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:49,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {45254#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:49,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {45254#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45254#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:49,162 INFO L273 TraceCheckUtils]: 47: Hoare triple {45254#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:49,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {45255#(<= main_~k~0 10)} assume true; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:49,163 INFO L273 TraceCheckUtils]: 49: Hoare triple {45255#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:49,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {45255#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45255#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:49,164 INFO L273 TraceCheckUtils]: 51: Hoare triple {45255#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:49,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {45256#(<= main_~k~0 11)} assume true; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:49,165 INFO L273 TraceCheckUtils]: 53: Hoare triple {45256#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:49,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {45256#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45256#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:49,167 INFO L273 TraceCheckUtils]: 55: Hoare triple {45256#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:49,167 INFO L273 TraceCheckUtils]: 56: Hoare triple {45257#(<= main_~k~0 12)} assume true; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:49,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {45257#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:49,168 INFO L273 TraceCheckUtils]: 58: Hoare triple {45257#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45257#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:49,169 INFO L273 TraceCheckUtils]: 59: Hoare triple {45257#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:49,169 INFO L273 TraceCheckUtils]: 60: Hoare triple {45258#(<= main_~k~0 13)} assume true; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:49,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {45258#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:49,170 INFO L273 TraceCheckUtils]: 62: Hoare triple {45258#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45258#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:49,171 INFO L273 TraceCheckUtils]: 63: Hoare triple {45258#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:49,171 INFO L273 TraceCheckUtils]: 64: Hoare triple {45259#(<= main_~k~0 14)} assume true; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:49,172 INFO L273 TraceCheckUtils]: 65: Hoare triple {45259#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:49,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {45259#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45259#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:49,173 INFO L273 TraceCheckUtils]: 67: Hoare triple {45259#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:49,174 INFO L273 TraceCheckUtils]: 68: Hoare triple {45260#(<= main_~k~0 15)} assume true; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:49,174 INFO L273 TraceCheckUtils]: 69: Hoare triple {45260#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:49,174 INFO L273 TraceCheckUtils]: 70: Hoare triple {45260#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45260#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:49,175 INFO L273 TraceCheckUtils]: 71: Hoare triple {45260#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:49,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {45261#(<= main_~k~0 16)} assume true; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:49,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {45261#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:49,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {45261#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45261#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:49,177 INFO L273 TraceCheckUtils]: 75: Hoare triple {45261#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:49,178 INFO L273 TraceCheckUtils]: 76: Hoare triple {45262#(<= main_~k~0 17)} assume true; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:49,178 INFO L273 TraceCheckUtils]: 77: Hoare triple {45262#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:49,179 INFO L273 TraceCheckUtils]: 78: Hoare triple {45262#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45262#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:49,179 INFO L273 TraceCheckUtils]: 79: Hoare triple {45262#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:49,180 INFO L273 TraceCheckUtils]: 80: Hoare triple {45263#(<= main_~k~0 18)} assume true; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:49,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {45263#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:49,181 INFO L273 TraceCheckUtils]: 82: Hoare triple {45263#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45263#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:49,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {45263#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:49,182 INFO L273 TraceCheckUtils]: 84: Hoare triple {45264#(<= main_~k~0 19)} assume true; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:49,182 INFO L273 TraceCheckUtils]: 85: Hoare triple {45264#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:49,183 INFO L273 TraceCheckUtils]: 86: Hoare triple {45264#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45264#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:49,184 INFO L273 TraceCheckUtils]: 87: Hoare triple {45264#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:49,184 INFO L273 TraceCheckUtils]: 88: Hoare triple {45265#(<= main_~k~0 20)} assume true; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:49,184 INFO L273 TraceCheckUtils]: 89: Hoare triple {45265#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:49,185 INFO L273 TraceCheckUtils]: 90: Hoare triple {45265#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45265#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:49,186 INFO L273 TraceCheckUtils]: 91: Hoare triple {45265#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:49,186 INFO L273 TraceCheckUtils]: 92: Hoare triple {45266#(<= main_~k~0 21)} assume true; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:49,187 INFO L273 TraceCheckUtils]: 93: Hoare triple {45266#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:49,187 INFO L273 TraceCheckUtils]: 94: Hoare triple {45266#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45266#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:49,188 INFO L273 TraceCheckUtils]: 95: Hoare triple {45266#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:49,188 INFO L273 TraceCheckUtils]: 96: Hoare triple {45267#(<= main_~k~0 22)} assume true; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:49,189 INFO L273 TraceCheckUtils]: 97: Hoare triple {45267#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:49,189 INFO L273 TraceCheckUtils]: 98: Hoare triple {45267#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45267#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:49,190 INFO L273 TraceCheckUtils]: 99: Hoare triple {45267#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:49,190 INFO L273 TraceCheckUtils]: 100: Hoare triple {45268#(<= main_~k~0 23)} assume true; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:49,191 INFO L273 TraceCheckUtils]: 101: Hoare triple {45268#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:49,191 INFO L273 TraceCheckUtils]: 102: Hoare triple {45268#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45268#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:49,192 INFO L273 TraceCheckUtils]: 103: Hoare triple {45268#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:49,193 INFO L273 TraceCheckUtils]: 104: Hoare triple {45269#(<= main_~k~0 24)} assume true; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:49,193 INFO L273 TraceCheckUtils]: 105: Hoare triple {45269#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:49,194 INFO L273 TraceCheckUtils]: 106: Hoare triple {45269#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45269#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:49,194 INFO L273 TraceCheckUtils]: 107: Hoare triple {45269#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:49,195 INFO L273 TraceCheckUtils]: 108: Hoare triple {45270#(<= main_~k~0 25)} assume true; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:49,195 INFO L273 TraceCheckUtils]: 109: Hoare triple {45270#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:49,196 INFO L273 TraceCheckUtils]: 110: Hoare triple {45270#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45270#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:49,196 INFO L273 TraceCheckUtils]: 111: Hoare triple {45270#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:49,197 INFO L273 TraceCheckUtils]: 112: Hoare triple {45271#(<= main_~k~0 26)} assume true; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:49,197 INFO L273 TraceCheckUtils]: 113: Hoare triple {45271#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:49,198 INFO L273 TraceCheckUtils]: 114: Hoare triple {45271#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45271#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:49,199 INFO L273 TraceCheckUtils]: 115: Hoare triple {45271#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:49,199 INFO L273 TraceCheckUtils]: 116: Hoare triple {45272#(<= main_~k~0 27)} assume true; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:49,200 INFO L273 TraceCheckUtils]: 117: Hoare triple {45272#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:49,200 INFO L273 TraceCheckUtils]: 118: Hoare triple {45272#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45272#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:49,201 INFO L273 TraceCheckUtils]: 119: Hoare triple {45272#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:49,201 INFO L273 TraceCheckUtils]: 120: Hoare triple {45273#(<= main_~k~0 28)} assume true; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:49,202 INFO L273 TraceCheckUtils]: 121: Hoare triple {45273#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:49,202 INFO L273 TraceCheckUtils]: 122: Hoare triple {45273#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45273#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:49,203 INFO L273 TraceCheckUtils]: 123: Hoare triple {45273#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:49,204 INFO L273 TraceCheckUtils]: 124: Hoare triple {45274#(<= main_~k~0 29)} assume true; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:49,204 INFO L273 TraceCheckUtils]: 125: Hoare triple {45274#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:49,204 INFO L273 TraceCheckUtils]: 126: Hoare triple {45274#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45274#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:49,205 INFO L273 TraceCheckUtils]: 127: Hoare triple {45274#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:49,206 INFO L273 TraceCheckUtils]: 128: Hoare triple {45275#(<= main_~k~0 30)} assume true; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:49,206 INFO L273 TraceCheckUtils]: 129: Hoare triple {45275#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:49,207 INFO L273 TraceCheckUtils]: 130: Hoare triple {45275#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45275#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:49,207 INFO L273 TraceCheckUtils]: 131: Hoare triple {45275#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:49,208 INFO L273 TraceCheckUtils]: 132: Hoare triple {45276#(<= main_~k~0 31)} assume true; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:49,208 INFO L273 TraceCheckUtils]: 133: Hoare triple {45276#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:49,209 INFO L273 TraceCheckUtils]: 134: Hoare triple {45276#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45276#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:49,209 INFO L273 TraceCheckUtils]: 135: Hoare triple {45276#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:49,210 INFO L273 TraceCheckUtils]: 136: Hoare triple {45277#(<= main_~k~0 32)} assume true; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:49,210 INFO L273 TraceCheckUtils]: 137: Hoare triple {45277#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:49,211 INFO L273 TraceCheckUtils]: 138: Hoare triple {45277#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45277#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:49,212 INFO L273 TraceCheckUtils]: 139: Hoare triple {45277#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:49,212 INFO L273 TraceCheckUtils]: 140: Hoare triple {45278#(<= main_~k~0 33)} assume true; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:49,213 INFO L273 TraceCheckUtils]: 141: Hoare triple {45278#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:49,213 INFO L273 TraceCheckUtils]: 142: Hoare triple {45278#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45278#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:49,214 INFO L273 TraceCheckUtils]: 143: Hoare triple {45278#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:49,214 INFO L273 TraceCheckUtils]: 144: Hoare triple {45279#(<= main_~k~0 34)} assume true; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:49,215 INFO L273 TraceCheckUtils]: 145: Hoare triple {45279#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:49,215 INFO L273 TraceCheckUtils]: 146: Hoare triple {45279#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45279#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:49,216 INFO L273 TraceCheckUtils]: 147: Hoare triple {45279#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:49,216 INFO L273 TraceCheckUtils]: 148: Hoare triple {45280#(<= main_~k~0 35)} assume true; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:49,217 INFO L273 TraceCheckUtils]: 149: Hoare triple {45280#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:49,217 INFO L273 TraceCheckUtils]: 150: Hoare triple {45280#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45280#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:49,218 INFO L273 TraceCheckUtils]: 151: Hoare triple {45280#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:49,218 INFO L273 TraceCheckUtils]: 152: Hoare triple {45281#(<= main_~k~0 36)} assume true; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:49,219 INFO L273 TraceCheckUtils]: 153: Hoare triple {45281#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:49,219 INFO L273 TraceCheckUtils]: 154: Hoare triple {45281#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45281#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:49,220 INFO L273 TraceCheckUtils]: 155: Hoare triple {45281#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:49,220 INFO L273 TraceCheckUtils]: 156: Hoare triple {45282#(<= main_~k~0 37)} assume true; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:49,221 INFO L273 TraceCheckUtils]: 157: Hoare triple {45282#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:49,221 INFO L273 TraceCheckUtils]: 158: Hoare triple {45282#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45282#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:49,222 INFO L273 TraceCheckUtils]: 159: Hoare triple {45282#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:49,222 INFO L273 TraceCheckUtils]: 160: Hoare triple {45283#(<= main_~k~0 38)} assume true; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:49,223 INFO L273 TraceCheckUtils]: 161: Hoare triple {45283#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:49,223 INFO L273 TraceCheckUtils]: 162: Hoare triple {45283#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45283#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:49,224 INFO L273 TraceCheckUtils]: 163: Hoare triple {45283#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:49,224 INFO L273 TraceCheckUtils]: 164: Hoare triple {45284#(<= main_~k~0 39)} assume true; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:49,225 INFO L273 TraceCheckUtils]: 165: Hoare triple {45284#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:49,225 INFO L273 TraceCheckUtils]: 166: Hoare triple {45284#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45284#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:49,226 INFO L273 TraceCheckUtils]: 167: Hoare triple {45284#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:49,226 INFO L273 TraceCheckUtils]: 168: Hoare triple {45285#(<= main_~k~0 40)} assume true; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:49,227 INFO L273 TraceCheckUtils]: 169: Hoare triple {45285#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:49,227 INFO L273 TraceCheckUtils]: 170: Hoare triple {45285#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {45285#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:49,228 INFO L273 TraceCheckUtils]: 171: Hoare triple {45285#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {45286#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:49,228 INFO L273 TraceCheckUtils]: 172: Hoare triple {45286#(<= main_~k~0 41)} assume true; {45286#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:49,229 INFO L273 TraceCheckUtils]: 173: Hoare triple {45286#(<= main_~k~0 41)} assume !(~k~0 < 100000); {45243#false} is VALID [2018-11-18 22:45:49,229 INFO L273 TraceCheckUtils]: 174: Hoare triple {45243#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45243#false} is VALID [2018-11-18 22:45:49,229 INFO L273 TraceCheckUtils]: 175: Hoare triple {45243#false} ~x~0 := 0; {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L273 TraceCheckUtils]: 176: Hoare triple {45243#false} assume true; {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L273 TraceCheckUtils]: 177: Hoare triple {45243#false} assume !(~x~0 < ~i~0); {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L273 TraceCheckUtils]: 178: Hoare triple {45243#false} ~x~0 := 1 + ~i~0; {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L273 TraceCheckUtils]: 179: Hoare triple {45243#false} assume true; {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L273 TraceCheckUtils]: 180: Hoare triple {45243#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45243#false} is VALID [2018-11-18 22:45:49,230 INFO L256 TraceCheckUtils]: 181: Hoare triple {45243#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {45243#false} is VALID [2018-11-18 22:45:49,231 INFO L273 TraceCheckUtils]: 182: Hoare triple {45243#false} ~cond := #in~cond; {45243#false} is VALID [2018-11-18 22:45:49,231 INFO L273 TraceCheckUtils]: 183: Hoare triple {45243#false} assume 0 == ~cond; {45243#false} is VALID [2018-11-18 22:45:49,231 INFO L273 TraceCheckUtils]: 184: Hoare triple {45243#false} assume !false; {45243#false} is VALID [2018-11-18 22:45:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:49,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:49,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2018-11-18 22:45:49,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 185 [2018-11-18 22:45:49,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:49,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-18 22:45:49,448 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-18 22:45:49,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-18 22:45:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-18 22:45:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 22:45:49,449 INFO L87 Difference]: Start difference. First operand 220 states and 273 transitions. Second operand 47 states. [2018-11-18 22:45:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:53,176 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2018-11-18 22:45:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-18 22:45:53,176 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 185 [2018-11-18 22:45:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:45:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 335 transitions. [2018-11-18 22:45:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:45:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 335 transitions. [2018-11-18 22:45:53,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 335 transitions. [2018-11-18 22:45:53,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:53,525 INFO L225 Difference]: With dead ends: 275 [2018-11-18 22:45:53,525 INFO L226 Difference]: Without dead ends: 233 [2018-11-18 22:45:53,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-11-18 22:45:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-18 22:45:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2018-11-18 22:45:53,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:53,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand 224 states. [2018-11-18 22:45:53,624 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 224 states. [2018-11-18 22:45:53,624 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 224 states. [2018-11-18 22:45:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:53,629 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2018-11-18 22:45:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2018-11-18 22:45:53,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:53,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:53,629 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 233 states. [2018-11-18 22:45:53,629 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 233 states. [2018-11-18 22:45:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:53,633 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2018-11-18 22:45:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2018-11-18 22:45:53,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:53,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:53,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:53,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-18 22:45:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 278 transitions. [2018-11-18 22:45:53,637 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 278 transitions. Word has length 185 [2018-11-18 22:45:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:53,637 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 278 transitions. [2018-11-18 22:45:53,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-18 22:45:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 278 transitions. [2018-11-18 22:45:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 22:45:53,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:53,638 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:53,638 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:53,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash -11731569, now seen corresponding path program 31 times [2018-11-18 22:45:53,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:53,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:53,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:54,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {47028#true} call ULTIMATE.init(); {47028#true} is VALID [2018-11-18 22:45:54,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {47028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47028#true} is VALID [2018-11-18 22:45:54,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {47028#true} assume true; {47028#true} is VALID [2018-11-18 22:45:54,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47028#true} {47028#true} #137#return; {47028#true} is VALID [2018-11-18 22:45:54,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {47028#true} call #t~ret15 := main(); {47028#true} is VALID [2018-11-18 22:45:54,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {47028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {47030#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:54,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {47030#(= 0 main_~i~0)} assume true; {47030#(= 0 main_~i~0)} is VALID [2018-11-18 22:45:54,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {47030#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {47031#(= main_~k~0 0)} is VALID [2018-11-18 22:45:54,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {47031#(= main_~k~0 0)} assume true; {47031#(= main_~k~0 0)} is VALID [2018-11-18 22:45:54,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {47031#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47031#(= main_~k~0 0)} is VALID [2018-11-18 22:45:54,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {47031#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47031#(= main_~k~0 0)} is VALID [2018-11-18 22:45:54,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {47031#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:54,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {47032#(<= main_~k~0 1)} assume true; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:54,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {47032#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:54,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {47032#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:54,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {47032#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:54,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {47033#(<= main_~k~0 2)} assume true; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:54,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {47033#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:54,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {47033#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:54,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {47033#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:54,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {47034#(<= main_~k~0 3)} assume true; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:54,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {47034#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:54,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {47034#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:54,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {47034#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:54,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {47035#(<= main_~k~0 4)} assume true; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:54,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {47035#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:54,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {47035#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:54,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {47035#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:54,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {47036#(<= main_~k~0 5)} assume true; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:54,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {47036#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:54,680 INFO L273 TraceCheckUtils]: 30: Hoare triple {47036#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:54,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {47036#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:54,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {47037#(<= main_~k~0 6)} assume true; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:54,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {47037#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:54,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {47037#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:54,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {47037#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:54,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {47038#(<= main_~k~0 7)} assume true; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:54,684 INFO L273 TraceCheckUtils]: 37: Hoare triple {47038#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:54,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {47038#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:54,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {47038#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:54,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {47039#(<= main_~k~0 8)} assume true; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:54,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {47039#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:54,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {47039#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:54,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {47039#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:54,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {47040#(<= main_~k~0 9)} assume true; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:54,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {47040#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:54,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {47040#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:54,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {47040#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:54,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {47041#(<= main_~k~0 10)} assume true; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:54,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {47041#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:54,691 INFO L273 TraceCheckUtils]: 50: Hoare triple {47041#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:54,691 INFO L273 TraceCheckUtils]: 51: Hoare triple {47041#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:54,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {47042#(<= main_~k~0 11)} assume true; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:54,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {47042#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:54,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {47042#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:54,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {47042#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:54,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {47043#(<= main_~k~0 12)} assume true; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:54,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {47043#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:54,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {47043#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:54,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {47043#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:54,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {47044#(<= main_~k~0 13)} assume true; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:54,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {47044#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:54,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {47044#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:54,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {47044#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:54,698 INFO L273 TraceCheckUtils]: 64: Hoare triple {47045#(<= main_~k~0 14)} assume true; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:54,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {47045#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:54,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {47045#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:54,700 INFO L273 TraceCheckUtils]: 67: Hoare triple {47045#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:54,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {47046#(<= main_~k~0 15)} assume true; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:54,701 INFO L273 TraceCheckUtils]: 69: Hoare triple {47046#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:54,701 INFO L273 TraceCheckUtils]: 70: Hoare triple {47046#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:54,702 INFO L273 TraceCheckUtils]: 71: Hoare triple {47046#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:54,703 INFO L273 TraceCheckUtils]: 72: Hoare triple {47047#(<= main_~k~0 16)} assume true; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:54,703 INFO L273 TraceCheckUtils]: 73: Hoare triple {47047#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:54,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {47047#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:54,704 INFO L273 TraceCheckUtils]: 75: Hoare triple {47047#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:54,705 INFO L273 TraceCheckUtils]: 76: Hoare triple {47048#(<= main_~k~0 17)} assume true; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:54,705 INFO L273 TraceCheckUtils]: 77: Hoare triple {47048#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:54,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {47048#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:54,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {47048#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:54,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {47049#(<= main_~k~0 18)} assume true; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:54,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {47049#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:54,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {47049#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:54,709 INFO L273 TraceCheckUtils]: 83: Hoare triple {47049#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:54,709 INFO L273 TraceCheckUtils]: 84: Hoare triple {47050#(<= main_~k~0 19)} assume true; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:54,710 INFO L273 TraceCheckUtils]: 85: Hoare triple {47050#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:54,710 INFO L273 TraceCheckUtils]: 86: Hoare triple {47050#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:54,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {47050#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:54,711 INFO L273 TraceCheckUtils]: 88: Hoare triple {47051#(<= main_~k~0 20)} assume true; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:54,712 INFO L273 TraceCheckUtils]: 89: Hoare triple {47051#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:54,712 INFO L273 TraceCheckUtils]: 90: Hoare triple {47051#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:54,713 INFO L273 TraceCheckUtils]: 91: Hoare triple {47051#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:54,713 INFO L273 TraceCheckUtils]: 92: Hoare triple {47052#(<= main_~k~0 21)} assume true; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:54,714 INFO L273 TraceCheckUtils]: 93: Hoare triple {47052#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:54,714 INFO L273 TraceCheckUtils]: 94: Hoare triple {47052#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:54,715 INFO L273 TraceCheckUtils]: 95: Hoare triple {47052#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:54,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {47053#(<= main_~k~0 22)} assume true; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:54,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {47053#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:54,717 INFO L273 TraceCheckUtils]: 98: Hoare triple {47053#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:54,717 INFO L273 TraceCheckUtils]: 99: Hoare triple {47053#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:54,718 INFO L273 TraceCheckUtils]: 100: Hoare triple {47054#(<= main_~k~0 23)} assume true; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:54,718 INFO L273 TraceCheckUtils]: 101: Hoare triple {47054#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:54,719 INFO L273 TraceCheckUtils]: 102: Hoare triple {47054#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:54,719 INFO L273 TraceCheckUtils]: 103: Hoare triple {47054#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:54,720 INFO L273 TraceCheckUtils]: 104: Hoare triple {47055#(<= main_~k~0 24)} assume true; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:54,720 INFO L273 TraceCheckUtils]: 105: Hoare triple {47055#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:54,721 INFO L273 TraceCheckUtils]: 106: Hoare triple {47055#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:54,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {47055#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:54,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {47056#(<= main_~k~0 25)} assume true; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:54,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {47056#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:54,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {47056#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:54,724 INFO L273 TraceCheckUtils]: 111: Hoare triple {47056#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:54,724 INFO L273 TraceCheckUtils]: 112: Hoare triple {47057#(<= main_~k~0 26)} assume true; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:54,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {47057#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:54,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {47057#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:54,726 INFO L273 TraceCheckUtils]: 115: Hoare triple {47057#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:54,726 INFO L273 TraceCheckUtils]: 116: Hoare triple {47058#(<= main_~k~0 27)} assume true; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:54,727 INFO L273 TraceCheckUtils]: 117: Hoare triple {47058#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:54,727 INFO L273 TraceCheckUtils]: 118: Hoare triple {47058#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:54,728 INFO L273 TraceCheckUtils]: 119: Hoare triple {47058#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:54,729 INFO L273 TraceCheckUtils]: 120: Hoare triple {47059#(<= main_~k~0 28)} assume true; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:54,729 INFO L273 TraceCheckUtils]: 121: Hoare triple {47059#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:54,730 INFO L273 TraceCheckUtils]: 122: Hoare triple {47059#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:54,730 INFO L273 TraceCheckUtils]: 123: Hoare triple {47059#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:54,731 INFO L273 TraceCheckUtils]: 124: Hoare triple {47060#(<= main_~k~0 29)} assume true; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:54,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {47060#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:54,732 INFO L273 TraceCheckUtils]: 126: Hoare triple {47060#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:54,732 INFO L273 TraceCheckUtils]: 127: Hoare triple {47060#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:54,733 INFO L273 TraceCheckUtils]: 128: Hoare triple {47061#(<= main_~k~0 30)} assume true; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:54,733 INFO L273 TraceCheckUtils]: 129: Hoare triple {47061#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:54,734 INFO L273 TraceCheckUtils]: 130: Hoare triple {47061#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:54,734 INFO L273 TraceCheckUtils]: 131: Hoare triple {47061#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:54,735 INFO L273 TraceCheckUtils]: 132: Hoare triple {47062#(<= main_~k~0 31)} assume true; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:54,735 INFO L273 TraceCheckUtils]: 133: Hoare triple {47062#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:54,736 INFO L273 TraceCheckUtils]: 134: Hoare triple {47062#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:54,737 INFO L273 TraceCheckUtils]: 135: Hoare triple {47062#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:54,737 INFO L273 TraceCheckUtils]: 136: Hoare triple {47063#(<= main_~k~0 32)} assume true; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:54,738 INFO L273 TraceCheckUtils]: 137: Hoare triple {47063#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:54,738 INFO L273 TraceCheckUtils]: 138: Hoare triple {47063#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:54,739 INFO L273 TraceCheckUtils]: 139: Hoare triple {47063#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:54,739 INFO L273 TraceCheckUtils]: 140: Hoare triple {47064#(<= main_~k~0 33)} assume true; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:54,740 INFO L273 TraceCheckUtils]: 141: Hoare triple {47064#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:54,740 INFO L273 TraceCheckUtils]: 142: Hoare triple {47064#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:54,741 INFO L273 TraceCheckUtils]: 143: Hoare triple {47064#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:54,741 INFO L273 TraceCheckUtils]: 144: Hoare triple {47065#(<= main_~k~0 34)} assume true; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:54,742 INFO L273 TraceCheckUtils]: 145: Hoare triple {47065#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:54,742 INFO L273 TraceCheckUtils]: 146: Hoare triple {47065#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:54,743 INFO L273 TraceCheckUtils]: 147: Hoare triple {47065#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:54,744 INFO L273 TraceCheckUtils]: 148: Hoare triple {47066#(<= main_~k~0 35)} assume true; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:54,744 INFO L273 TraceCheckUtils]: 149: Hoare triple {47066#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:54,745 INFO L273 TraceCheckUtils]: 150: Hoare triple {47066#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:54,745 INFO L273 TraceCheckUtils]: 151: Hoare triple {47066#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:54,746 INFO L273 TraceCheckUtils]: 152: Hoare triple {47067#(<= main_~k~0 36)} assume true; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:54,746 INFO L273 TraceCheckUtils]: 153: Hoare triple {47067#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:54,747 INFO L273 TraceCheckUtils]: 154: Hoare triple {47067#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:54,748 INFO L273 TraceCheckUtils]: 155: Hoare triple {47067#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:54,748 INFO L273 TraceCheckUtils]: 156: Hoare triple {47068#(<= main_~k~0 37)} assume true; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:54,749 INFO L273 TraceCheckUtils]: 157: Hoare triple {47068#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:54,749 INFO L273 TraceCheckUtils]: 158: Hoare triple {47068#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:54,750 INFO L273 TraceCheckUtils]: 159: Hoare triple {47068#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:54,750 INFO L273 TraceCheckUtils]: 160: Hoare triple {47069#(<= main_~k~0 38)} assume true; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:54,751 INFO L273 TraceCheckUtils]: 161: Hoare triple {47069#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:54,751 INFO L273 TraceCheckUtils]: 162: Hoare triple {47069#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:54,752 INFO L273 TraceCheckUtils]: 163: Hoare triple {47069#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:54,752 INFO L273 TraceCheckUtils]: 164: Hoare triple {47070#(<= main_~k~0 39)} assume true; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:54,753 INFO L273 TraceCheckUtils]: 165: Hoare triple {47070#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:54,753 INFO L273 TraceCheckUtils]: 166: Hoare triple {47070#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:54,754 INFO L273 TraceCheckUtils]: 167: Hoare triple {47070#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:54,755 INFO L273 TraceCheckUtils]: 168: Hoare triple {47071#(<= main_~k~0 40)} assume true; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:54,755 INFO L273 TraceCheckUtils]: 169: Hoare triple {47071#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:54,756 INFO L273 TraceCheckUtils]: 170: Hoare triple {47071#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:54,756 INFO L273 TraceCheckUtils]: 171: Hoare triple {47071#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:54,757 INFO L273 TraceCheckUtils]: 172: Hoare triple {47072#(<= main_~k~0 41)} assume true; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:54,757 INFO L273 TraceCheckUtils]: 173: Hoare triple {47072#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:54,758 INFO L273 TraceCheckUtils]: 174: Hoare triple {47072#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:54,758 INFO L273 TraceCheckUtils]: 175: Hoare triple {47072#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {47073#(<= main_~k~0 42)} is VALID [2018-11-18 22:45:54,759 INFO L273 TraceCheckUtils]: 176: Hoare triple {47073#(<= main_~k~0 42)} assume true; {47073#(<= main_~k~0 42)} is VALID [2018-11-18 22:45:54,759 INFO L273 TraceCheckUtils]: 177: Hoare triple {47073#(<= main_~k~0 42)} assume !(~k~0 < 100000); {47029#false} is VALID [2018-11-18 22:45:54,760 INFO L273 TraceCheckUtils]: 178: Hoare triple {47029#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#false} is VALID [2018-11-18 22:45:54,760 INFO L273 TraceCheckUtils]: 179: Hoare triple {47029#false} ~x~0 := 0; {47029#false} is VALID [2018-11-18 22:45:54,760 INFO L273 TraceCheckUtils]: 180: Hoare triple {47029#false} assume true; {47029#false} is VALID [2018-11-18 22:45:54,760 INFO L273 TraceCheckUtils]: 181: Hoare triple {47029#false} assume !(~x~0 < ~i~0); {47029#false} is VALID [2018-11-18 22:45:54,760 INFO L273 TraceCheckUtils]: 182: Hoare triple {47029#false} ~x~0 := 1 + ~i~0; {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L273 TraceCheckUtils]: 183: Hoare triple {47029#false} assume true; {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L273 TraceCheckUtils]: 184: Hoare triple {47029#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L256 TraceCheckUtils]: 185: Hoare triple {47029#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L273 TraceCheckUtils]: 186: Hoare triple {47029#false} ~cond := #in~cond; {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L273 TraceCheckUtils]: 187: Hoare triple {47029#false} assume 0 == ~cond; {47029#false} is VALID [2018-11-18 22:45:54,761 INFO L273 TraceCheckUtils]: 188: Hoare triple {47029#false} assume !false; {47029#false} is VALID [2018-11-18 22:45:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:54,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:54,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:54,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:55,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {47028#true} call ULTIMATE.init(); {47028#true} is VALID [2018-11-18 22:45:55,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {47028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47028#true} is VALID [2018-11-18 22:45:55,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {47028#true} assume true; {47028#true} is VALID [2018-11-18 22:45:55,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47028#true} {47028#true} #137#return; {47028#true} is VALID [2018-11-18 22:45:55,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {47028#true} call #t~ret15 := main(); {47028#true} is VALID [2018-11-18 22:45:55,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {47028#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {47092#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:55,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {47092#(<= main_~i~0 0)} assume true; {47092#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:55,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {47092#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {47099#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:55,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {47099#(<= main_~k~0 0)} assume true; {47099#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:55,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {47099#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47099#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:55,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {47099#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47099#(<= main_~k~0 0)} is VALID [2018-11-18 22:45:55,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {47099#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:55,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {47032#(<= main_~k~0 1)} assume true; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:55,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {47032#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:55,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {47032#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {47032#(<= main_~k~0 1)} is VALID [2018-11-18 22:45:55,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {47032#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:55,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {47033#(<= main_~k~0 2)} assume true; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:55,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {47033#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:55,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {47033#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47033#(<= main_~k~0 2)} is VALID [2018-11-18 22:45:55,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {47033#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:55,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {47034#(<= main_~k~0 3)} assume true; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:55,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {47034#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:55,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {47034#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47034#(<= main_~k~0 3)} is VALID [2018-11-18 22:45:55,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {47034#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:55,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {47035#(<= main_~k~0 4)} assume true; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:55,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {47035#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:55,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {47035#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47035#(<= main_~k~0 4)} is VALID [2018-11-18 22:45:55,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {47035#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:55,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {47036#(<= main_~k~0 5)} assume true; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:55,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {47036#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:55,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {47036#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47036#(<= main_~k~0 5)} is VALID [2018-11-18 22:45:55,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {47036#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:55,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {47037#(<= main_~k~0 6)} assume true; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:55,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {47037#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:55,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {47037#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47037#(<= main_~k~0 6)} is VALID [2018-11-18 22:45:55,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {47037#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:55,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {47038#(<= main_~k~0 7)} assume true; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:55,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {47038#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:55,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {47038#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47038#(<= main_~k~0 7)} is VALID [2018-11-18 22:45:55,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {47038#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:55,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {47039#(<= main_~k~0 8)} assume true; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:55,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {47039#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:55,510 INFO L273 TraceCheckUtils]: 42: Hoare triple {47039#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47039#(<= main_~k~0 8)} is VALID [2018-11-18 22:45:55,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {47039#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:55,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {47040#(<= main_~k~0 9)} assume true; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:55,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {47040#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:55,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {47040#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47040#(<= main_~k~0 9)} is VALID [2018-11-18 22:45:55,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {47040#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:55,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {47041#(<= main_~k~0 10)} assume true; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:55,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {47041#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:55,515 INFO L273 TraceCheckUtils]: 50: Hoare triple {47041#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47041#(<= main_~k~0 10)} is VALID [2018-11-18 22:45:55,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {47041#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:55,516 INFO L273 TraceCheckUtils]: 52: Hoare triple {47042#(<= main_~k~0 11)} assume true; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:55,517 INFO L273 TraceCheckUtils]: 53: Hoare triple {47042#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:55,517 INFO L273 TraceCheckUtils]: 54: Hoare triple {47042#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47042#(<= main_~k~0 11)} is VALID [2018-11-18 22:45:55,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {47042#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:55,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {47043#(<= main_~k~0 12)} assume true; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:55,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {47043#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:55,519 INFO L273 TraceCheckUtils]: 58: Hoare triple {47043#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47043#(<= main_~k~0 12)} is VALID [2018-11-18 22:45:55,520 INFO L273 TraceCheckUtils]: 59: Hoare triple {47043#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:55,521 INFO L273 TraceCheckUtils]: 60: Hoare triple {47044#(<= main_~k~0 13)} assume true; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:55,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {47044#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:55,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {47044#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47044#(<= main_~k~0 13)} is VALID [2018-11-18 22:45:55,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {47044#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:55,523 INFO L273 TraceCheckUtils]: 64: Hoare triple {47045#(<= main_~k~0 14)} assume true; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:55,523 INFO L273 TraceCheckUtils]: 65: Hoare triple {47045#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:55,524 INFO L273 TraceCheckUtils]: 66: Hoare triple {47045#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47045#(<= main_~k~0 14)} is VALID [2018-11-18 22:45:55,524 INFO L273 TraceCheckUtils]: 67: Hoare triple {47045#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:55,525 INFO L273 TraceCheckUtils]: 68: Hoare triple {47046#(<= main_~k~0 15)} assume true; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:55,525 INFO L273 TraceCheckUtils]: 69: Hoare triple {47046#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:55,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {47046#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47046#(<= main_~k~0 15)} is VALID [2018-11-18 22:45:55,527 INFO L273 TraceCheckUtils]: 71: Hoare triple {47046#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:55,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {47047#(<= main_~k~0 16)} assume true; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:55,528 INFO L273 TraceCheckUtils]: 73: Hoare triple {47047#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:55,528 INFO L273 TraceCheckUtils]: 74: Hoare triple {47047#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47047#(<= main_~k~0 16)} is VALID [2018-11-18 22:45:55,529 INFO L273 TraceCheckUtils]: 75: Hoare triple {47047#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:55,529 INFO L273 TraceCheckUtils]: 76: Hoare triple {47048#(<= main_~k~0 17)} assume true; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:55,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {47048#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:55,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {47048#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47048#(<= main_~k~0 17)} is VALID [2018-11-18 22:45:55,531 INFO L273 TraceCheckUtils]: 79: Hoare triple {47048#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:55,531 INFO L273 TraceCheckUtils]: 80: Hoare triple {47049#(<= main_~k~0 18)} assume true; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:55,532 INFO L273 TraceCheckUtils]: 81: Hoare triple {47049#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:55,532 INFO L273 TraceCheckUtils]: 82: Hoare triple {47049#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47049#(<= main_~k~0 18)} is VALID [2018-11-18 22:45:55,533 INFO L273 TraceCheckUtils]: 83: Hoare triple {47049#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:55,534 INFO L273 TraceCheckUtils]: 84: Hoare triple {47050#(<= main_~k~0 19)} assume true; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:55,534 INFO L273 TraceCheckUtils]: 85: Hoare triple {47050#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:55,535 INFO L273 TraceCheckUtils]: 86: Hoare triple {47050#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47050#(<= main_~k~0 19)} is VALID [2018-11-18 22:45:55,535 INFO L273 TraceCheckUtils]: 87: Hoare triple {47050#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:55,536 INFO L273 TraceCheckUtils]: 88: Hoare triple {47051#(<= main_~k~0 20)} assume true; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:55,536 INFO L273 TraceCheckUtils]: 89: Hoare triple {47051#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:55,537 INFO L273 TraceCheckUtils]: 90: Hoare triple {47051#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47051#(<= main_~k~0 20)} is VALID [2018-11-18 22:45:55,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {47051#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:55,538 INFO L273 TraceCheckUtils]: 92: Hoare triple {47052#(<= main_~k~0 21)} assume true; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:55,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {47052#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:55,539 INFO L273 TraceCheckUtils]: 94: Hoare triple {47052#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47052#(<= main_~k~0 21)} is VALID [2018-11-18 22:45:55,540 INFO L273 TraceCheckUtils]: 95: Hoare triple {47052#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:55,540 INFO L273 TraceCheckUtils]: 96: Hoare triple {47053#(<= main_~k~0 22)} assume true; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:55,541 INFO L273 TraceCheckUtils]: 97: Hoare triple {47053#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:55,541 INFO L273 TraceCheckUtils]: 98: Hoare triple {47053#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47053#(<= main_~k~0 22)} is VALID [2018-11-18 22:45:55,542 INFO L273 TraceCheckUtils]: 99: Hoare triple {47053#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:55,542 INFO L273 TraceCheckUtils]: 100: Hoare triple {47054#(<= main_~k~0 23)} assume true; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:55,543 INFO L273 TraceCheckUtils]: 101: Hoare triple {47054#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:55,543 INFO L273 TraceCheckUtils]: 102: Hoare triple {47054#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47054#(<= main_~k~0 23)} is VALID [2018-11-18 22:45:55,544 INFO L273 TraceCheckUtils]: 103: Hoare triple {47054#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:55,544 INFO L273 TraceCheckUtils]: 104: Hoare triple {47055#(<= main_~k~0 24)} assume true; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:55,545 INFO L273 TraceCheckUtils]: 105: Hoare triple {47055#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:55,545 INFO L273 TraceCheckUtils]: 106: Hoare triple {47055#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47055#(<= main_~k~0 24)} is VALID [2018-11-18 22:45:55,546 INFO L273 TraceCheckUtils]: 107: Hoare triple {47055#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:55,547 INFO L273 TraceCheckUtils]: 108: Hoare triple {47056#(<= main_~k~0 25)} assume true; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:55,547 INFO L273 TraceCheckUtils]: 109: Hoare triple {47056#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:55,547 INFO L273 TraceCheckUtils]: 110: Hoare triple {47056#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47056#(<= main_~k~0 25)} is VALID [2018-11-18 22:45:55,548 INFO L273 TraceCheckUtils]: 111: Hoare triple {47056#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:55,549 INFO L273 TraceCheckUtils]: 112: Hoare triple {47057#(<= main_~k~0 26)} assume true; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:55,549 INFO L273 TraceCheckUtils]: 113: Hoare triple {47057#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:55,550 INFO L273 TraceCheckUtils]: 114: Hoare triple {47057#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47057#(<= main_~k~0 26)} is VALID [2018-11-18 22:45:55,550 INFO L273 TraceCheckUtils]: 115: Hoare triple {47057#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:55,551 INFO L273 TraceCheckUtils]: 116: Hoare triple {47058#(<= main_~k~0 27)} assume true; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:55,551 INFO L273 TraceCheckUtils]: 117: Hoare triple {47058#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:55,552 INFO L273 TraceCheckUtils]: 118: Hoare triple {47058#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47058#(<= main_~k~0 27)} is VALID [2018-11-18 22:45:55,552 INFO L273 TraceCheckUtils]: 119: Hoare triple {47058#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:55,553 INFO L273 TraceCheckUtils]: 120: Hoare triple {47059#(<= main_~k~0 28)} assume true; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:55,553 INFO L273 TraceCheckUtils]: 121: Hoare triple {47059#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:55,554 INFO L273 TraceCheckUtils]: 122: Hoare triple {47059#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47059#(<= main_~k~0 28)} is VALID [2018-11-18 22:45:55,554 INFO L273 TraceCheckUtils]: 123: Hoare triple {47059#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:55,555 INFO L273 TraceCheckUtils]: 124: Hoare triple {47060#(<= main_~k~0 29)} assume true; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:55,555 INFO L273 TraceCheckUtils]: 125: Hoare triple {47060#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:55,556 INFO L273 TraceCheckUtils]: 126: Hoare triple {47060#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47060#(<= main_~k~0 29)} is VALID [2018-11-18 22:45:55,556 INFO L273 TraceCheckUtils]: 127: Hoare triple {47060#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:55,557 INFO L273 TraceCheckUtils]: 128: Hoare triple {47061#(<= main_~k~0 30)} assume true; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:55,557 INFO L273 TraceCheckUtils]: 129: Hoare triple {47061#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:55,558 INFO L273 TraceCheckUtils]: 130: Hoare triple {47061#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47061#(<= main_~k~0 30)} is VALID [2018-11-18 22:45:55,558 INFO L273 TraceCheckUtils]: 131: Hoare triple {47061#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:55,559 INFO L273 TraceCheckUtils]: 132: Hoare triple {47062#(<= main_~k~0 31)} assume true; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:55,559 INFO L273 TraceCheckUtils]: 133: Hoare triple {47062#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:55,560 INFO L273 TraceCheckUtils]: 134: Hoare triple {47062#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47062#(<= main_~k~0 31)} is VALID [2018-11-18 22:45:55,561 INFO L273 TraceCheckUtils]: 135: Hoare triple {47062#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:55,561 INFO L273 TraceCheckUtils]: 136: Hoare triple {47063#(<= main_~k~0 32)} assume true; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:55,562 INFO L273 TraceCheckUtils]: 137: Hoare triple {47063#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:55,562 INFO L273 TraceCheckUtils]: 138: Hoare triple {47063#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47063#(<= main_~k~0 32)} is VALID [2018-11-18 22:45:55,563 INFO L273 TraceCheckUtils]: 139: Hoare triple {47063#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:55,563 INFO L273 TraceCheckUtils]: 140: Hoare triple {47064#(<= main_~k~0 33)} assume true; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:55,564 INFO L273 TraceCheckUtils]: 141: Hoare triple {47064#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:55,564 INFO L273 TraceCheckUtils]: 142: Hoare triple {47064#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47064#(<= main_~k~0 33)} is VALID [2018-11-18 22:45:55,565 INFO L273 TraceCheckUtils]: 143: Hoare triple {47064#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:55,565 INFO L273 TraceCheckUtils]: 144: Hoare triple {47065#(<= main_~k~0 34)} assume true; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:55,566 INFO L273 TraceCheckUtils]: 145: Hoare triple {47065#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:55,566 INFO L273 TraceCheckUtils]: 146: Hoare triple {47065#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47065#(<= main_~k~0 34)} is VALID [2018-11-18 22:45:55,567 INFO L273 TraceCheckUtils]: 147: Hoare triple {47065#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:55,567 INFO L273 TraceCheckUtils]: 148: Hoare triple {47066#(<= main_~k~0 35)} assume true; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:55,568 INFO L273 TraceCheckUtils]: 149: Hoare triple {47066#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:55,568 INFO L273 TraceCheckUtils]: 150: Hoare triple {47066#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47066#(<= main_~k~0 35)} is VALID [2018-11-18 22:45:55,569 INFO L273 TraceCheckUtils]: 151: Hoare triple {47066#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:55,569 INFO L273 TraceCheckUtils]: 152: Hoare triple {47067#(<= main_~k~0 36)} assume true; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:55,570 INFO L273 TraceCheckUtils]: 153: Hoare triple {47067#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:55,570 INFO L273 TraceCheckUtils]: 154: Hoare triple {47067#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47067#(<= main_~k~0 36)} is VALID [2018-11-18 22:45:55,571 INFO L273 TraceCheckUtils]: 155: Hoare triple {47067#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:55,571 INFO L273 TraceCheckUtils]: 156: Hoare triple {47068#(<= main_~k~0 37)} assume true; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:55,572 INFO L273 TraceCheckUtils]: 157: Hoare triple {47068#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:55,572 INFO L273 TraceCheckUtils]: 158: Hoare triple {47068#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47068#(<= main_~k~0 37)} is VALID [2018-11-18 22:45:55,573 INFO L273 TraceCheckUtils]: 159: Hoare triple {47068#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:55,574 INFO L273 TraceCheckUtils]: 160: Hoare triple {47069#(<= main_~k~0 38)} assume true; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:55,574 INFO L273 TraceCheckUtils]: 161: Hoare triple {47069#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:55,574 INFO L273 TraceCheckUtils]: 162: Hoare triple {47069#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47069#(<= main_~k~0 38)} is VALID [2018-11-18 22:45:55,575 INFO L273 TraceCheckUtils]: 163: Hoare triple {47069#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:55,576 INFO L273 TraceCheckUtils]: 164: Hoare triple {47070#(<= main_~k~0 39)} assume true; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:55,576 INFO L273 TraceCheckUtils]: 165: Hoare triple {47070#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:55,577 INFO L273 TraceCheckUtils]: 166: Hoare triple {47070#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47070#(<= main_~k~0 39)} is VALID [2018-11-18 22:45:55,577 INFO L273 TraceCheckUtils]: 167: Hoare triple {47070#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:55,578 INFO L273 TraceCheckUtils]: 168: Hoare triple {47071#(<= main_~k~0 40)} assume true; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:55,578 INFO L273 TraceCheckUtils]: 169: Hoare triple {47071#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:55,579 INFO L273 TraceCheckUtils]: 170: Hoare triple {47071#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47071#(<= main_~k~0 40)} is VALID [2018-11-18 22:45:55,579 INFO L273 TraceCheckUtils]: 171: Hoare triple {47071#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:55,580 INFO L273 TraceCheckUtils]: 172: Hoare triple {47072#(<= main_~k~0 41)} assume true; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:55,580 INFO L273 TraceCheckUtils]: 173: Hoare triple {47072#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:55,581 INFO L273 TraceCheckUtils]: 174: Hoare triple {47072#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {47072#(<= main_~k~0 41)} is VALID [2018-11-18 22:45:55,582 INFO L273 TraceCheckUtils]: 175: Hoare triple {47072#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {47073#(<= main_~k~0 42)} is VALID [2018-11-18 22:45:55,582 INFO L273 TraceCheckUtils]: 176: Hoare triple {47073#(<= main_~k~0 42)} assume true; {47073#(<= main_~k~0 42)} is VALID [2018-11-18 22:45:55,583 INFO L273 TraceCheckUtils]: 177: Hoare triple {47073#(<= main_~k~0 42)} assume !(~k~0 < 100000); {47029#false} is VALID [2018-11-18 22:45:55,583 INFO L273 TraceCheckUtils]: 178: Hoare triple {47029#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#false} is VALID [2018-11-18 22:45:55,583 INFO L273 TraceCheckUtils]: 179: Hoare triple {47029#false} ~x~0 := 0; {47029#false} is VALID [2018-11-18 22:45:55,583 INFO L273 TraceCheckUtils]: 180: Hoare triple {47029#false} assume true; {47029#false} is VALID [2018-11-18 22:45:55,583 INFO L273 TraceCheckUtils]: 181: Hoare triple {47029#false} assume !(~x~0 < ~i~0); {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L273 TraceCheckUtils]: 182: Hoare triple {47029#false} ~x~0 := 1 + ~i~0; {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L273 TraceCheckUtils]: 183: Hoare triple {47029#false} assume true; {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L273 TraceCheckUtils]: 184: Hoare triple {47029#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L256 TraceCheckUtils]: 185: Hoare triple {47029#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L273 TraceCheckUtils]: 186: Hoare triple {47029#false} ~cond := #in~cond; {47029#false} is VALID [2018-11-18 22:45:55,584 INFO L273 TraceCheckUtils]: 187: Hoare triple {47029#false} assume 0 == ~cond; {47029#false} is VALID [2018-11-18 22:45:55,585 INFO L273 TraceCheckUtils]: 188: Hoare triple {47029#false} assume !false; {47029#false} is VALID [2018-11-18 22:45:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:45:55,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:55,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2018-11-18 22:45:55,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 189 [2018-11-18 22:45:55,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:55,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-18 22:45:55,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 22:45:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 22:45:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 22:45:55,808 INFO L87 Difference]: Start difference. First operand 224 states and 278 transitions. Second operand 48 states. [2018-11-18 22:45:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:59,163 INFO L93 Difference]: Finished difference Result 279 states and 349 transitions. [2018-11-18 22:45:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 22:45:59,163 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 189 [2018-11-18 22:45:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:45:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 340 transitions. [2018-11-18 22:45:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 22:45:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 340 transitions. [2018-11-18 22:45:59,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 340 transitions. [2018-11-18 22:45:59,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:59,524 INFO L225 Difference]: With dead ends: 279 [2018-11-18 22:45:59,524 INFO L226 Difference]: Without dead ends: 237 [2018-11-18 22:45:59,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-11-18 22:45:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-18 22:45:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2018-11-18 22:45:59,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:59,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand 228 states. [2018-11-18 22:45:59,694 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 228 states. [2018-11-18 22:45:59,694 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 228 states. [2018-11-18 22:45:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:59,700 INFO L93 Difference]: Finished difference Result 237 states and 295 transitions. [2018-11-18 22:45:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2018-11-18 22:45:59,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:59,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:59,700 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 237 states. [2018-11-18 22:45:59,700 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 237 states. [2018-11-18 22:45:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:59,704 INFO L93 Difference]: Finished difference Result 237 states and 295 transitions. [2018-11-18 22:45:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2018-11-18 22:45:59,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:59,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:59,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:59,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-18 22:45:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2018-11-18 22:45:59,708 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 189 [2018-11-18 22:45:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2018-11-18 22:45:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 22:45:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2018-11-18 22:45:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 22:45:59,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:59,710 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:59,710 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:59,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1666271077, now seen corresponding path program 32 times [2018-11-18 22:45:59,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:59,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:01,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {48847#true} call ULTIMATE.init(); {48847#true} is VALID [2018-11-18 22:46:01,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {48847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48847#true} is VALID [2018-11-18 22:46:01,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {48847#true} assume true; {48847#true} is VALID [2018-11-18 22:46:01,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48847#true} {48847#true} #137#return; {48847#true} is VALID [2018-11-18 22:46:01,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {48847#true} call #t~ret15 := main(); {48847#true} is VALID [2018-11-18 22:46:01,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {48847#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {48849#(= 0 main_~i~0)} is VALID [2018-11-18 22:46:01,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {48849#(= 0 main_~i~0)} assume true; {48849#(= 0 main_~i~0)} is VALID [2018-11-18 22:46:01,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {48849#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {48850#(= main_~k~0 0)} is VALID [2018-11-18 22:46:01,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {48850#(= main_~k~0 0)} assume true; {48850#(= main_~k~0 0)} is VALID [2018-11-18 22:46:01,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {48850#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48850#(= main_~k~0 0)} is VALID [2018-11-18 22:46:01,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {48850#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48850#(= main_~k~0 0)} is VALID [2018-11-18 22:46:01,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {48850#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:01,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {48851#(<= main_~k~0 1)} assume true; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:01,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {48851#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:01,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {48851#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:01,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {48851#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:01,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {48852#(<= main_~k~0 2)} assume true; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:01,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {48852#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:01,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {48852#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:01,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {48852#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:01,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {48853#(<= main_~k~0 3)} assume true; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:01,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {48853#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:01,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {48853#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:01,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {48853#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:01,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {48854#(<= main_~k~0 4)} assume true; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:01,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {48854#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:01,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {48854#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:01,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {48854#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:01,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {48855#(<= main_~k~0 5)} assume true; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:01,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {48855#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:01,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {48855#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:01,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {48855#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:01,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {48856#(<= main_~k~0 6)} assume true; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:01,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {48856#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:01,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {48856#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:01,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {48856#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:01,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {48857#(<= main_~k~0 7)} assume true; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:01,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {48857#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:01,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {48857#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:01,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {48857#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:01,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {48858#(<= main_~k~0 8)} assume true; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:01,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {48858#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:01,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {48858#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:01,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {48858#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:01,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {48859#(<= main_~k~0 9)} assume true; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:01,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {48859#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:01,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {48859#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:01,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {48859#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:01,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {48860#(<= main_~k~0 10)} assume true; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:01,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {48860#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:01,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {48860#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:01,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {48860#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:01,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {48861#(<= main_~k~0 11)} assume true; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:01,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {48861#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:01,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {48861#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:01,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {48861#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:01,237 INFO L273 TraceCheckUtils]: 56: Hoare triple {48862#(<= main_~k~0 12)} assume true; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:01,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {48862#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:01,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {48862#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:01,239 INFO L273 TraceCheckUtils]: 59: Hoare triple {48862#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:01,239 INFO L273 TraceCheckUtils]: 60: Hoare triple {48863#(<= main_~k~0 13)} assume true; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:01,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {48863#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:01,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {48863#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:01,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {48863#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:01,241 INFO L273 TraceCheckUtils]: 64: Hoare triple {48864#(<= main_~k~0 14)} assume true; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:01,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {48864#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:01,242 INFO L273 TraceCheckUtils]: 66: Hoare triple {48864#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:01,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {48864#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:01,243 INFO L273 TraceCheckUtils]: 68: Hoare triple {48865#(<= main_~k~0 15)} assume true; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:01,244 INFO L273 TraceCheckUtils]: 69: Hoare triple {48865#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:01,244 INFO L273 TraceCheckUtils]: 70: Hoare triple {48865#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:01,245 INFO L273 TraceCheckUtils]: 71: Hoare triple {48865#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:01,245 INFO L273 TraceCheckUtils]: 72: Hoare triple {48866#(<= main_~k~0 16)} assume true; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:01,246 INFO L273 TraceCheckUtils]: 73: Hoare triple {48866#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:01,246 INFO L273 TraceCheckUtils]: 74: Hoare triple {48866#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:01,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {48866#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:01,248 INFO L273 TraceCheckUtils]: 76: Hoare triple {48867#(<= main_~k~0 17)} assume true; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:01,248 INFO L273 TraceCheckUtils]: 77: Hoare triple {48867#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:01,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {48867#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:01,249 INFO L273 TraceCheckUtils]: 79: Hoare triple {48867#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:01,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {48868#(<= main_~k~0 18)} assume true; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:01,250 INFO L273 TraceCheckUtils]: 81: Hoare triple {48868#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:01,250 INFO L273 TraceCheckUtils]: 82: Hoare triple {48868#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:01,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {48868#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:01,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {48869#(<= main_~k~0 19)} assume true; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:01,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {48869#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:01,253 INFO L273 TraceCheckUtils]: 86: Hoare triple {48869#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:01,253 INFO L273 TraceCheckUtils]: 87: Hoare triple {48869#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:01,254 INFO L273 TraceCheckUtils]: 88: Hoare triple {48870#(<= main_~k~0 20)} assume true; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:01,254 INFO L273 TraceCheckUtils]: 89: Hoare triple {48870#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:01,255 INFO L273 TraceCheckUtils]: 90: Hoare triple {48870#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:01,255 INFO L273 TraceCheckUtils]: 91: Hoare triple {48870#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:01,256 INFO L273 TraceCheckUtils]: 92: Hoare triple {48871#(<= main_~k~0 21)} assume true; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:01,256 INFO L273 TraceCheckUtils]: 93: Hoare triple {48871#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:01,257 INFO L273 TraceCheckUtils]: 94: Hoare triple {48871#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:01,257 INFO L273 TraceCheckUtils]: 95: Hoare triple {48871#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:01,258 INFO L273 TraceCheckUtils]: 96: Hoare triple {48872#(<= main_~k~0 22)} assume true; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:01,258 INFO L273 TraceCheckUtils]: 97: Hoare triple {48872#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:01,259 INFO L273 TraceCheckUtils]: 98: Hoare triple {48872#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:01,259 INFO L273 TraceCheckUtils]: 99: Hoare triple {48872#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:01,260 INFO L273 TraceCheckUtils]: 100: Hoare triple {48873#(<= main_~k~0 23)} assume true; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:01,260 INFO L273 TraceCheckUtils]: 101: Hoare triple {48873#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:01,261 INFO L273 TraceCheckUtils]: 102: Hoare triple {48873#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:01,261 INFO L273 TraceCheckUtils]: 103: Hoare triple {48873#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:01,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {48874#(<= main_~k~0 24)} assume true; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:01,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {48874#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:01,263 INFO L273 TraceCheckUtils]: 106: Hoare triple {48874#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:01,264 INFO L273 TraceCheckUtils]: 107: Hoare triple {48874#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:01,264 INFO L273 TraceCheckUtils]: 108: Hoare triple {48875#(<= main_~k~0 25)} assume true; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:01,264 INFO L273 TraceCheckUtils]: 109: Hoare triple {48875#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:01,265 INFO L273 TraceCheckUtils]: 110: Hoare triple {48875#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:01,266 INFO L273 TraceCheckUtils]: 111: Hoare triple {48875#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:01,266 INFO L273 TraceCheckUtils]: 112: Hoare triple {48876#(<= main_~k~0 26)} assume true; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:01,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {48876#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:01,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {48876#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:01,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {48876#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:01,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {48877#(<= main_~k~0 27)} assume true; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:01,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {48877#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:01,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {48877#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:01,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {48877#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:01,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {48878#(<= main_~k~0 28)} assume true; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:01,271 INFO L273 TraceCheckUtils]: 121: Hoare triple {48878#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:01,271 INFO L273 TraceCheckUtils]: 122: Hoare triple {48878#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:01,272 INFO L273 TraceCheckUtils]: 123: Hoare triple {48878#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:01,272 INFO L273 TraceCheckUtils]: 124: Hoare triple {48879#(<= main_~k~0 29)} assume true; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:01,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {48879#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:01,273 INFO L273 TraceCheckUtils]: 126: Hoare triple {48879#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:01,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {48879#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:01,274 INFO L273 TraceCheckUtils]: 128: Hoare triple {48880#(<= main_~k~0 30)} assume true; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:01,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {48880#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:01,275 INFO L273 TraceCheckUtils]: 130: Hoare triple {48880#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:01,276 INFO L273 TraceCheckUtils]: 131: Hoare triple {48880#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:01,276 INFO L273 TraceCheckUtils]: 132: Hoare triple {48881#(<= main_~k~0 31)} assume true; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:01,277 INFO L273 TraceCheckUtils]: 133: Hoare triple {48881#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:01,277 INFO L273 TraceCheckUtils]: 134: Hoare triple {48881#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:01,278 INFO L273 TraceCheckUtils]: 135: Hoare triple {48881#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:01,278 INFO L273 TraceCheckUtils]: 136: Hoare triple {48882#(<= main_~k~0 32)} assume true; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:01,279 INFO L273 TraceCheckUtils]: 137: Hoare triple {48882#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:01,279 INFO L273 TraceCheckUtils]: 138: Hoare triple {48882#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:01,280 INFO L273 TraceCheckUtils]: 139: Hoare triple {48882#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:01,281 INFO L273 TraceCheckUtils]: 140: Hoare triple {48883#(<= main_~k~0 33)} assume true; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:01,281 INFO L273 TraceCheckUtils]: 141: Hoare triple {48883#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:01,281 INFO L273 TraceCheckUtils]: 142: Hoare triple {48883#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:01,282 INFO L273 TraceCheckUtils]: 143: Hoare triple {48883#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:01,283 INFO L273 TraceCheckUtils]: 144: Hoare triple {48884#(<= main_~k~0 34)} assume true; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:01,283 INFO L273 TraceCheckUtils]: 145: Hoare triple {48884#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:01,283 INFO L273 TraceCheckUtils]: 146: Hoare triple {48884#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:01,284 INFO L273 TraceCheckUtils]: 147: Hoare triple {48884#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:01,285 INFO L273 TraceCheckUtils]: 148: Hoare triple {48885#(<= main_~k~0 35)} assume true; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:01,285 INFO L273 TraceCheckUtils]: 149: Hoare triple {48885#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:01,286 INFO L273 TraceCheckUtils]: 150: Hoare triple {48885#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:01,286 INFO L273 TraceCheckUtils]: 151: Hoare triple {48885#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:01,287 INFO L273 TraceCheckUtils]: 152: Hoare triple {48886#(<= main_~k~0 36)} assume true; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:01,287 INFO L273 TraceCheckUtils]: 153: Hoare triple {48886#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:01,288 INFO L273 TraceCheckUtils]: 154: Hoare triple {48886#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:01,288 INFO L273 TraceCheckUtils]: 155: Hoare triple {48886#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:01,289 INFO L273 TraceCheckUtils]: 156: Hoare triple {48887#(<= main_~k~0 37)} assume true; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:01,289 INFO L273 TraceCheckUtils]: 157: Hoare triple {48887#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:01,290 INFO L273 TraceCheckUtils]: 158: Hoare triple {48887#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:01,290 INFO L273 TraceCheckUtils]: 159: Hoare triple {48887#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:01,291 INFO L273 TraceCheckUtils]: 160: Hoare triple {48888#(<= main_~k~0 38)} assume true; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:01,291 INFO L273 TraceCheckUtils]: 161: Hoare triple {48888#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:01,292 INFO L273 TraceCheckUtils]: 162: Hoare triple {48888#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:01,293 INFO L273 TraceCheckUtils]: 163: Hoare triple {48888#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:01,293 INFO L273 TraceCheckUtils]: 164: Hoare triple {48889#(<= main_~k~0 39)} assume true; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:01,294 INFO L273 TraceCheckUtils]: 165: Hoare triple {48889#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:01,294 INFO L273 TraceCheckUtils]: 166: Hoare triple {48889#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:01,295 INFO L273 TraceCheckUtils]: 167: Hoare triple {48889#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:01,295 INFO L273 TraceCheckUtils]: 168: Hoare triple {48890#(<= main_~k~0 40)} assume true; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:01,296 INFO L273 TraceCheckUtils]: 169: Hoare triple {48890#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:01,296 INFO L273 TraceCheckUtils]: 170: Hoare triple {48890#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:01,297 INFO L273 TraceCheckUtils]: 171: Hoare triple {48890#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:01,297 INFO L273 TraceCheckUtils]: 172: Hoare triple {48891#(<= main_~k~0 41)} assume true; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:01,298 INFO L273 TraceCheckUtils]: 173: Hoare triple {48891#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:01,298 INFO L273 TraceCheckUtils]: 174: Hoare triple {48891#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:01,299 INFO L273 TraceCheckUtils]: 175: Hoare triple {48891#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:01,299 INFO L273 TraceCheckUtils]: 176: Hoare triple {48892#(<= main_~k~0 42)} assume true; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:01,300 INFO L273 TraceCheckUtils]: 177: Hoare triple {48892#(<= main_~k~0 42)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:01,300 INFO L273 TraceCheckUtils]: 178: Hoare triple {48892#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:01,301 INFO L273 TraceCheckUtils]: 179: Hoare triple {48892#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {48893#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:01,301 INFO L273 TraceCheckUtils]: 180: Hoare triple {48893#(<= main_~k~0 43)} assume true; {48893#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:01,302 INFO L273 TraceCheckUtils]: 181: Hoare triple {48893#(<= main_~k~0 43)} assume !(~k~0 < 100000); {48848#false} is VALID [2018-11-18 22:46:01,302 INFO L273 TraceCheckUtils]: 182: Hoare triple {48848#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48848#false} is VALID [2018-11-18 22:46:01,302 INFO L273 TraceCheckUtils]: 183: Hoare triple {48848#false} ~x~0 := 0; {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L273 TraceCheckUtils]: 184: Hoare triple {48848#false} assume true; {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L273 TraceCheckUtils]: 185: Hoare triple {48848#false} assume !(~x~0 < ~i~0); {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L273 TraceCheckUtils]: 186: Hoare triple {48848#false} ~x~0 := 1 + ~i~0; {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L273 TraceCheckUtils]: 187: Hoare triple {48848#false} assume true; {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L273 TraceCheckUtils]: 188: Hoare triple {48848#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48848#false} is VALID [2018-11-18 22:46:01,303 INFO L256 TraceCheckUtils]: 189: Hoare triple {48848#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48848#false} is VALID [2018-11-18 22:46:01,304 INFO L273 TraceCheckUtils]: 190: Hoare triple {48848#false} ~cond := #in~cond; {48848#false} is VALID [2018-11-18 22:46:01,304 INFO L273 TraceCheckUtils]: 191: Hoare triple {48848#false} assume 0 == ~cond; {48848#false} is VALID [2018-11-18 22:46:01,304 INFO L273 TraceCheckUtils]: 192: Hoare triple {48848#false} assume !false; {48848#false} is VALID [2018-11-18 22:46:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:01,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:01,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:01,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:01,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:01,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:02,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {48847#true} call ULTIMATE.init(); {48847#true} is VALID [2018-11-18 22:46:02,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {48847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48847#true} is VALID [2018-11-18 22:46:02,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {48847#true} assume true; {48847#true} is VALID [2018-11-18 22:46:02,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48847#true} {48847#true} #137#return; {48847#true} is VALID [2018-11-18 22:46:02,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {48847#true} call #t~ret15 := main(); {48847#true} is VALID [2018-11-18 22:46:02,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {48847#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {48912#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:02,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {48912#(<= main_~i~0 0)} assume true; {48912#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:02,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {48912#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {48919#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:02,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {48919#(<= main_~k~0 0)} assume true; {48919#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:02,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {48919#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48919#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:02,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {48919#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48919#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:02,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {48919#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:02,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {48851#(<= main_~k~0 1)} assume true; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:02,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {48851#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:02,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {48851#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {48851#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:02,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {48851#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:02,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {48852#(<= main_~k~0 2)} assume true; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:02,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {48852#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:02,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {48852#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48852#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:02,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {48852#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:02,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {48853#(<= main_~k~0 3)} assume true; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:02,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {48853#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:02,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {48853#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48853#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:02,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {48853#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:02,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {48854#(<= main_~k~0 4)} assume true; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:02,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {48854#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:02,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {48854#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48854#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:02,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {48854#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:02,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {48855#(<= main_~k~0 5)} assume true; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:02,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {48855#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:02,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {48855#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48855#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:02,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {48855#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:02,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {48856#(<= main_~k~0 6)} assume true; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:02,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {48856#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:02,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {48856#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48856#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:02,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {48856#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:02,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {48857#(<= main_~k~0 7)} assume true; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:02,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {48857#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:02,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {48857#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48857#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:02,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {48857#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:02,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {48858#(<= main_~k~0 8)} assume true; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:02,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {48858#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:02,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {48858#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48858#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:02,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {48858#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:02,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {48859#(<= main_~k~0 9)} assume true; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:02,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {48859#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:02,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {48859#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48859#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:02,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {48859#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:02,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {48860#(<= main_~k~0 10)} assume true; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:02,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {48860#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:02,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {48860#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48860#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:02,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {48860#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:02,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {48861#(<= main_~k~0 11)} assume true; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:02,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {48861#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:02,465 INFO L273 TraceCheckUtils]: 54: Hoare triple {48861#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48861#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:02,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {48861#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:02,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {48862#(<= main_~k~0 12)} assume true; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:02,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {48862#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:02,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {48862#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48862#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:02,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {48862#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:02,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {48863#(<= main_~k~0 13)} assume true; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:02,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {48863#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:02,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {48863#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48863#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:02,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {48863#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:02,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {48864#(<= main_~k~0 14)} assume true; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:02,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {48864#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:02,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {48864#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48864#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:02,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {48864#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:02,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {48865#(<= main_~k~0 15)} assume true; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:02,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {48865#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:02,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {48865#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48865#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:02,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {48865#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:02,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {48866#(<= main_~k~0 16)} assume true; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:02,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {48866#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:02,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {48866#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48866#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:02,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {48866#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:02,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {48867#(<= main_~k~0 17)} assume true; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:02,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {48867#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:02,478 INFO L273 TraceCheckUtils]: 78: Hoare triple {48867#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48867#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:02,478 INFO L273 TraceCheckUtils]: 79: Hoare triple {48867#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:02,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {48868#(<= main_~k~0 18)} assume true; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:02,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {48868#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:02,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {48868#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48868#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:02,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {48868#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:02,481 INFO L273 TraceCheckUtils]: 84: Hoare triple {48869#(<= main_~k~0 19)} assume true; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:02,481 INFO L273 TraceCheckUtils]: 85: Hoare triple {48869#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:02,482 INFO L273 TraceCheckUtils]: 86: Hoare triple {48869#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48869#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:02,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {48869#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:02,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {48870#(<= main_~k~0 20)} assume true; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:02,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {48870#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:02,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {48870#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48870#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:02,485 INFO L273 TraceCheckUtils]: 91: Hoare triple {48870#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:02,485 INFO L273 TraceCheckUtils]: 92: Hoare triple {48871#(<= main_~k~0 21)} assume true; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:02,485 INFO L273 TraceCheckUtils]: 93: Hoare triple {48871#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:02,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {48871#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48871#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:02,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {48871#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:02,487 INFO L273 TraceCheckUtils]: 96: Hoare triple {48872#(<= main_~k~0 22)} assume true; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:02,488 INFO L273 TraceCheckUtils]: 97: Hoare triple {48872#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:02,488 INFO L273 TraceCheckUtils]: 98: Hoare triple {48872#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48872#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:02,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {48872#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:02,489 INFO L273 TraceCheckUtils]: 100: Hoare triple {48873#(<= main_~k~0 23)} assume true; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:02,490 INFO L273 TraceCheckUtils]: 101: Hoare triple {48873#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:02,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {48873#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48873#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:02,491 INFO L273 TraceCheckUtils]: 103: Hoare triple {48873#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:02,491 INFO L273 TraceCheckUtils]: 104: Hoare triple {48874#(<= main_~k~0 24)} assume true; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:02,492 INFO L273 TraceCheckUtils]: 105: Hoare triple {48874#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:02,492 INFO L273 TraceCheckUtils]: 106: Hoare triple {48874#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48874#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:02,493 INFO L273 TraceCheckUtils]: 107: Hoare triple {48874#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:02,493 INFO L273 TraceCheckUtils]: 108: Hoare triple {48875#(<= main_~k~0 25)} assume true; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:02,494 INFO L273 TraceCheckUtils]: 109: Hoare triple {48875#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:02,494 INFO L273 TraceCheckUtils]: 110: Hoare triple {48875#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48875#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:02,495 INFO L273 TraceCheckUtils]: 111: Hoare triple {48875#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:02,495 INFO L273 TraceCheckUtils]: 112: Hoare triple {48876#(<= main_~k~0 26)} assume true; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:02,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {48876#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:02,496 INFO L273 TraceCheckUtils]: 114: Hoare triple {48876#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48876#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:02,497 INFO L273 TraceCheckUtils]: 115: Hoare triple {48876#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:02,497 INFO L273 TraceCheckUtils]: 116: Hoare triple {48877#(<= main_~k~0 27)} assume true; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:02,498 INFO L273 TraceCheckUtils]: 117: Hoare triple {48877#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:02,498 INFO L273 TraceCheckUtils]: 118: Hoare triple {48877#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48877#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:02,499 INFO L273 TraceCheckUtils]: 119: Hoare triple {48877#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:02,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {48878#(<= main_~k~0 28)} assume true; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:02,500 INFO L273 TraceCheckUtils]: 121: Hoare triple {48878#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:02,500 INFO L273 TraceCheckUtils]: 122: Hoare triple {48878#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48878#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:02,501 INFO L273 TraceCheckUtils]: 123: Hoare triple {48878#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:02,501 INFO L273 TraceCheckUtils]: 124: Hoare triple {48879#(<= main_~k~0 29)} assume true; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:02,502 INFO L273 TraceCheckUtils]: 125: Hoare triple {48879#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:02,502 INFO L273 TraceCheckUtils]: 126: Hoare triple {48879#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48879#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:02,503 INFO L273 TraceCheckUtils]: 127: Hoare triple {48879#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:02,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {48880#(<= main_~k~0 30)} assume true; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:02,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {48880#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:02,504 INFO L273 TraceCheckUtils]: 130: Hoare triple {48880#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48880#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:02,505 INFO L273 TraceCheckUtils]: 131: Hoare triple {48880#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:02,506 INFO L273 TraceCheckUtils]: 132: Hoare triple {48881#(<= main_~k~0 31)} assume true; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:02,506 INFO L273 TraceCheckUtils]: 133: Hoare triple {48881#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:02,506 INFO L273 TraceCheckUtils]: 134: Hoare triple {48881#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48881#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:02,507 INFO L273 TraceCheckUtils]: 135: Hoare triple {48881#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:02,508 INFO L273 TraceCheckUtils]: 136: Hoare triple {48882#(<= main_~k~0 32)} assume true; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:02,508 INFO L273 TraceCheckUtils]: 137: Hoare triple {48882#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:02,509 INFO L273 TraceCheckUtils]: 138: Hoare triple {48882#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48882#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:02,509 INFO L273 TraceCheckUtils]: 139: Hoare triple {48882#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:02,510 INFO L273 TraceCheckUtils]: 140: Hoare triple {48883#(<= main_~k~0 33)} assume true; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:02,510 INFO L273 TraceCheckUtils]: 141: Hoare triple {48883#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:02,511 INFO L273 TraceCheckUtils]: 142: Hoare triple {48883#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48883#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:02,511 INFO L273 TraceCheckUtils]: 143: Hoare triple {48883#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:02,512 INFO L273 TraceCheckUtils]: 144: Hoare triple {48884#(<= main_~k~0 34)} assume true; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:02,512 INFO L273 TraceCheckUtils]: 145: Hoare triple {48884#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:02,513 INFO L273 TraceCheckUtils]: 146: Hoare triple {48884#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48884#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:02,514 INFO L273 TraceCheckUtils]: 147: Hoare triple {48884#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:02,514 INFO L273 TraceCheckUtils]: 148: Hoare triple {48885#(<= main_~k~0 35)} assume true; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:02,515 INFO L273 TraceCheckUtils]: 149: Hoare triple {48885#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:02,515 INFO L273 TraceCheckUtils]: 150: Hoare triple {48885#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48885#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:02,516 INFO L273 TraceCheckUtils]: 151: Hoare triple {48885#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:02,516 INFO L273 TraceCheckUtils]: 152: Hoare triple {48886#(<= main_~k~0 36)} assume true; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:02,517 INFO L273 TraceCheckUtils]: 153: Hoare triple {48886#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:02,517 INFO L273 TraceCheckUtils]: 154: Hoare triple {48886#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48886#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:02,518 INFO L273 TraceCheckUtils]: 155: Hoare triple {48886#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:02,519 INFO L273 TraceCheckUtils]: 156: Hoare triple {48887#(<= main_~k~0 37)} assume true; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:02,519 INFO L273 TraceCheckUtils]: 157: Hoare triple {48887#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:02,520 INFO L273 TraceCheckUtils]: 158: Hoare triple {48887#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48887#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:02,520 INFO L273 TraceCheckUtils]: 159: Hoare triple {48887#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:02,521 INFO L273 TraceCheckUtils]: 160: Hoare triple {48888#(<= main_~k~0 38)} assume true; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:02,521 INFO L273 TraceCheckUtils]: 161: Hoare triple {48888#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:02,522 INFO L273 TraceCheckUtils]: 162: Hoare triple {48888#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48888#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:02,522 INFO L273 TraceCheckUtils]: 163: Hoare triple {48888#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:02,523 INFO L273 TraceCheckUtils]: 164: Hoare triple {48889#(<= main_~k~0 39)} assume true; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:02,523 INFO L273 TraceCheckUtils]: 165: Hoare triple {48889#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:02,524 INFO L273 TraceCheckUtils]: 166: Hoare triple {48889#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48889#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:02,525 INFO L273 TraceCheckUtils]: 167: Hoare triple {48889#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:02,525 INFO L273 TraceCheckUtils]: 168: Hoare triple {48890#(<= main_~k~0 40)} assume true; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:02,526 INFO L273 TraceCheckUtils]: 169: Hoare triple {48890#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:02,526 INFO L273 TraceCheckUtils]: 170: Hoare triple {48890#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48890#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:02,527 INFO L273 TraceCheckUtils]: 171: Hoare triple {48890#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:02,527 INFO L273 TraceCheckUtils]: 172: Hoare triple {48891#(<= main_~k~0 41)} assume true; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:02,528 INFO L273 TraceCheckUtils]: 173: Hoare triple {48891#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:02,528 INFO L273 TraceCheckUtils]: 174: Hoare triple {48891#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48891#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:02,529 INFO L273 TraceCheckUtils]: 175: Hoare triple {48891#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:02,529 INFO L273 TraceCheckUtils]: 176: Hoare triple {48892#(<= main_~k~0 42)} assume true; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:02,530 INFO L273 TraceCheckUtils]: 177: Hoare triple {48892#(<= main_~k~0 42)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:02,530 INFO L273 TraceCheckUtils]: 178: Hoare triple {48892#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {48892#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:02,531 INFO L273 TraceCheckUtils]: 179: Hoare triple {48892#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {48893#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:02,532 INFO L273 TraceCheckUtils]: 180: Hoare triple {48893#(<= main_~k~0 43)} assume true; {48893#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:02,532 INFO L273 TraceCheckUtils]: 181: Hoare triple {48893#(<= main_~k~0 43)} assume !(~k~0 < 100000); {48848#false} is VALID [2018-11-18 22:46:02,532 INFO L273 TraceCheckUtils]: 182: Hoare triple {48848#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 183: Hoare triple {48848#false} ~x~0 := 0; {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 184: Hoare triple {48848#false} assume true; {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 185: Hoare triple {48848#false} assume !(~x~0 < ~i~0); {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 186: Hoare triple {48848#false} ~x~0 := 1 + ~i~0; {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 187: Hoare triple {48848#false} assume true; {48848#false} is VALID [2018-11-18 22:46:02,533 INFO L273 TraceCheckUtils]: 188: Hoare triple {48848#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {48848#false} is VALID [2018-11-18 22:46:02,534 INFO L256 TraceCheckUtils]: 189: Hoare triple {48848#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {48848#false} is VALID [2018-11-18 22:46:02,534 INFO L273 TraceCheckUtils]: 190: Hoare triple {48848#false} ~cond := #in~cond; {48848#false} is VALID [2018-11-18 22:46:02,534 INFO L273 TraceCheckUtils]: 191: Hoare triple {48848#false} assume 0 == ~cond; {48848#false} is VALID [2018-11-18 22:46:02,534 INFO L273 TraceCheckUtils]: 192: Hoare triple {48848#false} assume !false; {48848#false} is VALID [2018-11-18 22:46:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:02,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2018-11-18 22:46:02,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 193 [2018-11-18 22:46:02,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:02,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-18 22:46:02,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:02,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-18 22:46:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-18 22:46:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 22:46:02,758 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand 49 states. [2018-11-18 22:46:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:06,694 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2018-11-18 22:46:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 22:46:06,694 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 193 [2018-11-18 22:46:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:46:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 345 transitions. [2018-11-18 22:46:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:46:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 345 transitions. [2018-11-18 22:46:06,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 345 transitions. [2018-11-18 22:46:07,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:07,007 INFO L225 Difference]: With dead ends: 283 [2018-11-18 22:46:07,007 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 22:46:07,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-11-18 22:46:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 22:46:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 232. [2018-11-18 22:46:07,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:07,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 232 states. [2018-11-18 22:46:07,129 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 232 states. [2018-11-18 22:46:07,130 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 232 states. [2018-11-18 22:46:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:07,134 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2018-11-18 22:46:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2018-11-18 22:46:07,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:07,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:07,134 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 241 states. [2018-11-18 22:46:07,134 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 241 states. [2018-11-18 22:46:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:07,138 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2018-11-18 22:46:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2018-11-18 22:46:07,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:07,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:07,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:07,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 22:46:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2018-11-18 22:46:07,142 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 193 [2018-11-18 22:46:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:07,142 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2018-11-18 22:46:07,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-18 22:46:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-11-18 22:46:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 22:46:07,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:07,143 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:07,143 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:07,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 902870587, now seen corresponding path program 33 times [2018-11-18 22:46:07,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:07,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:07,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:08,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {50699#true} call ULTIMATE.init(); {50699#true} is VALID [2018-11-18 22:46:08,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {50699#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50699#true} is VALID [2018-11-18 22:46:08,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {50699#true} assume true; {50699#true} is VALID [2018-11-18 22:46:08,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50699#true} {50699#true} #137#return; {50699#true} is VALID [2018-11-18 22:46:08,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {50699#true} call #t~ret15 := main(); {50699#true} is VALID [2018-11-18 22:46:08,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {50699#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {50701#(= 0 main_~i~0)} is VALID [2018-11-18 22:46:08,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {50701#(= 0 main_~i~0)} assume true; {50701#(= 0 main_~i~0)} is VALID [2018-11-18 22:46:08,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {50701#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {50702#(= main_~k~0 0)} is VALID [2018-11-18 22:46:08,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {50702#(= main_~k~0 0)} assume true; {50702#(= main_~k~0 0)} is VALID [2018-11-18 22:46:08,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {50702#(= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50702#(= main_~k~0 0)} is VALID [2018-11-18 22:46:08,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {50702#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50702#(= main_~k~0 0)} is VALID [2018-11-18 22:46:08,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {50702#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:08,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {50703#(<= main_~k~0 1)} assume true; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:08,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {50703#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:08,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {50703#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:08,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {50703#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:08,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {50704#(<= main_~k~0 2)} assume true; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:08,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {50704#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:08,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {50704#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:08,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {50704#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:08,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {50705#(<= main_~k~0 3)} assume true; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:08,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {50705#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:08,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {50705#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:08,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {50705#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:08,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {50706#(<= main_~k~0 4)} assume true; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:08,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {50706#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:08,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {50706#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:08,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {50706#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:08,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {50707#(<= main_~k~0 5)} assume true; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:08,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {50707#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:08,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {50707#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:08,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {50707#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:08,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {50708#(<= main_~k~0 6)} assume true; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:08,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {50708#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:08,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {50708#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:08,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {50708#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:08,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {50709#(<= main_~k~0 7)} assume true; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:08,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {50709#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:08,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {50709#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:08,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {50709#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:08,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {50710#(<= main_~k~0 8)} assume true; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:08,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {50710#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:08,332 INFO L273 TraceCheckUtils]: 42: Hoare triple {50710#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:08,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {50710#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:08,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {50711#(<= main_~k~0 9)} assume true; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:08,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {50711#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:08,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {50711#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:08,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {50711#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:08,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {50712#(<= main_~k~0 10)} assume true; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:08,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {50712#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:08,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {50712#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:08,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {50712#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:08,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {50713#(<= main_~k~0 11)} assume true; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:08,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {50713#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:08,338 INFO L273 TraceCheckUtils]: 54: Hoare triple {50713#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:08,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {50713#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:08,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {50714#(<= main_~k~0 12)} assume true; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:08,340 INFO L273 TraceCheckUtils]: 57: Hoare triple {50714#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:08,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {50714#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:08,341 INFO L273 TraceCheckUtils]: 59: Hoare triple {50714#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:08,341 INFO L273 TraceCheckUtils]: 60: Hoare triple {50715#(<= main_~k~0 13)} assume true; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:08,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {50715#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:08,342 INFO L273 TraceCheckUtils]: 62: Hoare triple {50715#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:08,343 INFO L273 TraceCheckUtils]: 63: Hoare triple {50715#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:08,343 INFO L273 TraceCheckUtils]: 64: Hoare triple {50716#(<= main_~k~0 14)} assume true; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:08,344 INFO L273 TraceCheckUtils]: 65: Hoare triple {50716#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:08,344 INFO L273 TraceCheckUtils]: 66: Hoare triple {50716#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:08,345 INFO L273 TraceCheckUtils]: 67: Hoare triple {50716#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:08,345 INFO L273 TraceCheckUtils]: 68: Hoare triple {50717#(<= main_~k~0 15)} assume true; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:08,346 INFO L273 TraceCheckUtils]: 69: Hoare triple {50717#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:08,346 INFO L273 TraceCheckUtils]: 70: Hoare triple {50717#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:08,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {50717#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:08,347 INFO L273 TraceCheckUtils]: 72: Hoare triple {50718#(<= main_~k~0 16)} assume true; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:08,348 INFO L273 TraceCheckUtils]: 73: Hoare triple {50718#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:08,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {50718#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:08,349 INFO L273 TraceCheckUtils]: 75: Hoare triple {50718#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:08,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {50719#(<= main_~k~0 17)} assume true; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:08,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {50719#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:08,350 INFO L273 TraceCheckUtils]: 78: Hoare triple {50719#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:08,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {50719#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:08,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {50720#(<= main_~k~0 18)} assume true; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:08,352 INFO L273 TraceCheckUtils]: 81: Hoare triple {50720#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:08,353 INFO L273 TraceCheckUtils]: 82: Hoare triple {50720#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:08,353 INFO L273 TraceCheckUtils]: 83: Hoare triple {50720#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:08,354 INFO L273 TraceCheckUtils]: 84: Hoare triple {50721#(<= main_~k~0 19)} assume true; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:08,354 INFO L273 TraceCheckUtils]: 85: Hoare triple {50721#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:08,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {50721#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:08,355 INFO L273 TraceCheckUtils]: 87: Hoare triple {50721#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:08,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {50722#(<= main_~k~0 20)} assume true; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:08,356 INFO L273 TraceCheckUtils]: 89: Hoare triple {50722#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:08,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {50722#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:08,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {50722#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:08,358 INFO L273 TraceCheckUtils]: 92: Hoare triple {50723#(<= main_~k~0 21)} assume true; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:08,358 INFO L273 TraceCheckUtils]: 93: Hoare triple {50723#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:08,359 INFO L273 TraceCheckUtils]: 94: Hoare triple {50723#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:08,359 INFO L273 TraceCheckUtils]: 95: Hoare triple {50723#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:08,360 INFO L273 TraceCheckUtils]: 96: Hoare triple {50724#(<= main_~k~0 22)} assume true; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:08,360 INFO L273 TraceCheckUtils]: 97: Hoare triple {50724#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:08,361 INFO L273 TraceCheckUtils]: 98: Hoare triple {50724#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:08,361 INFO L273 TraceCheckUtils]: 99: Hoare triple {50724#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:08,362 INFO L273 TraceCheckUtils]: 100: Hoare triple {50725#(<= main_~k~0 23)} assume true; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:08,362 INFO L273 TraceCheckUtils]: 101: Hoare triple {50725#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:08,363 INFO L273 TraceCheckUtils]: 102: Hoare triple {50725#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:08,363 INFO L273 TraceCheckUtils]: 103: Hoare triple {50725#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:08,364 INFO L273 TraceCheckUtils]: 104: Hoare triple {50726#(<= main_~k~0 24)} assume true; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:08,364 INFO L273 TraceCheckUtils]: 105: Hoare triple {50726#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:08,365 INFO L273 TraceCheckUtils]: 106: Hoare triple {50726#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:08,365 INFO L273 TraceCheckUtils]: 107: Hoare triple {50726#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:08,366 INFO L273 TraceCheckUtils]: 108: Hoare triple {50727#(<= main_~k~0 25)} assume true; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:08,366 INFO L273 TraceCheckUtils]: 109: Hoare triple {50727#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:08,367 INFO L273 TraceCheckUtils]: 110: Hoare triple {50727#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:08,368 INFO L273 TraceCheckUtils]: 111: Hoare triple {50727#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:08,368 INFO L273 TraceCheckUtils]: 112: Hoare triple {50728#(<= main_~k~0 26)} assume true; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:08,368 INFO L273 TraceCheckUtils]: 113: Hoare triple {50728#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:08,369 INFO L273 TraceCheckUtils]: 114: Hoare triple {50728#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:08,370 INFO L273 TraceCheckUtils]: 115: Hoare triple {50728#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:08,370 INFO L273 TraceCheckUtils]: 116: Hoare triple {50729#(<= main_~k~0 27)} assume true; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:08,371 INFO L273 TraceCheckUtils]: 117: Hoare triple {50729#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:08,371 INFO L273 TraceCheckUtils]: 118: Hoare triple {50729#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:08,372 INFO L273 TraceCheckUtils]: 119: Hoare triple {50729#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:08,372 INFO L273 TraceCheckUtils]: 120: Hoare triple {50730#(<= main_~k~0 28)} assume true; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:08,373 INFO L273 TraceCheckUtils]: 121: Hoare triple {50730#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:08,373 INFO L273 TraceCheckUtils]: 122: Hoare triple {50730#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:08,374 INFO L273 TraceCheckUtils]: 123: Hoare triple {50730#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:08,374 INFO L273 TraceCheckUtils]: 124: Hoare triple {50731#(<= main_~k~0 29)} assume true; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:08,375 INFO L273 TraceCheckUtils]: 125: Hoare triple {50731#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:08,375 INFO L273 TraceCheckUtils]: 126: Hoare triple {50731#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:08,376 INFO L273 TraceCheckUtils]: 127: Hoare triple {50731#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:08,376 INFO L273 TraceCheckUtils]: 128: Hoare triple {50732#(<= main_~k~0 30)} assume true; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:08,377 INFO L273 TraceCheckUtils]: 129: Hoare triple {50732#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:08,377 INFO L273 TraceCheckUtils]: 130: Hoare triple {50732#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:08,378 INFO L273 TraceCheckUtils]: 131: Hoare triple {50732#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:08,378 INFO L273 TraceCheckUtils]: 132: Hoare triple {50733#(<= main_~k~0 31)} assume true; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:08,379 INFO L273 TraceCheckUtils]: 133: Hoare triple {50733#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:08,379 INFO L273 TraceCheckUtils]: 134: Hoare triple {50733#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:08,380 INFO L273 TraceCheckUtils]: 135: Hoare triple {50733#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:08,380 INFO L273 TraceCheckUtils]: 136: Hoare triple {50734#(<= main_~k~0 32)} assume true; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:08,381 INFO L273 TraceCheckUtils]: 137: Hoare triple {50734#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:08,381 INFO L273 TraceCheckUtils]: 138: Hoare triple {50734#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:08,382 INFO L273 TraceCheckUtils]: 139: Hoare triple {50734#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:08,382 INFO L273 TraceCheckUtils]: 140: Hoare triple {50735#(<= main_~k~0 33)} assume true; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:08,383 INFO L273 TraceCheckUtils]: 141: Hoare triple {50735#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:08,383 INFO L273 TraceCheckUtils]: 142: Hoare triple {50735#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:08,384 INFO L273 TraceCheckUtils]: 143: Hoare triple {50735#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:08,384 INFO L273 TraceCheckUtils]: 144: Hoare triple {50736#(<= main_~k~0 34)} assume true; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:08,385 INFO L273 TraceCheckUtils]: 145: Hoare triple {50736#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:08,385 INFO L273 TraceCheckUtils]: 146: Hoare triple {50736#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:08,386 INFO L273 TraceCheckUtils]: 147: Hoare triple {50736#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:08,387 INFO L273 TraceCheckUtils]: 148: Hoare triple {50737#(<= main_~k~0 35)} assume true; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:08,387 INFO L273 TraceCheckUtils]: 149: Hoare triple {50737#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:08,387 INFO L273 TraceCheckUtils]: 150: Hoare triple {50737#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:08,388 INFO L273 TraceCheckUtils]: 151: Hoare triple {50737#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:08,389 INFO L273 TraceCheckUtils]: 152: Hoare triple {50738#(<= main_~k~0 36)} assume true; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:08,389 INFO L273 TraceCheckUtils]: 153: Hoare triple {50738#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:08,390 INFO L273 TraceCheckUtils]: 154: Hoare triple {50738#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:08,390 INFO L273 TraceCheckUtils]: 155: Hoare triple {50738#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:08,391 INFO L273 TraceCheckUtils]: 156: Hoare triple {50739#(<= main_~k~0 37)} assume true; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:08,391 INFO L273 TraceCheckUtils]: 157: Hoare triple {50739#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:08,392 INFO L273 TraceCheckUtils]: 158: Hoare triple {50739#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:08,392 INFO L273 TraceCheckUtils]: 159: Hoare triple {50739#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:08,393 INFO L273 TraceCheckUtils]: 160: Hoare triple {50740#(<= main_~k~0 38)} assume true; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:08,393 INFO L273 TraceCheckUtils]: 161: Hoare triple {50740#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:08,394 INFO L273 TraceCheckUtils]: 162: Hoare triple {50740#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:08,394 INFO L273 TraceCheckUtils]: 163: Hoare triple {50740#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:08,395 INFO L273 TraceCheckUtils]: 164: Hoare triple {50741#(<= main_~k~0 39)} assume true; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:08,395 INFO L273 TraceCheckUtils]: 165: Hoare triple {50741#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:08,396 INFO L273 TraceCheckUtils]: 166: Hoare triple {50741#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:08,396 INFO L273 TraceCheckUtils]: 167: Hoare triple {50741#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:08,397 INFO L273 TraceCheckUtils]: 168: Hoare triple {50742#(<= main_~k~0 40)} assume true; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:08,397 INFO L273 TraceCheckUtils]: 169: Hoare triple {50742#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:08,398 INFO L273 TraceCheckUtils]: 170: Hoare triple {50742#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:08,398 INFO L273 TraceCheckUtils]: 171: Hoare triple {50742#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:08,399 INFO L273 TraceCheckUtils]: 172: Hoare triple {50743#(<= main_~k~0 41)} assume true; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:08,399 INFO L273 TraceCheckUtils]: 173: Hoare triple {50743#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:08,400 INFO L273 TraceCheckUtils]: 174: Hoare triple {50743#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:08,400 INFO L273 TraceCheckUtils]: 175: Hoare triple {50743#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:08,401 INFO L273 TraceCheckUtils]: 176: Hoare triple {50744#(<= main_~k~0 42)} assume true; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:08,401 INFO L273 TraceCheckUtils]: 177: Hoare triple {50744#(<= main_~k~0 42)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:08,402 INFO L273 TraceCheckUtils]: 178: Hoare triple {50744#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:08,403 INFO L273 TraceCheckUtils]: 179: Hoare triple {50744#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:08,403 INFO L273 TraceCheckUtils]: 180: Hoare triple {50745#(<= main_~k~0 43)} assume true; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:08,403 INFO L273 TraceCheckUtils]: 181: Hoare triple {50745#(<= main_~k~0 43)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:08,404 INFO L273 TraceCheckUtils]: 182: Hoare triple {50745#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:08,405 INFO L273 TraceCheckUtils]: 183: Hoare triple {50745#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {50746#(<= main_~k~0 44)} is VALID [2018-11-18 22:46:08,405 INFO L273 TraceCheckUtils]: 184: Hoare triple {50746#(<= main_~k~0 44)} assume true; {50746#(<= main_~k~0 44)} is VALID [2018-11-18 22:46:08,406 INFO L273 TraceCheckUtils]: 185: Hoare triple {50746#(<= main_~k~0 44)} assume !(~k~0 < 100000); {50700#false} is VALID [2018-11-18 22:46:08,406 INFO L273 TraceCheckUtils]: 186: Hoare triple {50700#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50700#false} is VALID [2018-11-18 22:46:08,406 INFO L273 TraceCheckUtils]: 187: Hoare triple {50700#false} ~x~0 := 0; {50700#false} is VALID [2018-11-18 22:46:08,406 INFO L273 TraceCheckUtils]: 188: Hoare triple {50700#false} assume true; {50700#false} is VALID [2018-11-18 22:46:08,406 INFO L273 TraceCheckUtils]: 189: Hoare triple {50700#false} assume !(~x~0 < ~i~0); {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 190: Hoare triple {50700#false} ~x~0 := 1 + ~i~0; {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 191: Hoare triple {50700#false} assume true; {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 192: Hoare triple {50700#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L256 TraceCheckUtils]: 193: Hoare triple {50700#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 194: Hoare triple {50700#false} ~cond := #in~cond; {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 195: Hoare triple {50700#false} assume 0 == ~cond; {50700#false} is VALID [2018-11-18 22:46:08,407 INFO L273 TraceCheckUtils]: 196: Hoare triple {50700#false} assume !false; {50700#false} is VALID [2018-11-18 22:46:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:08,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:08,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:08,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:46:08,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-18 22:46:08,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:08,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:09,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {50699#true} call ULTIMATE.init(); {50699#true} is VALID [2018-11-18 22:46:09,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {50699#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50699#true} is VALID [2018-11-18 22:46:09,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {50699#true} assume true; {50699#true} is VALID [2018-11-18 22:46:09,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50699#true} {50699#true} #137#return; {50699#true} is VALID [2018-11-18 22:46:09,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {50699#true} call #t~ret15 := main(); {50699#true} is VALID [2018-11-18 22:46:09,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {50699#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {50765#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:09,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {50765#(<= main_~i~0 0)} assume true; {50765#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:09,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {50765#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {50772#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:09,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {50772#(<= main_~k~0 0)} assume true; {50772#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:09,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {50772#(<= main_~k~0 0)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50772#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:09,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {50772#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50772#(<= main_~k~0 0)} is VALID [2018-11-18 22:46:09,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {50772#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:09,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {50703#(<= main_~k~0 1)} assume true; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:09,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {50703#(<= main_~k~0 1)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:09,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {50703#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {50703#(<= main_~k~0 1)} is VALID [2018-11-18 22:46:09,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {50703#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:09,193 INFO L273 TraceCheckUtils]: 16: Hoare triple {50704#(<= main_~k~0 2)} assume true; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:09,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {50704#(<= main_~k~0 2)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:09,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {50704#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50704#(<= main_~k~0 2)} is VALID [2018-11-18 22:46:09,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {50704#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:09,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {50705#(<= main_~k~0 3)} assume true; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:09,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {50705#(<= main_~k~0 3)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:09,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {50705#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50705#(<= main_~k~0 3)} is VALID [2018-11-18 22:46:09,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {50705#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:09,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {50706#(<= main_~k~0 4)} assume true; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:09,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {50706#(<= main_~k~0 4)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:09,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {50706#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50706#(<= main_~k~0 4)} is VALID [2018-11-18 22:46:09,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {50706#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:09,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {50707#(<= main_~k~0 5)} assume true; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:09,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {50707#(<= main_~k~0 5)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:09,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {50707#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50707#(<= main_~k~0 5)} is VALID [2018-11-18 22:46:09,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {50707#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:09,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {50708#(<= main_~k~0 6)} assume true; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:09,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {50708#(<= main_~k~0 6)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:09,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {50708#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50708#(<= main_~k~0 6)} is VALID [2018-11-18 22:46:09,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {50708#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:09,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {50709#(<= main_~k~0 7)} assume true; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:09,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {50709#(<= main_~k~0 7)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:09,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {50709#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50709#(<= main_~k~0 7)} is VALID [2018-11-18 22:46:09,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {50709#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:09,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {50710#(<= main_~k~0 8)} assume true; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:09,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {50710#(<= main_~k~0 8)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:09,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {50710#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50710#(<= main_~k~0 8)} is VALID [2018-11-18 22:46:09,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {50710#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:09,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {50711#(<= main_~k~0 9)} assume true; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:09,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {50711#(<= main_~k~0 9)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:09,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {50711#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50711#(<= main_~k~0 9)} is VALID [2018-11-18 22:46:09,210 INFO L273 TraceCheckUtils]: 47: Hoare triple {50711#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:09,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {50712#(<= main_~k~0 10)} assume true; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:09,211 INFO L273 TraceCheckUtils]: 49: Hoare triple {50712#(<= main_~k~0 10)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:09,212 INFO L273 TraceCheckUtils]: 50: Hoare triple {50712#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50712#(<= main_~k~0 10)} is VALID [2018-11-18 22:46:09,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {50712#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:09,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {50713#(<= main_~k~0 11)} assume true; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:09,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {50713#(<= main_~k~0 11)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:09,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {50713#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50713#(<= main_~k~0 11)} is VALID [2018-11-18 22:46:09,215 INFO L273 TraceCheckUtils]: 55: Hoare triple {50713#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:09,215 INFO L273 TraceCheckUtils]: 56: Hoare triple {50714#(<= main_~k~0 12)} assume true; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:09,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {50714#(<= main_~k~0 12)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:09,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {50714#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50714#(<= main_~k~0 12)} is VALID [2018-11-18 22:46:09,217 INFO L273 TraceCheckUtils]: 59: Hoare triple {50714#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:09,218 INFO L273 TraceCheckUtils]: 60: Hoare triple {50715#(<= main_~k~0 13)} assume true; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:09,218 INFO L273 TraceCheckUtils]: 61: Hoare triple {50715#(<= main_~k~0 13)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:09,219 INFO L273 TraceCheckUtils]: 62: Hoare triple {50715#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50715#(<= main_~k~0 13)} is VALID [2018-11-18 22:46:09,219 INFO L273 TraceCheckUtils]: 63: Hoare triple {50715#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:09,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {50716#(<= main_~k~0 14)} assume true; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:09,220 INFO L273 TraceCheckUtils]: 65: Hoare triple {50716#(<= main_~k~0 14)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:09,221 INFO L273 TraceCheckUtils]: 66: Hoare triple {50716#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50716#(<= main_~k~0 14)} is VALID [2018-11-18 22:46:09,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {50716#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:09,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {50717#(<= main_~k~0 15)} assume true; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:09,223 INFO L273 TraceCheckUtils]: 69: Hoare triple {50717#(<= main_~k~0 15)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:09,223 INFO L273 TraceCheckUtils]: 70: Hoare triple {50717#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50717#(<= main_~k~0 15)} is VALID [2018-11-18 22:46:09,224 INFO L273 TraceCheckUtils]: 71: Hoare triple {50717#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:09,224 INFO L273 TraceCheckUtils]: 72: Hoare triple {50718#(<= main_~k~0 16)} assume true; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:09,225 INFO L273 TraceCheckUtils]: 73: Hoare triple {50718#(<= main_~k~0 16)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:09,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {50718#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50718#(<= main_~k~0 16)} is VALID [2018-11-18 22:46:09,226 INFO L273 TraceCheckUtils]: 75: Hoare triple {50718#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:09,227 INFO L273 TraceCheckUtils]: 76: Hoare triple {50719#(<= main_~k~0 17)} assume true; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:09,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {50719#(<= main_~k~0 17)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:09,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {50719#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50719#(<= main_~k~0 17)} is VALID [2018-11-18 22:46:09,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {50719#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:09,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {50720#(<= main_~k~0 18)} assume true; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:09,229 INFO L273 TraceCheckUtils]: 81: Hoare triple {50720#(<= main_~k~0 18)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:09,230 INFO L273 TraceCheckUtils]: 82: Hoare triple {50720#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50720#(<= main_~k~0 18)} is VALID [2018-11-18 22:46:09,231 INFO L273 TraceCheckUtils]: 83: Hoare triple {50720#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:09,231 INFO L273 TraceCheckUtils]: 84: Hoare triple {50721#(<= main_~k~0 19)} assume true; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:09,232 INFO L273 TraceCheckUtils]: 85: Hoare triple {50721#(<= main_~k~0 19)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:09,232 INFO L273 TraceCheckUtils]: 86: Hoare triple {50721#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50721#(<= main_~k~0 19)} is VALID [2018-11-18 22:46:09,233 INFO L273 TraceCheckUtils]: 87: Hoare triple {50721#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:09,233 INFO L273 TraceCheckUtils]: 88: Hoare triple {50722#(<= main_~k~0 20)} assume true; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:09,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {50722#(<= main_~k~0 20)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:09,234 INFO L273 TraceCheckUtils]: 90: Hoare triple {50722#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50722#(<= main_~k~0 20)} is VALID [2018-11-18 22:46:09,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {50722#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:09,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {50723#(<= main_~k~0 21)} assume true; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:09,236 INFO L273 TraceCheckUtils]: 93: Hoare triple {50723#(<= main_~k~0 21)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:09,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {50723#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50723#(<= main_~k~0 21)} is VALID [2018-11-18 22:46:09,237 INFO L273 TraceCheckUtils]: 95: Hoare triple {50723#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:09,238 INFO L273 TraceCheckUtils]: 96: Hoare triple {50724#(<= main_~k~0 22)} assume true; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:09,238 INFO L273 TraceCheckUtils]: 97: Hoare triple {50724#(<= main_~k~0 22)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:09,239 INFO L273 TraceCheckUtils]: 98: Hoare triple {50724#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50724#(<= main_~k~0 22)} is VALID [2018-11-18 22:46:09,240 INFO L273 TraceCheckUtils]: 99: Hoare triple {50724#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:09,240 INFO L273 TraceCheckUtils]: 100: Hoare triple {50725#(<= main_~k~0 23)} assume true; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:09,241 INFO L273 TraceCheckUtils]: 101: Hoare triple {50725#(<= main_~k~0 23)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:09,241 INFO L273 TraceCheckUtils]: 102: Hoare triple {50725#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50725#(<= main_~k~0 23)} is VALID [2018-11-18 22:46:09,242 INFO L273 TraceCheckUtils]: 103: Hoare triple {50725#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:09,242 INFO L273 TraceCheckUtils]: 104: Hoare triple {50726#(<= main_~k~0 24)} assume true; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:09,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {50726#(<= main_~k~0 24)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:09,243 INFO L273 TraceCheckUtils]: 106: Hoare triple {50726#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50726#(<= main_~k~0 24)} is VALID [2018-11-18 22:46:09,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {50726#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:09,245 INFO L273 TraceCheckUtils]: 108: Hoare triple {50727#(<= main_~k~0 25)} assume true; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:09,245 INFO L273 TraceCheckUtils]: 109: Hoare triple {50727#(<= main_~k~0 25)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:09,246 INFO L273 TraceCheckUtils]: 110: Hoare triple {50727#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50727#(<= main_~k~0 25)} is VALID [2018-11-18 22:46:09,246 INFO L273 TraceCheckUtils]: 111: Hoare triple {50727#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:09,247 INFO L273 TraceCheckUtils]: 112: Hoare triple {50728#(<= main_~k~0 26)} assume true; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:09,247 INFO L273 TraceCheckUtils]: 113: Hoare triple {50728#(<= main_~k~0 26)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:09,248 INFO L273 TraceCheckUtils]: 114: Hoare triple {50728#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50728#(<= main_~k~0 26)} is VALID [2018-11-18 22:46:09,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {50728#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:09,249 INFO L273 TraceCheckUtils]: 116: Hoare triple {50729#(<= main_~k~0 27)} assume true; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:09,250 INFO L273 TraceCheckUtils]: 117: Hoare triple {50729#(<= main_~k~0 27)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:09,250 INFO L273 TraceCheckUtils]: 118: Hoare triple {50729#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50729#(<= main_~k~0 27)} is VALID [2018-11-18 22:46:09,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {50729#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:09,251 INFO L273 TraceCheckUtils]: 120: Hoare triple {50730#(<= main_~k~0 28)} assume true; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:09,252 INFO L273 TraceCheckUtils]: 121: Hoare triple {50730#(<= main_~k~0 28)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:09,252 INFO L273 TraceCheckUtils]: 122: Hoare triple {50730#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50730#(<= main_~k~0 28)} is VALID [2018-11-18 22:46:09,253 INFO L273 TraceCheckUtils]: 123: Hoare triple {50730#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:09,254 INFO L273 TraceCheckUtils]: 124: Hoare triple {50731#(<= main_~k~0 29)} assume true; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:09,254 INFO L273 TraceCheckUtils]: 125: Hoare triple {50731#(<= main_~k~0 29)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:09,254 INFO L273 TraceCheckUtils]: 126: Hoare triple {50731#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50731#(<= main_~k~0 29)} is VALID [2018-11-18 22:46:09,255 INFO L273 TraceCheckUtils]: 127: Hoare triple {50731#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:09,256 INFO L273 TraceCheckUtils]: 128: Hoare triple {50732#(<= main_~k~0 30)} assume true; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:09,256 INFO L273 TraceCheckUtils]: 129: Hoare triple {50732#(<= main_~k~0 30)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:09,257 INFO L273 TraceCheckUtils]: 130: Hoare triple {50732#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50732#(<= main_~k~0 30)} is VALID [2018-11-18 22:46:09,257 INFO L273 TraceCheckUtils]: 131: Hoare triple {50732#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:09,258 INFO L273 TraceCheckUtils]: 132: Hoare triple {50733#(<= main_~k~0 31)} assume true; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:09,258 INFO L273 TraceCheckUtils]: 133: Hoare triple {50733#(<= main_~k~0 31)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:09,259 INFO L273 TraceCheckUtils]: 134: Hoare triple {50733#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50733#(<= main_~k~0 31)} is VALID [2018-11-18 22:46:09,260 INFO L273 TraceCheckUtils]: 135: Hoare triple {50733#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:09,260 INFO L273 TraceCheckUtils]: 136: Hoare triple {50734#(<= main_~k~0 32)} assume true; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:09,261 INFO L273 TraceCheckUtils]: 137: Hoare triple {50734#(<= main_~k~0 32)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:09,261 INFO L273 TraceCheckUtils]: 138: Hoare triple {50734#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50734#(<= main_~k~0 32)} is VALID [2018-11-18 22:46:09,262 INFO L273 TraceCheckUtils]: 139: Hoare triple {50734#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:09,262 INFO L273 TraceCheckUtils]: 140: Hoare triple {50735#(<= main_~k~0 33)} assume true; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:09,263 INFO L273 TraceCheckUtils]: 141: Hoare triple {50735#(<= main_~k~0 33)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:09,263 INFO L273 TraceCheckUtils]: 142: Hoare triple {50735#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50735#(<= main_~k~0 33)} is VALID [2018-11-18 22:46:09,264 INFO L273 TraceCheckUtils]: 143: Hoare triple {50735#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:09,265 INFO L273 TraceCheckUtils]: 144: Hoare triple {50736#(<= main_~k~0 34)} assume true; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:09,265 INFO L273 TraceCheckUtils]: 145: Hoare triple {50736#(<= main_~k~0 34)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:09,266 INFO L273 TraceCheckUtils]: 146: Hoare triple {50736#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50736#(<= main_~k~0 34)} is VALID [2018-11-18 22:46:09,266 INFO L273 TraceCheckUtils]: 147: Hoare triple {50736#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:09,267 INFO L273 TraceCheckUtils]: 148: Hoare triple {50737#(<= main_~k~0 35)} assume true; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:09,267 INFO L273 TraceCheckUtils]: 149: Hoare triple {50737#(<= main_~k~0 35)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:09,268 INFO L273 TraceCheckUtils]: 150: Hoare triple {50737#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50737#(<= main_~k~0 35)} is VALID [2018-11-18 22:46:09,269 INFO L273 TraceCheckUtils]: 151: Hoare triple {50737#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:09,269 INFO L273 TraceCheckUtils]: 152: Hoare triple {50738#(<= main_~k~0 36)} assume true; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:09,270 INFO L273 TraceCheckUtils]: 153: Hoare triple {50738#(<= main_~k~0 36)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:09,270 INFO L273 TraceCheckUtils]: 154: Hoare triple {50738#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50738#(<= main_~k~0 36)} is VALID [2018-11-18 22:46:09,271 INFO L273 TraceCheckUtils]: 155: Hoare triple {50738#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:09,271 INFO L273 TraceCheckUtils]: 156: Hoare triple {50739#(<= main_~k~0 37)} assume true; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:09,272 INFO L273 TraceCheckUtils]: 157: Hoare triple {50739#(<= main_~k~0 37)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:09,272 INFO L273 TraceCheckUtils]: 158: Hoare triple {50739#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50739#(<= main_~k~0 37)} is VALID [2018-11-18 22:46:09,273 INFO L273 TraceCheckUtils]: 159: Hoare triple {50739#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:09,274 INFO L273 TraceCheckUtils]: 160: Hoare triple {50740#(<= main_~k~0 38)} assume true; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:09,274 INFO L273 TraceCheckUtils]: 161: Hoare triple {50740#(<= main_~k~0 38)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:09,275 INFO L273 TraceCheckUtils]: 162: Hoare triple {50740#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50740#(<= main_~k~0 38)} is VALID [2018-11-18 22:46:09,275 INFO L273 TraceCheckUtils]: 163: Hoare triple {50740#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:09,276 INFO L273 TraceCheckUtils]: 164: Hoare triple {50741#(<= main_~k~0 39)} assume true; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:09,276 INFO L273 TraceCheckUtils]: 165: Hoare triple {50741#(<= main_~k~0 39)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:09,277 INFO L273 TraceCheckUtils]: 166: Hoare triple {50741#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50741#(<= main_~k~0 39)} is VALID [2018-11-18 22:46:09,278 INFO L273 TraceCheckUtils]: 167: Hoare triple {50741#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:09,278 INFO L273 TraceCheckUtils]: 168: Hoare triple {50742#(<= main_~k~0 40)} assume true; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:09,279 INFO L273 TraceCheckUtils]: 169: Hoare triple {50742#(<= main_~k~0 40)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:09,279 INFO L273 TraceCheckUtils]: 170: Hoare triple {50742#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50742#(<= main_~k~0 40)} is VALID [2018-11-18 22:46:09,280 INFO L273 TraceCheckUtils]: 171: Hoare triple {50742#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:09,280 INFO L273 TraceCheckUtils]: 172: Hoare triple {50743#(<= main_~k~0 41)} assume true; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:09,281 INFO L273 TraceCheckUtils]: 173: Hoare triple {50743#(<= main_~k~0 41)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:09,281 INFO L273 TraceCheckUtils]: 174: Hoare triple {50743#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50743#(<= main_~k~0 41)} is VALID [2018-11-18 22:46:09,282 INFO L273 TraceCheckUtils]: 175: Hoare triple {50743#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:09,283 INFO L273 TraceCheckUtils]: 176: Hoare triple {50744#(<= main_~k~0 42)} assume true; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:09,283 INFO L273 TraceCheckUtils]: 177: Hoare triple {50744#(<= main_~k~0 42)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:09,284 INFO L273 TraceCheckUtils]: 178: Hoare triple {50744#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50744#(<= main_~k~0 42)} is VALID [2018-11-18 22:46:09,284 INFO L273 TraceCheckUtils]: 179: Hoare triple {50744#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:09,285 INFO L273 TraceCheckUtils]: 180: Hoare triple {50745#(<= main_~k~0 43)} assume true; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:09,285 INFO L273 TraceCheckUtils]: 181: Hoare triple {50745#(<= main_~k~0 43)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:09,286 INFO L273 TraceCheckUtils]: 182: Hoare triple {50745#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {50745#(<= main_~k~0 43)} is VALID [2018-11-18 22:46:09,287 INFO L273 TraceCheckUtils]: 183: Hoare triple {50745#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {50746#(<= main_~k~0 44)} is VALID [2018-11-18 22:46:09,287 INFO L273 TraceCheckUtils]: 184: Hoare triple {50746#(<= main_~k~0 44)} assume true; {50746#(<= main_~k~0 44)} is VALID [2018-11-18 22:46:09,288 INFO L273 TraceCheckUtils]: 185: Hoare triple {50746#(<= main_~k~0 44)} assume !(~k~0 < 100000); {50700#false} is VALID [2018-11-18 22:46:09,288 INFO L273 TraceCheckUtils]: 186: Hoare triple {50700#false} assume ~s~0 != ~i~0;call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3, ~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4);havoc #t~mem3;call write~int(~tmp~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50700#false} is VALID [2018-11-18 22:46:09,288 INFO L273 TraceCheckUtils]: 187: Hoare triple {50700#false} ~x~0 := 0; {50700#false} is VALID [2018-11-18 22:46:09,288 INFO L273 TraceCheckUtils]: 188: Hoare triple {50700#false} assume true; {50700#false} is VALID [2018-11-18 22:46:09,288 INFO L273 TraceCheckUtils]: 189: Hoare triple {50700#false} assume !(~x~0 < ~i~0); {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L273 TraceCheckUtils]: 190: Hoare triple {50700#false} ~x~0 := 1 + ~i~0; {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L273 TraceCheckUtils]: 191: Hoare triple {50700#false} assume true; {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L273 TraceCheckUtils]: 192: Hoare triple {50700#false} assume !!(~x~0 < 100000);call #t~mem9 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4);call #t~mem10 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L256 TraceCheckUtils]: 193: Hoare triple {50700#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L273 TraceCheckUtils]: 194: Hoare triple {50700#false} ~cond := #in~cond; {50700#false} is VALID [2018-11-18 22:46:09,289 INFO L273 TraceCheckUtils]: 195: Hoare triple {50700#false} assume 0 == ~cond; {50700#false} is VALID [2018-11-18 22:46:09,290 INFO L273 TraceCheckUtils]: 196: Hoare triple {50700#false} assume !false; {50700#false} is VALID [2018-11-18 22:46:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2018-11-18 22:46:09,335 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 197 [2018-11-18 22:46:09,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:09,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-18 22:46:09,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:09,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-18 22:46:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-18 22:46:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 22:46:09,544 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand 50 states.