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/AutomizerCInline_WitnessPrinter.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-61f4311 [2018-11-23 11:51:45,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,407 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-23 11:51:45,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,440 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,445 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,446 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,447 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,448 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,448 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,449 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,449 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,517 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,517 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-23 11:51:45,580 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1de8ef/4c8c17816d9b4aa89b50a7f9415a4c6e/FLAG34be2e0e2 [2018-11-23 11:51:46,041 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:46,042 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-23 11:51:46,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1de8ef/4c8c17816d9b4aa89b50a7f9415a4c6e/FLAG34be2e0e2 [2018-11-23 11:51:46,368 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1de8ef/4c8c17816d9b4aa89b50a7f9415a4c6e [2018-11-23 11:51:46,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@384cb2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,687 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,694 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,745 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,774 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (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-23 11:51:47,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,006 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,007 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:51:48,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48 BoogieIcfgContainer [2018-11-23 11:51:48,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:48,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe93906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:48,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe93906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48" (3/3) ... [2018-11-23 11:51:48,017 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call2_ground.i [2018-11-23 11:51:48,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,055 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,086 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,087 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:51:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:48,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 11:51:48,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:51:48,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45#true} is VALID [2018-11-23 11:51:48,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:51:48,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 11:51:48,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 11:51:48,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {45#true} is VALID [2018-11-23 11:51:48,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:51:48,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0; {46#false} is VALID [2018-11-23 11:51:48,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {46#false} is VALID [2018-11-23 11:51:48,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#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); {46#false} is VALID [2018-11-23 11:51:48,296 INFO L256 TraceCheckUtils]: 10: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {46#false} is VALID [2018-11-23 11:51:48,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 11:51:48,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0 == ~cond; {46#false} is VALID [2018-11-23 11:51:48,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:51:48,300 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-23 11:51:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,462 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:51:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,721 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 11:51:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,722 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 11:51:48,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 11:51:49,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,291 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:51:49,291 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:51:49,305 INFO L631 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-23 11:51:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:51:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 11:51:49,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,433 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,433 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,440 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:51:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,442 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,442 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 11:51:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,448 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 11:51:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:51:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 11:51:49,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 11:51:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,456 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 11:51:49,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:51:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:49,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,458 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 11:51:49,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 11:51:49,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-23 11:51:49,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 11:51:49,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #130#return; {279#true} is VALID [2018-11-23 11:51:49,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret15 := main(); {279#true} is VALID [2018-11-23 11:51:49,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {281#(= main_~i~0 0)} is VALID [2018-11-23 11:51:49,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-23 11:51:49,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {280#false} ~x~0 := 0; {280#false} is VALID [2018-11-23 11:51:49,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {280#false} assume !!(~x~0 < 100000);~y~0 := 1 + ~x~0; {280#false} is VALID [2018-11-23 11:51:49,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {280#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); {280#false} is VALID [2018-11-23 11:51:49,548 INFO L256 TraceCheckUtils]: 10: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {280#false} is VALID [2018-11-23 11:51:49,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-23 11:51:49,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2018-11-23 11:51:49,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 11:51:49,554 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-23 11:51:49,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:49,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,594 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 11:51:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,087 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 11:51:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:51:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:51:50,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 11:51:50,242 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-23 11:51:50,246 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:51:50,247 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:50,248 INFO L631 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-23 11:51:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 11:51:50,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,279 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,279 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 11:51:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,284 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:51:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:51:50,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,286 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 11:51:50,286 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 11:51:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,292 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 11:51:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 11:51:50,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:51:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 11:51:50,297 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 11:51:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,298 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 11:51:50,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 11:51:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:50,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 11:51:50,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-23 11:51:50,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {542#true} is VALID [2018-11-23 11:51:50,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-23 11:51:50,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #130#return; {542#true} is VALID [2018-11-23 11:51:50,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret15 := main(); {542#true} is VALID [2018-11-23 11:51:50,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {544#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:50,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {544#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {545#(= main_~k~0 0)} is VALID [2018-11-23 11:51:50,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {545#(= main_~k~0 0)} assume !(~k~0 < 100000); {543#false} is VALID [2018-11-23 11:51:50,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {543#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); {543#false} is VALID [2018-11-23 11:51:50,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#false} ~x~0 := 0; {543#false} is VALID [2018-11-23 11:51:50,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {543#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {543#false} is VALID [2018-11-23 11:51:50,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {543#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); {543#false} is VALID [2018-11-23 11:51:50,508 INFO L256 TraceCheckUtils]: 12: Hoare triple {543#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {543#false} is VALID [2018-11-23 11:51:50,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {543#false} ~cond := #in~cond; {543#false} is VALID [2018-11-23 11:51:50,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {543#false} assume 0 == ~cond; {543#false} is VALID [2018-11-23 11:51:50,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {543#false} assume !false; {543#false} is VALID [2018-11-23 11:51:50,510 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-23 11:51:50,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:51:50,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:51:50,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:51:50,555 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-23 11:51:50,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:51:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:51:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:51:50,557 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 4 states. [2018-11-23 11:51:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,955 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2018-11-23 11:51:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:50,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 11:51:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:51:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:51:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:51:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 11:51:50,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 11:51:51,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,175 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:51:51,176 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:51:51,176 INFO L631 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-23 11:51:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:51:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2018-11-23 11:51:51,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2018-11-23 11:51:51,224 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2018-11-23 11:51:51,224 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2018-11-23 11:51:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,229 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 11:51:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2018-11-23 11:51:51,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,230 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2018-11-23 11:51:51,230 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2018-11-23 11:51:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,234 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 11:51:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2018-11-23 11:51:51,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:51:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-11-23 11:51:51,239 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 16 [2018-11-23 11:51:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,239 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 11:51:51,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:51:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 11:51:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:51,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 11:51:51,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {845#true} is VALID [2018-11-23 11:51:51,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {845#true} is VALID [2018-11-23 11:51:51,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2018-11-23 11:51:51,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #130#return; {845#true} is VALID [2018-11-23 11:51:51,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret15 := main(); {845#true} is VALID [2018-11-23 11:51:51,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {847#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:51,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {847#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {848#(= main_~k~0 0)} is VALID [2018-11-23 11:51:51,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#(= 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); {848#(= main_~k~0 0)} is VALID [2018-11-23 11:51:51,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {848#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {848#(= main_~k~0 0)} is VALID [2018-11-23 11:51:51,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {848#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {849#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:51,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~k~0 1)} assume !(~k~0 < 100000); {846#false} is VALID [2018-11-23 11:51:51,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#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); {846#false} is VALID [2018-11-23 11:51:51,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {846#false} ~x~0 := 0; {846#false} is VALID [2018-11-23 11:51:51,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {846#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {846#false} is VALID [2018-11-23 11:51:51,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#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); {846#false} is VALID [2018-11-23 11:51:51,359 INFO L256 TraceCheckUtils]: 15: Hoare triple {846#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {846#false} is VALID [2018-11-23 11:51:51,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2018-11-23 11:51:51,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2018-11-23 11:51:51,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {846#false} assume !false; {846#false} is VALID [2018-11-23 11:51:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,363 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-23 11:51:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {845#true} is VALID [2018-11-23 11:51:51,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {845#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {845#true} is VALID [2018-11-23 11:51:51,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2018-11-23 11:51:51,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #130#return; {845#true} is VALID [2018-11-23 11:51:51,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret15 := main(); {845#true} is VALID [2018-11-23 11:51:51,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {868#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:51,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {872#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:51,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {872#(<= 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); {872#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:51,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {872#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {872#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:51,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {872#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {849#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:51,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~k~0 1)} assume !(~k~0 < 100000); {846#false} is VALID [2018-11-23 11:51:51,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {846#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); {846#false} is VALID [2018-11-23 11:51:51,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {846#false} ~x~0 := 0; {846#false} is VALID [2018-11-23 11:51:51,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {846#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {846#false} is VALID [2018-11-23 11:51:51,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#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); {846#false} is VALID [2018-11-23 11:51:51,735 INFO L256 TraceCheckUtils]: 15: Hoare triple {846#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {846#false} is VALID [2018-11-23 11:51:51,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2018-11-23 11:51:51,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2018-11-23 11:51:51,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {846#false} assume !false; {846#false} is VALID [2018-11-23 11:51:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 11:51:51,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:51:51,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:51,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:51,850 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 7 states. [2018-11-23 11:51:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,458 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2018-11-23 11:51:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:52,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:51:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:51:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2018-11-23 11:51:52,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 123 transitions. [2018-11-23 11:51:52,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,661 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:51:52,662 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:51:52,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-23 11:51:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:51:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-11-23 11:51:52,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 42 states. [2018-11-23 11:51:52,693 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 42 states. [2018-11-23 11:51:52,694 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 42 states. [2018-11-23 11:51:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,698 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2018-11-23 11:51:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-11-23 11:51:52,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,699 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 61 states. [2018-11-23 11:51:52,699 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 61 states. [2018-11-23 11:51:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,703 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2018-11-23 11:51:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-11-23 11:51:52,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-11-23 11:51:52,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 19 [2018-11-23 11:51:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,708 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-11-23 11:51:52,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-11-23 11:51:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:51:52,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1316091959, now seen corresponding path program 2 times [2018-11-23 11:51:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2018-11-23 11:51:52,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1221#true} is VALID [2018-11-23 11:51:52,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {1221#true} assume true; {1221#true} is VALID [2018-11-23 11:51:52,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1221#true} {1221#true} #130#return; {1221#true} is VALID [2018-11-23 11:51:52,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {1221#true} call #t~ret15 := main(); {1221#true} is VALID [2018-11-23 11:51:52,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {1221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1223#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:52,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {1223#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1224#(= main_~k~0 0)} is VALID [2018-11-23 11:51:52,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {1224#(= 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); {1224#(= main_~k~0 0)} is VALID [2018-11-23 11:51:52,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {1224#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1224#(= main_~k~0 0)} is VALID [2018-11-23 11:51:52,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {1224#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1225#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {1225#(<= 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); {1225#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {1225#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1225#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:52,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {1225#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1226#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:52,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#(<= main_~k~0 2)} assume !(~k~0 < 100000); {1222#false} is VALID [2018-11-23 11:51:52,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {1222#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); {1222#false} is VALID [2018-11-23 11:51:52,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {1222#false} ~x~0 := 0; {1222#false} is VALID [2018-11-23 11:51:52,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {1222#false} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1222#false} is VALID [2018-11-23 11:51:52,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {1222#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); {1222#false} is VALID [2018-11-23 11:51:52,888 INFO L256 TraceCheckUtils]: 18: Hoare triple {1222#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1222#false} is VALID [2018-11-23 11:51:52,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2018-11-23 11:51:52,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2018-11-23 11:51:52,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2018-11-23 11:51:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:52,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,890 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-23 11:51:52,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:51:52,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2018-11-23 11:51:53,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1221#true} is VALID [2018-11-23 11:51:53,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {1221#true} assume true; {1221#true} is VALID [2018-11-23 11:51:53,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1221#true} {1221#true} #130#return; {1221#true} is VALID [2018-11-23 11:51:53,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {1221#true} call #t~ret15 := main(); {1221#true} is VALID [2018-11-23 11:51:53,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {1221#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {1245#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {1245#(<= 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); {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {1245#(<= main_~i~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {1245#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {1245#(<= 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); {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(<= main_~i~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(<= main_~i~0 0)} ~k~0 := 1 + ~k~0; {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {1245#(<= main_~i~0 0)} assume !(~k~0 < 100000); {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {1245#(<= 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); {1245#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {1245#(<= main_~i~0 0)} ~x~0 := 0; {1276#(and (<= main_~i~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 11:51:53,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {1276#(and (<= main_~i~0 0) (<= 0 main_~x~0))} assume !!(~x~0 < ~i~0);~y~0 := 1 + ~x~0; {1222#false} is VALID [2018-11-23 11:51:53,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {1222#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); {1222#false} is VALID [2018-11-23 11:51:53,100 INFO L256 TraceCheckUtils]: 18: Hoare triple {1222#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1222#false} is VALID [2018-11-23 11:51:53,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2018-11-23 11:51:53,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2018-11-23 11:51:53,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2018-11-23 11:51:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:51:53,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:51:53,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 11:51:53,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:51:53,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:53,166 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-23 11:51:53,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,168 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2018-11-23 11:51:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,775 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-23 11:51:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:53,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:51:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:51:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-23 11:51:53,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-23 11:51:53,984 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-23 11:51:53,985 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:51:53,985 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:51:53,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:51:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-11-23 11:51:54,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 51 states. [2018-11-23 11:51:54,027 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 51 states. [2018-11-23 11:51:54,027 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 51 states. [2018-11-23 11:51:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,031 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2018-11-23 11:51:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2018-11-23 11:51:54,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,032 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 59 states. [2018-11-23 11:51:54,032 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 59 states. [2018-11-23 11:51:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,036 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2018-11-23 11:51:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2018-11-23 11:51:54,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:51:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2018-11-23 11:51:54,040 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 22 [2018-11-23 11:51:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,040 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2018-11-23 11:51:54,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2018-11-23 11:51:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:51:54,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,042 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,042 INFO L82 PathProgramCache]: Analyzing trace with hash 335283198, now seen corresponding path program 1 times [2018-11-23 11:51:54,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2018-11-23 11:51:54,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {1616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1616#true} is VALID [2018-11-23 11:51:54,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2018-11-23 11:51:54,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #130#return; {1616#true} is VALID [2018-11-23 11:51:54,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret15 := main(); {1616#true} is VALID [2018-11-23 11:51:54,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {1616#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1618#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:54,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1618#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1619#(= main_~k~0 0)} is VALID [2018-11-23 11:51:54,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {1619#(= 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); {1619#(= main_~k~0 0)} is VALID [2018-11-23 11:51:54,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {1619#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1619#(= main_~k~0 0)} is VALID [2018-11-23 11:51:54,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {1619#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {1620#(<= 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); {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {1620#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {1621#(<= 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); {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {1621#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {1621#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {1622#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:54,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {1622#(<= main_~k~0 3)} assume !(~k~0 < 100000); {1617#false} is VALID [2018-11-23 11:51:54,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {1617#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); {1617#false} is VALID [2018-11-23 11:51:54,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {1617#false} ~x~0 := 0; {1617#false} is VALID [2018-11-23 11:51:54,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {1617#false} assume !(~x~0 < ~i~0); {1617#false} is VALID [2018-11-23 11:51:54,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {1617#false} ~x~0 := 1 + ~i~0; {1617#false} is VALID [2018-11-23 11:51:54,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1617#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); {1617#false} is VALID [2018-11-23 11:51:54,199 INFO L256 TraceCheckUtils]: 22: Hoare triple {1617#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {1617#false} is VALID [2018-11-23 11:51:54,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2018-11-23 11:51:54,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2018-11-23 11:51:54,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2018-11-23 11:51:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,203 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-23 11:51:54,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {1616#true} call ULTIMATE.init(); {1616#true} is VALID [2018-11-23 11:51:54,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {1616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1616#true} is VALID [2018-11-23 11:51:54,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {1616#true} assume true; {1616#true} is VALID [2018-11-23 11:51:54,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1616#true} {1616#true} #130#return; {1616#true} is VALID [2018-11-23 11:51:54,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {1616#true} call #t~ret15 := main(); {1616#true} is VALID [2018-11-23 11:51:54,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {1616#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {1641#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:54,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {1641#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {1645#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:54,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {1645#(<= 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); {1645#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:54,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {1645#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1645#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:54,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {1620#(<= 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); {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {1620#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1620#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:54,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {1621#(<= 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); {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {1621#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1621#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:54,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {1621#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {1622#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {1622#(<= main_~k~0 3)} assume !(~k~0 < 100000); {1617#false} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {1617#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); {1617#false} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {1617#false} ~x~0 := 0; {1617#false} is VALID [2018-11-23 11:51:54,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {1617#false} assume !(~x~0 < ~i~0); {1617#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {1617#false} ~x~0 := 1 + ~i~0; {1617#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {1617#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); {1617#false} is VALID [2018-11-23 11:51:54,465 INFO L256 TraceCheckUtils]: 22: Hoare triple {1617#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {1617#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {1617#false} ~cond := #in~cond; {1617#false} is VALID [2018-11-23 11:51:54,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {1617#false} assume 0 == ~cond; {1617#false} is VALID [2018-11-23 11:51:54,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {1617#false} assume !false; {1617#false} is VALID [2018-11-23 11:51:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-23 11:51:54,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:51:54,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:54,562 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-23 11:51:54,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:54,563 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 9 states. [2018-11-23 11:51:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,384 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2018-11-23 11:51:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:55,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:51:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:51:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 11:51:55,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2018-11-23 11:51:55,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:55,560 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:51:55,561 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:51:55,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:51:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:51:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-23 11:51:55,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:55,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 54 states. [2018-11-23 11:51:55,589 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 54 states. [2018-11-23 11:51:55,589 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 54 states. [2018-11-23 11:51:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,592 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 11:51:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2018-11-23 11:51:55,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,593 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 62 states. [2018-11-23 11:51:55,593 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 62 states. [2018-11-23 11:51:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,597 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 11:51:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2018-11-23 11:51:55,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:55,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:51:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2018-11-23 11:51:55,600 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 26 [2018-11-23 11:51:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:55,601 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2018-11-23 11:51:55,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2018-11-23 11:51:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:55,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:55,602 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:55,602 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:55,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 2 times [2018-11-23 11:51:55,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {2042#true} call ULTIMATE.init(); {2042#true} is VALID [2018-11-23 11:51:55,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {2042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2042#true} is VALID [2018-11-23 11:51:55,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {2042#true} assume true; {2042#true} is VALID [2018-11-23 11:51:55,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2042#true} {2042#true} #130#return; {2042#true} is VALID [2018-11-23 11:51:55,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {2042#true} call #t~ret15 := main(); {2042#true} is VALID [2018-11-23 11:51:55,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {2042#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2044#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:55,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {2044#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2045#(= main_~k~0 0)} is VALID [2018-11-23 11:51:55,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {2045#(= 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); {2045#(= main_~k~0 0)} is VALID [2018-11-23 11:51:55,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {2045#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2045#(= main_~k~0 0)} is VALID [2018-11-23 11:51:55,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {2045#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {2046#(<= 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); {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {2046#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:55,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {2046#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {2047#(<= 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); {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {2047#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:55,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {2048#(<= 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); {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {2048#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:55,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {2048#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2049#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:55,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {2049#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2043#false} is VALID [2018-11-23 11:51:55,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {2043#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); {2043#false} is VALID [2018-11-23 11:51:55,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2043#false} ~x~0 := 0; {2043#false} is VALID [2018-11-23 11:51:55,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {2043#false} assume !(~x~0 < ~i~0); {2043#false} is VALID [2018-11-23 11:51:55,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {2043#false} ~x~0 := 1 + ~i~0; {2043#false} is VALID [2018-11-23 11:51:55,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {2043#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); {2043#false} is VALID [2018-11-23 11:51:55,843 INFO L256 TraceCheckUtils]: 25: Hoare triple {2043#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2043#false} is VALID [2018-11-23 11:51:55,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {2043#false} ~cond := #in~cond; {2043#false} is VALID [2018-11-23 11:51:55,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {2043#false} assume 0 == ~cond; {2043#false} is VALID [2018-11-23 11:51:55,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {2043#false} assume !false; {2043#false} is VALID [2018-11-23 11:51:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,845 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-23 11:51:55,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:55,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:55,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:56,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {2042#true} call ULTIMATE.init(); {2042#true} is VALID [2018-11-23 11:51:56,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {2042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2042#true} is VALID [2018-11-23 11:51:56,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {2042#true} assume true; {2042#true} is VALID [2018-11-23 11:51:56,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2042#true} {2042#true} #130#return; {2042#true} is VALID [2018-11-23 11:51:56,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {2042#true} call #t~ret15 := main(); {2042#true} is VALID [2018-11-23 11:51:56,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {2042#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2068#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:56,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {2068#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2072#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:56,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {2072#(<= 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); {2072#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:56,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {2072#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2072#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:56,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {2072#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:56,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {2046#(<= 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); {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:56,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {2046#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2046#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:56,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {2046#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:56,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {2047#(<= 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); {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:56,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {2047#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2047#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:56,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:56,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {2048#(<= 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); {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:56,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {2048#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2048#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:56,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {2048#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2049#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:56,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {2049#(<= main_~k~0 4)} assume !(~k~0 < 100000); {2043#false} is VALID [2018-11-23 11:51:56,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {2043#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); {2043#false} is VALID [2018-11-23 11:51:56,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {2043#false} ~x~0 := 0; {2043#false} is VALID [2018-11-23 11:51:56,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {2043#false} assume !(~x~0 < ~i~0); {2043#false} is VALID [2018-11-23 11:51:56,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {2043#false} ~x~0 := 1 + ~i~0; {2043#false} is VALID [2018-11-23 11:51:56,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {2043#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); {2043#false} is VALID [2018-11-23 11:51:56,134 INFO L256 TraceCheckUtils]: 25: Hoare triple {2043#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2043#false} is VALID [2018-11-23 11:51:56,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {2043#false} ~cond := #in~cond; {2043#false} is VALID [2018-11-23 11:51:56,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {2043#false} assume 0 == ~cond; {2043#false} is VALID [2018-11-23 11:51:56,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {2043#false} assume !false; {2043#false} is VALID [2018-11-23 11:51:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:56,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:56,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 11:51:56,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-23 11:51:56,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:56,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:51:56,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:51:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:51:56,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:56,188 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 10 states. [2018-11-23 11:51:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,015 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-11-23 11:51:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:57,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-23 11:51:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2018-11-23 11:51:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2018-11-23 11:51:57,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 127 transitions. [2018-11-23 11:51:57,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,149 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:51:57,149 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:51:57,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 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-23 11:51:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:51:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-11-23 11:51:57,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:57,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 57 states. [2018-11-23 11:51:57,190 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 57 states. [2018-11-23 11:51:57,190 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 57 states. [2018-11-23 11:51:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,193 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2018-11-23 11:51:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2018-11-23 11:51:57,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,194 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 65 states. [2018-11-23 11:51:57,194 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 65 states. [2018-11-23 11:51:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,197 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2018-11-23 11:51:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2018-11-23 11:51:57,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:57,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:51:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-11-23 11:51:57,200 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 29 [2018-11-23 11:51:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:57,200 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-11-23 11:51:57,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:51:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-11-23 11:51:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:51:57,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:57,201 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:57,202 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:57,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1134942690, now seen corresponding path program 3 times [2018-11-23 11:51:57,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:57,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:57,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {2494#true} call ULTIMATE.init(); {2494#true} is VALID [2018-11-23 11:51:57,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {2494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2494#true} is VALID [2018-11-23 11:51:57,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2018-11-23 11:51:57,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #130#return; {2494#true} is VALID [2018-11-23 11:51:57,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {2494#true} call #t~ret15 := main(); {2494#true} is VALID [2018-11-23 11:51:57,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {2494#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2496#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:57,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {2496#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2497#(= main_~k~0 0)} is VALID [2018-11-23 11:51:57,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {2497#(= 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); {2497#(= main_~k~0 0)} is VALID [2018-11-23 11:51:57,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {2497#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2497#(= main_~k~0 0)} is VALID [2018-11-23 11:51:57,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {2497#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {2498#(<= 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); {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {2498#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {2498#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {2499#(<= 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); {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {2499#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {2499#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {2500#(<= 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); {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {2500#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {2500#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {2501#(<= 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); {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {2501#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {2501#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2502#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:57,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {2502#(<= main_~k~0 5)} assume !(~k~0 < 100000); {2495#false} is VALID [2018-11-23 11:51:57,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {2495#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); {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {2495#false} ~x~0 := 0; {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {2495#false} assume !(~x~0 < ~i~0); {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {2495#false} ~x~0 := 1 + ~i~0; {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {2495#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); {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L256 TraceCheckUtils]: 28: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2495#false} is VALID [2018-11-23 11:51:57,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {2495#false} ~cond := #in~cond; {2495#false} is VALID [2018-11-23 11:51:57,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {2495#false} assume 0 == ~cond; {2495#false} is VALID [2018-11-23 11:51:57,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2018-11-23 11:51:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:57,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:57,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 11:51:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:57,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:51:57,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {2494#true} call ULTIMATE.init(); {2494#true} is VALID [2018-11-23 11:51:57,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {2494#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2494#true} is VALID [2018-11-23 11:51:57,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2018-11-23 11:51:57,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #130#return; {2494#true} is VALID [2018-11-23 11:51:57,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {2494#true} call #t~ret15 := main(); {2494#true} is VALID [2018-11-23 11:51:57,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {2494#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2521#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:57,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {2521#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2525#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:57,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {2525#(<= 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); {2525#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:57,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {2525#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2525#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:57,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {2525#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,596 INFO L273 TraceCheckUtils]: 10: Hoare triple {2498#(<= 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); {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,597 INFO L273 TraceCheckUtils]: 11: Hoare triple {2498#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2498#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:57,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {2498#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {2499#(<= 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); {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {2499#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2499#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:57,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {2499#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {2500#(<= 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); {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,601 INFO L273 TraceCheckUtils]: 17: Hoare triple {2500#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2500#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:57,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {2500#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {2501#(<= 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); {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {2501#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2501#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:57,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {2501#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2502#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:57,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {2502#(<= main_~k~0 5)} assume !(~k~0 < 100000); {2495#false} is VALID [2018-11-23 11:51:57,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {2495#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); {2495#false} is VALID [2018-11-23 11:51:57,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {2495#false} ~x~0 := 0; {2495#false} is VALID [2018-11-23 11:51:57,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {2495#false} assume !(~x~0 < ~i~0); {2495#false} is VALID [2018-11-23 11:51:57,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {2495#false} ~x~0 := 1 + ~i~0; {2495#false} is VALID [2018-11-23 11:51:57,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {2495#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); {2495#false} is VALID [2018-11-23 11:51:57,606 INFO L256 TraceCheckUtils]: 28: Hoare triple {2495#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2495#false} is VALID [2018-11-23 11:51:57,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {2495#false} ~cond := #in~cond; {2495#false} is VALID [2018-11-23 11:51:57,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {2495#false} assume 0 == ~cond; {2495#false} is VALID [2018-11-23 11:51:57,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2018-11-23 11:51:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:57,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-23 11:51:57,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 11:51:57,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:57,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:57,664 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 11 states. [2018-11-23 11:51:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,391 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2018-11-23 11:51:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:58,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 11:51:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:51:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:51:58,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2018-11-23 11:51:58,552 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-23 11:51:58,554 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:51:58,555 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:51:58,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-23 11:51:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:51:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-11-23 11:51:58,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 60 states. [2018-11-23 11:51:58,584 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 60 states. [2018-11-23 11:51:58,584 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 60 states. [2018-11-23 11:51:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,589 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2018-11-23 11:51:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2018-11-23 11:51:58,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,589 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 68 states. [2018-11-23 11:51:58,589 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 68 states. [2018-11-23 11:51:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,592 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2018-11-23 11:51:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2018-11-23 11:51:58,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:51:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2018-11-23 11:51:58,595 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 32 [2018-11-23 11:51:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,595 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2018-11-23 11:51:58,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2018-11-23 11:51:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:51:58,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,597 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,597 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1028894311, now seen corresponding path program 4 times [2018-11-23 11:51:58,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:58,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {2972#true} call ULTIMATE.init(); {2972#true} is VALID [2018-11-23 11:51:58,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {2972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2972#true} is VALID [2018-11-23 11:51:58,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {2972#true} assume true; {2972#true} is VALID [2018-11-23 11:51:58,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2972#true} {2972#true} #130#return; {2972#true} is VALID [2018-11-23 11:51:58,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {2972#true} call #t~ret15 := main(); {2972#true} is VALID [2018-11-23 11:51:58,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {2972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {2974#(= 0 main_~i~0)} is VALID [2018-11-23 11:51:58,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {2974#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {2975#(= main_~k~0 0)} is VALID [2018-11-23 11:51:58,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {2975#(= 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); {2975#(= main_~k~0 0)} is VALID [2018-11-23 11:51:58,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {2975#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2975#(= main_~k~0 0)} is VALID [2018-11-23 11:51:58,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {2975#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {2976#(<= 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); {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {2976#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {2976#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(<= 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); {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {2977#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {2977#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {2978#(<= 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); {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {2978#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,812 INFO L273 TraceCheckUtils]: 18: Hoare triple {2978#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {2979#(<= 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); {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {2979#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {2979#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,813 INFO L273 TraceCheckUtils]: 22: Hoare triple {2980#(<= 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); {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {2980#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {2980#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {2981#(<= main_~k~0 6)} is VALID [2018-11-23 11:51:58,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {2981#(<= main_~k~0 6)} assume !(~k~0 < 100000); {2973#false} is VALID [2018-11-23 11:51:58,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {2973#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); {2973#false} is VALID [2018-11-23 11:51:58,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {2973#false} ~x~0 := 0; {2973#false} is VALID [2018-11-23 11:51:58,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {2973#false} assume !(~x~0 < ~i~0); {2973#false} is VALID [2018-11-23 11:51:58,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {2973#false} ~x~0 := 1 + ~i~0; {2973#false} is VALID [2018-11-23 11:51:58,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {2973#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); {2973#false} is VALID [2018-11-23 11:51:58,817 INFO L256 TraceCheckUtils]: 31: Hoare triple {2973#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2973#false} is VALID [2018-11-23 11:51:58,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2973#false} ~cond := #in~cond; {2973#false} is VALID [2018-11-23 11:51:58,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {2973#false} assume 0 == ~cond; {2973#false} is VALID [2018-11-23 11:51:58,818 INFO L273 TraceCheckUtils]: 34: Hoare triple {2973#false} assume !false; {2973#false} is VALID [2018-11-23 11:51:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:58,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,820 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-23 11:51:58,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:58,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:58,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {2972#true} call ULTIMATE.init(); {2972#true} is VALID [2018-11-23 11:51:58,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {2972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2972#true} is VALID [2018-11-23 11:51:58,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {2972#true} assume true; {2972#true} is VALID [2018-11-23 11:51:58,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2972#true} {2972#true} #130#return; {2972#true} is VALID [2018-11-23 11:51:58,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {2972#true} call #t~ret15 := main(); {2972#true} is VALID [2018-11-23 11:51:58,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {2972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3000#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:58,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {3000#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3004#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:58,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {3004#(<= 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); {3004#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:58,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {3004#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3004#(<= main_~k~0 0)} is VALID [2018-11-23 11:51:58,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {3004#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {2976#(<= 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); {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {2976#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2976#(<= main_~k~0 1)} is VALID [2018-11-23 11:51:58,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {2976#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(<= 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); {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {2977#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2977#(<= main_~k~0 2)} is VALID [2018-11-23 11:51:58,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {2977#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {2978#(<= 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); {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {2978#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2978#(<= main_~k~0 3)} is VALID [2018-11-23 11:51:58,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {2978#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {2979#(<= 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); {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {2979#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2979#(<= main_~k~0 4)} is VALID [2018-11-23 11:51:58,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {2979#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {2980#(<= 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); {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {2980#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2980#(<= main_~k~0 5)} is VALID [2018-11-23 11:51:58,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {2980#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {2981#(<= main_~k~0 6)} is VALID [2018-11-23 11:51:58,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {2981#(<= main_~k~0 6)} assume !(~k~0 < 100000); {2973#false} is VALID [2018-11-23 11:51:58,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {2973#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); {2973#false} is VALID [2018-11-23 11:51:58,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {2973#false} ~x~0 := 0; {2973#false} is VALID [2018-11-23 11:51:58,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {2973#false} assume !(~x~0 < ~i~0); {2973#false} is VALID [2018-11-23 11:51:58,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {2973#false} ~x~0 := 1 + ~i~0; {2973#false} is VALID [2018-11-23 11:51:58,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {2973#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); {2973#false} is VALID [2018-11-23 11:51:58,977 INFO L256 TraceCheckUtils]: 31: Hoare triple {2973#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {2973#false} is VALID [2018-11-23 11:51:58,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {2973#false} ~cond := #in~cond; {2973#false} is VALID [2018-11-23 11:51:58,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {2973#false} assume 0 == ~cond; {2973#false} is VALID [2018-11-23 11:51:58,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {2973#false} assume !false; {2973#false} is VALID [2018-11-23 11:51:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:59,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-23 11:51:59,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:51:59,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:59,078 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-23 11:51:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,079 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 12 states. [2018-11-23 11:51:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,687 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2018-11-23 11:51:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:51:59,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:51:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:51:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2018-11-23 11:51:59,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2018-11-23 11:51:59,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,840 INFO L225 Difference]: With dead ends: 105 [2018-11-23 11:51:59,840 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:51:59,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:51:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:51:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-11-23 11:51:59,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:59,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 63 states. [2018-11-23 11:51:59,881 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 63 states. [2018-11-23 11:51:59,882 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 63 states. [2018-11-23 11:51:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,886 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2018-11-23 11:51:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2018-11-23 11:51:59,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,887 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 71 states. [2018-11-23 11:51:59,887 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 71 states. [2018-11-23 11:51:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,889 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2018-11-23 11:51:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2018-11-23 11:51:59,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:59,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:51:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2018-11-23 11:51:59,892 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 35 [2018-11-23 11:51:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:59,893 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2018-11-23 11:51:59,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2018-11-23 11:51:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:51:59,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:59,894 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:59,894 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:59,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1457401918, now seen corresponding path program 5 times [2018-11-23 11:51:59,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:59,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {3476#true} call ULTIMATE.init(); {3476#true} is VALID [2018-11-23 11:52:00,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {3476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3476#true} is VALID [2018-11-23 11:52:00,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {3476#true} assume true; {3476#true} is VALID [2018-11-23 11:52:00,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3476#true} {3476#true} #130#return; {3476#true} is VALID [2018-11-23 11:52:00,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {3476#true} call #t~ret15 := main(); {3476#true} is VALID [2018-11-23 11:52:00,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {3476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3478#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:00,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {3478#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3479#(= main_~k~0 0)} is VALID [2018-11-23 11:52:00,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {3479#(= 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); {3479#(= main_~k~0 0)} is VALID [2018-11-23 11:52:00,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {3479#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3479#(= main_~k~0 0)} is VALID [2018-11-23 11:52:00,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {3479#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {3480#(<= 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); {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {3480#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {3480#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {3481#(<= 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); {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {3481#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {3481#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {3482#(<= 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); {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {3482#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {3482#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {3483#(<= 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); {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {3483#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {3483#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {3484#(<= 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); {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {3484#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {3484#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {3485#(<= 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); {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,088 INFO L273 TraceCheckUtils]: 26: Hoare triple {3485#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {3485#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {3486#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:00,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {3486#(<= main_~k~0 7)} assume !(~k~0 < 100000); {3477#false} is VALID [2018-11-23 11:52:00,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {3477#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); {3477#false} is VALID [2018-11-23 11:52:00,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {3477#false} ~x~0 := 0; {3477#false} is VALID [2018-11-23 11:52:00,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {3477#false} assume !(~x~0 < ~i~0); {3477#false} is VALID [2018-11-23 11:52:00,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {3477#false} ~x~0 := 1 + ~i~0; {3477#false} is VALID [2018-11-23 11:52:00,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {3477#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); {3477#false} is VALID [2018-11-23 11:52:00,090 INFO L256 TraceCheckUtils]: 34: Hoare triple {3477#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3477#false} is VALID [2018-11-23 11:52:00,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {3477#false} ~cond := #in~cond; {3477#false} is VALID [2018-11-23 11:52:00,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {3477#false} assume 0 == ~cond; {3477#false} is VALID [2018-11-23 11:52:00,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {3477#false} assume !false; {3477#false} is VALID [2018-11-23 11:52:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:00,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,093 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-23 11:52:00,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:00,230 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 11:52:00,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:00,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {3476#true} call ULTIMATE.init(); {3476#true} is VALID [2018-11-23 11:52:00,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {3476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3476#true} is VALID [2018-11-23 11:52:00,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {3476#true} assume true; {3476#true} is VALID [2018-11-23 11:52:00,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3476#true} {3476#true} #130#return; {3476#true} is VALID [2018-11-23 11:52:00,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {3476#true} call #t~ret15 := main(); {3476#true} is VALID [2018-11-23 11:52:00,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {3476#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {3505#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:00,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {3505#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {3509#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:00,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {3509#(<= 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); {3509#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:00,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {3509#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3509#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:00,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {3509#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {3480#(<= 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); {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {3480#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3480#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:00,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {3480#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {3481#(<= 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); {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {3481#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3481#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:00,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {3481#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {3482#(<= 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); {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {3482#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3482#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {3482#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {3483#(<= 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); {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {3483#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3483#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:00,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {3483#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {3484#(<= 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); {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {3484#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3484#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:00,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {3484#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {3485#(<= 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); {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,626 INFO L273 TraceCheckUtils]: 26: Hoare triple {3485#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3485#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:00,627 INFO L273 TraceCheckUtils]: 27: Hoare triple {3485#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {3486#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:00,627 INFO L273 TraceCheckUtils]: 28: Hoare triple {3486#(<= main_~k~0 7)} assume !(~k~0 < 100000); {3477#false} is VALID [2018-11-23 11:52:00,627 INFO L273 TraceCheckUtils]: 29: Hoare triple {3477#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); {3477#false} is VALID [2018-11-23 11:52:00,628 INFO L273 TraceCheckUtils]: 30: Hoare triple {3477#false} ~x~0 := 0; {3477#false} is VALID [2018-11-23 11:52:00,628 INFO L273 TraceCheckUtils]: 31: Hoare triple {3477#false} assume !(~x~0 < ~i~0); {3477#false} is VALID [2018-11-23 11:52:00,628 INFO L273 TraceCheckUtils]: 32: Hoare triple {3477#false} ~x~0 := 1 + ~i~0; {3477#false} is VALID [2018-11-23 11:52:00,628 INFO L273 TraceCheckUtils]: 33: Hoare triple {3477#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); {3477#false} is VALID [2018-11-23 11:52:00,629 INFO L256 TraceCheckUtils]: 34: Hoare triple {3477#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {3477#false} is VALID [2018-11-23 11:52:00,629 INFO L273 TraceCheckUtils]: 35: Hoare triple {3477#false} ~cond := #in~cond; {3477#false} is VALID [2018-11-23 11:52:00,629 INFO L273 TraceCheckUtils]: 36: Hoare triple {3477#false} assume 0 == ~cond; {3477#false} is VALID [2018-11-23 11:52:00,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {3477#false} assume !false; {3477#false} is VALID [2018-11-23 11:52:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:00,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:00,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 11:52:00,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:52:00,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:00,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:00,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:00,693 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 13 states. [2018-11-23 11:52:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,497 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2018-11-23 11:52:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:01,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:52:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:52:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2018-11-23 11:52:01,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 139 transitions. [2018-11-23 11:52:01,682 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-23 11:52:01,684 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:52:01,685 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:52:01,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:52:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-11-23 11:52:01,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:01,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 66 states. [2018-11-23 11:52:01,771 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 66 states. [2018-11-23 11:52:01,771 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 66 states. [2018-11-23 11:52:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,774 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2018-11-23 11:52:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2018-11-23 11:52:01,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:01,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:01,775 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 74 states. [2018-11-23 11:52:01,775 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 74 states. [2018-11-23 11:52:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,777 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2018-11-23 11:52:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2018-11-23 11:52:01,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:01,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:01,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:01,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:52:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2018-11-23 11:52:01,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 38 [2018-11-23 11:52:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:01,781 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-11-23 11:52:01,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2018-11-23 11:52:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:52:01,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:01,782 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:01,782 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:01,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash -297626759, now seen corresponding path program 6 times [2018-11-23 11:52:01,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {4006#true} call ULTIMATE.init(); {4006#true} is VALID [2018-11-23 11:52:02,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {4006#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4006#true} is VALID [2018-11-23 11:52:02,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {4006#true} assume true; {4006#true} is VALID [2018-11-23 11:52:02,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4006#true} {4006#true} #130#return; {4006#true} is VALID [2018-11-23 11:52:02,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {4006#true} call #t~ret15 := main(); {4006#true} is VALID [2018-11-23 11:52:02,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {4006#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4008#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:02,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {4008#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4009#(= main_~k~0 0)} is VALID [2018-11-23 11:52:02,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {4009#(= 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); {4009#(= main_~k~0 0)} is VALID [2018-11-23 11:52:02,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {4009#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4009#(= main_~k~0 0)} is VALID [2018-11-23 11:52:02,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {4009#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {4010#(<= 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); {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {4010#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {4010#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {4011#(<= 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); {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {4011#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {4011#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {4012#(<= 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); {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {4012#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {4012#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {4013#(<= 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); {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {4013#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {4013#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {4014#(<= 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); {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {4014#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {4014#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {4015#(<= 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); {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {4015#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {4015#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#(<= 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); {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {4016#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4017#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:02,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {4017#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4007#false} is VALID [2018-11-23 11:52:02,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {4007#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); {4007#false} is VALID [2018-11-23 11:52:02,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {4007#false} ~x~0 := 0; {4007#false} is VALID [2018-11-23 11:52:02,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {4007#false} assume !(~x~0 < ~i~0); {4007#false} is VALID [2018-11-23 11:52:02,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {4007#false} ~x~0 := 1 + ~i~0; {4007#false} is VALID [2018-11-23 11:52:02,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {4007#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); {4007#false} is VALID [2018-11-23 11:52:02,042 INFO L256 TraceCheckUtils]: 37: Hoare triple {4007#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4007#false} is VALID [2018-11-23 11:52:02,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {4007#false} ~cond := #in~cond; {4007#false} is VALID [2018-11-23 11:52:02,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {4007#false} assume 0 == ~cond; {4007#false} is VALID [2018-11-23 11:52:02,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {4007#false} assume !false; {4007#false} is VALID [2018-11-23 11:52:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,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 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-23 11:52:02,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:02,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 11:52:02,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:02,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {4006#true} call ULTIMATE.init(); {4006#true} is VALID [2018-11-23 11:52:02,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {4006#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4006#true} is VALID [2018-11-23 11:52:02,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {4006#true} assume true; {4006#true} is VALID [2018-11-23 11:52:02,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4006#true} {4006#true} #130#return; {4006#true} is VALID [2018-11-23 11:52:02,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {4006#true} call #t~ret15 := main(); {4006#true} is VALID [2018-11-23 11:52:02,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {4006#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4036#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:02,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {4036#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4040#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:02,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {4040#(<= 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); {4040#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:02,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {4040#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4040#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:02,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {4040#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {4010#(<= 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); {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {4010#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4010#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:02,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {4010#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {4011#(<= 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); {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {4011#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4011#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:02,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {4011#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {4012#(<= 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); {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {4012#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4012#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:02,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {4012#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {4013#(<= 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); {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {4013#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4013#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:02,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {4013#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {4014#(<= 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); {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {4014#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4014#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:02,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {4014#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {4015#(<= 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); {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {4015#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4015#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:02,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {4015#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#(<= 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); {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4016#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:02,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {4016#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4017#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:02,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {4017#(<= main_~k~0 8)} assume !(~k~0 < 100000); {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {4007#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); {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {4007#false} ~x~0 := 0; {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {4007#false} assume !(~x~0 < ~i~0); {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {4007#false} ~x~0 := 1 + ~i~0; {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {4007#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); {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L256 TraceCheckUtils]: 37: Hoare triple {4007#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {4007#false} ~cond := #in~cond; {4007#false} is VALID [2018-11-23 11:52:02,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {4007#false} assume 0 == ~cond; {4007#false} is VALID [2018-11-23 11:52:02,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {4007#false} assume !false; {4007#false} is VALID [2018-11-23 11:52:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-11-23 11:52:02,305 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-23 11:52:02,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:02,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:02,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:02,352 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand 14 states. [2018-11-23 11:52:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,215 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2018-11-23 11:52:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:52:03,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-23 11:52:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 11:52:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2018-11-23 11:52:03,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2018-11-23 11:52:03,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,852 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:52:03,852 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:52:03,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:52:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-11-23 11:52:04,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:04,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 69 states. [2018-11-23 11:52:04,333 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 69 states. [2018-11-23 11:52:04,333 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 69 states. [2018-11-23 11:52:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,339 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2018-11-23 11:52:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-23 11:52:04,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,340 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 77 states. [2018-11-23 11:52:04,340 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 77 states. [2018-11-23 11:52:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,342 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2018-11-23 11:52:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-23 11:52:04,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:04,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:52:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2018-11-23 11:52:04,344 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 41 [2018-11-23 11:52:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:04,345 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2018-11-23 11:52:04,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2018-11-23 11:52:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:52:04,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:04,346 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:04,346 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:04,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1720049058, now seen corresponding path program 7 times [2018-11-23 11:52:04,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {4562#true} call ULTIMATE.init(); {4562#true} is VALID [2018-11-23 11:52:04,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {4562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4562#true} is VALID [2018-11-23 11:52:04,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {4562#true} assume true; {4562#true} is VALID [2018-11-23 11:52:04,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4562#true} {4562#true} #130#return; {4562#true} is VALID [2018-11-23 11:52:04,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {4562#true} call #t~ret15 := main(); {4562#true} is VALID [2018-11-23 11:52:04,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {4562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4564#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:04,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {4564#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4565#(= main_~k~0 0)} is VALID [2018-11-23 11:52:04,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {4565#(= 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); {4565#(= main_~k~0 0)} is VALID [2018-11-23 11:52:04,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {4565#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4565#(= main_~k~0 0)} is VALID [2018-11-23 11:52:04,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {4565#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {4566#(<= 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); {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {4566#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {4566#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {4567#(<= 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); {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {4567#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {4567#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {4568#(<= 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); {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {4568#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {4568#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:04,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {4569#(<= 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); {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:04,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {4569#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:04,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {4569#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:04,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {4570#(<= 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); {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:04,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {4570#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:04,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {4570#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:04,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {4571#(<= 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); {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:04,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {4571#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:04,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {4571#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:04,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {4572#(<= 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); {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:04,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {4572#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:04,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {4572#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:04,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {4573#(<= 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); {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:04,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {4573#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:04,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {4573#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {4574#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:04,663 INFO L273 TraceCheckUtils]: 34: Hoare triple {4574#(<= main_~k~0 9)} assume !(~k~0 < 100000); {4563#false} is VALID [2018-11-23 11:52:04,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {4563#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); {4563#false} is VALID [2018-11-23 11:52:04,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {4563#false} ~x~0 := 0; {4563#false} is VALID [2018-11-23 11:52:04,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {4563#false} assume !(~x~0 < ~i~0); {4563#false} is VALID [2018-11-23 11:52:04,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {4563#false} ~x~0 := 1 + ~i~0; {4563#false} is VALID [2018-11-23 11:52:04,664 INFO L273 TraceCheckUtils]: 39: Hoare triple {4563#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); {4563#false} is VALID [2018-11-23 11:52:04,664 INFO L256 TraceCheckUtils]: 40: Hoare triple {4563#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4563#false} is VALID [2018-11-23 11:52:04,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {4563#false} ~cond := #in~cond; {4563#false} is VALID [2018-11-23 11:52:04,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {4563#false} assume 0 == ~cond; {4563#false} is VALID [2018-11-23 11:52:04,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {4563#false} assume !false; {4563#false} is VALID [2018-11-23 11:52:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:04,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:04,666 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-23 11:52:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:04,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {4562#true} call ULTIMATE.init(); {4562#true} is VALID [2018-11-23 11:52:04,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {4562#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4562#true} is VALID [2018-11-23 11:52:04,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {4562#true} assume true; {4562#true} is VALID [2018-11-23 11:52:04,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4562#true} {4562#true} #130#return; {4562#true} is VALID [2018-11-23 11:52:04,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {4562#true} call #t~ret15 := main(); {4562#true} is VALID [2018-11-23 11:52:04,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {4562#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {4593#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:04,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {4593#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {4597#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:04,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {4597#(<= 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); {4597#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:04,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {4597#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4597#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:04,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {4597#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {4566#(<= 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); {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {4566#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4566#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:04,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {4566#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {4567#(<= 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); {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {4567#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4567#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:04,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {4567#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {4568#(<= 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); {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {4568#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4568#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:04,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {4568#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:05,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {4569#(<= 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); {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:05,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {4569#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4569#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:05,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {4569#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:05,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {4570#(<= 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); {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:05,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {4570#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4570#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:05,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {4570#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:05,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {4571#(<= 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); {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:05,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {4571#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4571#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:05,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {4571#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:05,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {4572#(<= 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); {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:05,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {4572#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4572#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:05,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {4572#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:05,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {4573#(<= 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); {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:05,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {4573#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4573#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:05,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {4573#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {4574#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:05,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {4574#(<= main_~k~0 9)} assume !(~k~0 < 100000); {4563#false} is VALID [2018-11-23 11:52:05,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {4563#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); {4563#false} is VALID [2018-11-23 11:52:05,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {4563#false} ~x~0 := 0; {4563#false} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {4563#false} assume !(~x~0 < ~i~0); {4563#false} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {4563#false} ~x~0 := 1 + ~i~0; {4563#false} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {4563#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); {4563#false} is VALID [2018-11-23 11:52:05,190 INFO L256 TraceCheckUtils]: 40: Hoare triple {4563#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {4563#false} is VALID [2018-11-23 11:52:05,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {4563#false} ~cond := #in~cond; {4563#false} is VALID [2018-11-23 11:52:05,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {4563#false} assume 0 == ~cond; {4563#false} is VALID [2018-11-23 11:52:05,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {4563#false} assume !false; {4563#false} is VALID [2018-11-23 11:52:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:05,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:05,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-11-23 11:52:05,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-23 11:52:05,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:05,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:52:05,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:52:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:52:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:05,331 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand 15 states. [2018-11-23 11:52:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,145 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2018-11-23 11:52:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:06,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-23 11:52:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:52:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2018-11-23 11:52:06,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2018-11-23 11:52:07,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:07,607 INFO L225 Difference]: With dead ends: 114 [2018-11-23 11:52:07,608 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:52:07,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:52:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-11-23 11:52:07,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:07,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 72 states. [2018-11-23 11:52:07,638 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 72 states. [2018-11-23 11:52:07,638 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 72 states. [2018-11-23 11:52:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,641 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2018-11-23 11:52:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2018-11-23 11:52:07,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:07,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:07,642 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 80 states. [2018-11-23 11:52:07,642 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 80 states. [2018-11-23 11:52:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,645 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2018-11-23 11:52:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2018-11-23 11:52:07,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:07,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:07,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:07,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:52:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-11-23 11:52:07,647 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 44 [2018-11-23 11:52:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:07,648 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-11-23 11:52:07,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:52:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-11-23 11:52:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:52:07,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:07,649 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:07,649 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:07,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1339551065, now seen corresponding path program 8 times [2018-11-23 11:52:07,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {5144#true} call ULTIMATE.init(); {5144#true} is VALID [2018-11-23 11:52:07,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {5144#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5144#true} is VALID [2018-11-23 11:52:07,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {5144#true} assume true; {5144#true} is VALID [2018-11-23 11:52:07,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5144#true} {5144#true} #130#return; {5144#true} is VALID [2018-11-23 11:52:07,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {5144#true} call #t~ret15 := main(); {5144#true} is VALID [2018-11-23 11:52:07,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {5144#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5146#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:07,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {5146#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5147#(= main_~k~0 0)} is VALID [2018-11-23 11:52:07,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {5147#(= 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); {5147#(= main_~k~0 0)} is VALID [2018-11-23 11:52:07,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {5147#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5147#(= main_~k~0 0)} is VALID [2018-11-23 11:52:07,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {5147#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:07,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {5148#(<= 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); {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:07,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {5148#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:07,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {5148#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:07,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {5149#(<= 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); {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:07,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {5149#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:07,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {5149#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:07,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {5150#(<= 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); {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:07,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {5150#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:07,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {5150#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:07,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {5151#(<= 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); {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:07,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {5151#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:07,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {5151#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:07,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {5152#(<= 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); {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:07,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {5152#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:07,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {5152#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:07,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {5153#(<= 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); {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:07,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {5153#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:07,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {5153#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:07,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {5154#(<= 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); {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:07,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {5154#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:07,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {5154#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:07,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {5155#(<= 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); {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:07,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {5155#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:07,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {5155#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:07,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {5156#(<= 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); {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:07,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {5156#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:07,956 INFO L273 TraceCheckUtils]: 36: Hoare triple {5156#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {5157#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:07,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {5157#(<= main_~k~0 10)} assume !(~k~0 < 100000); {5145#false} is VALID [2018-11-23 11:52:07,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {5145#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); {5145#false} is VALID [2018-11-23 11:52:07,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {5145#false} ~x~0 := 0; {5145#false} is VALID [2018-11-23 11:52:07,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {5145#false} assume !(~x~0 < ~i~0); {5145#false} is VALID [2018-11-23 11:52:07,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {5145#false} ~x~0 := 1 + ~i~0; {5145#false} is VALID [2018-11-23 11:52:07,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {5145#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); {5145#false} is VALID [2018-11-23 11:52:07,958 INFO L256 TraceCheckUtils]: 43: Hoare triple {5145#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5145#false} is VALID [2018-11-23 11:52:07,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {5145#false} ~cond := #in~cond; {5145#false} is VALID [2018-11-23 11:52:07,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {5145#false} assume 0 == ~cond; {5145#false} is VALID [2018-11-23 11:52:07,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {5145#false} assume !false; {5145#false} is VALID [2018-11-23 11:52:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:07,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:07,961 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-23 11:52:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:08,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:08,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:08,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {5144#true} call ULTIMATE.init(); {5144#true} is VALID [2018-11-23 11:52:08,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {5144#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5144#true} is VALID [2018-11-23 11:52:08,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {5144#true} assume true; {5144#true} is VALID [2018-11-23 11:52:08,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5144#true} {5144#true} #130#return; {5144#true} is VALID [2018-11-23 11:52:08,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {5144#true} call #t~ret15 := main(); {5144#true} is VALID [2018-11-23 11:52:08,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {5144#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5176#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:08,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {5176#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5180#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:08,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {5180#(<= 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); {5180#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:08,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {5180#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5180#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:08,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {5180#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:08,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {5148#(<= 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); {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:08,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {5148#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5148#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:08,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {5148#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:08,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {5149#(<= 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); {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:08,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {5149#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5149#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:08,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {5149#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:08,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {5150#(<= 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); {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:08,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {5150#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5150#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:08,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {5150#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:08,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {5151#(<= 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); {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:08,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {5151#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5151#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:08,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {5151#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:08,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {5152#(<= 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); {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:08,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {5152#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5152#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:08,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {5152#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:08,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {5153#(<= 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); {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:08,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {5153#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5153#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:08,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {5153#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:08,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {5154#(<= 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); {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:08,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {5154#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5154#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:08,354 INFO L273 TraceCheckUtils]: 30: Hoare triple {5154#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:08,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {5155#(<= 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); {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:08,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {5155#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5155#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:08,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {5155#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:08,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {5156#(<= 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); {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:08,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {5156#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5156#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:08,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {5156#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {5157#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {5157#(<= main_~k~0 10)} assume !(~k~0 < 100000); {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {5145#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); {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 39: Hoare triple {5145#false} ~x~0 := 0; {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {5145#false} assume !(~x~0 < ~i~0); {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {5145#false} ~x~0 := 1 + ~i~0; {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L273 TraceCheckUtils]: 42: Hoare triple {5145#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); {5145#false} is VALID [2018-11-23 11:52:08,364 INFO L256 TraceCheckUtils]: 43: Hoare triple {5145#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5145#false} is VALID [2018-11-23 11:52:08,365 INFO L273 TraceCheckUtils]: 44: Hoare triple {5145#false} ~cond := #in~cond; {5145#false} is VALID [2018-11-23 11:52:08,365 INFO L273 TraceCheckUtils]: 45: Hoare triple {5145#false} assume 0 == ~cond; {5145#false} is VALID [2018-11-23 11:52:08,365 INFO L273 TraceCheckUtils]: 46: Hoare triple {5145#false} assume !false; {5145#false} is VALID [2018-11-23 11:52:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:08,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:08,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-11-23 11:52:08,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-23 11:52:08,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:08,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:52:08,451 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-23 11:52:08,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:52:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:52:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:08,452 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand 16 states. [2018-11-23 11:52:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,205 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2018-11-23 11:52:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:09,205 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-23 11:52:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:52:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2018-11-23 11:52:09,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2018-11-23 11:52:09,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:09,630 INFO L225 Difference]: With dead ends: 117 [2018-11-23 11:52:09,630 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:52:09,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:52:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-11-23 11:52:09,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:09,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 75 states. [2018-11-23 11:52:09,661 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 75 states. [2018-11-23 11:52:09,661 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 75 states. [2018-11-23 11:52:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,663 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2018-11-23 11:52:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2018-11-23 11:52:09,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,664 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 83 states. [2018-11-23 11:52:09,664 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 83 states. [2018-11-23 11:52:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,666 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2018-11-23 11:52:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2018-11-23 11:52:09,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:09,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:52:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2018-11-23 11:52:09,669 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2018-11-23 11:52:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:09,669 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2018-11-23 11:52:09,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:52:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2018-11-23 11:52:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:52:09,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:09,670 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:09,670 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:09,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2090859646, now seen corresponding path program 9 times [2018-11-23 11:52:09,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {5752#true} call ULTIMATE.init(); {5752#true} is VALID [2018-11-23 11:52:10,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {5752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5752#true} is VALID [2018-11-23 11:52:10,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {5752#true} assume true; {5752#true} is VALID [2018-11-23 11:52:10,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5752#true} {5752#true} #130#return; {5752#true} is VALID [2018-11-23 11:52:10,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {5752#true} call #t~ret15 := main(); {5752#true} is VALID [2018-11-23 11:52:10,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {5752#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5754#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:10,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {5754#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5755#(= main_~k~0 0)} is VALID [2018-11-23 11:52:10,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {5755#(= 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); {5755#(= main_~k~0 0)} is VALID [2018-11-23 11:52:10,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {5755#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5755#(= main_~k~0 0)} is VALID [2018-11-23 11:52:10,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {5755#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {5756#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:10,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {5756#(<= 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); {5756#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:10,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {5756#(<= main_~k~0 1)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5756#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:10,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {5756#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {5757#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:10,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {5757#(<= 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); {5757#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:10,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {5757#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5757#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:10,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {5757#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {5758#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:10,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {5758#(<= 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); {5758#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:10,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {5758#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5758#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:10,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {5758#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {5759#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:10,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {5759#(<= 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); {5759#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:10,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {5759#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5759#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:10,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {5759#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {5760#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:10,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {5760#(<= 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); {5760#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:10,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {5760#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5760#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:10,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {5760#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {5761#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:10,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {5761#(<= 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); {5761#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:10,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {5761#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5761#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:10,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {5761#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {5762#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:10,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {5762#(<= 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); {5762#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:10,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {5762#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5762#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:10,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {5762#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {5763#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:10,210 INFO L273 TraceCheckUtils]: 31: Hoare triple {5763#(<= 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); {5763#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:10,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {5763#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5763#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:10,212 INFO L273 TraceCheckUtils]: 33: Hoare triple {5763#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {5764#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:10,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {5764#(<= 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); {5764#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:10,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {5764#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5764#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:10,214 INFO L273 TraceCheckUtils]: 36: Hoare triple {5764#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {5765#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:10,214 INFO L273 TraceCheckUtils]: 37: Hoare triple {5765#(<= 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); {5765#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:10,215 INFO L273 TraceCheckUtils]: 38: Hoare triple {5765#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5765#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:10,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {5765#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {5766#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:10,216 INFO L273 TraceCheckUtils]: 40: Hoare triple {5766#(<= main_~k~0 11)} assume !(~k~0 < 100000); {5753#false} is VALID [2018-11-23 11:52:10,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {5753#false} ~x~0 := 0; {5753#false} is VALID [2018-11-23 11:52:10,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {5753#false} assume !(~x~0 < ~i~0); {5753#false} is VALID [2018-11-23 11:52:10,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {5753#false} ~x~0 := 1 + ~i~0; {5753#false} is VALID [2018-11-23 11:52:10,217 INFO L273 TraceCheckUtils]: 45: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,217 INFO L256 TraceCheckUtils]: 46: Hoare triple {5753#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5753#false} is VALID [2018-11-23 11:52:10,218 INFO L273 TraceCheckUtils]: 47: Hoare triple {5753#false} ~cond := #in~cond; {5753#false} is VALID [2018-11-23 11:52:10,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {5753#false} assume 0 == ~cond; {5753#false} is VALID [2018-11-23 11:52:10,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {5753#false} assume !false; {5753#false} is VALID [2018-11-23 11:52:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:10,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:10,220 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-23 11:52:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:10,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:52:10,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:10,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {5752#true} call ULTIMATE.init(); {5752#true} is VALID [2018-11-23 11:52:10,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {5752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5752#true} is VALID [2018-11-23 11:52:10,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {5752#true} assume true; {5752#true} is VALID [2018-11-23 11:52:10,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5752#true} {5752#true} #130#return; {5752#true} is VALID [2018-11-23 11:52:10,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {5752#true} call #t~ret15 := main(); {5752#true} is VALID [2018-11-23 11:52:10,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {5752#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {5785#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 11:52:10,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {5785#(and (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {5789#(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-23 11:52:10,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {5789#(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); {5793#(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-23 11:52:10,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {5793#(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; {5797#(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-23 11:52:10,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {5797#(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; {5801#(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-23 11:52:10,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {5801#(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); {5805#(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-23 11:52:10,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {5805#(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; {5753#false} is VALID [2018-11-23 11:52:10,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,663 INFO L273 TraceCheckUtils]: 34: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,664 INFO L273 TraceCheckUtils]: 38: Hoare triple {5753#false} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,664 INFO L273 TraceCheckUtils]: 39: Hoare triple {5753#false} ~k~0 := 1 + ~k~0; {5753#false} is VALID [2018-11-23 11:52:10,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {5753#false} assume !(~k~0 < 100000); {5753#false} is VALID [2018-11-23 11:52:10,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {5753#false} ~x~0 := 0; {5753#false} is VALID [2018-11-23 11:52:10,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {5753#false} assume !(~x~0 < ~i~0); {5753#false} is VALID [2018-11-23 11:52:10,665 INFO L273 TraceCheckUtils]: 44: Hoare triple {5753#false} ~x~0 := 1 + ~i~0; {5753#false} is VALID [2018-11-23 11:52:10,665 INFO L273 TraceCheckUtils]: 45: Hoare triple {5753#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); {5753#false} is VALID [2018-11-23 11:52:10,666 INFO L256 TraceCheckUtils]: 46: Hoare triple {5753#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {5753#false} is VALID [2018-11-23 11:52:10,666 INFO L273 TraceCheckUtils]: 47: Hoare triple {5753#false} ~cond := #in~cond; {5753#false} is VALID [2018-11-23 11:52:10,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {5753#false} assume 0 == ~cond; {5753#false} is VALID [2018-11-23 11:52:10,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {5753#false} assume !false; {5753#false} is VALID [2018-11-23 11:52:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 11:52:10,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:10,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-23 11:52:10,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-11-23 11:52:10,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:10,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:10,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:10,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=257, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:10,832 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 21 states. [2018-11-23 11:52:11,517 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:52:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,518 INFO L93 Difference]: Finished difference Result 153 states and 203 transitions. [2018-11-23 11:52:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:12,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-11-23 11:52:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 160 transitions. [2018-11-23 11:52:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 160 transitions. [2018-11-23 11:52:12,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 160 transitions. [2018-11-23 11:52:13,049 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-23 11:52:13,051 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:52:13,052 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:52:13,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 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-23 11:52:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:52:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2018-11-23 11:52:13,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:13,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 81 states. [2018-11-23 11:52:13,099 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 81 states. [2018-11-23 11:52:13,099 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 81 states. [2018-11-23 11:52:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,102 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 11:52:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-11-23 11:52:13,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:13,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:13,103 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 90 states. [2018-11-23 11:52:13,103 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 90 states. [2018-11-23 11:52:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,106 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 11:52:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-11-23 11:52:13,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:13,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:13,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:13,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:52:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2018-11-23 11:52:13,109 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 50 [2018-11-23 11:52:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2018-11-23 11:52:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2018-11-23 11:52:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:52:13,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:13,110 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:13,110 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:13,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash -796604041, now seen corresponding path program 1 times [2018-11-23 11:52:13,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:13,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {6448#true} call ULTIMATE.init(); {6448#true} is VALID [2018-11-23 11:52:13,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {6448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6448#true} is VALID [2018-11-23 11:52:13,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {6448#true} assume true; {6448#true} is VALID [2018-11-23 11:52:13,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6448#true} {6448#true} #130#return; {6448#true} is VALID [2018-11-23 11:52:13,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {6448#true} call #t~ret15 := main(); {6448#true} is VALID [2018-11-23 11:52:13,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {6448#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6450#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:13,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {6450#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6451#(= main_~k~0 0)} is VALID [2018-11-23 11:52:13,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {6451#(= 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); {6451#(= main_~k~0 0)} is VALID [2018-11-23 11:52:13,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {6451#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6451#(= main_~k~0 0)} is VALID [2018-11-23 11:52:13,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {6451#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {6452#(<= 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); {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {6452#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {6452#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {6453#(<= 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); {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {6453#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {6453#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {6454#(<= 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); {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {6454#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {6454#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {6455#(<= 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); {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {6455#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {6455#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {6456#(<= 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); {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {6456#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {6456#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {6457#(<= 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); {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {6457#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {6457#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {6458#(<= 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); {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {6458#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {6458#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {6459#(<= 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); {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {6459#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {6459#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:13,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {6460#(<= 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); {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:13,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {6460#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:13,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {6460#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:13,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {6461#(<= 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); {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:13,776 INFO L273 TraceCheckUtils]: 38: Hoare triple {6461#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:13,776 INFO L273 TraceCheckUtils]: 39: Hoare triple {6461#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:13,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {6462#(<= 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); {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:13,777 INFO L273 TraceCheckUtils]: 41: Hoare triple {6462#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:13,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {6462#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {6463#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {6463#(<= main_~k~0 12)} assume !(~k~0 < 100000); {6449#false} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 44: Hoare triple {6449#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); {6449#false} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 45: Hoare triple {6449#false} ~x~0 := 0; {6449#false} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 46: Hoare triple {6449#false} assume !(~x~0 < ~i~0); {6449#false} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {6449#false} ~x~0 := 1 + ~i~0; {6449#false} is VALID [2018-11-23 11:52:13,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {6449#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); {6449#false} is VALID [2018-11-23 11:52:13,780 INFO L256 TraceCheckUtils]: 49: Hoare triple {6449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6449#false} is VALID [2018-11-23 11:52:13,780 INFO L273 TraceCheckUtils]: 50: Hoare triple {6449#false} ~cond := #in~cond; {6449#false} is VALID [2018-11-23 11:52:13,780 INFO L273 TraceCheckUtils]: 51: Hoare triple {6449#false} assume 0 == ~cond; {6449#false} is VALID [2018-11-23 11:52:13,780 INFO L273 TraceCheckUtils]: 52: Hoare triple {6449#false} assume !false; {6449#false} is VALID [2018-11-23 11:52:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:13,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:13,785 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-23 11:52:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:13,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {6448#true} call ULTIMATE.init(); {6448#true} is VALID [2018-11-23 11:52:13,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {6448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6448#true} is VALID [2018-11-23 11:52:13,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {6448#true} assume true; {6448#true} is VALID [2018-11-23 11:52:13,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6448#true} {6448#true} #130#return; {6448#true} is VALID [2018-11-23 11:52:13,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {6448#true} call #t~ret15 := main(); {6448#true} is VALID [2018-11-23 11:52:13,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {6448#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {6482#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:13,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {6482#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {6486#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:13,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {6486#(<= 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); {6486#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:13,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {6486#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6486#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:13,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {6486#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {6452#(<= 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); {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {6452#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6452#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:13,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {6452#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {6453#(<= 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); {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {6453#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6453#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:13,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {6453#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {6454#(<= 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); {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {6454#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6454#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:13,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {6454#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {6455#(<= 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); {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {6455#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6455#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:13,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {6455#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {6456#(<= 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); {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,993 INFO L273 TraceCheckUtils]: 23: Hoare triple {6456#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6456#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:13,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {6456#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {6457#(<= 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); {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {6457#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6457#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:13,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {6457#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {6458#(<= 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); {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {6458#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6458#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:13,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {6458#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {6459#(<= 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); {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {6459#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6459#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:13,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {6459#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:13,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {6460#(<= 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); {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:13,999 INFO L273 TraceCheckUtils]: 35: Hoare triple {6460#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6460#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:14,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {6460#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:14,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {6461#(<= 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); {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:14,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {6461#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6461#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:14,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {6461#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:14,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {6462#(<= 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); {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:14,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {6462#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6462#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:14,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {6462#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {6463#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:14,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {6463#(<= main_~k~0 12)} assume !(~k~0 < 100000); {6449#false} is VALID [2018-11-23 11:52:14,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {6449#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); {6449#false} is VALID [2018-11-23 11:52:14,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {6449#false} ~x~0 := 0; {6449#false} is VALID [2018-11-23 11:52:14,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {6449#false} assume !(~x~0 < ~i~0); {6449#false} is VALID [2018-11-23 11:52:14,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {6449#false} ~x~0 := 1 + ~i~0; {6449#false} is VALID [2018-11-23 11:52:14,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {6449#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); {6449#false} is VALID [2018-11-23 11:52:14,005 INFO L256 TraceCheckUtils]: 49: Hoare triple {6449#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {6449#false} is VALID [2018-11-23 11:52:14,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {6449#false} ~cond := #in~cond; {6449#false} is VALID [2018-11-23 11:52:14,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {6449#false} assume 0 == ~cond; {6449#false} is VALID [2018-11-23 11:52:14,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {6449#false} assume !false; {6449#false} is VALID [2018-11-23 11:52:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:14,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:14,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-11-23 11:52:14,028 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-23 11:52:14,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:14,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:14,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:14,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:14,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:14,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:14,085 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand 18 states. [2018-11-23 11:52:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,104 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2018-11-23 11:52:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:15,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-23 11:52:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:52:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 159 transitions. [2018-11-23 11:52:15,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 159 transitions. [2018-11-23 11:52:15,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:15,880 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:52:15,880 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:52:15,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 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-23 11:52:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:52:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-11-23 11:52:15,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:15,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 84 states. [2018-11-23 11:52:15,961 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 84 states. [2018-11-23 11:52:15,961 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 84 states. [2018-11-23 11:52:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,964 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2018-11-23 11:52:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-23 11:52:15,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:15,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:15,965 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 92 states. [2018-11-23 11:52:15,965 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 92 states. [2018-11-23 11:52:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,968 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2018-11-23 11:52:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-23 11:52:15,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:15,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:15,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:15,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:52:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2018-11-23 11:52:15,971 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 53 [2018-11-23 11:52:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:15,971 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2018-11-23 11:52:15,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2018-11-23 11:52:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:52:15,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:15,972 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:15,973 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:15,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1870445664, now seen corresponding path program 2 times [2018-11-23 11:52:15,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:15,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:15,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {7122#true} call ULTIMATE.init(); {7122#true} is VALID [2018-11-23 11:52:17,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {7122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7122#true} is VALID [2018-11-23 11:52:17,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2018-11-23 11:52:17,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #130#return; {7122#true} is VALID [2018-11-23 11:52:17,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret15 := main(); {7122#true} is VALID [2018-11-23 11:52:17,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {7122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7124#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:17,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {7124#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7125#(= main_~k~0 0)} is VALID [2018-11-23 11:52:17,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {7125#(= 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); {7125#(= main_~k~0 0)} is VALID [2018-11-23 11:52:17,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {7125#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7125#(= main_~k~0 0)} is VALID [2018-11-23 11:52:17,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {7125#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {7126#(<= 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); {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {7126#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {7126#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {7127#(<= 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); {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {7127#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {7127#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {7128#(<= 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); {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {7128#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {7128#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {7129#(<= 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); {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {7129#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {7129#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {7130#(<= 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); {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {7130#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {7130#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {7131#(<= 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); {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {7131#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {7131#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {7132#(<= 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); {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {7132#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {7132#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {7133#(<= 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); {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,338 INFO L273 TraceCheckUtils]: 32: Hoare triple {7133#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {7133#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {7134#(<= 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); {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {7134#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {7134#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {7135#(<= 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); {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {7135#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {7135#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,341 INFO L273 TraceCheckUtils]: 40: Hoare triple {7136#(<= 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); {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {7136#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {7136#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,343 INFO L273 TraceCheckUtils]: 43: Hoare triple {7137#(<= 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); {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {7137#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {7137#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {7138#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 46: Hoare triple {7138#(<= main_~k~0 13)} assume !(~k~0 < 100000); {7123#false} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {7123#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); {7123#false} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {7123#false} ~x~0 := 0; {7123#false} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(~x~0 < ~i~0); {7123#false} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {7123#false} ~x~0 := 1 + ~i~0; {7123#false} is VALID [2018-11-23 11:52:17,346 INFO L273 TraceCheckUtils]: 51: Hoare triple {7123#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); {7123#false} is VALID [2018-11-23 11:52:17,346 INFO L256 TraceCheckUtils]: 52: Hoare triple {7123#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7123#false} is VALID [2018-11-23 11:52:17,346 INFO L273 TraceCheckUtils]: 53: Hoare triple {7123#false} ~cond := #in~cond; {7123#false} is VALID [2018-11-23 11:52:17,346 INFO L273 TraceCheckUtils]: 54: Hoare triple {7123#false} assume 0 == ~cond; {7123#false} is VALID [2018-11-23 11:52:17,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2018-11-23 11:52:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:17,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:17,350 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-23 11:52:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:17,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:17,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:17,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {7122#true} call ULTIMATE.init(); {7122#true} is VALID [2018-11-23 11:52:17,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {7122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7122#true} is VALID [2018-11-23 11:52:17,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2018-11-23 11:52:17,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #130#return; {7122#true} is VALID [2018-11-23 11:52:17,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret15 := main(); {7122#true} is VALID [2018-11-23 11:52:17,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {7122#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7157#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:17,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {7157#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7161#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:17,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {7161#(<= 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); {7161#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:17,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {7161#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7161#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:17,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {7161#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {7126#(<= 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); {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {7126#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7126#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:17,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {7126#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {7127#(<= 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); {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {7127#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7127#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:17,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {7127#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {7128#(<= 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); {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {7128#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7128#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:17,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {7128#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {7129#(<= 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); {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {7129#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7129#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:17,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {7129#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {7130#(<= 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); {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {7130#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7130#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:17,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {7130#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {7131#(<= 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); {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {7131#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7131#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:17,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {7131#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {7132#(<= 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); {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {7132#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7132#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:17,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {7132#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {7133#(<= 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); {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {7133#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7133#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:17,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {7133#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {7134#(<= 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); {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {7134#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7134#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:17,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {7134#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {7135#(<= 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); {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {7135#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7135#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:17,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {7135#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {7136#(<= 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); {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {7136#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7136#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:17,673 INFO L273 TraceCheckUtils]: 42: Hoare triple {7136#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,674 INFO L273 TraceCheckUtils]: 43: Hoare triple {7137#(<= 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); {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,674 INFO L273 TraceCheckUtils]: 44: Hoare triple {7137#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7137#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:17,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {7137#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {7138#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:17,676 INFO L273 TraceCheckUtils]: 46: Hoare triple {7138#(<= main_~k~0 13)} assume !(~k~0 < 100000); {7123#false} is VALID [2018-11-23 11:52:17,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {7123#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); {7123#false} is VALID [2018-11-23 11:52:17,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {7123#false} ~x~0 := 0; {7123#false} is VALID [2018-11-23 11:52:17,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(~x~0 < ~i~0); {7123#false} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 50: Hoare triple {7123#false} ~x~0 := 1 + ~i~0; {7123#false} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 51: Hoare triple {7123#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); {7123#false} is VALID [2018-11-23 11:52:17,677 INFO L256 TraceCheckUtils]: 52: Hoare triple {7123#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7123#false} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 53: Hoare triple {7123#false} ~cond := #in~cond; {7123#false} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {7123#false} assume 0 == ~cond; {7123#false} is VALID [2018-11-23 11:52:17,678 INFO L273 TraceCheckUtils]: 55: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2018-11-23 11:52:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:17,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:17,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-11-23 11:52:17,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-23 11:52:17,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:17,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:52:17,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:17,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:52:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:52:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:17,757 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand 19 states. [2018-11-23 11:52:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,548 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2018-11-23 11:52:18,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:18,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-23 11:52:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:52:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2018-11-23 11:52:18,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 163 transitions. [2018-11-23 11:52:18,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:18,994 INFO L225 Difference]: With dead ends: 129 [2018-11-23 11:52:18,994 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 11:52:18,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:52:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 11:52:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-11-23 11:52:19,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:19,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 87 states. [2018-11-23 11:52:19,142 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 87 states. [2018-11-23 11:52:19,142 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 87 states. [2018-11-23 11:52:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,146 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 11:52:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-11-23 11:52:19,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:19,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:19,147 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 95 states. [2018-11-23 11:52:19,147 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 95 states. [2018-11-23 11:52:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,151 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 11:52:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-11-23 11:52:19,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:19,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:19,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:19,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:52:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2018-11-23 11:52:19,155 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 56 [2018-11-23 11:52:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:19,155 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2018-11-23 11:52:19,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:52:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2018-11-23 11:52:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:52:19,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:19,156 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:19,157 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:19,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 525151447, now seen corresponding path program 3 times [2018-11-23 11:52:19,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:19,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:19,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {7822#true} call ULTIMATE.init(); {7822#true} is VALID [2018-11-23 11:52:19,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {7822#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7822#true} is VALID [2018-11-23 11:52:19,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {7822#true} assume true; {7822#true} is VALID [2018-11-23 11:52:19,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7822#true} {7822#true} #130#return; {7822#true} is VALID [2018-11-23 11:52:19,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {7822#true} call #t~ret15 := main(); {7822#true} is VALID [2018-11-23 11:52:19,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {7822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7824#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:19,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {7824#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7825#(= main_~k~0 0)} is VALID [2018-11-23 11:52:19,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {7825#(= 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); {7825#(= main_~k~0 0)} is VALID [2018-11-23 11:52:19,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {7825#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7825#(= main_~k~0 0)} is VALID [2018-11-23 11:52:19,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {7825#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {7826#(<= 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); {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {7826#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {7826#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {7827#(<= 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); {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {7827#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {7827#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {7828#(<= 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); {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {7828#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {7828#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {7829#(<= 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); {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {7829#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {7829#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {7830#(<= 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); {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {7830#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {7830#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:19,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {7831#(<= 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); {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:19,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {7831#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:19,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {7831#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:19,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {7832#(<= 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); {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:19,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {7832#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:19,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {7832#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:19,744 INFO L273 TraceCheckUtils]: 31: Hoare triple {7833#(<= 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); {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:19,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {7833#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:19,745 INFO L273 TraceCheckUtils]: 33: Hoare triple {7833#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:19,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {7834#(<= 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); {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:19,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {7834#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:19,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {7834#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:19,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {7835#(<= 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); {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:19,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {7835#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:19,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {7835#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:19,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {7836#(<= 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); {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:19,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {7836#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:19,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {7836#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:19,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {7837#(<= 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); {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:19,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {7837#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:19,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {7837#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:19,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {7838#(<= 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); {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:19,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {7838#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:19,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {7838#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {7839#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:19,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {7839#(<= main_~k~0 14)} assume !(~k~0 < 100000); {7823#false} is VALID [2018-11-23 11:52:19,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {7823#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); {7823#false} is VALID [2018-11-23 11:52:19,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {7823#false} ~x~0 := 0; {7823#false} is VALID [2018-11-23 11:52:19,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {7823#false} assume !(~x~0 < ~i~0); {7823#false} is VALID [2018-11-23 11:52:19,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {7823#false} ~x~0 := 1 + ~i~0; {7823#false} is VALID [2018-11-23 11:52:19,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {7823#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); {7823#false} is VALID [2018-11-23 11:52:19,756 INFO L256 TraceCheckUtils]: 55: Hoare triple {7823#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7823#false} is VALID [2018-11-23 11:52:19,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {7823#false} ~cond := #in~cond; {7823#false} is VALID [2018-11-23 11:52:19,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {7823#false} assume 0 == ~cond; {7823#false} is VALID [2018-11-23 11:52:19,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {7823#false} assume !false; {7823#false} is VALID [2018-11-23 11:52:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:19,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:19,760 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-23 11:52:19,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:19,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 11:52:19,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:19,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:19,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {7822#true} call ULTIMATE.init(); {7822#true} is VALID [2018-11-23 11:52:19,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {7822#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7822#true} is VALID [2018-11-23 11:52:19,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {7822#true} assume true; {7822#true} is VALID [2018-11-23 11:52:19,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7822#true} {7822#true} #130#return; {7822#true} is VALID [2018-11-23 11:52:19,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {7822#true} call #t~ret15 := main(); {7822#true} is VALID [2018-11-23 11:52:19,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {7822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {7858#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:19,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {7858#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {7862#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:19,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {7862#(<= 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); {7862#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:19,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {7862#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7862#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:19,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {7862#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {7826#(<= 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); {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {7826#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7826#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:19,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {7826#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {7827#(<= 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); {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {7827#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7827#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:19,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {7827#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {7828#(<= 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); {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {7828#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7828#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:19,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {7828#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {7829#(<= 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); {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {7829#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7829#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:19,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {7829#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {7830#(<= 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); {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {7830#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7830#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:19,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {7830#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:19,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {7831#(<= 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); {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:19,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {7831#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7831#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:20,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {7831#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:20,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {7832#(<= 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); {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:20,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {7832#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7832#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:20,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {7832#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:20,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {7833#(<= 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); {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:20,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {7833#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7833#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:20,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {7833#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:20,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {7834#(<= 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); {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:20,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {7834#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7834#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:20,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {7834#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:20,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {7835#(<= 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); {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:20,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {7835#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7835#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:20,007 INFO L273 TraceCheckUtils]: 39: Hoare triple {7835#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:20,008 INFO L273 TraceCheckUtils]: 40: Hoare triple {7836#(<= 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); {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:20,008 INFO L273 TraceCheckUtils]: 41: Hoare triple {7836#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7836#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:20,009 INFO L273 TraceCheckUtils]: 42: Hoare triple {7836#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:20,009 INFO L273 TraceCheckUtils]: 43: Hoare triple {7837#(<= 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); {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:20,010 INFO L273 TraceCheckUtils]: 44: Hoare triple {7837#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7837#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:20,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {7837#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:20,011 INFO L273 TraceCheckUtils]: 46: Hoare triple {7838#(<= 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); {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:20,012 INFO L273 TraceCheckUtils]: 47: Hoare triple {7838#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7838#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:20,012 INFO L273 TraceCheckUtils]: 48: Hoare triple {7838#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {7839#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:20,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {7839#(<= main_~k~0 14)} assume !(~k~0 < 100000); {7823#false} is VALID [2018-11-23 11:52:20,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {7823#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); {7823#false} is VALID [2018-11-23 11:52:20,014 INFO L273 TraceCheckUtils]: 51: Hoare triple {7823#false} ~x~0 := 0; {7823#false} is VALID [2018-11-23 11:52:20,014 INFO L273 TraceCheckUtils]: 52: Hoare triple {7823#false} assume !(~x~0 < ~i~0); {7823#false} is VALID [2018-11-23 11:52:20,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {7823#false} ~x~0 := 1 + ~i~0; {7823#false} is VALID [2018-11-23 11:52:20,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {7823#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); {7823#false} is VALID [2018-11-23 11:52:20,014 INFO L256 TraceCheckUtils]: 55: Hoare triple {7823#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {7823#false} is VALID [2018-11-23 11:52:20,015 INFO L273 TraceCheckUtils]: 56: Hoare triple {7823#false} ~cond := #in~cond; {7823#false} is VALID [2018-11-23 11:52:20,015 INFO L273 TraceCheckUtils]: 57: Hoare triple {7823#false} assume 0 == ~cond; {7823#false} is VALID [2018-11-23 11:52:20,015 INFO L273 TraceCheckUtils]: 58: Hoare triple {7823#false} assume !false; {7823#false} is VALID [2018-11-23 11:52:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:20,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:20,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-11-23 11:52:20,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-23 11:52:20,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:20,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:20,101 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-23 11:52:20,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:20,102 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand 20 states. [2018-11-23 11:52:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,398 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-11-23 11:52:21,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:21,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-23 11:52:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:52:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 167 transitions. [2018-11-23 11:52:21,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 167 transitions. [2018-11-23 11:52:21,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:21,563 INFO L225 Difference]: With dead ends: 132 [2018-11-23 11:52:21,564 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 11:52:21,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:52:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 11:52:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-11-23 11:52:21,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:21,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 90 states. [2018-11-23 11:52:21,612 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 90 states. [2018-11-23 11:52:21,613 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 90 states. [2018-11-23 11:52:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,615 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2018-11-23 11:52:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-23 11:52:21,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,616 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 98 states. [2018-11-23 11:52:21,616 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 98 states. [2018-11-23 11:52:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,618 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2018-11-23 11:52:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-23 11:52:21,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:21,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:52:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2018-11-23 11:52:21,621 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 59 [2018-11-23 11:52:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:21,621 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2018-11-23 11:52:21,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-11-23 11:52:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 11:52:21,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:21,622 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:21,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:21,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1712872384, now seen corresponding path program 4 times [2018-11-23 11:52:21,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:21,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {8548#true} call ULTIMATE.init(); {8548#true} is VALID [2018-11-23 11:52:22,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {8548#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8548#true} is VALID [2018-11-23 11:52:22,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {8548#true} assume true; {8548#true} is VALID [2018-11-23 11:52:22,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8548#true} {8548#true} #130#return; {8548#true} is VALID [2018-11-23 11:52:22,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {8548#true} call #t~ret15 := main(); {8548#true} is VALID [2018-11-23 11:52:22,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {8548#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8550#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:22,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {8550#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {8551#(= main_~k~0 0)} is VALID [2018-11-23 11:52:22,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {8551#(= 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); {8551#(= main_~k~0 0)} is VALID [2018-11-23 11:52:22,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {8551#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8551#(= main_~k~0 0)} is VALID [2018-11-23 11:52:22,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {8551#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:22,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {8552#(<= 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); {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:22,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {8552#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:22,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {8552#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:22,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {8553#(<= 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); {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:22,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {8553#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:22,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {8553#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:22,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {8554#(<= 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); {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:22,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {8554#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:22,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {8554#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:22,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {8555#(<= 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); {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:22,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {8555#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:22,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {8555#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:22,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {8556#(<= 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); {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:22,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {8556#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:22,738 INFO L273 TraceCheckUtils]: 24: Hoare triple {8556#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:22,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {8557#(<= 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); {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:22,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {8557#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:22,740 INFO L273 TraceCheckUtils]: 27: Hoare triple {8557#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:22,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {8558#(<= 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); {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:22,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {8558#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:22,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {8558#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:22,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {8559#(<= 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); {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:22,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {8559#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:22,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {8559#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:22,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {8560#(<= 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); {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:22,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {8560#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:22,745 INFO L273 TraceCheckUtils]: 36: Hoare triple {8560#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:22,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {8561#(<= 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); {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:22,746 INFO L273 TraceCheckUtils]: 38: Hoare triple {8561#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:22,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {8561#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:22,747 INFO L273 TraceCheckUtils]: 40: Hoare triple {8562#(<= 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); {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:22,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {8562#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:22,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {8562#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:22,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {8563#(<= 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); {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:22,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {8563#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:22,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {8563#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:22,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {8564#(<= 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); {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:22,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {8564#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:22,752 INFO L273 TraceCheckUtils]: 48: Hoare triple {8564#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:22,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {8565#(<= 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); {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:22,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {8565#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:22,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {8565#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {8566#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:22,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {8566#(<= main_~k~0 15)} assume !(~k~0 < 100000); {8549#false} is VALID [2018-11-23 11:52:22,754 INFO L273 TraceCheckUtils]: 53: Hoare triple {8549#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); {8549#false} is VALID [2018-11-23 11:52:22,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {8549#false} ~x~0 := 0; {8549#false} is VALID [2018-11-23 11:52:22,755 INFO L273 TraceCheckUtils]: 55: Hoare triple {8549#false} assume !(~x~0 < ~i~0); {8549#false} is VALID [2018-11-23 11:52:22,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {8549#false} ~x~0 := 1 + ~i~0; {8549#false} is VALID [2018-11-23 11:52:22,755 INFO L273 TraceCheckUtils]: 57: Hoare triple {8549#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); {8549#false} is VALID [2018-11-23 11:52:22,755 INFO L256 TraceCheckUtils]: 58: Hoare triple {8549#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8549#false} is VALID [2018-11-23 11:52:22,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {8549#false} ~cond := #in~cond; {8549#false} is VALID [2018-11-23 11:52:22,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {8549#false} assume 0 == ~cond; {8549#false} is VALID [2018-11-23 11:52:22,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {8549#false} assume !false; {8549#false} is VALID [2018-11-23 11:52:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:22,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:22,760 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-23 11:52:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:22,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:22,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:23,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {8548#true} call ULTIMATE.init(); {8548#true} is VALID [2018-11-23 11:52:23,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {8548#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8548#true} is VALID [2018-11-23 11:52:23,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {8548#true} assume true; {8548#true} is VALID [2018-11-23 11:52:23,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8548#true} {8548#true} #130#return; {8548#true} is VALID [2018-11-23 11:52:23,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {8548#true} call #t~ret15 := main(); {8548#true} is VALID [2018-11-23 11:52:23,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {8548#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {8585#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:23,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {8585#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {8589#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:23,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {8589#(<= 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); {8589#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:23,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {8589#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8589#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:23,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {8589#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:23,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {8552#(<= 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); {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:23,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {8552#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {8552#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:23,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {8552#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:23,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {8553#(<= 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); {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:23,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {8553#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8553#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:23,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {8553#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:23,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {8554#(<= 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); {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:23,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {8554#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8554#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:23,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {8554#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:23,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {8555#(<= 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); {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:23,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {8555#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8555#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:23,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {8555#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:23,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {8556#(<= 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); {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:23,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {8556#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8556#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:23,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {8556#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:23,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {8557#(<= 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); {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:23,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {8557#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8557#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:23,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {8557#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:23,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {8558#(<= 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); {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:23,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {8558#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8558#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:23,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {8558#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:23,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {8559#(<= 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); {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:23,086 INFO L273 TraceCheckUtils]: 32: Hoare triple {8559#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8559#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:23,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {8559#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:23,087 INFO L273 TraceCheckUtils]: 34: Hoare triple {8560#(<= 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); {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:23,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {8560#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8560#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:23,088 INFO L273 TraceCheckUtils]: 36: Hoare triple {8560#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:23,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {8561#(<= 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); {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:23,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {8561#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8561#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:23,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {8561#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:23,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {8562#(<= 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); {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:23,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {8562#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8562#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:23,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {8562#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:23,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {8563#(<= 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); {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:23,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {8563#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8563#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:23,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {8563#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:23,094 INFO L273 TraceCheckUtils]: 46: Hoare triple {8564#(<= 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); {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:23,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {8564#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8564#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:23,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {8564#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:23,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {8565#(<= 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); {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:23,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {8565#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8565#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:23,097 INFO L273 TraceCheckUtils]: 51: Hoare triple {8565#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {8566#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:23,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {8566#(<= main_~k~0 15)} assume !(~k~0 < 100000); {8549#false} is VALID [2018-11-23 11:52:23,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {8549#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); {8549#false} is VALID [2018-11-23 11:52:23,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {8549#false} ~x~0 := 0; {8549#false} is VALID [2018-11-23 11:52:23,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {8549#false} assume !(~x~0 < ~i~0); {8549#false} is VALID [2018-11-23 11:52:23,098 INFO L273 TraceCheckUtils]: 56: Hoare triple {8549#false} ~x~0 := 1 + ~i~0; {8549#false} is VALID [2018-11-23 11:52:23,098 INFO L273 TraceCheckUtils]: 57: Hoare triple {8549#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); {8549#false} is VALID [2018-11-23 11:52:23,098 INFO L256 TraceCheckUtils]: 58: Hoare triple {8549#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {8549#false} is VALID [2018-11-23 11:52:23,099 INFO L273 TraceCheckUtils]: 59: Hoare triple {8549#false} ~cond := #in~cond; {8549#false} is VALID [2018-11-23 11:52:23,099 INFO L273 TraceCheckUtils]: 60: Hoare triple {8549#false} assume 0 == ~cond; {8549#false} is VALID [2018-11-23 11:52:23,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {8549#false} assume !false; {8549#false} is VALID [2018-11-23 11:52:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:23,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-11-23 11:52:23,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-23 11:52:23,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:23,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:23,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:23,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:23,191 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 21 states. [2018-11-23 11:52:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,860 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2018-11-23 11:52:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:24,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-23 11:52:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:52:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2018-11-23 11:52:24,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 171 transitions. [2018-11-23 11:52:25,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:25,052 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:52:25,052 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:52:25,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:52:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:52:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-11-23 11:52:25,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:25,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 93 states. [2018-11-23 11:52:25,121 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 93 states. [2018-11-23 11:52:25,121 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 93 states. [2018-11-23 11:52:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,123 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2018-11-23 11:52:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-23 11:52:25,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,124 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 101 states. [2018-11-23 11:52:25,124 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 101 states. [2018-11-23 11:52:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:25,126 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2018-11-23 11:52:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-23 11:52:25,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:25,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:25,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:25,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:52:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2018-11-23 11:52:25,129 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 62 [2018-11-23 11:52:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:25,129 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2018-11-23 11:52:25,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2018-11-23 11:52:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:25,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:25,130 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:25,131 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:25,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 391481399, now seen corresponding path program 5 times [2018-11-23 11:52:25,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:25,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:25,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {9300#true} call ULTIMATE.init(); {9300#true} is VALID [2018-11-23 11:52:25,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {9300#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9300#true} is VALID [2018-11-23 11:52:25,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {9300#true} assume true; {9300#true} is VALID [2018-11-23 11:52:25,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9300#true} {9300#true} #130#return; {9300#true} is VALID [2018-11-23 11:52:25,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {9300#true} call #t~ret15 := main(); {9300#true} is VALID [2018-11-23 11:52:25,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {9300#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9302#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:25,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {9302#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {9303#(= main_~k~0 0)} is VALID [2018-11-23 11:52:25,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {9303#(= 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); {9303#(= main_~k~0 0)} is VALID [2018-11-23 11:52:25,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {9303#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9303#(= main_~k~0 0)} is VALID [2018-11-23 11:52:25,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {9303#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {9304#(<= 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); {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {9304#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {9304#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {9305#(<= 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); {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {9305#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {9305#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {9306#(<= 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); {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {9306#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {9306#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {9307#(<= 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); {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {9307#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {9307#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {9308#(<= 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); {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {9308#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {9308#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {9309#(<= 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); {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {9309#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {9309#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,544 INFO L273 TraceCheckUtils]: 28: Hoare triple {9310#(<= 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); {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {9310#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {9310#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {9311#(<= 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); {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {9311#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {9311#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {9312#(<= 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); {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {9312#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {9312#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {9313#(<= 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); {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {9313#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {9313#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {9314#(<= 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); {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {9314#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {9314#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {9315#(<= 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); {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {9315#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {9315#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {9316#(<= 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); {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {9316#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {9316#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {9317#(<= 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); {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {9317#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {9317#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {9318#(<= 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); {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {9318#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {9318#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {9319#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:25,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {9319#(<= main_~k~0 16)} assume !(~k~0 < 100000); {9301#false} is VALID [2018-11-23 11:52:25,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {9301#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); {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {9301#false} ~x~0 := 0; {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {9301#false} assume !(~x~0 < ~i~0); {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {9301#false} ~x~0 := 1 + ~i~0; {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L273 TraceCheckUtils]: 60: Hoare triple {9301#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); {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L256 TraceCheckUtils]: 61: Hoare triple {9301#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9301#false} is VALID [2018-11-23 11:52:25,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {9301#false} ~cond := #in~cond; {9301#false} is VALID [2018-11-23 11:52:25,559 INFO L273 TraceCheckUtils]: 63: Hoare triple {9301#false} assume 0 == ~cond; {9301#false} is VALID [2018-11-23 11:52:25,559 INFO L273 TraceCheckUtils]: 64: Hoare triple {9301#false} assume !false; {9301#false} is VALID [2018-11-23 11:52:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:25,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:25,562 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-23 11:52:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:25,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 11:52:25,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:25,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:25,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {9300#true} call ULTIMATE.init(); {9300#true} is VALID [2018-11-23 11:52:25,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {9300#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9300#true} is VALID [2018-11-23 11:52:25,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {9300#true} assume true; {9300#true} is VALID [2018-11-23 11:52:25,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9300#true} {9300#true} #130#return; {9300#true} is VALID [2018-11-23 11:52:25,813 INFO L256 TraceCheckUtils]: 4: Hoare triple {9300#true} call #t~ret15 := main(); {9300#true} is VALID [2018-11-23 11:52:25,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {9300#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {9338#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:25,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {9338#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {9342#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:25,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {9342#(<= 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); {9342#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:25,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {9342#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9342#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:25,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {9342#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {9304#(<= 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); {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {9304#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9304#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:25,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {9304#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {9305#(<= 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); {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {9305#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9305#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:25,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {9305#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {9306#(<= 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); {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {9306#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9306#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:25,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {9306#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {9307#(<= 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); {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {9307#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9307#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:25,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {9307#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {9308#(<= 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); {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {9308#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9308#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:25,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {9308#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {9309#(<= 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); {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {9309#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9309#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:25,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {9309#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {9310#(<= 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); {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {9310#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9310#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:25,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {9310#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {9311#(<= 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); {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {9311#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9311#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:25,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {9311#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {9312#(<= 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); {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {9312#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9312#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:25,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {9312#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {9313#(<= 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); {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {9313#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9313#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:25,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {9313#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {9314#(<= 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); {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {9314#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9314#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:25,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {9314#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {9315#(<= 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); {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {9315#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9315#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:25,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {9315#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {9316#(<= 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); {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {9316#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9316#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:25,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {9316#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,855 INFO L273 TraceCheckUtils]: 49: Hoare triple {9317#(<= 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); {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,855 INFO L273 TraceCheckUtils]: 50: Hoare triple {9317#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9317#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:25,856 INFO L273 TraceCheckUtils]: 51: Hoare triple {9317#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,857 INFO L273 TraceCheckUtils]: 52: Hoare triple {9318#(<= 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); {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {9318#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9318#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:25,858 INFO L273 TraceCheckUtils]: 54: Hoare triple {9318#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {9319#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:25,859 INFO L273 TraceCheckUtils]: 55: Hoare triple {9319#(<= main_~k~0 16)} assume !(~k~0 < 100000); {9301#false} is VALID [2018-11-23 11:52:25,859 INFO L273 TraceCheckUtils]: 56: Hoare triple {9301#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); {9301#false} is VALID [2018-11-23 11:52:25,859 INFO L273 TraceCheckUtils]: 57: Hoare triple {9301#false} ~x~0 := 0; {9301#false} is VALID [2018-11-23 11:52:25,859 INFO L273 TraceCheckUtils]: 58: Hoare triple {9301#false} assume !(~x~0 < ~i~0); {9301#false} is VALID [2018-11-23 11:52:25,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {9301#false} ~x~0 := 1 + ~i~0; {9301#false} is VALID [2018-11-23 11:52:25,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {9301#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); {9301#false} is VALID [2018-11-23 11:52:25,860 INFO L256 TraceCheckUtils]: 61: Hoare triple {9301#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {9301#false} is VALID [2018-11-23 11:52:25,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {9301#false} ~cond := #in~cond; {9301#false} is VALID [2018-11-23 11:52:25,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {9301#false} assume 0 == ~cond; {9301#false} is VALID [2018-11-23 11:52:25,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {9301#false} assume !false; {9301#false} is VALID [2018-11-23 11:52:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-11-23 11:52:25,885 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-23 11:52:25,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:25,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:52:25,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:25,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:52:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:52:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:25,956 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 22 states. [2018-11-23 11:52:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,128 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2018-11-23 11:52:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:29,128 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-23 11:52:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:52:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2018-11-23 11:52:29,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 175 transitions. [2018-11-23 11:52:29,334 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-23 11:52:29,337 INFO L225 Difference]: With dead ends: 138 [2018-11-23 11:52:29,337 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:52:29,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:52:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:52:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-11-23 11:52:29,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:29,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 96 states. [2018-11-23 11:52:29,407 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 96 states. [2018-11-23 11:52:29,408 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 96 states. [2018-11-23 11:52:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,411 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2018-11-23 11:52:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-11-23 11:52:29,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,412 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 104 states. [2018-11-23 11:52:29,412 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 104 states. [2018-11-23 11:52:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,414 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2018-11-23 11:52:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-11-23 11:52:29,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:29,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:52:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2018-11-23 11:52:29,418 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 65 [2018-11-23 11:52:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:29,418 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2018-11-23 11:52:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:52:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2018-11-23 11:52:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 11:52:29,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:29,420 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:29,420 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:29,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1852378336, now seen corresponding path program 6 times [2018-11-23 11:52:29,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {10078#true} call ULTIMATE.init(); {10078#true} is VALID [2018-11-23 11:52:29,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {10078#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10078#true} is VALID [2018-11-23 11:52:29,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {10078#true} assume true; {10078#true} is VALID [2018-11-23 11:52:29,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10078#true} {10078#true} #130#return; {10078#true} is VALID [2018-11-23 11:52:29,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {10078#true} call #t~ret15 := main(); {10078#true} is VALID [2018-11-23 11:52:29,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {10078#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10080#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:29,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {10080#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10081#(= main_~k~0 0)} is VALID [2018-11-23 11:52:29,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {10081#(= 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); {10081#(= main_~k~0 0)} is VALID [2018-11-23 11:52:29,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {10081#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10081#(= main_~k~0 0)} is VALID [2018-11-23 11:52:29,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {10081#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {10082#(<= 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); {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {10082#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:29,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {10082#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {10083#(<= 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); {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:29,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {10084#(<= 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); {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {10084#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:29,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {10084#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {10085#(<= 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); {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {10085#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:29,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {10085#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {10086#(<= 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); {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {10086#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:29,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {10086#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {10087#(<= 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); {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {10087#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:29,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {10087#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {10088#(<= 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); {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {10088#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:29,861 INFO L273 TraceCheckUtils]: 30: Hoare triple {10088#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {10089#(<= 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); {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {10089#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:29,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {10089#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {10090#(<= 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); {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {10090#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:29,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {10090#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {10091#(<= 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); {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {10091#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:29,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {10091#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {10092#(<= 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); {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {10092#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:29,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {10092#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {10093#(<= 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); {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {10093#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:29,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {10093#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {10094#(<= 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); {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {10094#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:29,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {10094#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:29,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {10095#(<= 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); {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:29,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {10095#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:29,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {10095#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:29,893 INFO L273 TraceCheckUtils]: 52: Hoare triple {10096#(<= 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); {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:29,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {10096#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:29,894 INFO L273 TraceCheckUtils]: 54: Hoare triple {10096#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:29,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {10097#(<= 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); {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:29,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {10097#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:29,896 INFO L273 TraceCheckUtils]: 57: Hoare triple {10097#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {10098#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:29,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {10098#(<= main_~k~0 17)} assume !(~k~0 < 100000); {10079#false} is VALID [2018-11-23 11:52:29,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {10079#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); {10079#false} is VALID [2018-11-23 11:52:29,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {10079#false} ~x~0 := 0; {10079#false} is VALID [2018-11-23 11:52:29,897 INFO L273 TraceCheckUtils]: 61: Hoare triple {10079#false} assume !(~x~0 < ~i~0); {10079#false} is VALID [2018-11-23 11:52:29,897 INFO L273 TraceCheckUtils]: 62: Hoare triple {10079#false} ~x~0 := 1 + ~i~0; {10079#false} is VALID [2018-11-23 11:52:29,897 INFO L273 TraceCheckUtils]: 63: Hoare triple {10079#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); {10079#false} is VALID [2018-11-23 11:52:29,898 INFO L256 TraceCheckUtils]: 64: Hoare triple {10079#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10079#false} is VALID [2018-11-23 11:52:29,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {10079#false} ~cond := #in~cond; {10079#false} is VALID [2018-11-23 11:52:29,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {10079#false} assume 0 == ~cond; {10079#false} is VALID [2018-11-23 11:52:29,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {10079#false} assume !false; {10079#false} is VALID [2018-11-23 11:52:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:29,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:29,903 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-23 11:52:29,912 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:29,989 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-23 11:52:29,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:30,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:30,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {10078#true} call ULTIMATE.init(); {10078#true} is VALID [2018-11-23 11:52:30,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {10078#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10078#true} is VALID [2018-11-23 11:52:30,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {10078#true} assume true; {10078#true} is VALID [2018-11-23 11:52:30,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10078#true} {10078#true} #130#return; {10078#true} is VALID [2018-11-23 11:52:30,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {10078#true} call #t~ret15 := main(); {10078#true} is VALID [2018-11-23 11:52:30,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {10078#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10117#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:30,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {10117#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10121#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:30,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {10121#(<= 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); {10121#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:30,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {10121#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10121#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:30,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {10121#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:30,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {10082#(<= 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); {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:30,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {10082#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10082#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:30,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {10082#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:30,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {10083#(<= 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); {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:30,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10083#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:30,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:30,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {10084#(<= 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); {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:30,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {10084#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10084#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:30,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {10084#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:30,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {10085#(<= 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); {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:30,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {10085#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10085#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:30,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {10085#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:30,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {10086#(<= 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); {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:30,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {10086#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10086#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:30,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {10086#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:30,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {10087#(<= 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); {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:30,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {10087#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10087#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:30,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {10087#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:30,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {10088#(<= 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); {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:30,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {10088#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10088#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:30,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {10088#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:30,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {10089#(<= 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); {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:30,173 INFO L273 TraceCheckUtils]: 32: Hoare triple {10089#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10089#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:30,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {10089#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:30,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {10090#(<= 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); {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:30,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {10090#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10090#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:30,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {10090#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:30,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {10091#(<= 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); {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:30,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {10091#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10091#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:30,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {10091#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:30,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {10092#(<= 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); {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:30,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {10092#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10092#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:30,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {10092#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:30,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {10093#(<= 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); {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:30,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {10093#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10093#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:30,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {10093#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:30,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {10094#(<= 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); {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:30,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {10094#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10094#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:30,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {10094#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:30,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {10095#(<= 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); {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:30,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {10095#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10095#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:30,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {10095#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:30,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {10096#(<= 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); {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:30,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {10096#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10096#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:30,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {10096#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:30,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {10097#(<= 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); {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:30,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {10097#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10097#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:30,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {10097#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {10098#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:30,188 INFO L273 TraceCheckUtils]: 58: Hoare triple {10098#(<= main_~k~0 17)} assume !(~k~0 < 100000); {10079#false} is VALID [2018-11-23 11:52:30,188 INFO L273 TraceCheckUtils]: 59: Hoare triple {10079#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); {10079#false} is VALID [2018-11-23 11:52:30,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {10079#false} ~x~0 := 0; {10079#false} is VALID [2018-11-23 11:52:30,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {10079#false} assume !(~x~0 < ~i~0); {10079#false} is VALID [2018-11-23 11:52:30,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {10079#false} ~x~0 := 1 + ~i~0; {10079#false} is VALID [2018-11-23 11:52:30,189 INFO L273 TraceCheckUtils]: 63: Hoare triple {10079#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); {10079#false} is VALID [2018-11-23 11:52:30,189 INFO L256 TraceCheckUtils]: 64: Hoare triple {10079#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10079#false} is VALID [2018-11-23 11:52:30,189 INFO L273 TraceCheckUtils]: 65: Hoare triple {10079#false} ~cond := #in~cond; {10079#false} is VALID [2018-11-23 11:52:30,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {10079#false} assume 0 == ~cond; {10079#false} is VALID [2018-11-23 11:52:30,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {10079#false} assume !false; {10079#false} is VALID [2018-11-23 11:52:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:30,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:30,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-11-23 11:52:30,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-23 11:52:30,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:30,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:52:30,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:30,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:52:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:52:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:30,285 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand 23 states. [2018-11-23 11:52:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,823 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2018-11-23 11:52:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:52:31,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-23 11:52:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:52:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 179 transitions. [2018-11-23 11:52:31,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 179 transitions. [2018-11-23 11:52:32,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:32,046 INFO L225 Difference]: With dead ends: 141 [2018-11-23 11:52:32,046 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:52:32,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:52:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:52:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2018-11-23 11:52:32,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:32,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 99 states. [2018-11-23 11:52:32,108 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 99 states. [2018-11-23 11:52:32,108 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 99 states. [2018-11-23 11:52:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:32,110 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2018-11-23 11:52:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2018-11-23 11:52:32,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:32,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:32,111 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 107 states. [2018-11-23 11:52:32,111 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 107 states. [2018-11-23 11:52:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:32,113 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2018-11-23 11:52:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2018-11-23 11:52:32,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:32,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:32,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:32,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:52:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-11-23 11:52:32,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 68 [2018-11-23 11:52:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:32,116 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-11-23 11:52:32,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:52:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-23 11:52:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:52:32,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:32,117 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:32,118 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:32,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1765549161, now seen corresponding path program 7 times [2018-11-23 11:52:32,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:32,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:32,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:33,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {10882#true} call ULTIMATE.init(); {10882#true} is VALID [2018-11-23 11:52:33,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {10882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10882#true} is VALID [2018-11-23 11:52:33,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {10882#true} assume true; {10882#true} is VALID [2018-11-23 11:52:33,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10882#true} {10882#true} #130#return; {10882#true} is VALID [2018-11-23 11:52:33,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {10882#true} call #t~ret15 := main(); {10882#true} is VALID [2018-11-23 11:52:33,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {10882#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10884#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:33,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {10884#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10885#(= main_~k~0 0)} is VALID [2018-11-23 11:52:33,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {10885#(= 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); {10885#(= main_~k~0 0)} is VALID [2018-11-23 11:52:33,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {10885#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10885#(= main_~k~0 0)} is VALID [2018-11-23 11:52:33,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {10885#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {10886#(<= 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); {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {10886#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {10886#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {10887#(<= 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); {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {10887#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {10887#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {10888#(<= 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); {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {10888#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {10888#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {10889#(<= 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); {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {10889#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {10889#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {10890#(<= 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); {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {10890#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {10890#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {10891#(<= 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); {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {10891#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {10891#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {10892#(<= 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); {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {10892#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {10892#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {10893#(<= 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); {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {10893#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {10893#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {10894#(<= 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); {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {10894#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,186 INFO L273 TraceCheckUtils]: 36: Hoare triple {10894#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,187 INFO L273 TraceCheckUtils]: 37: Hoare triple {10895#(<= 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); {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {10895#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {10895#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {10896#(<= 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); {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,189 INFO L273 TraceCheckUtils]: 41: Hoare triple {10896#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {10896#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {10897#(<= 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); {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,191 INFO L273 TraceCheckUtils]: 44: Hoare triple {10897#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,191 INFO L273 TraceCheckUtils]: 45: Hoare triple {10897#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,192 INFO L273 TraceCheckUtils]: 46: Hoare triple {10898#(<= 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); {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,192 INFO L273 TraceCheckUtils]: 47: Hoare triple {10898#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,193 INFO L273 TraceCheckUtils]: 48: Hoare triple {10898#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,194 INFO L273 TraceCheckUtils]: 49: Hoare triple {10899#(<= 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); {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,194 INFO L273 TraceCheckUtils]: 50: Hoare triple {10899#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,195 INFO L273 TraceCheckUtils]: 51: Hoare triple {10899#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {10900#(<= 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); {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,196 INFO L273 TraceCheckUtils]: 53: Hoare triple {10900#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,197 INFO L273 TraceCheckUtils]: 54: Hoare triple {10900#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,197 INFO L273 TraceCheckUtils]: 55: Hoare triple {10901#(<= 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); {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,198 INFO L273 TraceCheckUtils]: 56: Hoare triple {10901#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {10901#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,199 INFO L273 TraceCheckUtils]: 58: Hoare triple {10902#(<= 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); {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {10902#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {10902#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {10903#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:33,201 INFO L273 TraceCheckUtils]: 61: Hoare triple {10903#(<= main_~k~0 18)} assume !(~k~0 < 100000); {10883#false} is VALID [2018-11-23 11:52:33,201 INFO L273 TraceCheckUtils]: 62: Hoare triple {10883#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); {10883#false} is VALID [2018-11-23 11:52:33,201 INFO L273 TraceCheckUtils]: 63: Hoare triple {10883#false} ~x~0 := 0; {10883#false} is VALID [2018-11-23 11:52:33,202 INFO L273 TraceCheckUtils]: 64: Hoare triple {10883#false} assume !(~x~0 < ~i~0); {10883#false} is VALID [2018-11-23 11:52:33,202 INFO L273 TraceCheckUtils]: 65: Hoare triple {10883#false} ~x~0 := 1 + ~i~0; {10883#false} is VALID [2018-11-23 11:52:33,202 INFO L273 TraceCheckUtils]: 66: Hoare triple {10883#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); {10883#false} is VALID [2018-11-23 11:52:33,202 INFO L256 TraceCheckUtils]: 67: Hoare triple {10883#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10883#false} is VALID [2018-11-23 11:52:33,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {10883#false} ~cond := #in~cond; {10883#false} is VALID [2018-11-23 11:52:33,203 INFO L273 TraceCheckUtils]: 69: Hoare triple {10883#false} assume 0 == ~cond; {10883#false} is VALID [2018-11-23 11:52:33,203 INFO L273 TraceCheckUtils]: 70: Hoare triple {10883#false} assume !false; {10883#false} is VALID [2018-11-23 11:52:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:33,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:33,207 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-23 11:52:33,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:33,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:33,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {10882#true} call ULTIMATE.init(); {10882#true} is VALID [2018-11-23 11:52:33,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {10882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10882#true} is VALID [2018-11-23 11:52:33,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {10882#true} assume true; {10882#true} is VALID [2018-11-23 11:52:33,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10882#true} {10882#true} #130#return; {10882#true} is VALID [2018-11-23 11:52:33,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {10882#true} call #t~ret15 := main(); {10882#true} is VALID [2018-11-23 11:52:33,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {10882#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {10922#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:33,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {10922#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {10926#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:33,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {10926#(<= 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); {10926#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:33,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {10926#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10926#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:33,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {10926#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {10886#(<= 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); {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {10886#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10886#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:33,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {10886#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {10887#(<= 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); {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {10887#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10887#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:33,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {10887#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {10888#(<= 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); {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {10888#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10888#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:33,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {10888#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {10889#(<= 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); {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {10889#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10889#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:33,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {10889#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {10890#(<= 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); {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {10890#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10890#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:33,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {10890#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {10891#(<= 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); {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {10891#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10891#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:33,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {10891#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {10892#(<= 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); {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {10892#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10892#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:33,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {10892#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {10893#(<= 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); {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {10893#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10893#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:33,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {10893#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {10894#(<= 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); {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {10894#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10894#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:33,458 INFO L273 TraceCheckUtils]: 36: Hoare triple {10894#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {10895#(<= 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); {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,459 INFO L273 TraceCheckUtils]: 38: Hoare triple {10895#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10895#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:33,460 INFO L273 TraceCheckUtils]: 39: Hoare triple {10895#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {10896#(<= 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); {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {10896#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10896#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:33,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {10896#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,462 INFO L273 TraceCheckUtils]: 43: Hoare triple {10897#(<= 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); {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {10897#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10897#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:33,463 INFO L273 TraceCheckUtils]: 45: Hoare triple {10897#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {10898#(<= 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); {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {10898#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10898#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:33,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {10898#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {10899#(<= 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); {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,466 INFO L273 TraceCheckUtils]: 50: Hoare triple {10899#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10899#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:33,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {10899#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,467 INFO L273 TraceCheckUtils]: 52: Hoare triple {10900#(<= 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); {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,467 INFO L273 TraceCheckUtils]: 53: Hoare triple {10900#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10900#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:33,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {10900#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,469 INFO L273 TraceCheckUtils]: 55: Hoare triple {10901#(<= 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); {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {10901#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10901#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:33,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {10901#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {10902#(<= 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); {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,471 INFO L273 TraceCheckUtils]: 59: Hoare triple {10902#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10902#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:33,472 INFO L273 TraceCheckUtils]: 60: Hoare triple {10902#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {10903#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:33,472 INFO L273 TraceCheckUtils]: 61: Hoare triple {10903#(<= main_~k~0 18)} assume !(~k~0 < 100000); {10883#false} is VALID [2018-11-23 11:52:33,472 INFO L273 TraceCheckUtils]: 62: Hoare triple {10883#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); {10883#false} is VALID [2018-11-23 11:52:33,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {10883#false} ~x~0 := 0; {10883#false} is VALID [2018-11-23 11:52:33,473 INFO L273 TraceCheckUtils]: 64: Hoare triple {10883#false} assume !(~x~0 < ~i~0); {10883#false} is VALID [2018-11-23 11:52:33,473 INFO L273 TraceCheckUtils]: 65: Hoare triple {10883#false} ~x~0 := 1 + ~i~0; {10883#false} is VALID [2018-11-23 11:52:33,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {10883#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); {10883#false} is VALID [2018-11-23 11:52:33,473 INFO L256 TraceCheckUtils]: 67: Hoare triple {10883#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {10883#false} is VALID [2018-11-23 11:52:33,474 INFO L273 TraceCheckUtils]: 68: Hoare triple {10883#false} ~cond := #in~cond; {10883#false} is VALID [2018-11-23 11:52:33,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {10883#false} assume 0 == ~cond; {10883#false} is VALID [2018-11-23 11:52:33,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {10883#false} assume !false; {10883#false} is VALID [2018-11-23 11:52:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:33,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:33,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-11-23 11:52:33,501 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-23 11:52:33,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:33,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:33,571 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-23 11:52:33,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:33,572 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 24 states. [2018-11-23 11:52:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,257 INFO L93 Difference]: Finished difference Result 144 states and 190 transitions. [2018-11-23 11:52:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:35,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-23 11:52:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:52:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2018-11-23 11:52:35,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 183 transitions. [2018-11-23 11:52:35,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:35,429 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:52:35,429 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:52:35,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 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-23 11:52:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:52:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-11-23 11:52:35,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:35,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 102 states. [2018-11-23 11:52:35,607 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 102 states. [2018-11-23 11:52:35,607 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 102 states. [2018-11-23 11:52:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,610 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-23 11:52:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2018-11-23 11:52:35,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,611 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 110 states. [2018-11-23 11:52:35,611 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 110 states. [2018-11-23 11:52:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,613 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-23 11:52:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2018-11-23 11:52:35,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:35,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:52:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-11-23 11:52:35,616 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 71 [2018-11-23 11:52:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:35,616 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-11-23 11:52:35,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-11-23 11:52:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 11:52:35,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:35,618 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:35,618 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:35,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1239319168, now seen corresponding path program 8 times [2018-11-23 11:52:35,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:35,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:35,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:35,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {11712#true} call ULTIMATE.init(); {11712#true} is VALID [2018-11-23 11:52:36,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {11712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11712#true} is VALID [2018-11-23 11:52:36,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {11712#true} assume true; {11712#true} is VALID [2018-11-23 11:52:36,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11712#true} {11712#true} #130#return; {11712#true} is VALID [2018-11-23 11:52:36,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {11712#true} call #t~ret15 := main(); {11712#true} is VALID [2018-11-23 11:52:36,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {11712#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11714#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:36,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {11714#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {11715#(= main_~k~0 0)} is VALID [2018-11-23 11:52:36,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {11715#(= 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); {11715#(= main_~k~0 0)} is VALID [2018-11-23 11:52:36,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {11715#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11715#(= main_~k~0 0)} is VALID [2018-11-23 11:52:36,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {11715#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {11716#(<= 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); {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {11716#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {11716#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {11717#(<= 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); {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {11717#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {11717#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {11718#(<= 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); {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {11718#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {11718#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {11719#(<= 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); {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {11719#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {11719#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {11720#(<= 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); {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {11720#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {11720#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {11721#(<= 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); {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {11721#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {11721#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {11722#(<= 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); {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {11722#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {11722#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {11723#(<= 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); {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {11723#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {11723#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {11724#(<= 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); {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {11724#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {11724#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {11725#(<= 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); {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {11725#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {11725#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {11726#(<= 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); {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {11726#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {11726#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {11727#(<= 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); {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {11727#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {11727#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {11728#(<= 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); {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {11728#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {11728#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {11729#(<= 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); {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {11729#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {11729#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {11730#(<= 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); {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {11730#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {11730#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {11731#(<= 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); {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {11731#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,558 INFO L273 TraceCheckUtils]: 57: Hoare triple {11731#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {11732#(<= 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); {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,559 INFO L273 TraceCheckUtils]: 59: Hoare triple {11732#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {11732#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {11733#(<= 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); {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {11733#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {11733#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {11734#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:36,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {11734#(<= main_~k~0 19)} assume !(~k~0 < 100000); {11713#false} is VALID [2018-11-23 11:52:36,562 INFO L273 TraceCheckUtils]: 65: Hoare triple {11713#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); {11713#false} is VALID [2018-11-23 11:52:36,562 INFO L273 TraceCheckUtils]: 66: Hoare triple {11713#false} ~x~0 := 0; {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L273 TraceCheckUtils]: 67: Hoare triple {11713#false} assume !(~x~0 < ~i~0); {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L273 TraceCheckUtils]: 68: Hoare triple {11713#false} ~x~0 := 1 + ~i~0; {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L273 TraceCheckUtils]: 69: Hoare triple {11713#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); {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L256 TraceCheckUtils]: 70: Hoare triple {11713#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L273 TraceCheckUtils]: 71: Hoare triple {11713#false} ~cond := #in~cond; {11713#false} is VALID [2018-11-23 11:52:36,563 INFO L273 TraceCheckUtils]: 72: Hoare triple {11713#false} assume 0 == ~cond; {11713#false} is VALID [2018-11-23 11:52:36,564 INFO L273 TraceCheckUtils]: 73: Hoare triple {11713#false} assume !false; {11713#false} is VALID [2018-11-23 11:52:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:36,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:36,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 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-23 11:52:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:36,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:36,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:36,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {11712#true} call ULTIMATE.init(); {11712#true} is VALID [2018-11-23 11:52:36,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {11712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11712#true} is VALID [2018-11-23 11:52:36,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {11712#true} assume true; {11712#true} is VALID [2018-11-23 11:52:36,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11712#true} {11712#true} #130#return; {11712#true} is VALID [2018-11-23 11:52:36,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {11712#true} call #t~ret15 := main(); {11712#true} is VALID [2018-11-23 11:52:36,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {11712#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {11753#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:36,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {11753#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {11757#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:36,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {11757#(<= 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); {11757#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:36,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {11757#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11757#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:36,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {11757#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {11716#(<= 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); {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {11716#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11716#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:36,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {11716#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {11717#(<= 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); {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {11717#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11717#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:36,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {11717#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {11718#(<= 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); {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {11718#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11718#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:36,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {11718#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {11719#(<= 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); {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {11719#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11719#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:36,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {11719#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {11720#(<= 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); {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {11720#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11720#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:36,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {11720#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {11721#(<= 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); {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {11721#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11721#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:36,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {11721#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {11722#(<= 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); {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {11722#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11722#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:36,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {11722#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {11723#(<= 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); {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {11723#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11723#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:36,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {11723#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {11724#(<= 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); {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {11724#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11724#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:36,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {11724#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {11725#(<= 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); {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {11725#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11725#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:36,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {11725#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {11726#(<= 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); {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,827 INFO L273 TraceCheckUtils]: 41: Hoare triple {11726#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11726#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:36,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {11726#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,828 INFO L273 TraceCheckUtils]: 43: Hoare triple {11727#(<= 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); {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,828 INFO L273 TraceCheckUtils]: 44: Hoare triple {11727#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11727#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:36,829 INFO L273 TraceCheckUtils]: 45: Hoare triple {11727#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {11728#(<= 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); {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {11728#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11728#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:36,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {11728#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {11729#(<= 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); {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {11729#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11729#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:36,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {11729#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {11730#(<= 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); {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {11730#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11730#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:36,834 INFO L273 TraceCheckUtils]: 54: Hoare triple {11730#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,835 INFO L273 TraceCheckUtils]: 55: Hoare triple {11731#(<= 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); {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,835 INFO L273 TraceCheckUtils]: 56: Hoare triple {11731#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11731#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:36,836 INFO L273 TraceCheckUtils]: 57: Hoare triple {11731#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {11732#(<= 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); {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,837 INFO L273 TraceCheckUtils]: 59: Hoare triple {11732#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11732#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:36,838 INFO L273 TraceCheckUtils]: 60: Hoare triple {11732#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,839 INFO L273 TraceCheckUtils]: 61: Hoare triple {11733#(<= 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); {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,839 INFO L273 TraceCheckUtils]: 62: Hoare triple {11733#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11733#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:36,840 INFO L273 TraceCheckUtils]: 63: Hoare triple {11733#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {11734#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:36,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {11734#(<= main_~k~0 19)} assume !(~k~0 < 100000); {11713#false} is VALID [2018-11-23 11:52:36,841 INFO L273 TraceCheckUtils]: 65: Hoare triple {11713#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); {11713#false} is VALID [2018-11-23 11:52:36,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {11713#false} ~x~0 := 0; {11713#false} is VALID [2018-11-23 11:52:36,841 INFO L273 TraceCheckUtils]: 67: Hoare triple {11713#false} assume !(~x~0 < ~i~0); {11713#false} is VALID [2018-11-23 11:52:36,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {11713#false} ~x~0 := 1 + ~i~0; {11713#false} is VALID [2018-11-23 11:52:36,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {11713#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); {11713#false} is VALID [2018-11-23 11:52:36,842 INFO L256 TraceCheckUtils]: 70: Hoare triple {11713#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {11713#false} is VALID [2018-11-23 11:52:36,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {11713#false} ~cond := #in~cond; {11713#false} is VALID [2018-11-23 11:52:36,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {11713#false} assume 0 == ~cond; {11713#false} is VALID [2018-11-23 11:52:36,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {11713#false} assume !false; {11713#false} is VALID [2018-11-23 11:52:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-11-23 11:52:36,866 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-23 11:52:36,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:36,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:52:36,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:36,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:52:36,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:52:36,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:36,963 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 25 states. [2018-11-23 11:52:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:38,601 INFO L93 Difference]: Finished difference Result 147 states and 194 transitions. [2018-11-23 11:52:38,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:52:38,601 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-23 11:52:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:52:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 187 transitions. [2018-11-23 11:52:38,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 187 transitions. [2018-11-23 11:52:38,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:38,791 INFO L225 Difference]: With dead ends: 147 [2018-11-23 11:52:38,792 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:52:38,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:52:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:52:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-11-23 11:52:38,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:38,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 105 states. [2018-11-23 11:52:38,957 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 105 states. [2018-11-23 11:52:38,957 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 105 states. [2018-11-23 11:52:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:38,960 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2018-11-23 11:52:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2018-11-23 11:52:38,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:38,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:38,960 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 113 states. [2018-11-23 11:52:38,961 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 113 states. [2018-11-23 11:52:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:38,963 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2018-11-23 11:52:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2018-11-23 11:52:38,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:38,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:38,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:38,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:52:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2018-11-23 11:52:38,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 74 [2018-11-23 11:52:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:38,966 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2018-11-23 11:52:38,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:52:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2018-11-23 11:52:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:52:38,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:38,967 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:38,967 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:38,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash -952228105, now seen corresponding path program 9 times [2018-11-23 11:52:38,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:38,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:38,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:39,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {12568#true} call ULTIMATE.init(); {12568#true} is VALID [2018-11-23 11:52:39,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {12568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12568#true} is VALID [2018-11-23 11:52:39,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {12568#true} assume true; {12568#true} is VALID [2018-11-23 11:52:39,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12568#true} {12568#true} #130#return; {12568#true} is VALID [2018-11-23 11:52:39,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {12568#true} call #t~ret15 := main(); {12568#true} is VALID [2018-11-23 11:52:39,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {12568#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12570#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:39,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {12570#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {12571#(= main_~k~0 0)} is VALID [2018-11-23 11:52:39,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {12571#(= 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); {12571#(= main_~k~0 0)} is VALID [2018-11-23 11:52:39,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {12571#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12571#(= main_~k~0 0)} is VALID [2018-11-23 11:52:39,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {12571#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {12572#(<= 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); {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {12572#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {12572#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {12573#(<= 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); {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {12573#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {12573#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {12574#(<= 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); {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {12574#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {12574#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {12575#(<= 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); {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {12575#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {12575#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {12576#(<= 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); {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {12576#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {12576#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {12577#(<= 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); {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {12577#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {12577#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {12578#(<= 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); {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {12578#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {12578#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {12579#(<= 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); {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {12579#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {12579#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {12580#(<= 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); {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {12580#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {12580#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {12581#(<= 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); {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {12581#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {12581#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {12582#(<= 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); {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {12582#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {12582#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {12583#(<= 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); {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {12583#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {12583#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {12584#(<= 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); {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {12584#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {12584#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {12585#(<= 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); {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {12585#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {12585#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {12586#(<= 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); {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {12586#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {12586#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {12587#(<= 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); {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {12587#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {12587#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,423 INFO L273 TraceCheckUtils]: 58: Hoare triple {12588#(<= 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); {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {12588#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {12588#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,425 INFO L273 TraceCheckUtils]: 61: Hoare triple {12589#(<= 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); {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,425 INFO L273 TraceCheckUtils]: 62: Hoare triple {12589#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,426 INFO L273 TraceCheckUtils]: 63: Hoare triple {12589#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {12590#(<= 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); {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,427 INFO L273 TraceCheckUtils]: 65: Hoare triple {12590#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {12590#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {12591#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:39,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {12591#(<= main_~k~0 20)} assume !(~k~0 < 100000); {12569#false} is VALID [2018-11-23 11:52:39,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {12569#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); {12569#false} is VALID [2018-11-23 11:52:39,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {12569#false} ~x~0 := 0; {12569#false} is VALID [2018-11-23 11:52:39,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {12569#false} assume !(~x~0 < ~i~0); {12569#false} is VALID [2018-11-23 11:52:39,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {12569#false} ~x~0 := 1 + ~i~0; {12569#false} is VALID [2018-11-23 11:52:39,429 INFO L273 TraceCheckUtils]: 72: Hoare triple {12569#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); {12569#false} is VALID [2018-11-23 11:52:39,430 INFO L256 TraceCheckUtils]: 73: Hoare triple {12569#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12569#false} is VALID [2018-11-23 11:52:39,430 INFO L273 TraceCheckUtils]: 74: Hoare triple {12569#false} ~cond := #in~cond; {12569#false} is VALID [2018-11-23 11:52:39,430 INFO L273 TraceCheckUtils]: 75: Hoare triple {12569#false} assume 0 == ~cond; {12569#false} is VALID [2018-11-23 11:52:39,430 INFO L273 TraceCheckUtils]: 76: Hoare triple {12569#false} assume !false; {12569#false} is VALID [2018-11-23 11:52:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:39,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:39,436 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-23 11:52:39,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:39,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 11:52:39,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:39,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:39,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {12568#true} call ULTIMATE.init(); {12568#true} is VALID [2018-11-23 11:52:39,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {12568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12568#true} is VALID [2018-11-23 11:52:39,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {12568#true} assume true; {12568#true} is VALID [2018-11-23 11:52:39,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12568#true} {12568#true} #130#return; {12568#true} is VALID [2018-11-23 11:52:39,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {12568#true} call #t~ret15 := main(); {12568#true} is VALID [2018-11-23 11:52:39,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {12568#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {12610#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:39,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {12610#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {12614#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:39,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {12614#(<= 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); {12614#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:39,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {12614#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12614#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:39,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {12614#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {12572#(<= 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); {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {12572#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {12572#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:39,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {12572#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {12573#(<= 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); {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {12573#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12573#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:39,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {12573#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {12574#(<= 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); {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {12574#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12574#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:39,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {12574#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {12575#(<= 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); {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {12575#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12575#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:39,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {12575#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {12576#(<= 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); {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {12576#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12576#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:39,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {12576#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {12577#(<= 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); {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {12577#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12577#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:39,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {12577#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {12578#(<= 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); {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,749 INFO L273 TraceCheckUtils]: 29: Hoare triple {12578#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12578#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:39,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {12578#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {12579#(<= 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); {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {12579#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12579#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:39,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {12579#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {12580#(<= 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); {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,753 INFO L273 TraceCheckUtils]: 35: Hoare triple {12580#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12580#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:39,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {12580#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {12581#(<= 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); {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {12581#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12581#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:39,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {12581#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {12582#(<= 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); {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {12582#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12582#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:39,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {12582#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {12583#(<= 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); {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {12583#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12583#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:39,758 INFO L273 TraceCheckUtils]: 45: Hoare triple {12583#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,759 INFO L273 TraceCheckUtils]: 46: Hoare triple {12584#(<= 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); {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {12584#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12584#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:39,760 INFO L273 TraceCheckUtils]: 48: Hoare triple {12584#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {12585#(<= 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); {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,761 INFO L273 TraceCheckUtils]: 50: Hoare triple {12585#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12585#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:39,762 INFO L273 TraceCheckUtils]: 51: Hoare triple {12585#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {12586#(<= 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); {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {12586#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12586#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:39,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {12586#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {12587#(<= 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); {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {12587#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12587#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:39,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {12587#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,766 INFO L273 TraceCheckUtils]: 58: Hoare triple {12588#(<= 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); {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {12588#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12588#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:39,767 INFO L273 TraceCheckUtils]: 60: Hoare triple {12588#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {12589#(<= 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); {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {12589#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12589#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:39,769 INFO L273 TraceCheckUtils]: 63: Hoare triple {12589#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {12590#(<= 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); {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,770 INFO L273 TraceCheckUtils]: 65: Hoare triple {12590#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {12590#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:39,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {12590#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {12591#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:39,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {12591#(<= main_~k~0 20)} assume !(~k~0 < 100000); {12569#false} is VALID [2018-11-23 11:52:39,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {12569#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); {12569#false} is VALID [2018-11-23 11:52:39,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {12569#false} ~x~0 := 0; {12569#false} is VALID [2018-11-23 11:52:39,771 INFO L273 TraceCheckUtils]: 70: Hoare triple {12569#false} assume !(~x~0 < ~i~0); {12569#false} is VALID [2018-11-23 11:52:39,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {12569#false} ~x~0 := 1 + ~i~0; {12569#false} is VALID [2018-11-23 11:52:39,772 INFO L273 TraceCheckUtils]: 72: Hoare triple {12569#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); {12569#false} is VALID [2018-11-23 11:52:39,772 INFO L256 TraceCheckUtils]: 73: Hoare triple {12569#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {12569#false} is VALID [2018-11-23 11:52:39,772 INFO L273 TraceCheckUtils]: 74: Hoare triple {12569#false} ~cond := #in~cond; {12569#false} is VALID [2018-11-23 11:52:39,772 INFO L273 TraceCheckUtils]: 75: Hoare triple {12569#false} assume 0 == ~cond; {12569#false} is VALID [2018-11-23 11:52:39,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {12569#false} assume !false; {12569#false} is VALID [2018-11-23 11:52:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:39,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:39,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-11-23 11:52:39,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 77 [2018-11-23 11:52:39,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:39,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:52:39,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:39,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:52:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:52:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:39,871 INFO L87 Difference]: Start difference. First operand 105 states and 137 transitions. Second operand 26 states. [2018-11-23 11:52:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,278 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2018-11-23 11:52:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:52:41,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 77 [2018-11-23 11:52:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:52:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2018-11-23 11:52:41,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 191 transitions. [2018-11-23 11:52:41,558 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-23 11:52:41,561 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:52:41,561 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 11:52:41,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 76 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-23 11:52:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 11:52:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-23 11:52:41,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:41,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 108 states. [2018-11-23 11:52:41,641 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 108 states. [2018-11-23 11:52:41,641 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 108 states. [2018-11-23 11:52:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,644 INFO L93 Difference]: Finished difference Result 116 states and 152 transitions. [2018-11-23 11:52:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2018-11-23 11:52:41,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,645 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 116 states. [2018-11-23 11:52:41,645 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 116 states. [2018-11-23 11:52:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,647 INFO L93 Difference]: Finished difference Result 116 states and 152 transitions. [2018-11-23 11:52:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2018-11-23 11:52:41,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:41,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:41,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:41,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:52:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2018-11-23 11:52:41,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 77 [2018-11-23 11:52:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:41,650 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2018-11-23 11:52:41,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:52:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2018-11-23 11:52:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 11:52:41,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:41,652 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:41,652 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:41,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 497743392, now seen corresponding path program 10 times [2018-11-23 11:52:41,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {13450#true} call ULTIMATE.init(); {13450#true} is VALID [2018-11-23 11:52:42,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {13450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13450#true} is VALID [2018-11-23 11:52:42,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {13450#true} assume true; {13450#true} is VALID [2018-11-23 11:52:42,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13450#true} {13450#true} #130#return; {13450#true} is VALID [2018-11-23 11:52:42,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {13450#true} call #t~ret15 := main(); {13450#true} is VALID [2018-11-23 11:52:42,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {13450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13452#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:42,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {13452#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {13453#(= main_~k~0 0)} is VALID [2018-11-23 11:52:42,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {13453#(= 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); {13453#(= main_~k~0 0)} is VALID [2018-11-23 11:52:42,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {13453#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13453#(= main_~k~0 0)} is VALID [2018-11-23 11:52:42,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {13453#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {13454#(<= 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); {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {13454#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {13454#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {13455#(<= 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); {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {13455#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {13455#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {13456#(<= 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); {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {13456#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {13456#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {13457#(<= 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); {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {13457#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {13457#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {13458#(<= 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); {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {13458#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {13458#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {13459#(<= 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); {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {13459#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {13459#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {13460#(<= 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); {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {13460#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {13460#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {13461#(<= 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); {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {13461#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {13461#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {13462#(<= 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); {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {13462#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {13462#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {13463#(<= 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); {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {13463#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {13463#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {13464#(<= 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); {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {13464#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {13464#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {13465#(<= 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); {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {13465#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,094 INFO L273 TraceCheckUtils]: 45: Hoare triple {13465#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {13466#(<= 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); {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {13466#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,096 INFO L273 TraceCheckUtils]: 48: Hoare triple {13466#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,096 INFO L273 TraceCheckUtils]: 49: Hoare triple {13467#(<= 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); {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {13467#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,098 INFO L273 TraceCheckUtils]: 51: Hoare triple {13467#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {13468#(<= 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); {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,099 INFO L273 TraceCheckUtils]: 53: Hoare triple {13468#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,099 INFO L273 TraceCheckUtils]: 54: Hoare triple {13468#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {13469#(<= 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); {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,100 INFO L273 TraceCheckUtils]: 56: Hoare triple {13469#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,101 INFO L273 TraceCheckUtils]: 57: Hoare triple {13469#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,101 INFO L273 TraceCheckUtils]: 58: Hoare triple {13470#(<= 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); {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {13470#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,103 INFO L273 TraceCheckUtils]: 60: Hoare triple {13470#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,103 INFO L273 TraceCheckUtils]: 61: Hoare triple {13471#(<= 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); {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,104 INFO L273 TraceCheckUtils]: 62: Hoare triple {13471#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,104 INFO L273 TraceCheckUtils]: 63: Hoare triple {13471#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {13472#(<= 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); {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {13472#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {13472#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {13473#(<= 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); {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,107 INFO L273 TraceCheckUtils]: 68: Hoare triple {13473#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,108 INFO L273 TraceCheckUtils]: 69: Hoare triple {13473#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {13474#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:42,108 INFO L273 TraceCheckUtils]: 70: Hoare triple {13474#(<= main_~k~0 21)} assume !(~k~0 < 100000); {13451#false} is VALID [2018-11-23 11:52:42,108 INFO L273 TraceCheckUtils]: 71: Hoare triple {13451#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); {13451#false} is VALID [2018-11-23 11:52:42,109 INFO L273 TraceCheckUtils]: 72: Hoare triple {13451#false} ~x~0 := 0; {13451#false} is VALID [2018-11-23 11:52:42,109 INFO L273 TraceCheckUtils]: 73: Hoare triple {13451#false} assume !(~x~0 < ~i~0); {13451#false} is VALID [2018-11-23 11:52:42,109 INFO L273 TraceCheckUtils]: 74: Hoare triple {13451#false} ~x~0 := 1 + ~i~0; {13451#false} is VALID [2018-11-23 11:52:42,109 INFO L273 TraceCheckUtils]: 75: Hoare triple {13451#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); {13451#false} is VALID [2018-11-23 11:52:42,109 INFO L256 TraceCheckUtils]: 76: Hoare triple {13451#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13451#false} is VALID [2018-11-23 11:52:42,110 INFO L273 TraceCheckUtils]: 77: Hoare triple {13451#false} ~cond := #in~cond; {13451#false} is VALID [2018-11-23 11:52:42,110 INFO L273 TraceCheckUtils]: 78: Hoare triple {13451#false} assume 0 == ~cond; {13451#false} is VALID [2018-11-23 11:52:42,110 INFO L273 TraceCheckUtils]: 79: Hoare triple {13451#false} assume !false; {13451#false} is VALID [2018-11-23 11:52:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:42,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:42,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 11:52:42,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:42,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:42,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {13450#true} call ULTIMATE.init(); {13450#true} is VALID [2018-11-23 11:52:42,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {13450#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13450#true} is VALID [2018-11-23 11:52:42,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {13450#true} assume true; {13450#true} is VALID [2018-11-23 11:52:42,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13450#true} {13450#true} #130#return; {13450#true} is VALID [2018-11-23 11:52:42,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {13450#true} call #t~ret15 := main(); {13450#true} is VALID [2018-11-23 11:52:42,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {13450#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {13493#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:42,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {13493#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {13497#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:42,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {13497#(<= 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); {13497#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:42,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {13497#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13497#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:42,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {13497#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {13454#(<= 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); {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {13454#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {13454#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:42,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {13454#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {13455#(<= 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); {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {13455#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13455#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:42,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {13455#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {13456#(<= 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); {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {13456#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13456#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:42,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {13456#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {13457#(<= 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); {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {13457#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13457#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:42,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {13457#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {13458#(<= 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); {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {13458#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13458#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:42,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {13458#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {13459#(<= 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); {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {13459#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13459#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:42,421 INFO L273 TraceCheckUtils]: 27: Hoare triple {13459#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {13460#(<= 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); {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {13460#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13460#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:42,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {13460#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {13461#(<= 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); {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {13461#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13461#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:42,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {13461#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {13462#(<= 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); {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {13462#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13462#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:42,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {13462#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {13463#(<= 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); {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {13463#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13463#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:42,428 INFO L273 TraceCheckUtils]: 39: Hoare triple {13463#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {13464#(<= 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); {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {13464#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13464#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:42,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {13464#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,430 INFO L273 TraceCheckUtils]: 43: Hoare triple {13465#(<= 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); {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,430 INFO L273 TraceCheckUtils]: 44: Hoare triple {13465#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13465#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:42,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {13465#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {13466#(<= 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); {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {13466#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13466#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:42,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {13466#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {13467#(<= 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); {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {13467#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13467#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:42,434 INFO L273 TraceCheckUtils]: 51: Hoare triple {13467#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {13468#(<= 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); {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {13468#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13468#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:42,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {13468#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {13469#(<= 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); {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {13469#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13469#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:42,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {13469#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,438 INFO L273 TraceCheckUtils]: 58: Hoare triple {13470#(<= 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); {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {13470#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13470#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:42,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {13470#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,440 INFO L273 TraceCheckUtils]: 61: Hoare triple {13471#(<= 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); {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,440 INFO L273 TraceCheckUtils]: 62: Hoare triple {13471#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13471#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:42,441 INFO L273 TraceCheckUtils]: 63: Hoare triple {13471#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,441 INFO L273 TraceCheckUtils]: 64: Hoare triple {13472#(<= 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); {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,442 INFO L273 TraceCheckUtils]: 65: Hoare triple {13472#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13472#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:42,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {13472#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {13473#(<= 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); {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {13473#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {13473#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:42,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {13473#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {13474#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:42,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {13474#(<= main_~k~0 21)} assume !(~k~0 < 100000); {13451#false} is VALID [2018-11-23 11:52:42,445 INFO L273 TraceCheckUtils]: 71: Hoare triple {13451#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); {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 72: Hoare triple {13451#false} ~x~0 := 0; {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 73: Hoare triple {13451#false} assume !(~x~0 < ~i~0); {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 74: Hoare triple {13451#false} ~x~0 := 1 + ~i~0; {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 75: Hoare triple {13451#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); {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L256 TraceCheckUtils]: 76: Hoare triple {13451#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {13451#false} is VALID [2018-11-23 11:52:42,446 INFO L273 TraceCheckUtils]: 77: Hoare triple {13451#false} ~cond := #in~cond; {13451#false} is VALID [2018-11-23 11:52:42,447 INFO L273 TraceCheckUtils]: 78: Hoare triple {13451#false} assume 0 == ~cond; {13451#false} is VALID [2018-11-23 11:52:42,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {13451#false} assume !false; {13451#false} is VALID [2018-11-23 11:52:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-11-23 11:52:42,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-11-23 11:52:42,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:52:42,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:42,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:52:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:52:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:42,565 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 27 states. [2018-11-23 11:52:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,552 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2018-11-23 11:52:44,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:52:44,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-11-23 11:52:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:52:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:52:44,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 195 transitions. [2018-11-23 11:52:44,742 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-23 11:52:44,744 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:52:44,744 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:52:44,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:52:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:52:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-11-23 11:52:44,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:44,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 111 states. [2018-11-23 11:52:44,807 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 111 states. [2018-11-23 11:52:44,807 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 111 states. [2018-11-23 11:52:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,810 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2018-11-23 11:52:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2018-11-23 11:52:44,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,810 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 119 states. [2018-11-23 11:52:44,811 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 119 states. [2018-11-23 11:52:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,812 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2018-11-23 11:52:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2018-11-23 11:52:44,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:44,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:52:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2018-11-23 11:52:44,815 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 80 [2018-11-23 11:52:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:44,816 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2018-11-23 11:52:44,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:52:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2018-11-23 11:52:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:52:44,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:44,817 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:44,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:44,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2112514647, now seen corresponding path program 11 times [2018-11-23 11:52:44,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {14358#true} call ULTIMATE.init(); {14358#true} is VALID [2018-11-23 11:52:45,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {14358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14358#true} is VALID [2018-11-23 11:52:45,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {14358#true} assume true; {14358#true} is VALID [2018-11-23 11:52:45,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14358#true} {14358#true} #130#return; {14358#true} is VALID [2018-11-23 11:52:45,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {14358#true} call #t~ret15 := main(); {14358#true} is VALID [2018-11-23 11:52:45,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {14358#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14360#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:45,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {14360#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {14361#(= main_~k~0 0)} is VALID [2018-11-23 11:52:45,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {14361#(= 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); {14361#(= main_~k~0 0)} is VALID [2018-11-23 11:52:45,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {14361#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14361#(= main_~k~0 0)} is VALID [2018-11-23 11:52:45,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {14361#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {14362#(<= 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); {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {14362#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {14362#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {14363#(<= 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); {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {14363#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {14363#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {14364#(<= 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); {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {14364#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {14364#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {14365#(<= 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); {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {14365#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {14365#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {14366#(<= 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); {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {14366#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {14366#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {14367#(<= 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); {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {14367#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {14367#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {14368#(<= 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); {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {14368#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {14368#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {14369#(<= 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); {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {14369#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {14369#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {14370#(<= 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); {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {14370#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {14370#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {14371#(<= 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); {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {14371#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {14371#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {14372#(<= 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); {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {14372#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {14372#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {14373#(<= 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); {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {14373#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,249 INFO L273 TraceCheckUtils]: 45: Hoare triple {14373#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,250 INFO L273 TraceCheckUtils]: 46: Hoare triple {14374#(<= 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); {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {14374#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {14374#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {14375#(<= 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); {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,252 INFO L273 TraceCheckUtils]: 50: Hoare triple {14375#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,253 INFO L273 TraceCheckUtils]: 51: Hoare triple {14375#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,253 INFO L273 TraceCheckUtils]: 52: Hoare triple {14376#(<= 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); {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {14376#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,254 INFO L273 TraceCheckUtils]: 54: Hoare triple {14376#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {14377#(<= 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); {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {14377#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {14377#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,257 INFO L273 TraceCheckUtils]: 58: Hoare triple {14378#(<= 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); {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,257 INFO L273 TraceCheckUtils]: 59: Hoare triple {14378#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,258 INFO L273 TraceCheckUtils]: 60: Hoare triple {14378#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,258 INFO L273 TraceCheckUtils]: 61: Hoare triple {14379#(<= 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); {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {14379#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {14379#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {14380#(<= 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); {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {14380#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {14380#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,262 INFO L273 TraceCheckUtils]: 67: Hoare triple {14381#(<= 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); {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,262 INFO L273 TraceCheckUtils]: 68: Hoare triple {14381#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {14381#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {14382#(<= 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); {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,264 INFO L273 TraceCheckUtils]: 71: Hoare triple {14382#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {14382#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {14383#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:45,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {14383#(<= main_~k~0 22)} assume !(~k~0 < 100000); {14359#false} is VALID [2018-11-23 11:52:45,265 INFO L273 TraceCheckUtils]: 74: Hoare triple {14359#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); {14359#false} is VALID [2018-11-23 11:52:45,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {14359#false} ~x~0 := 0; {14359#false} is VALID [2018-11-23 11:52:45,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {14359#false} assume !(~x~0 < ~i~0); {14359#false} is VALID [2018-11-23 11:52:45,266 INFO L273 TraceCheckUtils]: 77: Hoare triple {14359#false} ~x~0 := 1 + ~i~0; {14359#false} is VALID [2018-11-23 11:52:45,266 INFO L273 TraceCheckUtils]: 78: Hoare triple {14359#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); {14359#false} is VALID [2018-11-23 11:52:45,266 INFO L256 TraceCheckUtils]: 79: Hoare triple {14359#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14359#false} is VALID [2018-11-23 11:52:45,267 INFO L273 TraceCheckUtils]: 80: Hoare triple {14359#false} ~cond := #in~cond; {14359#false} is VALID [2018-11-23 11:52:45,267 INFO L273 TraceCheckUtils]: 81: Hoare triple {14359#false} assume 0 == ~cond; {14359#false} is VALID [2018-11-23 11:52:45,267 INFO L273 TraceCheckUtils]: 82: Hoare triple {14359#false} assume !false; {14359#false} is VALID [2018-11-23 11:52:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:45,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:45,272 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-23 11:52:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:45,350 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 11:52:45,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:45,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {14358#true} call ULTIMATE.init(); {14358#true} is VALID [2018-11-23 11:52:45,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {14358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14358#true} is VALID [2018-11-23 11:52:45,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {14358#true} assume true; {14358#true} is VALID [2018-11-23 11:52:45,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14358#true} {14358#true} #130#return; {14358#true} is VALID [2018-11-23 11:52:45,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {14358#true} call #t~ret15 := main(); {14358#true} is VALID [2018-11-23 11:52:45,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {14358#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {14402#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:45,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {14402#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {14406#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:45,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {14406#(<= 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); {14406#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:45,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {14406#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14406#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:45,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {14406#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {14362#(<= 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); {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {14362#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {14362#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:45,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {14362#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {14363#(<= 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); {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {14363#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14363#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:45,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {14363#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {14364#(<= 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); {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {14364#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14364#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:45,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {14364#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {14365#(<= 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); {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {14365#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14365#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:45,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {14365#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {14366#(<= 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); {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {14366#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14366#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:45,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {14366#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {14367#(<= 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); {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {14367#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14367#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:45,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {14367#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,600 INFO L273 TraceCheckUtils]: 28: Hoare triple {14368#(<= 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); {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,601 INFO L273 TraceCheckUtils]: 29: Hoare triple {14368#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14368#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:45,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {14368#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,602 INFO L273 TraceCheckUtils]: 31: Hoare triple {14369#(<= 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); {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {14369#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14369#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:45,603 INFO L273 TraceCheckUtils]: 33: Hoare triple {14369#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {14370#(<= 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); {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {14370#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14370#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:45,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {14370#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {14371#(<= 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); {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,606 INFO L273 TraceCheckUtils]: 38: Hoare triple {14371#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14371#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:45,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {14371#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {14372#(<= 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); {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {14372#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14372#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:45,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {14372#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {14373#(<= 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); {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {14373#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14373#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:45,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {14373#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {14374#(<= 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); {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {14374#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14374#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:45,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {14374#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {14375#(<= 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); {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,613 INFO L273 TraceCheckUtils]: 50: Hoare triple {14375#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14375#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:45,613 INFO L273 TraceCheckUtils]: 51: Hoare triple {14375#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,614 INFO L273 TraceCheckUtils]: 52: Hoare triple {14376#(<= 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); {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {14376#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14376#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:45,615 INFO L273 TraceCheckUtils]: 54: Hoare triple {14376#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {14377#(<= 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); {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {14377#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14377#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:45,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {14377#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {14378#(<= 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); {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,618 INFO L273 TraceCheckUtils]: 59: Hoare triple {14378#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14378#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:45,618 INFO L273 TraceCheckUtils]: 60: Hoare triple {14378#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,619 INFO L273 TraceCheckUtils]: 61: Hoare triple {14379#(<= 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); {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,619 INFO L273 TraceCheckUtils]: 62: Hoare triple {14379#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14379#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:45,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {14379#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,620 INFO L273 TraceCheckUtils]: 64: Hoare triple {14380#(<= 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); {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {14380#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14380#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:45,622 INFO L273 TraceCheckUtils]: 66: Hoare triple {14380#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,622 INFO L273 TraceCheckUtils]: 67: Hoare triple {14381#(<= 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); {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,623 INFO L273 TraceCheckUtils]: 68: Hoare triple {14381#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14381#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:45,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {14381#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,624 INFO L273 TraceCheckUtils]: 70: Hoare triple {14382#(<= 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); {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,624 INFO L273 TraceCheckUtils]: 71: Hoare triple {14382#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {14382#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:45,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {14382#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {14383#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:45,626 INFO L273 TraceCheckUtils]: 73: Hoare triple {14383#(<= main_~k~0 22)} assume !(~k~0 < 100000); {14359#false} is VALID [2018-11-23 11:52:45,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {14359#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); {14359#false} is VALID [2018-11-23 11:52:45,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {14359#false} ~x~0 := 0; {14359#false} is VALID [2018-11-23 11:52:45,626 INFO L273 TraceCheckUtils]: 76: Hoare triple {14359#false} assume !(~x~0 < ~i~0); {14359#false} is VALID [2018-11-23 11:52:45,626 INFO L273 TraceCheckUtils]: 77: Hoare triple {14359#false} ~x~0 := 1 + ~i~0; {14359#false} is VALID [2018-11-23 11:52:45,627 INFO L273 TraceCheckUtils]: 78: Hoare triple {14359#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); {14359#false} is VALID [2018-11-23 11:52:45,627 INFO L256 TraceCheckUtils]: 79: Hoare triple {14359#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {14359#false} is VALID [2018-11-23 11:52:45,627 INFO L273 TraceCheckUtils]: 80: Hoare triple {14359#false} ~cond := #in~cond; {14359#false} is VALID [2018-11-23 11:52:45,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {14359#false} assume 0 == ~cond; {14359#false} is VALID [2018-11-23 11:52:45,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {14359#false} assume !false; {14359#false} is VALID [2018-11-23 11:52:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:45,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:45,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-11-23 11:52:45,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-11-23 11:52:45,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:45,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:52:45,735 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-23 11:52:45,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:52:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:52:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:45,736 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand 28 states. [2018-11-23 11:52:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,504 INFO L93 Difference]: Finished difference Result 156 states and 206 transitions. [2018-11-23 11:52:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:52:47,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-11-23 11:52:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:52:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2018-11-23 11:52:47,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 199 transitions. [2018-11-23 11:52:47,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:47,687 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:52:47,687 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:52:47,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:52:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:52:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-23 11:52:47,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:47,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:47,903 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:47,903 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 114 states. [2018-11-23 11:52:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,906 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2018-11-23 11:52:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2018-11-23 11:52:47,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,906 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 122 states. [2018-11-23 11:52:47,907 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 122 states. [2018-11-23 11:52:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,908 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2018-11-23 11:52:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2018-11-23 11:52:47,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:47,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:52:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2018-11-23 11:52:47,911 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 83 [2018-11-23 11:52:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:47,911 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2018-11-23 11:52:47,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:52:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2018-11-23 11:52:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 11:52:47,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:47,912 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:47,912 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:47,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash -165710144, now seen corresponding path program 12 times [2018-11-23 11:52:47,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:47,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:47,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:47,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {15292#true} call ULTIMATE.init(); {15292#true} is VALID [2018-11-23 11:52:48,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {15292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15292#true} is VALID [2018-11-23 11:52:48,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {15292#true} assume true; {15292#true} is VALID [2018-11-23 11:52:48,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15292#true} {15292#true} #130#return; {15292#true} is VALID [2018-11-23 11:52:48,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {15292#true} call #t~ret15 := main(); {15292#true} is VALID [2018-11-23 11:52:48,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {15292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15294#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:48,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {15294#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {15295#(= main_~k~0 0)} is VALID [2018-11-23 11:52:48,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {15295#(= 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); {15295#(= main_~k~0 0)} is VALID [2018-11-23 11:52:48,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {15295#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15295#(= main_~k~0 0)} is VALID [2018-11-23 11:52:48,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {15295#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {15296#(<= 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); {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {15296#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {15296#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {15297#(<= 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); {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {15297#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {15297#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {15298#(<= 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); {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {15298#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {15298#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,332 INFO L273 TraceCheckUtils]: 19: Hoare triple {15299#(<= 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); {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {15299#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {15299#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,334 INFO L273 TraceCheckUtils]: 22: Hoare triple {15300#(<= 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); {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {15300#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {15300#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {15301#(<= 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); {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {15301#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {15301#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {15302#(<= 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); {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {15302#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {15302#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {15303#(<= 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); {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {15303#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {15303#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {15304#(<= 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); {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {15304#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {15304#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {15305#(<= 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); {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {15305#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {15305#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {15306#(<= 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); {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {15306#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,345 INFO L273 TraceCheckUtils]: 42: Hoare triple {15306#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {15307#(<= 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); {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {15307#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {15307#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {15308#(<= 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); {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {15308#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {15308#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,349 INFO L273 TraceCheckUtils]: 49: Hoare triple {15309#(<= 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); {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {15309#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,350 INFO L273 TraceCheckUtils]: 51: Hoare triple {15309#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,350 INFO L273 TraceCheckUtils]: 52: Hoare triple {15310#(<= 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); {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {15310#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {15310#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,352 INFO L273 TraceCheckUtils]: 55: Hoare triple {15311#(<= 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); {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 56: Hoare triple {15311#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,353 INFO L273 TraceCheckUtils]: 57: Hoare triple {15311#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 58: Hoare triple {15312#(<= 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); {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,354 INFO L273 TraceCheckUtils]: 59: Hoare triple {15312#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 60: Hoare triple {15312#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,355 INFO L273 TraceCheckUtils]: 61: Hoare triple {15313#(<= 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); {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,356 INFO L273 TraceCheckUtils]: 62: Hoare triple {15313#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 63: Hoare triple {15313#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,357 INFO L273 TraceCheckUtils]: 64: Hoare triple {15314#(<= 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); {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 65: Hoare triple {15314#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,358 INFO L273 TraceCheckUtils]: 66: Hoare triple {15314#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 67: Hoare triple {15315#(<= 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); {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {15315#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 69: Hoare triple {15315#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,360 INFO L273 TraceCheckUtils]: 70: Hoare triple {15316#(<= 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); {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,361 INFO L273 TraceCheckUtils]: 71: Hoare triple {15316#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 72: Hoare triple {15316#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,362 INFO L273 TraceCheckUtils]: 73: Hoare triple {15317#(<= 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); {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 74: Hoare triple {15317#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,363 INFO L273 TraceCheckUtils]: 75: Hoare triple {15317#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {15318#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 76: Hoare triple {15318#(<= main_~k~0 23)} assume !(~k~0 < 100000); {15293#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 77: Hoare triple {15293#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); {15293#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 78: Hoare triple {15293#false} ~x~0 := 0; {15293#false} is VALID [2018-11-23 11:52:48,364 INFO L273 TraceCheckUtils]: 79: Hoare triple {15293#false} assume !(~x~0 < ~i~0); {15293#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 80: Hoare triple {15293#false} ~x~0 := 1 + ~i~0; {15293#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 81: Hoare triple {15293#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); {15293#false} is VALID [2018-11-23 11:52:48,365 INFO L256 TraceCheckUtils]: 82: Hoare triple {15293#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15293#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 83: Hoare triple {15293#false} ~cond := #in~cond; {15293#false} is VALID [2018-11-23 11:52:48,365 INFO L273 TraceCheckUtils]: 84: Hoare triple {15293#false} assume 0 == ~cond; {15293#false} is VALID [2018-11-23 11:52:48,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {15293#false} assume !false; {15293#false} is VALID [2018-11-23 11:52:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:48,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:48,371 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-23 11:52:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:48,504 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-11-23 11:52:48,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:48,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {15292#true} call ULTIMATE.init(); {15292#true} is VALID [2018-11-23 11:52:48,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {15292#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15292#true} is VALID [2018-11-23 11:52:48,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {15292#true} assume true; {15292#true} is VALID [2018-11-23 11:52:48,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15292#true} {15292#true} #130#return; {15292#true} is VALID [2018-11-23 11:52:48,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {15292#true} call #t~ret15 := main(); {15292#true} is VALID [2018-11-23 11:52:48,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {15292#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {15337#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:48,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {15337#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {15341#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:48,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {15341#(<= 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); {15341#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:48,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {15341#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15341#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:48,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {15341#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {15296#(<= 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); {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {15296#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {15296#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:48,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {15296#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {15297#(<= 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); {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {15297#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15297#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:48,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {15297#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {15298#(<= 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); {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {15298#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15298#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:48,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {15298#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {15299#(<= 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); {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {15299#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15299#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:48,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {15299#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {15300#(<= 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); {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {15300#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15300#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:48,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {15300#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {15301#(<= 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); {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {15301#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15301#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:48,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {15301#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,748 INFO L273 TraceCheckUtils]: 28: Hoare triple {15302#(<= 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); {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,749 INFO L273 TraceCheckUtils]: 29: Hoare triple {15302#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15302#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:48,749 INFO L273 TraceCheckUtils]: 30: Hoare triple {15302#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,750 INFO L273 TraceCheckUtils]: 31: Hoare triple {15303#(<= 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); {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {15303#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15303#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:48,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {15303#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {15304#(<= 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); {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {15304#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15304#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:48,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {15304#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {15305#(<= 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); {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {15305#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15305#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:48,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {15305#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {15306#(<= 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); {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {15306#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15306#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:48,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {15306#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {15307#(<= 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); {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {15307#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15307#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:48,758 INFO L273 TraceCheckUtils]: 45: Hoare triple {15307#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {15308#(<= 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); {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {15308#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15308#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:48,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {15308#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {15309#(<= 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); {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {15309#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15309#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:48,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {15309#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {15310#(<= 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); {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {15310#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15310#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:48,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {15310#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {15311#(<= 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); {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {15311#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15311#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:48,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {15311#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {15312#(<= 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); {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {15312#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15312#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:48,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {15312#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {15313#(<= 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); {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,767 INFO L273 TraceCheckUtils]: 62: Hoare triple {15313#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15313#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:48,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {15313#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,768 INFO L273 TraceCheckUtils]: 64: Hoare triple {15314#(<= 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); {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {15314#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15314#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:48,769 INFO L273 TraceCheckUtils]: 66: Hoare triple {15314#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,770 INFO L273 TraceCheckUtils]: 67: Hoare triple {15315#(<= 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); {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {15315#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15315#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:48,771 INFO L273 TraceCheckUtils]: 69: Hoare triple {15315#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {15316#(<= 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); {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,772 INFO L273 TraceCheckUtils]: 71: Hoare triple {15316#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15316#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:48,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {15316#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {15317#(<= 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); {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,774 INFO L273 TraceCheckUtils]: 74: Hoare triple {15317#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {15317#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:48,774 INFO L273 TraceCheckUtils]: 75: Hoare triple {15317#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {15318#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:48,775 INFO L273 TraceCheckUtils]: 76: Hoare triple {15318#(<= main_~k~0 23)} assume !(~k~0 < 100000); {15293#false} is VALID [2018-11-23 11:52:48,775 INFO L273 TraceCheckUtils]: 77: Hoare triple {15293#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); {15293#false} is VALID [2018-11-23 11:52:48,775 INFO L273 TraceCheckUtils]: 78: Hoare triple {15293#false} ~x~0 := 0; {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L273 TraceCheckUtils]: 79: Hoare triple {15293#false} assume !(~x~0 < ~i~0); {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L273 TraceCheckUtils]: 80: Hoare triple {15293#false} ~x~0 := 1 + ~i~0; {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L273 TraceCheckUtils]: 81: Hoare triple {15293#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); {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L256 TraceCheckUtils]: 82: Hoare triple {15293#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L273 TraceCheckUtils]: 83: Hoare triple {15293#false} ~cond := #in~cond; {15293#false} is VALID [2018-11-23 11:52:48,776 INFO L273 TraceCheckUtils]: 84: Hoare triple {15293#false} assume 0 == ~cond; {15293#false} is VALID [2018-11-23 11:52:48,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {15293#false} assume !false; {15293#false} is VALID [2018-11-23 11:52:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:48,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-11-23 11:52:48,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 86 [2018-11-23 11:52:48,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:48,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:52:48,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:48,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:52:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:52:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:48,885 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand 29 states. [2018-11-23 11:52:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:50,885 INFO L93 Difference]: Finished difference Result 159 states and 210 transitions. [2018-11-23 11:52:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:52:50,885 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 86 [2018-11-23 11:52:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:52:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 203 transitions. [2018-11-23 11:52:50,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 203 transitions. [2018-11-23 11:52:51,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:51,078 INFO L225 Difference]: With dead ends: 159 [2018-11-23 11:52:51,078 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:52:51,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 85 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-23 11:52:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:52:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-11-23 11:52:51,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:51,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 117 states. [2018-11-23 11:52:51,182 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 117 states. [2018-11-23 11:52:51,182 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 117 states. [2018-11-23 11:52:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,184 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2018-11-23 11:52:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 164 transitions. [2018-11-23 11:52:51,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,185 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 125 states. [2018-11-23 11:52:51,185 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 125 states. [2018-11-23 11:52:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:51,187 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2018-11-23 11:52:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 164 transitions. [2018-11-23 11:52:51,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:51,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:51,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:51,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:52:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2018-11-23 11:52:51,191 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 86 [2018-11-23 11:52:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:51,191 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2018-11-23 11:52:51,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:52:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2018-11-23 11:52:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:52:51,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:51,192 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:51,192 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:51,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:51,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1687247433, now seen corresponding path program 13 times [2018-11-23 11:52:51,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:51,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:51,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {16252#true} call ULTIMATE.init(); {16252#true} is VALID [2018-11-23 11:52:51,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {16252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16252#true} is VALID [2018-11-23 11:52:51,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {16252#true} assume true; {16252#true} is VALID [2018-11-23 11:52:51,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16252#true} {16252#true} #130#return; {16252#true} is VALID [2018-11-23 11:52:51,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {16252#true} call #t~ret15 := main(); {16252#true} is VALID [2018-11-23 11:52:51,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {16252#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {16254#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:51,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {16254#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {16255#(= main_~k~0 0)} is VALID [2018-11-23 11:52:51,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {16255#(= 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); {16255#(= main_~k~0 0)} is VALID [2018-11-23 11:52:51,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {16255#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16255#(= main_~k~0 0)} is VALID [2018-11-23 11:52:51,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {16255#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:51,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {16256#(<= 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); {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:51,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {16256#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:51,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {16256#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:51,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {16257#(<= 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); {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:51,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {16257#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:51,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {16257#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:51,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {16258#(<= 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); {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:51,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {16258#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:51,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {16258#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:51,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {16259#(<= 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); {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:51,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {16259#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:51,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {16259#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:51,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {16260#(<= 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); {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:51,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {16260#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:51,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {16260#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:51,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {16261#(<= 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); {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:51,703 INFO L273 TraceCheckUtils]: 26: Hoare triple {16261#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:51,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {16261#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:51,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {16262#(<= 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); {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:51,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {16262#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:51,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {16262#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:51,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {16263#(<= 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); {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:51,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {16263#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:51,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {16263#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:51,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {16264#(<= 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); {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:51,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {16264#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:51,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {16264#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:51,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {16265#(<= 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); {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:51,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {16265#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:51,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {16265#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:51,710 INFO L273 TraceCheckUtils]: 40: Hoare triple {16266#(<= 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); {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:51,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {16266#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:51,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {16266#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:51,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {16267#(<= 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); {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:51,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {16267#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:51,713 INFO L273 TraceCheckUtils]: 45: Hoare triple {16267#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:51,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {16268#(<= 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); {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:51,714 INFO L273 TraceCheckUtils]: 47: Hoare triple {16268#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:51,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {16268#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:51,715 INFO L273 TraceCheckUtils]: 49: Hoare triple {16269#(<= 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); {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:51,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {16269#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:51,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {16269#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:51,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {16270#(<= 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); {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:51,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {16270#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:51,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {16270#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:51,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {16271#(<= 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); {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:51,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {16271#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:51,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {16271#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:51,720 INFO L273 TraceCheckUtils]: 58: Hoare triple {16272#(<= 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); {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:51,721 INFO L273 TraceCheckUtils]: 59: Hoare triple {16272#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:51,722 INFO L273 TraceCheckUtils]: 60: Hoare triple {16272#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:51,722 INFO L273 TraceCheckUtils]: 61: Hoare triple {16273#(<= 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); {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:51,723 INFO L273 TraceCheckUtils]: 62: Hoare triple {16273#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:51,723 INFO L273 TraceCheckUtils]: 63: Hoare triple {16273#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:51,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {16274#(<= 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); {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:51,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {16274#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:51,725 INFO L273 TraceCheckUtils]: 66: Hoare triple {16274#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:51,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {16275#(<= 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); {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:51,726 INFO L273 TraceCheckUtils]: 68: Hoare triple {16275#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:51,727 INFO L273 TraceCheckUtils]: 69: Hoare triple {16275#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:51,727 INFO L273 TraceCheckUtils]: 70: Hoare triple {16276#(<= 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); {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:51,728 INFO L273 TraceCheckUtils]: 71: Hoare triple {16276#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:51,728 INFO L273 TraceCheckUtils]: 72: Hoare triple {16276#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:51,729 INFO L273 TraceCheckUtils]: 73: Hoare triple {16277#(<= 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); {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:51,729 INFO L273 TraceCheckUtils]: 74: Hoare triple {16277#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:51,730 INFO L273 TraceCheckUtils]: 75: Hoare triple {16277#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:51,730 INFO L273 TraceCheckUtils]: 76: Hoare triple {16278#(<= 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); {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:51,731 INFO L273 TraceCheckUtils]: 77: Hoare triple {16278#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:51,732 INFO L273 TraceCheckUtils]: 78: Hoare triple {16278#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {16279#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:51,732 INFO L273 TraceCheckUtils]: 79: Hoare triple {16279#(<= main_~k~0 24)} assume !(~k~0 < 100000); {16253#false} is VALID [2018-11-23 11:52:51,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {16253#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); {16253#false} is VALID [2018-11-23 11:52:51,733 INFO L273 TraceCheckUtils]: 81: Hoare triple {16253#false} ~x~0 := 0; {16253#false} is VALID [2018-11-23 11:52:51,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {16253#false} assume !(~x~0 < ~i~0); {16253#false} is VALID [2018-11-23 11:52:51,733 INFO L273 TraceCheckUtils]: 83: Hoare triple {16253#false} ~x~0 := 1 + ~i~0; {16253#false} is VALID [2018-11-23 11:52:51,733 INFO L273 TraceCheckUtils]: 84: Hoare triple {16253#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); {16253#false} is VALID [2018-11-23 11:52:51,733 INFO L256 TraceCheckUtils]: 85: Hoare triple {16253#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {16253#false} is VALID [2018-11-23 11:52:51,734 INFO L273 TraceCheckUtils]: 86: Hoare triple {16253#false} ~cond := #in~cond; {16253#false} is VALID [2018-11-23 11:52:51,734 INFO L273 TraceCheckUtils]: 87: Hoare triple {16253#false} assume 0 == ~cond; {16253#false} is VALID [2018-11-23 11:52:51,734 INFO L273 TraceCheckUtils]: 88: Hoare triple {16253#false} assume !false; {16253#false} is VALID [2018-11-23 11:52:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:51,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:51,740 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-23 11:52:51,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:51,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:52,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {16252#true} call ULTIMATE.init(); {16252#true} is VALID [2018-11-23 11:52:52,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {16252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16252#true} is VALID [2018-11-23 11:52:52,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {16252#true} assume true; {16252#true} is VALID [2018-11-23 11:52:52,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16252#true} {16252#true} #130#return; {16252#true} is VALID [2018-11-23 11:52:52,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {16252#true} call #t~ret15 := main(); {16252#true} is VALID [2018-11-23 11:52:52,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {16252#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {16298#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:52,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {16298#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {16302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:52,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {16302#(<= 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); {16302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:52,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {16302#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:52,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {16302#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {16256#(<= 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); {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {16256#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {16256#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:52,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {16256#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {16257#(<= 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); {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {16257#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16257#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:52,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {16257#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {16258#(<= 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); {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {16258#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16258#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:52,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {16258#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {16259#(<= 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); {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {16259#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16259#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:52,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {16259#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {16260#(<= 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); {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {16260#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16260#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:52,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {16260#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {16261#(<= 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); {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {16261#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16261#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:52,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {16261#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {16262#(<= 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); {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {16262#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16262#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:52,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {16262#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {16263#(<= 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); {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {16263#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16263#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:52,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {16263#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {16264#(<= 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); {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {16264#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16264#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:52,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {16264#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {16265#(<= 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); {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {16265#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16265#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:52,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {16265#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {16266#(<= 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); {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {16266#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16266#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:52,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {16266#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {16267#(<= 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); {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {16267#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16267#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:52,094 INFO L273 TraceCheckUtils]: 45: Hoare triple {16267#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {16268#(<= 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); {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {16268#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16268#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:52,096 INFO L273 TraceCheckUtils]: 48: Hoare triple {16268#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,097 INFO L273 TraceCheckUtils]: 49: Hoare triple {16269#(<= 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); {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {16269#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16269#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:52,098 INFO L273 TraceCheckUtils]: 51: Hoare triple {16269#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {16270#(<= 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); {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,099 INFO L273 TraceCheckUtils]: 53: Hoare triple {16270#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16270#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:52,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {16270#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {16271#(<= 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); {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,101 INFO L273 TraceCheckUtils]: 56: Hoare triple {16271#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16271#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:52,101 INFO L273 TraceCheckUtils]: 57: Hoare triple {16271#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {16272#(<= 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); {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,103 INFO L273 TraceCheckUtils]: 59: Hoare triple {16272#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16272#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:52,110 INFO L273 TraceCheckUtils]: 60: Hoare triple {16272#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,111 INFO L273 TraceCheckUtils]: 61: Hoare triple {16273#(<= 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); {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,111 INFO L273 TraceCheckUtils]: 62: Hoare triple {16273#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16273#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:52,112 INFO L273 TraceCheckUtils]: 63: Hoare triple {16273#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,112 INFO L273 TraceCheckUtils]: 64: Hoare triple {16274#(<= 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); {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,112 INFO L273 TraceCheckUtils]: 65: Hoare triple {16274#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16274#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:52,113 INFO L273 TraceCheckUtils]: 66: Hoare triple {16274#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,113 INFO L273 TraceCheckUtils]: 67: Hoare triple {16275#(<= 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); {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {16275#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16275#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:52,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {16275#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:52,114 INFO L273 TraceCheckUtils]: 70: Hoare triple {16276#(<= 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); {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:52,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {16276#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16276#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:52,116 INFO L273 TraceCheckUtils]: 72: Hoare triple {16276#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:52,116 INFO L273 TraceCheckUtils]: 73: Hoare triple {16277#(<= 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); {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:52,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {16277#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16277#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:52,117 INFO L273 TraceCheckUtils]: 75: Hoare triple {16277#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:52,118 INFO L273 TraceCheckUtils]: 76: Hoare triple {16278#(<= 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); {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:52,118 INFO L273 TraceCheckUtils]: 77: Hoare triple {16278#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {16278#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:52,119 INFO L273 TraceCheckUtils]: 78: Hoare triple {16278#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {16279#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:52,120 INFO L273 TraceCheckUtils]: 79: Hoare triple {16279#(<= main_~k~0 24)} assume !(~k~0 < 100000); {16253#false} is VALID [2018-11-23 11:52:52,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {16253#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); {16253#false} is VALID [2018-11-23 11:52:52,120 INFO L273 TraceCheckUtils]: 81: Hoare triple {16253#false} ~x~0 := 0; {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L273 TraceCheckUtils]: 82: Hoare triple {16253#false} assume !(~x~0 < ~i~0); {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L273 TraceCheckUtils]: 83: Hoare triple {16253#false} ~x~0 := 1 + ~i~0; {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L273 TraceCheckUtils]: 84: Hoare triple {16253#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); {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L256 TraceCheckUtils]: 85: Hoare triple {16253#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L273 TraceCheckUtils]: 86: Hoare triple {16253#false} ~cond := #in~cond; {16253#false} is VALID [2018-11-23 11:52:52,121 INFO L273 TraceCheckUtils]: 87: Hoare triple {16253#false} assume 0 == ~cond; {16253#false} is VALID [2018-11-23 11:52:52,122 INFO L273 TraceCheckUtils]: 88: Hoare triple {16253#false} assume !false; {16253#false} is VALID [2018-11-23 11:52:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:52,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:52,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2018-11-23 11:52:52,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-11-23 11:52:52,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:52,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:52:52,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:52,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:52:52,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:52:52,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:52,233 INFO L87 Difference]: Start difference. First operand 117 states and 153 transitions. Second operand 30 states. [2018-11-23 11:52:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,100 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2018-11-23 11:52:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:52:54,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-11-23 11:52:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:52:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2018-11-23 11:52:54,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 207 transitions. [2018-11-23 11:52:54,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:54,384 INFO L225 Difference]: With dead ends: 162 [2018-11-23 11:52:54,384 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:52:54,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 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-23 11:52:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:52:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-11-23 11:52:54,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:54,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 120 states. [2018-11-23 11:52:54,557 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 120 states. [2018-11-23 11:52:54,557 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 120 states. [2018-11-23 11:52:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,560 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 11:52:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2018-11-23 11:52:54,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,561 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 128 states. [2018-11-23 11:52:54,561 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 128 states. [2018-11-23 11:52:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,563 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 11:52:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2018-11-23 11:52:54,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:54,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:54,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:54,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:52:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2018-11-23 11:52:54,567 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 89 [2018-11-23 11:52:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:54,567 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2018-11-23 11:52:54,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:52:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2018-11-23 11:52:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 11:52:54,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:54,568 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:54,568 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:54,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash -719782048, now seen corresponding path program 14 times [2018-11-23 11:52:54,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:54,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:55,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {17238#true} call ULTIMATE.init(); {17238#true} is VALID [2018-11-23 11:52:55,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {17238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17238#true} is VALID [2018-11-23 11:52:55,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {17238#true} assume true; {17238#true} is VALID [2018-11-23 11:52:55,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17238#true} {17238#true} #130#return; {17238#true} is VALID [2018-11-23 11:52:55,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {17238#true} call #t~ret15 := main(); {17238#true} is VALID [2018-11-23 11:52:55,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {17238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17240#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:55,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {17240#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {17241#(= main_~k~0 0)} is VALID [2018-11-23 11:52:55,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {17241#(= 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); {17241#(= main_~k~0 0)} is VALID [2018-11-23 11:52:55,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {17241#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17241#(= main_~k~0 0)} is VALID [2018-11-23 11:52:55,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {17241#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {17242#(<= 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); {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {17242#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {17242#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {17243#(<= 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); {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {17243#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {17243#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {17244#(<= 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); {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {17244#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {17244#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {17245#(<= 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); {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {17245#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {17245#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {17246#(<= 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); {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {17246#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {17246#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {17247#(<= 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); {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {17247#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {17247#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {17248#(<= 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); {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {17248#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {17248#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {17249#(<= 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); {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {17249#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {17249#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {17250#(<= 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); {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {17250#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {17250#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {17251#(<= 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); {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {17251#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {17251#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {17252#(<= 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); {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {17252#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {17252#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {17253#(<= 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); {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {17253#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {17253#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {17254#(<= 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); {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,128 INFO L273 TraceCheckUtils]: 47: Hoare triple {17254#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {17254#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {17255#(<= 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); {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {17255#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,130 INFO L273 TraceCheckUtils]: 51: Hoare triple {17255#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,131 INFO L273 TraceCheckUtils]: 52: Hoare triple {17256#(<= 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); {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,131 INFO L273 TraceCheckUtils]: 53: Hoare triple {17256#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {17256#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {17257#(<= 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); {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {17257#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {17257#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,134 INFO L273 TraceCheckUtils]: 58: Hoare triple {17258#(<= 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); {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,135 INFO L273 TraceCheckUtils]: 59: Hoare triple {17258#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,135 INFO L273 TraceCheckUtils]: 60: Hoare triple {17258#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {17259#(<= 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); {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {17259#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {17259#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {17260#(<= 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); {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,138 INFO L273 TraceCheckUtils]: 65: Hoare triple {17260#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,139 INFO L273 TraceCheckUtils]: 66: Hoare triple {17260#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,139 INFO L273 TraceCheckUtils]: 67: Hoare triple {17261#(<= 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); {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {17261#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,140 INFO L273 TraceCheckUtils]: 69: Hoare triple {17261#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,160 INFO L273 TraceCheckUtils]: 70: Hoare triple {17262#(<= 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); {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,168 INFO L273 TraceCheckUtils]: 71: Hoare triple {17262#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,169 INFO L273 TraceCheckUtils]: 72: Hoare triple {17262#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,169 INFO L273 TraceCheckUtils]: 73: Hoare triple {17263#(<= 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); {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,170 INFO L273 TraceCheckUtils]: 74: Hoare triple {17263#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,170 INFO L273 TraceCheckUtils]: 75: Hoare triple {17263#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,170 INFO L273 TraceCheckUtils]: 76: Hoare triple {17264#(<= 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); {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,171 INFO L273 TraceCheckUtils]: 77: Hoare triple {17264#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,171 INFO L273 TraceCheckUtils]: 78: Hoare triple {17264#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,172 INFO L273 TraceCheckUtils]: 79: Hoare triple {17265#(<= 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); {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {17265#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,173 INFO L273 TraceCheckUtils]: 81: Hoare triple {17265#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {17266#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:55,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {17266#(<= main_~k~0 25)} assume !(~k~0 < 100000); {17239#false} is VALID [2018-11-23 11:52:55,174 INFO L273 TraceCheckUtils]: 83: Hoare triple {17239#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); {17239#false} is VALID [2018-11-23 11:52:55,174 INFO L273 TraceCheckUtils]: 84: Hoare triple {17239#false} ~x~0 := 0; {17239#false} is VALID [2018-11-23 11:52:55,174 INFO L273 TraceCheckUtils]: 85: Hoare triple {17239#false} assume !(~x~0 < ~i~0); {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L273 TraceCheckUtils]: 86: Hoare triple {17239#false} ~x~0 := 1 + ~i~0; {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {17239#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); {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L256 TraceCheckUtils]: 88: Hoare triple {17239#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L273 TraceCheckUtils]: 89: Hoare triple {17239#false} ~cond := #in~cond; {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L273 TraceCheckUtils]: 90: Hoare triple {17239#false} assume 0 == ~cond; {17239#false} is VALID [2018-11-23 11:52:55,175 INFO L273 TraceCheckUtils]: 91: Hoare triple {17239#false} assume !false; {17239#false} is VALID [2018-11-23 11:52:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:55,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:55,182 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-23 11:52:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:55,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:55,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:55,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:55,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {17238#true} call ULTIMATE.init(); {17238#true} is VALID [2018-11-23 11:52:55,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {17238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17238#true} is VALID [2018-11-23 11:52:55,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {17238#true} assume true; {17238#true} is VALID [2018-11-23 11:52:55,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17238#true} {17238#true} #130#return; {17238#true} is VALID [2018-11-23 11:52:55,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {17238#true} call #t~ret15 := main(); {17238#true} is VALID [2018-11-23 11:52:55,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {17238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {17285#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:55,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {17285#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {17289#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:55,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {17289#(<= 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); {17289#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:55,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {17289#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17289#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:55,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {17289#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {17242#(<= 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); {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {17242#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {17242#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:55,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {17242#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {17243#(<= 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); {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {17243#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17243#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:55,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {17243#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {17244#(<= 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); {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {17244#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17244#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:55,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {17244#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {17245#(<= 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); {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {17245#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17245#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:55,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {17245#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {17246#(<= 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); {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {17246#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17246#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:55,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {17246#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {17247#(<= 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); {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {17247#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17247#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:55,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {17247#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {17248#(<= 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); {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {17248#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17248#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:55,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {17248#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {17249#(<= 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); {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {17249#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17249#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:55,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {17249#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {17250#(<= 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); {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {17250#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17250#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:55,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {17250#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,535 INFO L273 TraceCheckUtils]: 37: Hoare triple {17251#(<= 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); {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {17251#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17251#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:55,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {17251#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {17252#(<= 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); {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {17252#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17252#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:55,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {17252#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {17253#(<= 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); {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,539 INFO L273 TraceCheckUtils]: 44: Hoare triple {17253#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17253#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:55,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {17253#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,540 INFO L273 TraceCheckUtils]: 46: Hoare triple {17254#(<= 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); {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,541 INFO L273 TraceCheckUtils]: 47: Hoare triple {17254#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17254#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:55,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {17254#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {17255#(<= 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); {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {17255#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17255#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:55,543 INFO L273 TraceCheckUtils]: 51: Hoare triple {17255#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,544 INFO L273 TraceCheckUtils]: 52: Hoare triple {17256#(<= 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); {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,544 INFO L273 TraceCheckUtils]: 53: Hoare triple {17256#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17256#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:55,545 INFO L273 TraceCheckUtils]: 54: Hoare triple {17256#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,545 INFO L273 TraceCheckUtils]: 55: Hoare triple {17257#(<= 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); {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,546 INFO L273 TraceCheckUtils]: 56: Hoare triple {17257#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17257#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:55,547 INFO L273 TraceCheckUtils]: 57: Hoare triple {17257#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,547 INFO L273 TraceCheckUtils]: 58: Hoare triple {17258#(<= 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); {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,548 INFO L273 TraceCheckUtils]: 59: Hoare triple {17258#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17258#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:55,548 INFO L273 TraceCheckUtils]: 60: Hoare triple {17258#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,549 INFO L273 TraceCheckUtils]: 61: Hoare triple {17259#(<= 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); {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,549 INFO L273 TraceCheckUtils]: 62: Hoare triple {17259#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17259#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:55,550 INFO L273 TraceCheckUtils]: 63: Hoare triple {17259#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,550 INFO L273 TraceCheckUtils]: 64: Hoare triple {17260#(<= 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); {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,551 INFO L273 TraceCheckUtils]: 65: Hoare triple {17260#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17260#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:55,552 INFO L273 TraceCheckUtils]: 66: Hoare triple {17260#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,552 INFO L273 TraceCheckUtils]: 67: Hoare triple {17261#(<= 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); {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,553 INFO L273 TraceCheckUtils]: 68: Hoare triple {17261#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17261#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:55,554 INFO L273 TraceCheckUtils]: 69: Hoare triple {17261#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,554 INFO L273 TraceCheckUtils]: 70: Hoare triple {17262#(<= 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); {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,555 INFO L273 TraceCheckUtils]: 71: Hoare triple {17262#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17262#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:55,556 INFO L273 TraceCheckUtils]: 72: Hoare triple {17262#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,556 INFO L273 TraceCheckUtils]: 73: Hoare triple {17263#(<= 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); {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,557 INFO L273 TraceCheckUtils]: 74: Hoare triple {17263#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17263#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:55,558 INFO L273 TraceCheckUtils]: 75: Hoare triple {17263#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,558 INFO L273 TraceCheckUtils]: 76: Hoare triple {17264#(<= 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); {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,559 INFO L273 TraceCheckUtils]: 77: Hoare triple {17264#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17264#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:55,559 INFO L273 TraceCheckUtils]: 78: Hoare triple {17264#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,560 INFO L273 TraceCheckUtils]: 79: Hoare triple {17265#(<= 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); {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,561 INFO L273 TraceCheckUtils]: 80: Hoare triple {17265#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {17265#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:55,561 INFO L273 TraceCheckUtils]: 81: Hoare triple {17265#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {17266#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:55,562 INFO L273 TraceCheckUtils]: 82: Hoare triple {17266#(<= main_~k~0 25)} assume !(~k~0 < 100000); {17239#false} is VALID [2018-11-23 11:52:55,562 INFO L273 TraceCheckUtils]: 83: Hoare triple {17239#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); {17239#false} is VALID [2018-11-23 11:52:55,563 INFO L273 TraceCheckUtils]: 84: Hoare triple {17239#false} ~x~0 := 0; {17239#false} is VALID [2018-11-23 11:52:55,563 INFO L273 TraceCheckUtils]: 85: Hoare triple {17239#false} assume !(~x~0 < ~i~0); {17239#false} is VALID [2018-11-23 11:52:55,563 INFO L273 TraceCheckUtils]: 86: Hoare triple {17239#false} ~x~0 := 1 + ~i~0; {17239#false} is VALID [2018-11-23 11:52:55,563 INFO L273 TraceCheckUtils]: 87: Hoare triple {17239#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); {17239#false} is VALID [2018-11-23 11:52:55,564 INFO L256 TraceCheckUtils]: 88: Hoare triple {17239#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {17239#false} is VALID [2018-11-23 11:52:55,564 INFO L273 TraceCheckUtils]: 89: Hoare triple {17239#false} ~cond := #in~cond; {17239#false} is VALID [2018-11-23 11:52:55,564 INFO L273 TraceCheckUtils]: 90: Hoare triple {17239#false} assume 0 == ~cond; {17239#false} is VALID [2018-11-23 11:52:55,564 INFO L273 TraceCheckUtils]: 91: Hoare triple {17239#false} assume !false; {17239#false} is VALID [2018-11-23 11:52:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:55,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:55,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-11-23 11:52:55,595 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-11-23 11:52:55,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:55,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:52:55,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:55,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:52:55,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:52:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:52:55,695 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand 31 states. [2018-11-23 11:52:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,706 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2018-11-23 11:52:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:52:57,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-11-23 11:52:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:52:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 211 transitions. [2018-11-23 11:52:57,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 211 transitions. [2018-11-23 11:52:57,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:57,916 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:52:57,917 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:52:57,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:52:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:52:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-11-23 11:52:57,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:57,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 123 states. [2018-11-23 11:52:57,993 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 123 states. [2018-11-23 11:52:57,993 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 123 states. [2018-11-23 11:52:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,995 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2018-11-23 11:52:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2018-11-23 11:52:57,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,996 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 131 states. [2018-11-23 11:52:57,996 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 131 states. [2018-11-23 11:52:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,998 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2018-11-23 11:52:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2018-11-23 11:52:57,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:57,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:52:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2018-11-23 11:52:58,001 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 92 [2018-11-23 11:52:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:58,002 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2018-11-23 11:52:58,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:52:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2018-11-23 11:52:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:52:58,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:58,003 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:58,003 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:58,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1810946327, now seen corresponding path program 15 times [2018-11-23 11:52:58,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:58,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:58,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:58,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2018-11-23 11:52:58,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {18250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18250#true} is VALID [2018-11-23 11:52:58,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2018-11-23 11:52:58,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #130#return; {18250#true} is VALID [2018-11-23 11:52:58,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret15 := main(); {18250#true} is VALID [2018-11-23 11:52:58,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18252#(= 0 main_~i~0)} is VALID [2018-11-23 11:52:58,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {18252#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {18253#(= main_~k~0 0)} is VALID [2018-11-23 11:52:58,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {18253#(= 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); {18253#(= main_~k~0 0)} is VALID [2018-11-23 11:52:58,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {18253#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18253#(= main_~k~0 0)} is VALID [2018-11-23 11:52:58,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {18253#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:58,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {18254#(<= 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); {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:58,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {18254#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:58,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {18254#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:58,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {18255#(<= 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); {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:58,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {18255#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:58,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {18255#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:58,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {18256#(<= 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); {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:58,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {18256#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:58,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {18256#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:58,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {18257#(<= 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); {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:58,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {18257#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:58,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {18257#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:58,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {18258#(<= 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); {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:58,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {18258#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:58,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {18258#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:58,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {18259#(<= 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); {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:58,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {18259#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:58,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {18259#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:58,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {18260#(<= 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); {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:58,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {18260#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:58,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {18260#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:58,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {18261#(<= 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); {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:58,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {18261#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:58,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {18261#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:58,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {18262#(<= 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); {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:58,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {18262#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:58,657 INFO L273 TraceCheckUtils]: 36: Hoare triple {18262#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:58,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {18263#(<= 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); {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:58,658 INFO L273 TraceCheckUtils]: 38: Hoare triple {18263#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:58,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {18263#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:58,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {18264#(<= 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); {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:58,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {18264#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:58,661 INFO L273 TraceCheckUtils]: 42: Hoare triple {18264#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:58,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {18265#(<= 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); {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:58,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {18265#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:58,662 INFO L273 TraceCheckUtils]: 45: Hoare triple {18265#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:58,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {18266#(<= 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); {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:58,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {18266#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:58,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {18266#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:58,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {18267#(<= 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); {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:58,665 INFO L273 TraceCheckUtils]: 50: Hoare triple {18267#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:58,666 INFO L273 TraceCheckUtils]: 51: Hoare triple {18267#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:58,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {18268#(<= 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); {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:58,666 INFO L273 TraceCheckUtils]: 53: Hoare triple {18268#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:58,667 INFO L273 TraceCheckUtils]: 54: Hoare triple {18268#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:58,668 INFO L273 TraceCheckUtils]: 55: Hoare triple {18269#(<= 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); {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:58,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {18269#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:58,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {18269#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:58,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {18270#(<= 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); {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:58,670 INFO L273 TraceCheckUtils]: 59: Hoare triple {18270#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:58,670 INFO L273 TraceCheckUtils]: 60: Hoare triple {18270#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:58,671 INFO L273 TraceCheckUtils]: 61: Hoare triple {18271#(<= 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); {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:58,671 INFO L273 TraceCheckUtils]: 62: Hoare triple {18271#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:58,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {18271#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:58,673 INFO L273 TraceCheckUtils]: 64: Hoare triple {18272#(<= 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); {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:58,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {18272#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:58,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {18272#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:58,674 INFO L273 TraceCheckUtils]: 67: Hoare triple {18273#(<= 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); {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:58,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {18273#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:58,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {18273#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:58,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {18274#(<= 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); {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:58,677 INFO L273 TraceCheckUtils]: 71: Hoare triple {18274#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:58,677 INFO L273 TraceCheckUtils]: 72: Hoare triple {18274#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:58,678 INFO L273 TraceCheckUtils]: 73: Hoare triple {18275#(<= 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); {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:58,678 INFO L273 TraceCheckUtils]: 74: Hoare triple {18275#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:58,679 INFO L273 TraceCheckUtils]: 75: Hoare triple {18275#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:58,679 INFO L273 TraceCheckUtils]: 76: Hoare triple {18276#(<= 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); {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:58,680 INFO L273 TraceCheckUtils]: 77: Hoare triple {18276#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:58,681 INFO L273 TraceCheckUtils]: 78: Hoare triple {18276#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:58,681 INFO L273 TraceCheckUtils]: 79: Hoare triple {18277#(<= 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); {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:58,682 INFO L273 TraceCheckUtils]: 80: Hoare triple {18277#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:58,682 INFO L273 TraceCheckUtils]: 81: Hoare triple {18277#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:58,683 INFO L273 TraceCheckUtils]: 82: Hoare triple {18278#(<= 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); {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:58,683 INFO L273 TraceCheckUtils]: 83: Hoare triple {18278#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:58,684 INFO L273 TraceCheckUtils]: 84: Hoare triple {18278#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {18279#(<= main_~k~0 26)} is VALID [2018-11-23 11:52:58,685 INFO L273 TraceCheckUtils]: 85: Hoare triple {18279#(<= main_~k~0 26)} assume !(~k~0 < 100000); {18251#false} is VALID [2018-11-23 11:52:58,685 INFO L273 TraceCheckUtils]: 86: Hoare triple {18251#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); {18251#false} is VALID [2018-11-23 11:52:58,685 INFO L273 TraceCheckUtils]: 87: Hoare triple {18251#false} ~x~0 := 0; {18251#false} is VALID [2018-11-23 11:52:58,685 INFO L273 TraceCheckUtils]: 88: Hoare triple {18251#false} assume !(~x~0 < ~i~0); {18251#false} is VALID [2018-11-23 11:52:58,686 INFO L273 TraceCheckUtils]: 89: Hoare triple {18251#false} ~x~0 := 1 + ~i~0; {18251#false} is VALID [2018-11-23 11:52:58,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {18251#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); {18251#false} is VALID [2018-11-23 11:52:58,686 INFO L256 TraceCheckUtils]: 91: Hoare triple {18251#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18251#false} is VALID [2018-11-23 11:52:58,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {18251#false} ~cond := #in~cond; {18251#false} is VALID [2018-11-23 11:52:58,686 INFO L273 TraceCheckUtils]: 93: Hoare triple {18251#false} assume 0 == ~cond; {18251#false} is VALID [2018-11-23 11:52:58,687 INFO L273 TraceCheckUtils]: 94: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2018-11-23 11:52:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:58,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:58,694 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-23 11:52:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:58,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-23 11:52:58,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:58,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:59,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {18250#true} call ULTIMATE.init(); {18250#true} is VALID [2018-11-23 11:52:59,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {18250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18250#true} is VALID [2018-11-23 11:52:59,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {18250#true} assume true; {18250#true} is VALID [2018-11-23 11:52:59,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18250#true} {18250#true} #130#return; {18250#true} is VALID [2018-11-23 11:52:59,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {18250#true} call #t~ret15 := main(); {18250#true} is VALID [2018-11-23 11:52:59,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {18250#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {18298#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:59,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {18298#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {18302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:59,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {18302#(<= 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); {18302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:59,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {18302#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18302#(<= main_~k~0 0)} is VALID [2018-11-23 11:52:59,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {18302#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {18254#(<= 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); {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {18254#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {18254#(<= main_~k~0 1)} is VALID [2018-11-23 11:52:59,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {18254#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {18255#(<= 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); {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {18255#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18255#(<= main_~k~0 2)} is VALID [2018-11-23 11:52:59,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {18255#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {18256#(<= 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); {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {18256#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18256#(<= main_~k~0 3)} is VALID [2018-11-23 11:52:59,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {18256#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {18257#(<= 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); {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {18257#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18257#(<= main_~k~0 4)} is VALID [2018-11-23 11:52:59,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {18257#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {18258#(<= 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); {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {18258#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18258#(<= main_~k~0 5)} is VALID [2018-11-23 11:52:59,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {18258#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {18259#(<= 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); {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {18259#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18259#(<= main_~k~0 6)} is VALID [2018-11-23 11:52:59,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {18259#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {18260#(<= 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); {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {18260#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18260#(<= main_~k~0 7)} is VALID [2018-11-23 11:52:59,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {18260#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {18261#(<= 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); {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {18261#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18261#(<= main_~k~0 8)} is VALID [2018-11-23 11:52:59,070 INFO L273 TraceCheckUtils]: 33: Hoare triple {18261#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,071 INFO L273 TraceCheckUtils]: 34: Hoare triple {18262#(<= 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); {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {18262#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18262#(<= main_~k~0 9)} is VALID [2018-11-23 11:52:59,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {18262#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,072 INFO L273 TraceCheckUtils]: 37: Hoare triple {18263#(<= 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); {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {18263#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18263#(<= main_~k~0 10)} is VALID [2018-11-23 11:52:59,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {18263#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {18264#(<= 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); {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {18264#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18264#(<= main_~k~0 11)} is VALID [2018-11-23 11:52:59,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {18264#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {18265#(<= 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); {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {18265#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18265#(<= main_~k~0 12)} is VALID [2018-11-23 11:52:59,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {18265#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {18266#(<= 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); {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {18266#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18266#(<= main_~k~0 13)} is VALID [2018-11-23 11:52:59,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {18266#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {18267#(<= 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); {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {18267#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18267#(<= main_~k~0 14)} is VALID [2018-11-23 11:52:59,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {18267#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {18268#(<= 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); {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {18268#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18268#(<= main_~k~0 15)} is VALID [2018-11-23 11:52:59,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {18268#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,083 INFO L273 TraceCheckUtils]: 55: Hoare triple {18269#(<= 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); {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {18269#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18269#(<= main_~k~0 16)} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 57: Hoare triple {18269#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,084 INFO L273 TraceCheckUtils]: 58: Hoare triple {18270#(<= 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); {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 59: Hoare triple {18270#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18270#(<= main_~k~0 17)} is VALID [2018-11-23 11:52:59,085 INFO L273 TraceCheckUtils]: 60: Hoare triple {18270#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {18271#(<= 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); {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {18271#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18271#(<= main_~k~0 18)} is VALID [2018-11-23 11:52:59,087 INFO L273 TraceCheckUtils]: 63: Hoare triple {18271#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,088 INFO L273 TraceCheckUtils]: 64: Hoare triple {18272#(<= 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); {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,088 INFO L273 TraceCheckUtils]: 65: Hoare triple {18272#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18272#(<= main_~k~0 19)} is VALID [2018-11-23 11:52:59,089 INFO L273 TraceCheckUtils]: 66: Hoare triple {18272#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,089 INFO L273 TraceCheckUtils]: 67: Hoare triple {18273#(<= 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); {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,090 INFO L273 TraceCheckUtils]: 68: Hoare triple {18273#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18273#(<= main_~k~0 20)} is VALID [2018-11-23 11:52:59,090 INFO L273 TraceCheckUtils]: 69: Hoare triple {18273#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,091 INFO L273 TraceCheckUtils]: 70: Hoare triple {18274#(<= 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); {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,091 INFO L273 TraceCheckUtils]: 71: Hoare triple {18274#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18274#(<= main_~k~0 21)} is VALID [2018-11-23 11:52:59,092 INFO L273 TraceCheckUtils]: 72: Hoare triple {18274#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,093 INFO L273 TraceCheckUtils]: 73: Hoare triple {18275#(<= 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); {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,093 INFO L273 TraceCheckUtils]: 74: Hoare triple {18275#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18275#(<= main_~k~0 22)} is VALID [2018-11-23 11:52:59,094 INFO L273 TraceCheckUtils]: 75: Hoare triple {18275#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:59,094 INFO L273 TraceCheckUtils]: 76: Hoare triple {18276#(<= 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); {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:59,095 INFO L273 TraceCheckUtils]: 77: Hoare triple {18276#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18276#(<= main_~k~0 23)} is VALID [2018-11-23 11:52:59,096 INFO L273 TraceCheckUtils]: 78: Hoare triple {18276#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:59,096 INFO L273 TraceCheckUtils]: 79: Hoare triple {18277#(<= 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); {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:59,097 INFO L273 TraceCheckUtils]: 80: Hoare triple {18277#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18277#(<= main_~k~0 24)} is VALID [2018-11-23 11:52:59,097 INFO L273 TraceCheckUtils]: 81: Hoare triple {18277#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:59,098 INFO L273 TraceCheckUtils]: 82: Hoare triple {18278#(<= 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); {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:59,098 INFO L273 TraceCheckUtils]: 83: Hoare triple {18278#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {18278#(<= main_~k~0 25)} is VALID [2018-11-23 11:52:59,099 INFO L273 TraceCheckUtils]: 84: Hoare triple {18278#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {18279#(<= main_~k~0 26)} is VALID [2018-11-23 11:52:59,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {18279#(<= main_~k~0 26)} assume !(~k~0 < 100000); {18251#false} is VALID [2018-11-23 11:52:59,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {18251#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); {18251#false} is VALID [2018-11-23 11:52:59,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {18251#false} ~x~0 := 0; {18251#false} is VALID [2018-11-23 11:52:59,100 INFO L273 TraceCheckUtils]: 88: Hoare triple {18251#false} assume !(~x~0 < ~i~0); {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {18251#false} ~x~0 := 1 + ~i~0; {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {18251#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); {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L256 TraceCheckUtils]: 91: Hoare triple {18251#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {18251#false} ~cond := #in~cond; {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {18251#false} assume 0 == ~cond; {18251#false} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 94: Hoare triple {18251#false} assume !false; {18251#false} is VALID [2018-11-23 11:52:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:52:59,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:59,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2018-11-23 11:52:59,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-11-23 11:52:59,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:59,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:52:59,218 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-23 11:52:59,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:52:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:52:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:59,220 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand 32 states. [2018-11-23 11:53:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,000 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2018-11-23 11:53:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:53:02,000 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-11-23 11:53:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:53:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 215 transitions. [2018-11-23 11:53:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:53:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 215 transitions. [2018-11-23 11:53:02,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 215 transitions. [2018-11-23 11:53:02,203 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-23 11:53:02,206 INFO L225 Difference]: With dead ends: 168 [2018-11-23 11:53:02,206 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 11:53:02,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:53:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 11:53:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-11-23 11:53:02,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:02,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 126 states. [2018-11-23 11:53:02,294 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 126 states. [2018-11-23 11:53:02,294 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 126 states. [2018-11-23 11:53:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,296 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2018-11-23 11:53:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2018-11-23 11:53:02,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,297 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 134 states. [2018-11-23 11:53:02,297 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 134 states. [2018-11-23 11:53:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,300 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2018-11-23 11:53:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2018-11-23 11:53:02,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:02,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:53:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2018-11-23 11:53:02,303 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 95 [2018-11-23 11:53:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:02,303 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2018-11-23 11:53:02,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:53:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2018-11-23 11:53:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 11:53:02,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:02,304 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:02,304 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:02,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash 884051968, now seen corresponding path program 16 times [2018-11-23 11:53:02,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:02,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {19288#true} call ULTIMATE.init(); {19288#true} is VALID [2018-11-23 11:53:03,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {19288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19288#true} is VALID [2018-11-23 11:53:03,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {19288#true} assume true; {19288#true} is VALID [2018-11-23 11:53:03,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19288#true} {19288#true} #130#return; {19288#true} is VALID [2018-11-23 11:53:03,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {19288#true} call #t~ret15 := main(); {19288#true} is VALID [2018-11-23 11:53:03,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {19288#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19290#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:03,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {19290#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {19291#(= main_~k~0 0)} is VALID [2018-11-23 11:53:03,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {19291#(= 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); {19291#(= main_~k~0 0)} is VALID [2018-11-23 11:53:03,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {19291#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19291#(= main_~k~0 0)} is VALID [2018-11-23 11:53:03,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {19291#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {19292#(<= 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); {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {19292#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {19292#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {19293#(<= 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); {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {19293#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {19293#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {19294#(<= 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); {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {19294#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {19294#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {19295#(<= 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); {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {19295#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {19295#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {19296#(<= 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); {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {19296#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {19296#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {19297#(<= 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); {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {19297#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {19297#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {19298#(<= 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); {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {19298#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {19298#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {19299#(<= 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); {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {19299#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {19299#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {19300#(<= 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); {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {19300#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {19300#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {19301#(<= 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); {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {19301#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {19301#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {19302#(<= 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); {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {19302#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {19302#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {19303#(<= 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); {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {19303#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {19303#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {19304#(<= 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); {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,055 INFO L273 TraceCheckUtils]: 47: Hoare triple {19304#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {19304#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {19305#(<= 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); {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {19305#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {19305#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {19306#(<= 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); {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {19306#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,059 INFO L273 TraceCheckUtils]: 54: Hoare triple {19306#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,060 INFO L273 TraceCheckUtils]: 55: Hoare triple {19307#(<= 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); {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {19307#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,061 INFO L273 TraceCheckUtils]: 57: Hoare triple {19307#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,061 INFO L273 TraceCheckUtils]: 58: Hoare triple {19308#(<= 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); {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,062 INFO L273 TraceCheckUtils]: 59: Hoare triple {19308#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,062 INFO L273 TraceCheckUtils]: 60: Hoare triple {19308#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,063 INFO L273 TraceCheckUtils]: 61: Hoare triple {19309#(<= 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); {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,063 INFO L273 TraceCheckUtils]: 62: Hoare triple {19309#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,064 INFO L273 TraceCheckUtils]: 63: Hoare triple {19309#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,064 INFO L273 TraceCheckUtils]: 64: Hoare triple {19310#(<= 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); {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {19310#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,066 INFO L273 TraceCheckUtils]: 66: Hoare triple {19310#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,066 INFO L273 TraceCheckUtils]: 67: Hoare triple {19311#(<= 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); {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,067 INFO L273 TraceCheckUtils]: 68: Hoare triple {19311#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,067 INFO L273 TraceCheckUtils]: 69: Hoare triple {19311#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,068 INFO L273 TraceCheckUtils]: 70: Hoare triple {19312#(<= 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); {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,068 INFO L273 TraceCheckUtils]: 71: Hoare triple {19312#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,069 INFO L273 TraceCheckUtils]: 72: Hoare triple {19312#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,070 INFO L273 TraceCheckUtils]: 73: Hoare triple {19313#(<= 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); {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,070 INFO L273 TraceCheckUtils]: 74: Hoare triple {19313#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,071 INFO L273 TraceCheckUtils]: 75: Hoare triple {19313#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,071 INFO L273 TraceCheckUtils]: 76: Hoare triple {19314#(<= 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); {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,072 INFO L273 TraceCheckUtils]: 77: Hoare triple {19314#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,072 INFO L273 TraceCheckUtils]: 78: Hoare triple {19314#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,073 INFO L273 TraceCheckUtils]: 79: Hoare triple {19315#(<= 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); {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,073 INFO L273 TraceCheckUtils]: 80: Hoare triple {19315#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,074 INFO L273 TraceCheckUtils]: 81: Hoare triple {19315#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {19316#(<= 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); {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,075 INFO L273 TraceCheckUtils]: 83: Hoare triple {19316#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,076 INFO L273 TraceCheckUtils]: 84: Hoare triple {19316#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,076 INFO L273 TraceCheckUtils]: 85: Hoare triple {19317#(<= 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); {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,077 INFO L273 TraceCheckUtils]: 86: Hoare triple {19317#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {19317#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {19318#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:03,078 INFO L273 TraceCheckUtils]: 88: Hoare triple {19318#(<= main_~k~0 27)} assume !(~k~0 < 100000); {19289#false} is VALID [2018-11-23 11:53:03,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {19289#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); {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L273 TraceCheckUtils]: 90: Hoare triple {19289#false} ~x~0 := 0; {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {19289#false} assume !(~x~0 < ~i~0); {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {19289#false} ~x~0 := 1 + ~i~0; {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L273 TraceCheckUtils]: 93: Hoare triple {19289#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); {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L256 TraceCheckUtils]: 94: Hoare triple {19289#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19289#false} is VALID [2018-11-23 11:53:03,079 INFO L273 TraceCheckUtils]: 95: Hoare triple {19289#false} ~cond := #in~cond; {19289#false} is VALID [2018-11-23 11:53:03,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {19289#false} assume 0 == ~cond; {19289#false} is VALID [2018-11-23 11:53:03,080 INFO L273 TraceCheckUtils]: 97: Hoare triple {19289#false} assume !false; {19289#false} is VALID [2018-11-23 11:53:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:03,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:03,088 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-23 11:53:03,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:03,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:03,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:03,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {19288#true} call ULTIMATE.init(); {19288#true} is VALID [2018-11-23 11:53:03,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {19288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19288#true} is VALID [2018-11-23 11:53:03,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {19288#true} assume true; {19288#true} is VALID [2018-11-23 11:53:03,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19288#true} {19288#true} #130#return; {19288#true} is VALID [2018-11-23 11:53:03,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {19288#true} call #t~ret15 := main(); {19288#true} is VALID [2018-11-23 11:53:03,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {19288#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {19337#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:03,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {19337#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {19341#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:03,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {19341#(<= 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); {19341#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:03,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {19341#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19341#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:03,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {19341#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {19292#(<= 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); {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {19292#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {19292#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:03,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {19292#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {19293#(<= 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); {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {19293#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19293#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:03,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {19293#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {19294#(<= 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); {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {19294#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19294#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:03,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {19294#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {19295#(<= 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); {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {19295#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19295#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:03,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {19295#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {19296#(<= 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); {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {19296#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19296#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:03,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {19296#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {19297#(<= 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); {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {19297#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19297#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:03,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {19297#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {19298#(<= 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); {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {19298#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19298#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:03,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {19298#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {19299#(<= 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); {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {19299#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19299#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:03,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {19299#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {19300#(<= 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); {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {19300#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19300#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:03,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {19300#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {19301#(<= 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); {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {19301#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19301#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:03,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {19301#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,418 INFO L273 TraceCheckUtils]: 40: Hoare triple {19302#(<= 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); {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {19302#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19302#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:03,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {19302#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {19303#(<= 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); {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {19303#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19303#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:03,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {19303#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {19304#(<= 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); {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {19304#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19304#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:03,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {19304#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {19305#(<= 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); {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {19305#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19305#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:03,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {19305#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {19306#(<= 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); {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {19306#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19306#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:03,426 INFO L273 TraceCheckUtils]: 54: Hoare triple {19306#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,426 INFO L273 TraceCheckUtils]: 55: Hoare triple {19307#(<= 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); {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {19307#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19307#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:03,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {19307#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {19308#(<= 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); {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {19308#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19308#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:03,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {19308#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,430 INFO L273 TraceCheckUtils]: 61: Hoare triple {19309#(<= 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); {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,430 INFO L273 TraceCheckUtils]: 62: Hoare triple {19309#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19309#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:03,431 INFO L273 TraceCheckUtils]: 63: Hoare triple {19309#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,431 INFO L273 TraceCheckUtils]: 64: Hoare triple {19310#(<= 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); {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,432 INFO L273 TraceCheckUtils]: 65: Hoare triple {19310#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19310#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:03,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {19310#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,433 INFO L273 TraceCheckUtils]: 67: Hoare triple {19311#(<= 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); {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,434 INFO L273 TraceCheckUtils]: 68: Hoare triple {19311#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19311#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:03,434 INFO L273 TraceCheckUtils]: 69: Hoare triple {19311#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,435 INFO L273 TraceCheckUtils]: 70: Hoare triple {19312#(<= 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); {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,435 INFO L273 TraceCheckUtils]: 71: Hoare triple {19312#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19312#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:03,436 INFO L273 TraceCheckUtils]: 72: Hoare triple {19312#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,437 INFO L273 TraceCheckUtils]: 73: Hoare triple {19313#(<= 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); {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,437 INFO L273 TraceCheckUtils]: 74: Hoare triple {19313#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19313#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:03,438 INFO L273 TraceCheckUtils]: 75: Hoare triple {19313#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {19314#(<= 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); {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,444 INFO L273 TraceCheckUtils]: 77: Hoare triple {19314#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19314#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:03,445 INFO L273 TraceCheckUtils]: 78: Hoare triple {19314#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,445 INFO L273 TraceCheckUtils]: 79: Hoare triple {19315#(<= 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); {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,445 INFO L273 TraceCheckUtils]: 80: Hoare triple {19315#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19315#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:03,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {19315#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {19316#(<= 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); {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,446 INFO L273 TraceCheckUtils]: 83: Hoare triple {19316#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19316#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:03,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {19316#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {19317#(<= 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); {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {19317#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {19317#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:03,448 INFO L273 TraceCheckUtils]: 87: Hoare triple {19317#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {19318#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:03,449 INFO L273 TraceCheckUtils]: 88: Hoare triple {19318#(<= main_~k~0 27)} assume !(~k~0 < 100000); {19289#false} is VALID [2018-11-23 11:53:03,449 INFO L273 TraceCheckUtils]: 89: Hoare triple {19289#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); {19289#false} is VALID [2018-11-23 11:53:03,449 INFO L273 TraceCheckUtils]: 90: Hoare triple {19289#false} ~x~0 := 0; {19289#false} is VALID [2018-11-23 11:53:03,449 INFO L273 TraceCheckUtils]: 91: Hoare triple {19289#false} assume !(~x~0 < ~i~0); {19289#false} is VALID [2018-11-23 11:53:03,449 INFO L273 TraceCheckUtils]: 92: Hoare triple {19289#false} ~x~0 := 1 + ~i~0; {19289#false} is VALID [2018-11-23 11:53:03,450 INFO L273 TraceCheckUtils]: 93: Hoare triple {19289#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); {19289#false} is VALID [2018-11-23 11:53:03,450 INFO L256 TraceCheckUtils]: 94: Hoare triple {19289#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {19289#false} is VALID [2018-11-23 11:53:03,450 INFO L273 TraceCheckUtils]: 95: Hoare triple {19289#false} ~cond := #in~cond; {19289#false} is VALID [2018-11-23 11:53:03,450 INFO L273 TraceCheckUtils]: 96: Hoare triple {19289#false} assume 0 == ~cond; {19289#false} is VALID [2018-11-23 11:53:03,450 INFO L273 TraceCheckUtils]: 97: Hoare triple {19289#false} assume !false; {19289#false} is VALID [2018-11-23 11:53:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:03,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:03,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-11-23 11:53:03,479 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2018-11-23 11:53:03,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:03,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:53:03,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:03,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:53:03,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:53:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:53:03,576 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand 33 states. [2018-11-23 11:53:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,880 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2018-11-23 11:53:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:53:05,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2018-11-23 11:53:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:53:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:53:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:53:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 219 transitions. [2018-11-23 11:53:05,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 219 transitions. [2018-11-23 11:53:06,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:06,118 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:53:06,118 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 11:53:06,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:53:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 11:53:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-11-23 11:53:06,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:06,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 129 states. [2018-11-23 11:53:06,235 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 129 states. [2018-11-23 11:53:06,235 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 129 states. [2018-11-23 11:53:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:06,237 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2018-11-23 11:53:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2018-11-23 11:53:06,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:06,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 137 states. [2018-11-23 11:53:06,238 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 137 states. [2018-11-23 11:53:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:06,239 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2018-11-23 11:53:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2018-11-23 11:53:06,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:06,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:06,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:06,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:53:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2018-11-23 11:53:06,242 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 98 [2018-11-23 11:53:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:06,242 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2018-11-23 11:53:06,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:53:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2018-11-23 11:53:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:53:06,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:06,243 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:06,243 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:06,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash 118948983, now seen corresponding path program 17 times [2018-11-23 11:53:06,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:06,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:06,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {20352#true} call ULTIMATE.init(); {20352#true} is VALID [2018-11-23 11:53:06,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {20352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20352#true} is VALID [2018-11-23 11:53:06,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {20352#true} assume true; {20352#true} is VALID [2018-11-23 11:53:06,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20352#true} {20352#true} #130#return; {20352#true} is VALID [2018-11-23 11:53:06,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {20352#true} call #t~ret15 := main(); {20352#true} is VALID [2018-11-23 11:53:06,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {20352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {20354#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:06,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {20354#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {20355#(= main_~k~0 0)} is VALID [2018-11-23 11:53:06,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {20355#(= 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); {20355#(= main_~k~0 0)} is VALID [2018-11-23 11:53:06,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {20355#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20355#(= main_~k~0 0)} is VALID [2018-11-23 11:53:06,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {20355#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:06,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {20356#(<= 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); {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:06,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {20356#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:06,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {20356#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:06,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {20357#(<= 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); {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:06,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {20357#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:06,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {20357#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:06,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {20358#(<= 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); {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:06,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {20358#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:06,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {20358#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:06,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {20359#(<= 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); {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:06,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {20359#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:06,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {20359#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:06,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {20360#(<= 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); {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:06,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {20360#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:06,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {20360#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:06,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {20361#(<= 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); {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:06,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {20361#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:06,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {20361#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:06,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {20362#(<= 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); {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:06,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {20362#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:06,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {20362#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:06,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {20363#(<= 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); {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:06,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {20363#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:06,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {20363#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:06,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {20364#(<= 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); {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:06,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {20364#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:06,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {20364#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:06,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {20365#(<= 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); {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:06,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {20365#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:06,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {20365#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:06,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {20366#(<= 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); {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:06,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {20366#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:06,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {20366#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:06,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {20367#(<= 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); {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:06,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {20367#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:06,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {20367#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:06,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {20368#(<= 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); {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:06,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {20368#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:06,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {20368#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:06,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {20369#(<= 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); {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:06,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {20369#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:06,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {20369#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:06,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {20370#(<= 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); {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:06,900 INFO L273 TraceCheckUtils]: 53: Hoare triple {20370#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:06,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {20370#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:06,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {20371#(<= 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); {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:06,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {20371#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:06,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {20371#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:06,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {20372#(<= 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); {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:06,969 INFO L273 TraceCheckUtils]: 59: Hoare triple {20372#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:06,983 INFO L273 TraceCheckUtils]: 60: Hoare triple {20372#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:06,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {20373#(<= 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); {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {20373#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,016 INFO L273 TraceCheckUtils]: 63: Hoare triple {20373#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,029 INFO L273 TraceCheckUtils]: 64: Hoare triple {20374#(<= 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); {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,038 INFO L273 TraceCheckUtils]: 65: Hoare triple {20374#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,050 INFO L273 TraceCheckUtils]: 66: Hoare triple {20374#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,063 INFO L273 TraceCheckUtils]: 67: Hoare triple {20375#(<= 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); {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,065 INFO L273 TraceCheckUtils]: 68: Hoare triple {20375#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,065 INFO L273 TraceCheckUtils]: 69: Hoare triple {20375#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {20376#(<= 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); {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {20376#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,069 INFO L273 TraceCheckUtils]: 72: Hoare triple {20376#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,069 INFO L273 TraceCheckUtils]: 73: Hoare triple {20377#(<= 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); {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {20377#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,071 INFO L273 TraceCheckUtils]: 75: Hoare triple {20377#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,071 INFO L273 TraceCheckUtils]: 76: Hoare triple {20378#(<= 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); {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,072 INFO L273 TraceCheckUtils]: 77: Hoare triple {20378#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,073 INFO L273 TraceCheckUtils]: 78: Hoare triple {20378#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,073 INFO L273 TraceCheckUtils]: 79: Hoare triple {20379#(<= 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); {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,073 INFO L273 TraceCheckUtils]: 80: Hoare triple {20379#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,074 INFO L273 TraceCheckUtils]: 81: Hoare triple {20379#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {20380#(<= 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); {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,074 INFO L273 TraceCheckUtils]: 83: Hoare triple {20380#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {20380#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,076 INFO L273 TraceCheckUtils]: 85: Hoare triple {20381#(<= 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); {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,076 INFO L273 TraceCheckUtils]: 86: Hoare triple {20381#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,077 INFO L273 TraceCheckUtils]: 87: Hoare triple {20381#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,077 INFO L273 TraceCheckUtils]: 88: Hoare triple {20382#(<= 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); {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {20382#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {20382#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {20383#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:07,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {20383#(<= main_~k~0 28)} assume !(~k~0 < 100000); {20353#false} is VALID [2018-11-23 11:53:07,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {20353#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); {20353#false} is VALID [2018-11-23 11:53:07,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {20353#false} ~x~0 := 0; {20353#false} is VALID [2018-11-23 11:53:07,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {20353#false} assume !(~x~0 < ~i~0); {20353#false} is VALID [2018-11-23 11:53:07,080 INFO L273 TraceCheckUtils]: 95: Hoare triple {20353#false} ~x~0 := 1 + ~i~0; {20353#false} is VALID [2018-11-23 11:53:07,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {20353#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); {20353#false} is VALID [2018-11-23 11:53:07,080 INFO L256 TraceCheckUtils]: 97: Hoare triple {20353#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20353#false} is VALID [2018-11-23 11:53:07,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {20353#false} ~cond := #in~cond; {20353#false} is VALID [2018-11-23 11:53:07,081 INFO L273 TraceCheckUtils]: 99: Hoare triple {20353#false} assume 0 == ~cond; {20353#false} is VALID [2018-11-23 11:53:07,081 INFO L273 TraceCheckUtils]: 100: Hoare triple {20353#false} assume !false; {20353#false} is VALID [2018-11-23 11:53:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:07,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:07,089 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-23 11:53:07,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:07,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 11:53:07,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:07,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:07,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {20352#true} call ULTIMATE.init(); {20352#true} is VALID [2018-11-23 11:53:07,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {20352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20352#true} is VALID [2018-11-23 11:53:07,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {20352#true} assume true; {20352#true} is VALID [2018-11-23 11:53:07,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20352#true} {20352#true} #130#return; {20352#true} is VALID [2018-11-23 11:53:07,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {20352#true} call #t~ret15 := main(); {20352#true} is VALID [2018-11-23 11:53:07,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {20352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {20402#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:07,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {20402#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {20406#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:07,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {20406#(<= 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); {20406#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:07,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {20406#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20406#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:07,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {20406#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {20356#(<= 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); {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {20356#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {20356#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:07,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {20356#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {20357#(<= 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); {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {20357#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20357#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:07,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {20357#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {20358#(<= 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); {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {20358#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20358#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:07,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {20358#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {20359#(<= 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); {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {20359#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20359#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:07,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {20359#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {20360#(<= 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); {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {20360#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20360#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:07,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {20360#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {20361#(<= 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); {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {20361#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20361#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:07,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {20361#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {20362#(<= 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); {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {20362#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20362#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:07,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {20362#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {20363#(<= 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); {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {20363#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20363#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:07,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {20363#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {20364#(<= 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); {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {20364#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20364#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:07,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {20364#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,606 INFO L273 TraceCheckUtils]: 37: Hoare triple {20365#(<= 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); {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {20365#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20365#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:07,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {20365#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {20366#(<= 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); {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,609 INFO L273 TraceCheckUtils]: 41: Hoare triple {20366#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20366#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:07,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {20366#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {20367#(<= 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); {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {20367#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20367#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:07,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {20367#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,612 INFO L273 TraceCheckUtils]: 46: Hoare triple {20368#(<= 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); {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {20368#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20368#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:07,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {20368#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,614 INFO L273 TraceCheckUtils]: 49: Hoare triple {20369#(<= 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); {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,614 INFO L273 TraceCheckUtils]: 50: Hoare triple {20369#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20369#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:07,615 INFO L273 TraceCheckUtils]: 51: Hoare triple {20369#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,615 INFO L273 TraceCheckUtils]: 52: Hoare triple {20370#(<= 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); {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {20370#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20370#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:07,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {20370#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,617 INFO L273 TraceCheckUtils]: 55: Hoare triple {20371#(<= 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); {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,618 INFO L273 TraceCheckUtils]: 56: Hoare triple {20371#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20371#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:07,618 INFO L273 TraceCheckUtils]: 57: Hoare triple {20371#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {20372#(<= 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); {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,619 INFO L273 TraceCheckUtils]: 59: Hoare triple {20372#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20372#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:07,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {20372#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,621 INFO L273 TraceCheckUtils]: 61: Hoare triple {20373#(<= 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); {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {20373#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20373#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:07,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {20373#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,622 INFO L273 TraceCheckUtils]: 64: Hoare triple {20374#(<= 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); {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {20374#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20374#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:07,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {20374#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {20375#(<= 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); {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {20375#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20375#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:07,625 INFO L273 TraceCheckUtils]: 69: Hoare triple {20375#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {20376#(<= 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); {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {20376#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20376#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:07,627 INFO L273 TraceCheckUtils]: 72: Hoare triple {20376#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,628 INFO L273 TraceCheckUtils]: 73: Hoare triple {20377#(<= 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); {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,628 INFO L273 TraceCheckUtils]: 74: Hoare triple {20377#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20377#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:07,629 INFO L273 TraceCheckUtils]: 75: Hoare triple {20377#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,629 INFO L273 TraceCheckUtils]: 76: Hoare triple {20378#(<= 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); {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,630 INFO L273 TraceCheckUtils]: 77: Hoare triple {20378#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20378#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:07,631 INFO L273 TraceCheckUtils]: 78: Hoare triple {20378#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,631 INFO L273 TraceCheckUtils]: 79: Hoare triple {20379#(<= 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); {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,632 INFO L273 TraceCheckUtils]: 80: Hoare triple {20379#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20379#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:07,632 INFO L273 TraceCheckUtils]: 81: Hoare triple {20379#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,633 INFO L273 TraceCheckUtils]: 82: Hoare triple {20380#(<= 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); {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,633 INFO L273 TraceCheckUtils]: 83: Hoare triple {20380#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20380#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:07,634 INFO L273 TraceCheckUtils]: 84: Hoare triple {20380#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,635 INFO L273 TraceCheckUtils]: 85: Hoare triple {20381#(<= 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); {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,635 INFO L273 TraceCheckUtils]: 86: Hoare triple {20381#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20381#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:07,636 INFO L273 TraceCheckUtils]: 87: Hoare triple {20381#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,636 INFO L273 TraceCheckUtils]: 88: Hoare triple {20382#(<= 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); {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,637 INFO L273 TraceCheckUtils]: 89: Hoare triple {20382#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {20382#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:07,637 INFO L273 TraceCheckUtils]: 90: Hoare triple {20382#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {20383#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:07,638 INFO L273 TraceCheckUtils]: 91: Hoare triple {20383#(<= main_~k~0 28)} assume !(~k~0 < 100000); {20353#false} is VALID [2018-11-23 11:53:07,638 INFO L273 TraceCheckUtils]: 92: Hoare triple {20353#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); {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {20353#false} ~x~0 := 0; {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L273 TraceCheckUtils]: 94: Hoare triple {20353#false} assume !(~x~0 < ~i~0); {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {20353#false} ~x~0 := 1 + ~i~0; {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L273 TraceCheckUtils]: 96: Hoare triple {20353#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); {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L256 TraceCheckUtils]: 97: Hoare triple {20353#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {20353#false} is VALID [2018-11-23 11:53:07,639 INFO L273 TraceCheckUtils]: 98: Hoare triple {20353#false} ~cond := #in~cond; {20353#false} is VALID [2018-11-23 11:53:07,640 INFO L273 TraceCheckUtils]: 99: Hoare triple {20353#false} assume 0 == ~cond; {20353#false} is VALID [2018-11-23 11:53:07,640 INFO L273 TraceCheckUtils]: 100: Hoare triple {20353#false} assume !false; {20353#false} is VALID [2018-11-23 11:53:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:07,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:07,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2018-11-23 11:53:07,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-23 11:53:07,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:07,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:53:07,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:07,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:53:07,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:53:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:53:07,766 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand 34 states. [2018-11-23 11:53:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,112 INFO L93 Difference]: Finished difference Result 174 states and 230 transitions. [2018-11-23 11:53:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:53:10,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2018-11-23 11:53:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:53:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 11:53:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:53:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 223 transitions. [2018-11-23 11:53:10,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 223 transitions. [2018-11-23 11:53:10,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:10,325 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:53:10,325 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 11:53:10,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 11:53:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 11:53:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2018-11-23 11:53:10,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:10,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 132 states. [2018-11-23 11:53:10,396 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 132 states. [2018-11-23 11:53:10,396 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 132 states. [2018-11-23 11:53:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,399 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2018-11-23 11:53:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2018-11-23 11:53:10,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:10,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:10,399 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 140 states. [2018-11-23 11:53:10,399 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 140 states. [2018-11-23 11:53:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,401 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2018-11-23 11:53:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2018-11-23 11:53:10,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:10,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:10,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:10,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:53:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2018-11-23 11:53:10,404 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 101 [2018-11-23 11:53:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:10,405 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2018-11-23 11:53:10,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:53:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2018-11-23 11:53:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:53:10,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:10,406 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:10,406 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:10,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 327362720, now seen corresponding path program 18 times [2018-11-23 11:53:10,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:10,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:10,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {21442#true} call ULTIMATE.init(); {21442#true} is VALID [2018-11-23 11:53:11,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {21442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21442#true} is VALID [2018-11-23 11:53:11,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {21442#true} assume true; {21442#true} is VALID [2018-11-23 11:53:11,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21442#true} {21442#true} #130#return; {21442#true} is VALID [2018-11-23 11:53:11,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {21442#true} call #t~ret15 := main(); {21442#true} is VALID [2018-11-23 11:53:11,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {21442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21444#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:11,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {21444#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {21445#(= main_~k~0 0)} is VALID [2018-11-23 11:53:11,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {21445#(= 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); {21445#(= main_~k~0 0)} is VALID [2018-11-23 11:53:11,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {21445#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21445#(= main_~k~0 0)} is VALID [2018-11-23 11:53:11,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {21445#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {21446#(<= 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); {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {21446#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {21446#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {21447#(<= 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); {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {21447#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {21447#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {21448#(<= 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); {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {21448#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {21448#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {21449#(<= 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); {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {21449#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {21449#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {21450#(<= 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); {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {21450#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {21450#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {21451#(<= 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); {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {21451#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {21451#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {21452#(<= 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); {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {21452#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {21452#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {21453#(<= 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); {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {21453#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {21453#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {21454#(<= 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); {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {21454#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,142 INFO L273 TraceCheckUtils]: 36: Hoare triple {21454#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {21455#(<= 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); {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {21455#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {21455#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {21456#(<= 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); {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {21456#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {21456#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {21457#(<= 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); {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,147 INFO L273 TraceCheckUtils]: 44: Hoare triple {21457#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {21457#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {21458#(<= 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); {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {21458#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,149 INFO L273 TraceCheckUtils]: 48: Hoare triple {21458#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {21459#(<= 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); {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {21459#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {21459#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,151 INFO L273 TraceCheckUtils]: 52: Hoare triple {21460#(<= 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); {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {21460#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {21460#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {21461#(<= 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); {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {21461#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,154 INFO L273 TraceCheckUtils]: 57: Hoare triple {21461#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {21462#(<= 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); {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,155 INFO L273 TraceCheckUtils]: 59: Hoare triple {21462#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,156 INFO L273 TraceCheckUtils]: 60: Hoare triple {21462#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {21463#(<= 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); {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {21463#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,158 INFO L273 TraceCheckUtils]: 63: Hoare triple {21463#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,158 INFO L273 TraceCheckUtils]: 64: Hoare triple {21464#(<= 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); {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,159 INFO L273 TraceCheckUtils]: 65: Hoare triple {21464#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,159 INFO L273 TraceCheckUtils]: 66: Hoare triple {21464#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,160 INFO L273 TraceCheckUtils]: 67: Hoare triple {21465#(<= 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); {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,160 INFO L273 TraceCheckUtils]: 68: Hoare triple {21465#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,161 INFO L273 TraceCheckUtils]: 69: Hoare triple {21465#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,161 INFO L273 TraceCheckUtils]: 70: Hoare triple {21466#(<= 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); {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {21466#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,163 INFO L273 TraceCheckUtils]: 72: Hoare triple {21466#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {21467#(<= 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); {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,164 INFO L273 TraceCheckUtils]: 74: Hoare triple {21467#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,164 INFO L273 TraceCheckUtils]: 75: Hoare triple {21467#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,165 INFO L273 TraceCheckUtils]: 76: Hoare triple {21468#(<= 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); {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,165 INFO L273 TraceCheckUtils]: 77: Hoare triple {21468#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {21468#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,166 INFO L273 TraceCheckUtils]: 79: Hoare triple {21469#(<= 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); {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,167 INFO L273 TraceCheckUtils]: 80: Hoare triple {21469#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {21469#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,168 INFO L273 TraceCheckUtils]: 82: Hoare triple {21470#(<= 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); {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,168 INFO L273 TraceCheckUtils]: 83: Hoare triple {21470#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,169 INFO L273 TraceCheckUtils]: 84: Hoare triple {21470#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,170 INFO L273 TraceCheckUtils]: 85: Hoare triple {21471#(<= 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); {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,170 INFO L273 TraceCheckUtils]: 86: Hoare triple {21471#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,171 INFO L273 TraceCheckUtils]: 87: Hoare triple {21471#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,171 INFO L273 TraceCheckUtils]: 88: Hoare triple {21472#(<= 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); {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,172 INFO L273 TraceCheckUtils]: 89: Hoare triple {21472#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,172 INFO L273 TraceCheckUtils]: 90: Hoare triple {21472#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {21473#(<= 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); {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,173 INFO L273 TraceCheckUtils]: 92: Hoare triple {21473#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,174 INFO L273 TraceCheckUtils]: 93: Hoare triple {21473#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {21474#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:11,175 INFO L273 TraceCheckUtils]: 94: Hoare triple {21474#(<= main_~k~0 29)} assume !(~k~0 < 100000); {21443#false} is VALID [2018-11-23 11:53:11,175 INFO L273 TraceCheckUtils]: 95: Hoare triple {21443#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); {21443#false} is VALID [2018-11-23 11:53:11,175 INFO L273 TraceCheckUtils]: 96: Hoare triple {21443#false} ~x~0 := 0; {21443#false} is VALID [2018-11-23 11:53:11,175 INFO L273 TraceCheckUtils]: 97: Hoare triple {21443#false} assume !(~x~0 < ~i~0); {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L273 TraceCheckUtils]: 98: Hoare triple {21443#false} ~x~0 := 1 + ~i~0; {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L273 TraceCheckUtils]: 99: Hoare triple {21443#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); {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L256 TraceCheckUtils]: 100: Hoare triple {21443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L273 TraceCheckUtils]: 101: Hoare triple {21443#false} ~cond := #in~cond; {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L273 TraceCheckUtils]: 102: Hoare triple {21443#false} assume 0 == ~cond; {21443#false} is VALID [2018-11-23 11:53:11,176 INFO L273 TraceCheckUtils]: 103: Hoare triple {21443#false} assume !false; {21443#false} is VALID [2018-11-23 11:53:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:11,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:11,185 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-23 11:53:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:11,370 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-11-23 11:53:11,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:11,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {21442#true} call ULTIMATE.init(); {21442#true} is VALID [2018-11-23 11:53:11,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {21442#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21442#true} is VALID [2018-11-23 11:53:11,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {21442#true} assume true; {21442#true} is VALID [2018-11-23 11:53:11,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21442#true} {21442#true} #130#return; {21442#true} is VALID [2018-11-23 11:53:11,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {21442#true} call #t~ret15 := main(); {21442#true} is VALID [2018-11-23 11:53:11,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {21442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {21493#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:11,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {21493#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {21497#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:11,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {21497#(<= 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); {21497#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:11,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {21497#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21497#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:11,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {21497#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {21446#(<= 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); {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {21446#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {21446#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:11,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {21446#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {21447#(<= 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); {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {21447#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21447#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:11,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {21447#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {21448#(<= 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); {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {21448#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21448#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:11,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {21448#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {21449#(<= 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); {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {21449#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21449#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:11,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {21449#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {21450#(<= 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); {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {21450#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21450#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:11,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {21450#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {21451#(<= 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); {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {21451#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21451#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:11,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {21451#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,638 INFO L273 TraceCheckUtils]: 28: Hoare triple {21452#(<= 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); {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,639 INFO L273 TraceCheckUtils]: 29: Hoare triple {21452#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21452#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:11,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {21452#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {21453#(<= 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); {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {21453#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21453#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:11,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {21453#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {21454#(<= 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); {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {21454#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21454#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:11,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {21454#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {21455#(<= 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); {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {21455#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21455#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:11,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {21455#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {21456#(<= 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); {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {21456#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21456#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:11,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {21456#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {21457#(<= 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); {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {21457#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21457#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:11,648 INFO L273 TraceCheckUtils]: 45: Hoare triple {21457#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,649 INFO L273 TraceCheckUtils]: 46: Hoare triple {21458#(<= 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); {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,649 INFO L273 TraceCheckUtils]: 47: Hoare triple {21458#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21458#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:11,650 INFO L273 TraceCheckUtils]: 48: Hoare triple {21458#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,650 INFO L273 TraceCheckUtils]: 49: Hoare triple {21459#(<= 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); {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {21459#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21459#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:11,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {21459#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {21460#(<= 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); {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {21460#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21460#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:11,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {21460#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {21461#(<= 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); {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {21461#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21461#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:11,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {21461#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {21462#(<= 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); {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,656 INFO L273 TraceCheckUtils]: 59: Hoare triple {21462#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21462#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:11,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {21462#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,657 INFO L273 TraceCheckUtils]: 61: Hoare triple {21463#(<= 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); {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,658 INFO L273 TraceCheckUtils]: 62: Hoare triple {21463#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21463#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:11,659 INFO L273 TraceCheckUtils]: 63: Hoare triple {21463#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {21464#(<= 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); {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,660 INFO L273 TraceCheckUtils]: 65: Hoare triple {21464#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21464#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:11,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {21464#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,661 INFO L273 TraceCheckUtils]: 67: Hoare triple {21465#(<= 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); {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,661 INFO L273 TraceCheckUtils]: 68: Hoare triple {21465#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21465#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:11,662 INFO L273 TraceCheckUtils]: 69: Hoare triple {21465#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,663 INFO L273 TraceCheckUtils]: 70: Hoare triple {21466#(<= 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); {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,663 INFO L273 TraceCheckUtils]: 71: Hoare triple {21466#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21466#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:11,664 INFO L273 TraceCheckUtils]: 72: Hoare triple {21466#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {21467#(<= 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); {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,665 INFO L273 TraceCheckUtils]: 74: Hoare triple {21467#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21467#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:11,666 INFO L273 TraceCheckUtils]: 75: Hoare triple {21467#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,666 INFO L273 TraceCheckUtils]: 76: Hoare triple {21468#(<= 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); {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,667 INFO L273 TraceCheckUtils]: 77: Hoare triple {21468#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21468#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:11,667 INFO L273 TraceCheckUtils]: 78: Hoare triple {21468#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,668 INFO L273 TraceCheckUtils]: 79: Hoare triple {21469#(<= 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); {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,668 INFO L273 TraceCheckUtils]: 80: Hoare triple {21469#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21469#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:11,669 INFO L273 TraceCheckUtils]: 81: Hoare triple {21469#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,670 INFO L273 TraceCheckUtils]: 82: Hoare triple {21470#(<= 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); {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,670 INFO L273 TraceCheckUtils]: 83: Hoare triple {21470#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21470#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:11,671 INFO L273 TraceCheckUtils]: 84: Hoare triple {21470#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,671 INFO L273 TraceCheckUtils]: 85: Hoare triple {21471#(<= 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); {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,672 INFO L273 TraceCheckUtils]: 86: Hoare triple {21471#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21471#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:11,673 INFO L273 TraceCheckUtils]: 87: Hoare triple {21471#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,673 INFO L273 TraceCheckUtils]: 88: Hoare triple {21472#(<= 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); {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,674 INFO L273 TraceCheckUtils]: 89: Hoare triple {21472#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21472#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:11,674 INFO L273 TraceCheckUtils]: 90: Hoare triple {21472#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,675 INFO L273 TraceCheckUtils]: 91: Hoare triple {21473#(<= 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); {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,675 INFO L273 TraceCheckUtils]: 92: Hoare triple {21473#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {21473#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:11,676 INFO L273 TraceCheckUtils]: 93: Hoare triple {21473#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {21474#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:11,677 INFO L273 TraceCheckUtils]: 94: Hoare triple {21474#(<= main_~k~0 29)} assume !(~k~0 < 100000); {21443#false} is VALID [2018-11-23 11:53:11,677 INFO L273 TraceCheckUtils]: 95: Hoare triple {21443#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); {21443#false} is VALID [2018-11-23 11:53:11,677 INFO L273 TraceCheckUtils]: 96: Hoare triple {21443#false} ~x~0 := 0; {21443#false} is VALID [2018-11-23 11:53:11,677 INFO L273 TraceCheckUtils]: 97: Hoare triple {21443#false} assume !(~x~0 < ~i~0); {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L273 TraceCheckUtils]: 98: Hoare triple {21443#false} ~x~0 := 1 + ~i~0; {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L273 TraceCheckUtils]: 99: Hoare triple {21443#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); {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L256 TraceCheckUtils]: 100: Hoare triple {21443#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L273 TraceCheckUtils]: 101: Hoare triple {21443#false} ~cond := #in~cond; {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L273 TraceCheckUtils]: 102: Hoare triple {21443#false} assume 0 == ~cond; {21443#false} is VALID [2018-11-23 11:53:11,678 INFO L273 TraceCheckUtils]: 103: Hoare triple {21443#false} assume !false; {21443#false} is VALID [2018-11-23 11:53:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:11,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2018-11-23 11:53:11,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 104 [2018-11-23 11:53:11,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:11,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:53:11,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:11,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:53:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:53:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:53:11,809 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand 35 states. [2018-11-23 11:53:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,084 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2018-11-23 11:53:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:53:14,084 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 104 [2018-11-23 11:53:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:53:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 11:53:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:53:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 227 transitions. [2018-11-23 11:53:14,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 227 transitions. [2018-11-23 11:53:14,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:14,299 INFO L225 Difference]: With dead ends: 177 [2018-11-23 11:53:14,299 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 11:53:14,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 11:53:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 11:53:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-11-23 11:53:14,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:14,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 135 states. [2018-11-23 11:53:14,688 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 135 states. [2018-11-23 11:53:14,688 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 135 states. [2018-11-23 11:53:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,691 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2018-11-23 11:53:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2018-11-23 11:53:14,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,692 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 143 states. [2018-11-23 11:53:14,692 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 143 states. [2018-11-23 11:53:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,694 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2018-11-23 11:53:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2018-11-23 11:53:14,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:14,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:53:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2018-11-23 11:53:14,697 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 104 [2018-11-23 11:53:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:14,697 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2018-11-23 11:53:14,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:53:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2018-11-23 11:53:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:53:14,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:14,698 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:14,698 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:14,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1341708329, now seen corresponding path program 19 times [2018-11-23 11:53:14,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:14,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {22558#true} call ULTIMATE.init(); {22558#true} is VALID [2018-11-23 11:53:15,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {22558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22558#true} is VALID [2018-11-23 11:53:15,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {22558#true} assume true; {22558#true} is VALID [2018-11-23 11:53:15,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22558#true} {22558#true} #130#return; {22558#true} is VALID [2018-11-23 11:53:15,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {22558#true} call #t~ret15 := main(); {22558#true} is VALID [2018-11-23 11:53:15,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {22558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22560#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:15,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {22560#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {22561#(= main_~k~0 0)} is VALID [2018-11-23 11:53:15,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {22561#(= 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); {22561#(= main_~k~0 0)} is VALID [2018-11-23 11:53:15,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {22561#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22561#(= main_~k~0 0)} is VALID [2018-11-23 11:53:15,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {22561#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:15,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {22562#(<= 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); {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:15,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {22562#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:15,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {22562#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:15,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {22563#(<= 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); {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:15,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {22563#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:15,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {22563#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:15,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {22564#(<= 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); {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:15,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {22564#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:15,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {22564#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:15,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {22565#(<= 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); {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:15,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {22565#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:15,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {22565#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:15,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {22566#(<= 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); {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:15,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {22566#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:15,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {22566#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:15,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {22567#(<= 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); {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:15,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {22567#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:15,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {22567#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:15,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {22568#(<= 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); {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:15,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {22568#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:15,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {22568#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:15,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {22569#(<= 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); {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:15,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {22569#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:15,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {22569#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:15,473 INFO L273 TraceCheckUtils]: 34: Hoare triple {22570#(<= 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); {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:15,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {22570#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:15,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {22570#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:15,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {22571#(<= 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); {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:15,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {22571#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:15,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {22571#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:15,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {22572#(<= 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); {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:15,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {22572#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:15,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {22572#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:15,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {22573#(<= 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); {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:15,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {22573#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:15,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {22573#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:15,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {22574#(<= 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); {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:15,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {22574#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:15,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {22574#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:15,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {22575#(<= 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); {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:15,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {22575#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:15,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {22575#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:15,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {22576#(<= 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); {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:15,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {22576#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:15,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {22576#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:15,485 INFO L273 TraceCheckUtils]: 55: Hoare triple {22577#(<= 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); {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:15,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {22577#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:15,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {22577#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:15,486 INFO L273 TraceCheckUtils]: 58: Hoare triple {22578#(<= 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); {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:15,487 INFO L273 TraceCheckUtils]: 59: Hoare triple {22578#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:15,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {22578#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:15,488 INFO L273 TraceCheckUtils]: 61: Hoare triple {22579#(<= 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); {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:15,488 INFO L273 TraceCheckUtils]: 62: Hoare triple {22579#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:15,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {22579#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:15,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {22580#(<= 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); {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:15,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {22580#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:15,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {22580#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:15,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {22581#(<= 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); {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:15,492 INFO L273 TraceCheckUtils]: 68: Hoare triple {22581#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:15,492 INFO L273 TraceCheckUtils]: 69: Hoare triple {22581#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:15,493 INFO L273 TraceCheckUtils]: 70: Hoare triple {22582#(<= 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); {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:15,493 INFO L273 TraceCheckUtils]: 71: Hoare triple {22582#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:15,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {22582#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:15,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {22583#(<= 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); {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:15,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {22583#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:15,496 INFO L273 TraceCheckUtils]: 75: Hoare triple {22583#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:15,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {22584#(<= 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); {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:15,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {22584#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:15,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {22584#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:15,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {22585#(<= 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); {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:15,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {22585#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:15,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {22585#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:15,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {22586#(<= 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); {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:15,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {22586#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:15,501 INFO L273 TraceCheckUtils]: 84: Hoare triple {22586#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:15,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {22587#(<= 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); {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:15,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {22587#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:15,503 INFO L273 TraceCheckUtils]: 87: Hoare triple {22587#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:15,504 INFO L273 TraceCheckUtils]: 88: Hoare triple {22588#(<= 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); {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:15,504 INFO L273 TraceCheckUtils]: 89: Hoare triple {22588#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:15,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {22588#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:15,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {22589#(<= 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); {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:15,506 INFO L273 TraceCheckUtils]: 92: Hoare triple {22589#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:15,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {22589#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:15,508 INFO L273 TraceCheckUtils]: 94: Hoare triple {22590#(<= 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); {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:15,509 INFO L273 TraceCheckUtils]: 95: Hoare triple {22590#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:15,509 INFO L273 TraceCheckUtils]: 96: Hoare triple {22590#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {22591#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:15,510 INFO L273 TraceCheckUtils]: 97: Hoare triple {22591#(<= main_~k~0 30)} assume !(~k~0 < 100000); {22559#false} is VALID [2018-11-23 11:53:15,510 INFO L273 TraceCheckUtils]: 98: Hoare triple {22559#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); {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 99: Hoare triple {22559#false} ~x~0 := 0; {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 100: Hoare triple {22559#false} assume !(~x~0 < ~i~0); {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 101: Hoare triple {22559#false} ~x~0 := 1 + ~i~0; {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 102: Hoare triple {22559#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); {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L256 TraceCheckUtils]: 103: Hoare triple {22559#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22559#false} is VALID [2018-11-23 11:53:15,511 INFO L273 TraceCheckUtils]: 104: Hoare triple {22559#false} ~cond := #in~cond; {22559#false} is VALID [2018-11-23 11:53:15,512 INFO L273 TraceCheckUtils]: 105: Hoare triple {22559#false} assume 0 == ~cond; {22559#false} is VALID [2018-11-23 11:53:15,512 INFO L273 TraceCheckUtils]: 106: Hoare triple {22559#false} assume !false; {22559#false} is VALID [2018-11-23 11:53:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:15,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:15,521 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-23 11:53:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:17,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {22558#true} call ULTIMATE.init(); {22558#true} is VALID [2018-11-23 11:53:17,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {22558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22558#true} is VALID [2018-11-23 11:53:17,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {22558#true} assume true; {22558#true} is VALID [2018-11-23 11:53:17,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22558#true} {22558#true} #130#return; {22558#true} is VALID [2018-11-23 11:53:17,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {22558#true} call #t~ret15 := main(); {22558#true} is VALID [2018-11-23 11:53:17,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {22558#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {22610#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:17,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {22610#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {22614#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:17,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {22614#(<= 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); {22614#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:17,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {22614#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22614#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:17,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {22614#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:17,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {22562#(<= 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); {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:17,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {22562#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {22562#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:17,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {22562#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:17,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {22563#(<= 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); {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:17,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {22563#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22563#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:17,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {22563#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:17,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {22564#(<= 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); {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:17,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {22564#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22564#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:17,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {22564#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:17,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {22565#(<= 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); {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:17,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {22565#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22565#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:17,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {22565#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:17,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {22566#(<= 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); {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:17,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {22566#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22566#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:17,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {22566#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:17,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {22567#(<= 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); {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:17,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {22567#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22567#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:17,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {22567#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:17,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {22568#(<= 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); {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:17,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {22568#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22568#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:17,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {22568#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:17,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {22569#(<= 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); {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:17,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {22569#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22569#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:17,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {22569#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:17,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {22570#(<= 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); {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:17,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {22570#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22570#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:17,067 INFO L273 TraceCheckUtils]: 36: Hoare triple {22570#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:17,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {22571#(<= 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); {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:17,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {22571#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22571#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:17,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {22571#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:17,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {22572#(<= 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); {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:17,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {22572#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22572#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:17,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {22572#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:17,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {22573#(<= 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); {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:17,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {22573#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22573#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:17,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {22573#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:17,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {22574#(<= 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); {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:17,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {22574#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22574#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:17,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {22574#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:17,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {22575#(<= 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); {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:17,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {22575#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22575#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:17,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {22575#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:17,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {22576#(<= 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); {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:17,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {22576#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22576#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:17,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {22576#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:17,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {22577#(<= 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); {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:17,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {22577#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22577#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:17,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {22577#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:17,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {22578#(<= 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); {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:17,080 INFO L273 TraceCheckUtils]: 59: Hoare triple {22578#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22578#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:17,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {22578#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:17,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {22579#(<= 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); {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:17,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {22579#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22579#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:17,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {22579#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:17,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {22580#(<= 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); {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:17,082 INFO L273 TraceCheckUtils]: 65: Hoare triple {22580#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22580#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:17,083 INFO L273 TraceCheckUtils]: 66: Hoare triple {22580#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:17,083 INFO L273 TraceCheckUtils]: 67: Hoare triple {22581#(<= 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); {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:17,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {22581#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22581#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:17,084 INFO L273 TraceCheckUtils]: 69: Hoare triple {22581#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:17,085 INFO L273 TraceCheckUtils]: 70: Hoare triple {22582#(<= 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); {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:17,085 INFO L273 TraceCheckUtils]: 71: Hoare triple {22582#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22582#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:17,086 INFO L273 TraceCheckUtils]: 72: Hoare triple {22582#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:17,086 INFO L273 TraceCheckUtils]: 73: Hoare triple {22583#(<= 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); {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:17,087 INFO L273 TraceCheckUtils]: 74: Hoare triple {22583#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22583#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:17,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {22583#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:17,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {22584#(<= 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); {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:17,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {22584#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22584#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:17,089 INFO L273 TraceCheckUtils]: 78: Hoare triple {22584#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:17,090 INFO L273 TraceCheckUtils]: 79: Hoare triple {22585#(<= 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); {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:17,090 INFO L273 TraceCheckUtils]: 80: Hoare triple {22585#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22585#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:17,091 INFO L273 TraceCheckUtils]: 81: Hoare triple {22585#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:17,091 INFO L273 TraceCheckUtils]: 82: Hoare triple {22586#(<= 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); {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:17,092 INFO L273 TraceCheckUtils]: 83: Hoare triple {22586#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22586#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:17,092 INFO L273 TraceCheckUtils]: 84: Hoare triple {22586#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:17,093 INFO L273 TraceCheckUtils]: 85: Hoare triple {22587#(<= 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); {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:17,093 INFO L273 TraceCheckUtils]: 86: Hoare triple {22587#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22587#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:17,094 INFO L273 TraceCheckUtils]: 87: Hoare triple {22587#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:17,095 INFO L273 TraceCheckUtils]: 88: Hoare triple {22588#(<= 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); {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:17,095 INFO L273 TraceCheckUtils]: 89: Hoare triple {22588#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22588#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:17,096 INFO L273 TraceCheckUtils]: 90: Hoare triple {22588#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:17,096 INFO L273 TraceCheckUtils]: 91: Hoare triple {22589#(<= 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); {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:17,097 INFO L273 TraceCheckUtils]: 92: Hoare triple {22589#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22589#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:17,097 INFO L273 TraceCheckUtils]: 93: Hoare triple {22589#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:17,098 INFO L273 TraceCheckUtils]: 94: Hoare triple {22590#(<= 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); {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:17,098 INFO L273 TraceCheckUtils]: 95: Hoare triple {22590#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {22590#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:17,099 INFO L273 TraceCheckUtils]: 96: Hoare triple {22590#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {22591#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:17,100 INFO L273 TraceCheckUtils]: 97: Hoare triple {22591#(<= main_~k~0 30)} assume !(~k~0 < 100000); {22559#false} is VALID [2018-11-23 11:53:17,100 INFO L273 TraceCheckUtils]: 98: Hoare triple {22559#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); {22559#false} is VALID [2018-11-23 11:53:17,100 INFO L273 TraceCheckUtils]: 99: Hoare triple {22559#false} ~x~0 := 0; {22559#false} is VALID [2018-11-23 11:53:17,100 INFO L273 TraceCheckUtils]: 100: Hoare triple {22559#false} assume !(~x~0 < ~i~0); {22559#false} is VALID [2018-11-23 11:53:17,100 INFO L273 TraceCheckUtils]: 101: Hoare triple {22559#false} ~x~0 := 1 + ~i~0; {22559#false} is VALID [2018-11-23 11:53:17,101 INFO L273 TraceCheckUtils]: 102: Hoare triple {22559#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); {22559#false} is VALID [2018-11-23 11:53:17,101 INFO L256 TraceCheckUtils]: 103: Hoare triple {22559#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {22559#false} is VALID [2018-11-23 11:53:17,101 INFO L273 TraceCheckUtils]: 104: Hoare triple {22559#false} ~cond := #in~cond; {22559#false} is VALID [2018-11-23 11:53:17,101 INFO L273 TraceCheckUtils]: 105: Hoare triple {22559#false} assume 0 == ~cond; {22559#false} is VALID [2018-11-23 11:53:17,101 INFO L273 TraceCheckUtils]: 106: Hoare triple {22559#false} assume !false; {22559#false} is VALID [2018-11-23 11:53:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:17,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2018-11-23 11:53:17,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2018-11-23 11:53:17,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:17,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:53:17,229 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-23 11:53:17,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:53:17,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:53:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:53:17,231 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand 36 states. [2018-11-23 11:53:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:19,607 INFO L93 Difference]: Finished difference Result 180 states and 238 transitions. [2018-11-23 11:53:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:53:19,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2018-11-23 11:53:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:53:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 11:53:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:53:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 231 transitions. [2018-11-23 11:53:19,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 231 transitions. [2018-11-23 11:53:19,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:19,962 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:53:19,962 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 11:53:19,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 11:53:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 11:53:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2018-11-23 11:53:20,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:20,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 138 states. [2018-11-23 11:53:20,116 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 138 states. [2018-11-23 11:53:20,116 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 138 states. [2018-11-23 11:53:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:20,119 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2018-11-23 11:53:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-11-23 11:53:20,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:20,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:20,120 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 146 states. [2018-11-23 11:53:20,120 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 146 states. [2018-11-23 11:53:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:20,122 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2018-11-23 11:53:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-11-23 11:53:20,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:20,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:20,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:20,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:53:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-11-23 11:53:20,125 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 107 [2018-11-23 11:53:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:20,126 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-11-23 11:53:20,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:53:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-11-23 11:53:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 11:53:20,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:20,127 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:20,127 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:20,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1800943296, now seen corresponding path program 20 times [2018-11-23 11:53:20,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:20,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {23700#true} call ULTIMATE.init(); {23700#true} is VALID [2018-11-23 11:53:20,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {23700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23700#true} is VALID [2018-11-23 11:53:20,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 11:53:20,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23700#true} {23700#true} #130#return; {23700#true} is VALID [2018-11-23 11:53:20,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {23700#true} call #t~ret15 := main(); {23700#true} is VALID [2018-11-23 11:53:20,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {23700#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23702#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:20,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {23702#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {23703#(= main_~k~0 0)} is VALID [2018-11-23 11:53:20,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {23703#(= 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); {23703#(= main_~k~0 0)} is VALID [2018-11-23 11:53:20,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {23703#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23703#(= main_~k~0 0)} is VALID [2018-11-23 11:53:20,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {23703#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:20,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {23704#(<= 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); {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:20,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {23704#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:20,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {23704#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:20,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {23705#(<= 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); {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:20,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {23705#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:20,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {23705#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:20,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {23706#(<= 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); {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:20,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {23706#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:20,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {23706#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:20,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {23707#(<= 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); {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:20,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {23707#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:20,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {23707#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:20,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {23708#(<= 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); {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:20,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {23708#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:20,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {23708#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:20,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {23709#(<= 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); {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:20,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {23709#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:20,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {23709#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:20,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {23710#(<= 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); {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:20,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {23710#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:20,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {23710#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:20,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {23711#(<= 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); {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:20,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {23711#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:20,730 INFO L273 TraceCheckUtils]: 33: Hoare triple {23711#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:20,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {23712#(<= 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); {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:20,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {23712#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:20,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {23712#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:20,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {23713#(<= 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); {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:20,733 INFO L273 TraceCheckUtils]: 38: Hoare triple {23713#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:20,733 INFO L273 TraceCheckUtils]: 39: Hoare triple {23713#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:20,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {23714#(<= 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); {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:20,734 INFO L273 TraceCheckUtils]: 41: Hoare triple {23714#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:20,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {23714#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:20,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {23715#(<= 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); {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:20,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {23715#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:20,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {23715#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:20,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {23716#(<= 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); {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:20,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {23716#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:20,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {23716#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:20,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {23717#(<= 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); {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:20,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {23717#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:20,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {23717#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:20,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {23718#(<= 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); {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:20,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {23718#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:20,785 INFO L273 TraceCheckUtils]: 54: Hoare triple {23718#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:20,785 INFO L273 TraceCheckUtils]: 55: Hoare triple {23719#(<= 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); {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:20,786 INFO L273 TraceCheckUtils]: 56: Hoare triple {23719#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:20,786 INFO L273 TraceCheckUtils]: 57: Hoare triple {23719#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:20,787 INFO L273 TraceCheckUtils]: 58: Hoare triple {23720#(<= 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); {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:20,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {23720#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:20,788 INFO L273 TraceCheckUtils]: 60: Hoare triple {23720#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:20,789 INFO L273 TraceCheckUtils]: 61: Hoare triple {23721#(<= 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); {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:20,789 INFO L273 TraceCheckUtils]: 62: Hoare triple {23721#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:20,790 INFO L273 TraceCheckUtils]: 63: Hoare triple {23721#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:20,790 INFO L273 TraceCheckUtils]: 64: Hoare triple {23722#(<= 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); {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:20,791 INFO L273 TraceCheckUtils]: 65: Hoare triple {23722#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:20,791 INFO L273 TraceCheckUtils]: 66: Hoare triple {23722#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:20,792 INFO L273 TraceCheckUtils]: 67: Hoare triple {23723#(<= 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); {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:20,792 INFO L273 TraceCheckUtils]: 68: Hoare triple {23723#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:20,793 INFO L273 TraceCheckUtils]: 69: Hoare triple {23723#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:20,793 INFO L273 TraceCheckUtils]: 70: Hoare triple {23724#(<= 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); {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:20,794 INFO L273 TraceCheckUtils]: 71: Hoare triple {23724#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:20,795 INFO L273 TraceCheckUtils]: 72: Hoare triple {23724#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:20,795 INFO L273 TraceCheckUtils]: 73: Hoare triple {23725#(<= 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); {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:20,796 INFO L273 TraceCheckUtils]: 74: Hoare triple {23725#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:20,796 INFO L273 TraceCheckUtils]: 75: Hoare triple {23725#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:20,797 INFO L273 TraceCheckUtils]: 76: Hoare triple {23726#(<= 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); {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:20,797 INFO L273 TraceCheckUtils]: 77: Hoare triple {23726#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:20,798 INFO L273 TraceCheckUtils]: 78: Hoare triple {23726#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:20,798 INFO L273 TraceCheckUtils]: 79: Hoare triple {23727#(<= 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); {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:20,799 INFO L273 TraceCheckUtils]: 80: Hoare triple {23727#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:20,799 INFO L273 TraceCheckUtils]: 81: Hoare triple {23727#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:20,800 INFO L273 TraceCheckUtils]: 82: Hoare triple {23728#(<= 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); {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:20,800 INFO L273 TraceCheckUtils]: 83: Hoare triple {23728#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:20,801 INFO L273 TraceCheckUtils]: 84: Hoare triple {23728#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:20,802 INFO L273 TraceCheckUtils]: 85: Hoare triple {23729#(<= 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); {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:20,802 INFO L273 TraceCheckUtils]: 86: Hoare triple {23729#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:20,803 INFO L273 TraceCheckUtils]: 87: Hoare triple {23729#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:20,803 INFO L273 TraceCheckUtils]: 88: Hoare triple {23730#(<= 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); {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:20,804 INFO L273 TraceCheckUtils]: 89: Hoare triple {23730#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:20,804 INFO L273 TraceCheckUtils]: 90: Hoare triple {23730#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:20,805 INFO L273 TraceCheckUtils]: 91: Hoare triple {23731#(<= 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); {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:20,805 INFO L273 TraceCheckUtils]: 92: Hoare triple {23731#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:20,806 INFO L273 TraceCheckUtils]: 93: Hoare triple {23731#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:20,806 INFO L273 TraceCheckUtils]: 94: Hoare triple {23732#(<= 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); {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:20,807 INFO L273 TraceCheckUtils]: 95: Hoare triple {23732#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:20,808 INFO L273 TraceCheckUtils]: 96: Hoare triple {23732#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:20,808 INFO L273 TraceCheckUtils]: 97: Hoare triple {23733#(<= 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); {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:20,809 INFO L273 TraceCheckUtils]: 98: Hoare triple {23733#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:20,809 INFO L273 TraceCheckUtils]: 99: Hoare triple {23733#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {23734#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:20,810 INFO L273 TraceCheckUtils]: 100: Hoare triple {23734#(<= main_~k~0 31)} assume !(~k~0 < 100000); {23701#false} is VALID [2018-11-23 11:53:20,810 INFO L273 TraceCheckUtils]: 101: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 11:53:20,810 INFO L273 TraceCheckUtils]: 102: Hoare triple {23701#false} ~x~0 := 0; {23701#false} is VALID [2018-11-23 11:53:20,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {23701#false} assume !(~x~0 < ~i~0); {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L273 TraceCheckUtils]: 104: Hoare triple {23701#false} ~x~0 := 1 + ~i~0; {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L273 TraceCheckUtils]: 105: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L256 TraceCheckUtils]: 106: Hoare triple {23701#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L273 TraceCheckUtils]: 107: Hoare triple {23701#false} ~cond := #in~cond; {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L273 TraceCheckUtils]: 108: Hoare triple {23701#false} assume 0 == ~cond; {23701#false} is VALID [2018-11-23 11:53:20,811 INFO L273 TraceCheckUtils]: 109: Hoare triple {23701#false} assume !false; {23701#false} is VALID [2018-11-23 11:53:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:20,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:20,821 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-23 11:53:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:20,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:20,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:20,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:21,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {23700#true} call ULTIMATE.init(); {23700#true} is VALID [2018-11-23 11:53:21,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {23700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23700#true} is VALID [2018-11-23 11:53:21,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {23700#true} assume true; {23700#true} is VALID [2018-11-23 11:53:21,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23700#true} {23700#true} #130#return; {23700#true} is VALID [2018-11-23 11:53:21,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {23700#true} call #t~ret15 := main(); {23700#true} is VALID [2018-11-23 11:53:21,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {23700#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {23753#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:21,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {23753#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {23757#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:21,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {23757#(<= 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); {23757#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:21,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {23757#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23757#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:21,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {23757#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:21,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {23704#(<= 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); {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:21,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {23704#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {23704#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:21,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {23704#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:21,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {23705#(<= 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); {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:21,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {23705#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23705#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:21,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {23705#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:21,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {23706#(<= 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); {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:21,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {23706#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23706#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:21,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {23706#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:21,149 INFO L273 TraceCheckUtils]: 19: Hoare triple {23707#(<= 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); {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:21,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {23707#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23707#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:21,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {23707#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:21,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {23708#(<= 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); {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:21,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {23708#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23708#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:21,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {23708#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:21,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {23709#(<= 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); {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:21,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {23709#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23709#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:21,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {23709#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:21,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {23710#(<= 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); {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:21,157 INFO L273 TraceCheckUtils]: 29: Hoare triple {23710#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23710#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:21,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {23710#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:21,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {23711#(<= 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); {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:21,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {23711#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23711#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:21,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {23711#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:21,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {23712#(<= 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); {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:21,160 INFO L273 TraceCheckUtils]: 35: Hoare triple {23712#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23712#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:21,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {23712#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:21,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {23713#(<= 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); {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:21,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {23713#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23713#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:21,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {23713#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:21,163 INFO L273 TraceCheckUtils]: 40: Hoare triple {23714#(<= 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); {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:21,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {23714#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23714#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:21,164 INFO L273 TraceCheckUtils]: 42: Hoare triple {23714#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:21,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {23715#(<= 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); {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:21,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {23715#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23715#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:21,166 INFO L273 TraceCheckUtils]: 45: Hoare triple {23715#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:21,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {23716#(<= 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); {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:21,167 INFO L273 TraceCheckUtils]: 47: Hoare triple {23716#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23716#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:21,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {23716#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:21,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {23717#(<= 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); {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:21,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {23717#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23717#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:21,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {23717#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:21,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {23718#(<= 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); {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:21,170 INFO L273 TraceCheckUtils]: 53: Hoare triple {23718#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23718#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:21,171 INFO L273 TraceCheckUtils]: 54: Hoare triple {23718#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:21,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {23719#(<= 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); {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:21,172 INFO L273 TraceCheckUtils]: 56: Hoare triple {23719#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23719#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:21,172 INFO L273 TraceCheckUtils]: 57: Hoare triple {23719#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:21,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {23720#(<= 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); {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:21,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {23720#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23720#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:21,174 INFO L273 TraceCheckUtils]: 60: Hoare triple {23720#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:21,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {23721#(<= 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); {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:21,175 INFO L273 TraceCheckUtils]: 62: Hoare triple {23721#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23721#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:21,175 INFO L273 TraceCheckUtils]: 63: Hoare triple {23721#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:21,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {23722#(<= 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); {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:21,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {23722#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23722#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:21,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {23722#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:21,178 INFO L273 TraceCheckUtils]: 67: Hoare triple {23723#(<= 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); {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:21,178 INFO L273 TraceCheckUtils]: 68: Hoare triple {23723#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23723#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:21,179 INFO L273 TraceCheckUtils]: 69: Hoare triple {23723#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:21,179 INFO L273 TraceCheckUtils]: 70: Hoare triple {23724#(<= 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); {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:21,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {23724#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23724#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:21,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {23724#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:21,181 INFO L273 TraceCheckUtils]: 73: Hoare triple {23725#(<= 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); {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:21,181 INFO L273 TraceCheckUtils]: 74: Hoare triple {23725#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23725#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:21,182 INFO L273 TraceCheckUtils]: 75: Hoare triple {23725#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:21,182 INFO L273 TraceCheckUtils]: 76: Hoare triple {23726#(<= 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); {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:21,183 INFO L273 TraceCheckUtils]: 77: Hoare triple {23726#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23726#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:21,184 INFO L273 TraceCheckUtils]: 78: Hoare triple {23726#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:21,184 INFO L273 TraceCheckUtils]: 79: Hoare triple {23727#(<= 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); {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:21,185 INFO L273 TraceCheckUtils]: 80: Hoare triple {23727#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23727#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:21,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {23727#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:21,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {23728#(<= 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); {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:21,186 INFO L273 TraceCheckUtils]: 83: Hoare triple {23728#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23728#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:21,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {23728#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:21,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {23729#(<= 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); {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:21,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {23729#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23729#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:21,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {23729#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:21,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {23730#(<= 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); {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:21,189 INFO L273 TraceCheckUtils]: 89: Hoare triple {23730#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23730#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:21,190 INFO L273 TraceCheckUtils]: 90: Hoare triple {23730#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:21,191 INFO L273 TraceCheckUtils]: 91: Hoare triple {23731#(<= 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); {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:21,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {23731#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23731#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:21,192 INFO L273 TraceCheckUtils]: 93: Hoare triple {23731#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:21,192 INFO L273 TraceCheckUtils]: 94: Hoare triple {23732#(<= 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); {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:21,193 INFO L273 TraceCheckUtils]: 95: Hoare triple {23732#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23732#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:21,193 INFO L273 TraceCheckUtils]: 96: Hoare triple {23732#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:21,194 INFO L273 TraceCheckUtils]: 97: Hoare triple {23733#(<= 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); {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:21,194 INFO L273 TraceCheckUtils]: 98: Hoare triple {23733#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {23733#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:21,195 INFO L273 TraceCheckUtils]: 99: Hoare triple {23733#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {23734#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 100: Hoare triple {23734#(<= main_~k~0 31)} assume !(~k~0 < 100000); {23701#false} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 101: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 102: Hoare triple {23701#false} ~x~0 := 0; {23701#false} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 103: Hoare triple {23701#false} assume !(~x~0 < ~i~0); {23701#false} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 104: Hoare triple {23701#false} ~x~0 := 1 + ~i~0; {23701#false} is VALID [2018-11-23 11:53:21,196 INFO L273 TraceCheckUtils]: 105: Hoare triple {23701#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); {23701#false} is VALID [2018-11-23 11:53:21,197 INFO L256 TraceCheckUtils]: 106: Hoare triple {23701#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {23701#false} is VALID [2018-11-23 11:53:21,197 INFO L273 TraceCheckUtils]: 107: Hoare triple {23701#false} ~cond := #in~cond; {23701#false} is VALID [2018-11-23 11:53:21,197 INFO L273 TraceCheckUtils]: 108: Hoare triple {23701#false} assume 0 == ~cond; {23701#false} is VALID [2018-11-23 11:53:21,197 INFO L273 TraceCheckUtils]: 109: Hoare triple {23701#false} assume !false; {23701#false} is VALID [2018-11-23 11:53:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:21,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:21,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-11-23 11:53:21,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 110 [2018-11-23 11:53:21,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:21,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:53:21,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:53:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:53:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:53:21,331 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 37 states. [2018-11-23 11:53:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:23,884 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2018-11-23 11:53:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:53:23,885 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 110 [2018-11-23 11:53:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:53:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 11:53:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:53:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 235 transitions. [2018-11-23 11:53:23,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 235 transitions. [2018-11-23 11:53:24,097 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-23 11:53:24,100 INFO L225 Difference]: With dead ends: 183 [2018-11-23 11:53:24,100 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:53:24,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 11:53:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:53:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2018-11-23 11:53:24,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:24,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 141 states. [2018-11-23 11:53:24,178 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 141 states. [2018-11-23 11:53:24,179 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 141 states. [2018-11-23 11:53:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:24,182 INFO L93 Difference]: Finished difference Result 149 states and 196 transitions. [2018-11-23 11:53:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 196 transitions. [2018-11-23 11:53:24,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:24,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:24,182 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 149 states. [2018-11-23 11:53:24,182 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 149 states. [2018-11-23 11:53:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:24,185 INFO L93 Difference]: Finished difference Result 149 states and 196 transitions. [2018-11-23 11:53:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 196 transitions. [2018-11-23 11:53:24,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:24,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:24,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:24,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:53:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 185 transitions. [2018-11-23 11:53:24,188 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 185 transitions. Word has length 110 [2018-11-23 11:53:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:24,189 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 185 transitions. [2018-11-23 11:53:24,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:53:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2018-11-23 11:53:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 11:53:24,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:24,190 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:24,190 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:24,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash 895959863, now seen corresponding path program 21 times [2018-11-23 11:53:24,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:24,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:24,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:24,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:24,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:25,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {24868#true} call ULTIMATE.init(); {24868#true} is VALID [2018-11-23 11:53:25,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {24868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24868#true} is VALID [2018-11-23 11:53:25,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {24868#true} assume true; {24868#true} is VALID [2018-11-23 11:53:25,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24868#true} {24868#true} #130#return; {24868#true} is VALID [2018-11-23 11:53:25,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {24868#true} call #t~ret15 := main(); {24868#true} is VALID [2018-11-23 11:53:25,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {24868#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {24870#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:25,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {24870#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {24871#(= main_~k~0 0)} is VALID [2018-11-23 11:53:25,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {24871#(= 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); {24871#(= main_~k~0 0)} is VALID [2018-11-23 11:53:25,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {24871#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24871#(= main_~k~0 0)} is VALID [2018-11-23 11:53:25,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {24871#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:25,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {24872#(<= 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); {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:25,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {24872#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:25,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {24872#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:25,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {24873#(<= 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); {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:25,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {24873#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:25,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {24873#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:25,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {24874#(<= 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); {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:25,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {24874#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:25,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {24874#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:25,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {24875#(<= 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); {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:25,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {24875#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:25,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {24875#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:25,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {24876#(<= 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); {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:25,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {24876#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:25,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {24876#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:25,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {24877#(<= 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); {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:25,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {24877#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:25,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {24877#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:25,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {24878#(<= 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); {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:25,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {24878#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:25,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {24878#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:25,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {24879#(<= 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); {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:25,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {24879#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:25,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {24879#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:25,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {24880#(<= 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); {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:25,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {24880#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:25,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {24880#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:25,648 INFO L273 TraceCheckUtils]: 37: Hoare triple {24881#(<= 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); {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:25,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {24881#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:25,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {24881#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:25,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {24882#(<= 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); {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:25,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {24882#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:25,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {24882#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:25,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {24883#(<= 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); {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:25,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {24883#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:25,653 INFO L273 TraceCheckUtils]: 45: Hoare triple {24883#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:25,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {24884#(<= 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); {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:25,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {24884#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:25,654 INFO L273 TraceCheckUtils]: 48: Hoare triple {24884#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:25,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {24885#(<= 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); {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:25,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {24885#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:25,656 INFO L273 TraceCheckUtils]: 51: Hoare triple {24885#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:25,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {24886#(<= 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); {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:25,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {24886#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:25,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {24886#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:25,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {24887#(<= 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); {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:25,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {24887#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:25,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {24887#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:25,660 INFO L273 TraceCheckUtils]: 58: Hoare triple {24888#(<= 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); {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:25,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {24888#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:25,661 INFO L273 TraceCheckUtils]: 60: Hoare triple {24888#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:25,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {24889#(<= 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); {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:25,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {24889#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:25,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {24889#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:25,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {24890#(<= 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); {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:25,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {24890#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:25,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {24890#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:25,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {24891#(<= 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); {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:25,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {24891#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:25,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {24891#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:25,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {24892#(<= 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); {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:25,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {24892#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:25,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {24892#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:25,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {24893#(<= 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); {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:25,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {24893#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:25,669 INFO L273 TraceCheckUtils]: 75: Hoare triple {24893#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:25,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {24894#(<= 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); {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:25,670 INFO L273 TraceCheckUtils]: 77: Hoare triple {24894#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:25,670 INFO L273 TraceCheckUtils]: 78: Hoare triple {24894#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:25,671 INFO L273 TraceCheckUtils]: 79: Hoare triple {24895#(<= 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); {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:25,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {24895#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:25,672 INFO L273 TraceCheckUtils]: 81: Hoare triple {24895#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:25,673 INFO L273 TraceCheckUtils]: 82: Hoare triple {24896#(<= 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); {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:25,673 INFO L273 TraceCheckUtils]: 83: Hoare triple {24896#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:25,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {24896#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:25,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {24897#(<= 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); {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:25,675 INFO L273 TraceCheckUtils]: 86: Hoare triple {24897#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:25,675 INFO L273 TraceCheckUtils]: 87: Hoare triple {24897#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:25,676 INFO L273 TraceCheckUtils]: 88: Hoare triple {24898#(<= 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); {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:25,676 INFO L273 TraceCheckUtils]: 89: Hoare triple {24898#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:25,677 INFO L273 TraceCheckUtils]: 90: Hoare triple {24898#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:25,677 INFO L273 TraceCheckUtils]: 91: Hoare triple {24899#(<= 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); {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:25,678 INFO L273 TraceCheckUtils]: 92: Hoare triple {24899#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:25,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {24899#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:25,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {24900#(<= 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); {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:25,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {24900#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:25,680 INFO L273 TraceCheckUtils]: 96: Hoare triple {24900#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:25,681 INFO L273 TraceCheckUtils]: 97: Hoare triple {24901#(<= 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); {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:25,681 INFO L273 TraceCheckUtils]: 98: Hoare triple {24901#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:25,682 INFO L273 TraceCheckUtils]: 99: Hoare triple {24901#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:25,682 INFO L273 TraceCheckUtils]: 100: Hoare triple {24902#(<= 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); {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:25,683 INFO L273 TraceCheckUtils]: 101: Hoare triple {24902#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:25,683 INFO L273 TraceCheckUtils]: 102: Hoare triple {24902#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {24903#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:25,684 INFO L273 TraceCheckUtils]: 103: Hoare triple {24903#(<= main_~k~0 32)} assume !(~k~0 < 100000); {24869#false} is VALID [2018-11-23 11:53:25,684 INFO L273 TraceCheckUtils]: 104: Hoare triple {24869#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); {24869#false} is VALID [2018-11-23 11:53:25,684 INFO L273 TraceCheckUtils]: 105: Hoare triple {24869#false} ~x~0 := 0; {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L273 TraceCheckUtils]: 106: Hoare triple {24869#false} assume !(~x~0 < ~i~0); {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L273 TraceCheckUtils]: 107: Hoare triple {24869#false} ~x~0 := 1 + ~i~0; {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L273 TraceCheckUtils]: 108: Hoare triple {24869#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); {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L256 TraceCheckUtils]: 109: Hoare triple {24869#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L273 TraceCheckUtils]: 110: Hoare triple {24869#false} ~cond := #in~cond; {24869#false} is VALID [2018-11-23 11:53:25,685 INFO L273 TraceCheckUtils]: 111: Hoare triple {24869#false} assume 0 == ~cond; {24869#false} is VALID [2018-11-23 11:53:25,686 INFO L273 TraceCheckUtils]: 112: Hoare triple {24869#false} assume !false; {24869#false} is VALID [2018-11-23 11:53:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:25,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:25,695 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-23 11:53:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:25,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-23 11:53:25,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:25,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:26,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {24868#true} call ULTIMATE.init(); {24868#true} is VALID [2018-11-23 11:53:26,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {24868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24868#true} is VALID [2018-11-23 11:53:26,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {24868#true} assume true; {24868#true} is VALID [2018-11-23 11:53:26,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24868#true} {24868#true} #130#return; {24868#true} is VALID [2018-11-23 11:53:26,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {24868#true} call #t~ret15 := main(); {24868#true} is VALID [2018-11-23 11:53:26,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {24868#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {24922#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:26,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {24922#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {24926#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:26,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {24926#(<= 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); {24926#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:26,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {24926#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24926#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:26,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {24926#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:26,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {24872#(<= 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); {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:26,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {24872#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {24872#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:26,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {24872#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:26,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {24873#(<= 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); {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:26,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {24873#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24873#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:26,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {24873#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:26,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {24874#(<= 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); {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:26,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {24874#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24874#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:26,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {24874#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:26,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {24875#(<= 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); {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:26,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {24875#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24875#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:26,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {24875#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:26,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {24876#(<= 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); {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:26,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {24876#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24876#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:26,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {24876#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:26,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {24877#(<= 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); {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:26,164 INFO L273 TraceCheckUtils]: 26: Hoare triple {24877#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24877#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:26,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {24877#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:26,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {24878#(<= 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); {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:26,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {24878#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24878#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:26,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {24878#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:26,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {24879#(<= 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); {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:26,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {24879#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24879#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:26,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {24879#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:26,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {24880#(<= 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); {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:26,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {24880#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24880#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:26,170 INFO L273 TraceCheckUtils]: 36: Hoare triple {24880#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:26,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {24881#(<= 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); {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:26,171 INFO L273 TraceCheckUtils]: 38: Hoare triple {24881#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24881#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:26,172 INFO L273 TraceCheckUtils]: 39: Hoare triple {24881#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:26,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {24882#(<= 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); {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:26,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {24882#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24882#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:26,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {24882#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:26,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {24883#(<= 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); {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:26,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {24883#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24883#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:26,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {24883#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:26,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {24884#(<= 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); {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:26,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {24884#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24884#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:26,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {24884#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:26,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {24885#(<= 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); {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:26,178 INFO L273 TraceCheckUtils]: 50: Hoare triple {24885#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24885#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:26,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {24885#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:26,179 INFO L273 TraceCheckUtils]: 52: Hoare triple {24886#(<= 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); {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:26,180 INFO L273 TraceCheckUtils]: 53: Hoare triple {24886#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24886#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:26,180 INFO L273 TraceCheckUtils]: 54: Hoare triple {24886#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:26,181 INFO L273 TraceCheckUtils]: 55: Hoare triple {24887#(<= 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); {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:26,181 INFO L273 TraceCheckUtils]: 56: Hoare triple {24887#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24887#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:26,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {24887#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:26,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {24888#(<= 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); {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:26,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {24888#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24888#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:26,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {24888#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:26,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {24889#(<= 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); {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:26,185 INFO L273 TraceCheckUtils]: 62: Hoare triple {24889#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24889#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:26,185 INFO L273 TraceCheckUtils]: 63: Hoare triple {24889#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:26,186 INFO L273 TraceCheckUtils]: 64: Hoare triple {24890#(<= 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); {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:26,186 INFO L273 TraceCheckUtils]: 65: Hoare triple {24890#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24890#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:26,187 INFO L273 TraceCheckUtils]: 66: Hoare triple {24890#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:26,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {24891#(<= 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); {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:26,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {24891#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24891#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:26,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {24891#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:26,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {24892#(<= 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); {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:26,190 INFO L273 TraceCheckUtils]: 71: Hoare triple {24892#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24892#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:26,190 INFO L273 TraceCheckUtils]: 72: Hoare triple {24892#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:26,191 INFO L273 TraceCheckUtils]: 73: Hoare triple {24893#(<= 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); {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:26,191 INFO L273 TraceCheckUtils]: 74: Hoare triple {24893#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24893#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:26,192 INFO L273 TraceCheckUtils]: 75: Hoare triple {24893#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:26,192 INFO L273 TraceCheckUtils]: 76: Hoare triple {24894#(<= 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); {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:26,193 INFO L273 TraceCheckUtils]: 77: Hoare triple {24894#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24894#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:26,194 INFO L273 TraceCheckUtils]: 78: Hoare triple {24894#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:26,194 INFO L273 TraceCheckUtils]: 79: Hoare triple {24895#(<= 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); {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:26,194 INFO L273 TraceCheckUtils]: 80: Hoare triple {24895#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24895#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:26,195 INFO L273 TraceCheckUtils]: 81: Hoare triple {24895#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:26,196 INFO L273 TraceCheckUtils]: 82: Hoare triple {24896#(<= 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); {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:26,196 INFO L273 TraceCheckUtils]: 83: Hoare triple {24896#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24896#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:26,197 INFO L273 TraceCheckUtils]: 84: Hoare triple {24896#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:26,197 INFO L273 TraceCheckUtils]: 85: Hoare triple {24897#(<= 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); {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:26,198 INFO L273 TraceCheckUtils]: 86: Hoare triple {24897#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24897#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:26,198 INFO L273 TraceCheckUtils]: 87: Hoare triple {24897#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:26,199 INFO L273 TraceCheckUtils]: 88: Hoare triple {24898#(<= 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); {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:26,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {24898#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24898#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:26,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {24898#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:26,201 INFO L273 TraceCheckUtils]: 91: Hoare triple {24899#(<= 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); {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:26,201 INFO L273 TraceCheckUtils]: 92: Hoare triple {24899#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24899#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:26,202 INFO L273 TraceCheckUtils]: 93: Hoare triple {24899#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:26,202 INFO L273 TraceCheckUtils]: 94: Hoare triple {24900#(<= 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); {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:26,203 INFO L273 TraceCheckUtils]: 95: Hoare triple {24900#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24900#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:26,203 INFO L273 TraceCheckUtils]: 96: Hoare triple {24900#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:26,204 INFO L273 TraceCheckUtils]: 97: Hoare triple {24901#(<= 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); {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:26,204 INFO L273 TraceCheckUtils]: 98: Hoare triple {24901#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24901#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:26,205 INFO L273 TraceCheckUtils]: 99: Hoare triple {24901#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:26,205 INFO L273 TraceCheckUtils]: 100: Hoare triple {24902#(<= 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); {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:26,206 INFO L273 TraceCheckUtils]: 101: Hoare triple {24902#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {24902#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:26,207 INFO L273 TraceCheckUtils]: 102: Hoare triple {24902#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {24903#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:26,207 INFO L273 TraceCheckUtils]: 103: Hoare triple {24903#(<= main_~k~0 32)} assume !(~k~0 < 100000); {24869#false} is VALID [2018-11-23 11:53:26,207 INFO L273 TraceCheckUtils]: 104: Hoare triple {24869#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); {24869#false} is VALID [2018-11-23 11:53:26,208 INFO L273 TraceCheckUtils]: 105: Hoare triple {24869#false} ~x~0 := 0; {24869#false} is VALID [2018-11-23 11:53:26,208 INFO L273 TraceCheckUtils]: 106: Hoare triple {24869#false} assume !(~x~0 < ~i~0); {24869#false} is VALID [2018-11-23 11:53:26,208 INFO L273 TraceCheckUtils]: 107: Hoare triple {24869#false} ~x~0 := 1 + ~i~0; {24869#false} is VALID [2018-11-23 11:53:26,208 INFO L273 TraceCheckUtils]: 108: Hoare triple {24869#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); {24869#false} is VALID [2018-11-23 11:53:26,208 INFO L256 TraceCheckUtils]: 109: Hoare triple {24869#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {24869#false} is VALID [2018-11-23 11:53:26,209 INFO L273 TraceCheckUtils]: 110: Hoare triple {24869#false} ~cond := #in~cond; {24869#false} is VALID [2018-11-23 11:53:26,209 INFO L273 TraceCheckUtils]: 111: Hoare triple {24869#false} assume 0 == ~cond; {24869#false} is VALID [2018-11-23 11:53:26,209 INFO L273 TraceCheckUtils]: 112: Hoare triple {24869#false} assume !false; {24869#false} is VALID [2018-11-23 11:53:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:26,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:26,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2018-11-23 11:53:26,240 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 113 [2018-11-23 11:53:26,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:26,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:53:26,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:26,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:53:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:53:26,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:53:26,352 INFO L87 Difference]: Start difference. First operand 141 states and 185 transitions. Second operand 38 states. [2018-11-23 11:53:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:28,008 INFO L93 Difference]: Finished difference Result 186 states and 246 transitions. [2018-11-23 11:53:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:53:28,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 113 [2018-11-23 11:53:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 11:53:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 239 transitions. [2018-11-23 11:53:28,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 239 transitions. [2018-11-23 11:53:28,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:28,228 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:53:28,228 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:53:28,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-11-23 11:53:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:53:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2018-11-23 11:53:28,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:28,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 144 states. [2018-11-23 11:53:28,317 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 144 states. [2018-11-23 11:53:28,317 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 144 states. [2018-11-23 11:53:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:28,320 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2018-11-23 11:53:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2018-11-23 11:53:28,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:28,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:28,320 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 152 states. [2018-11-23 11:53:28,320 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 152 states. [2018-11-23 11:53:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:28,323 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2018-11-23 11:53:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2018-11-23 11:53:28,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:28,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:28,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:28,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 11:53:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2018-11-23 11:53:28,326 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 113 [2018-11-23 11:53:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:28,327 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2018-11-23 11:53:28,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:53:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2018-11-23 11:53:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 11:53:28,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:28,328 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:28,328 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:28,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1615236640, now seen corresponding path program 22 times [2018-11-23 11:53:28,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:29,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {26062#true} call ULTIMATE.init(); {26062#true} is VALID [2018-11-23 11:53:29,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {26062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26062#true} is VALID [2018-11-23 11:53:29,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {26062#true} assume true; {26062#true} is VALID [2018-11-23 11:53:29,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26062#true} {26062#true} #130#return; {26062#true} is VALID [2018-11-23 11:53:29,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {26062#true} call #t~ret15 := main(); {26062#true} is VALID [2018-11-23 11:53:29,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {26062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26064#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:29,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {26064#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {26065#(= main_~k~0 0)} is VALID [2018-11-23 11:53:29,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {26065#(= 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); {26065#(= main_~k~0 0)} is VALID [2018-11-23 11:53:29,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {26065#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26065#(= main_~k~0 0)} is VALID [2018-11-23 11:53:29,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {26065#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {26066#(<= 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); {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {26066#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {26066#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {26067#(<= 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); {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {26067#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {26067#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {26068#(<= 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); {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {26068#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {26068#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {26069#(<= 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); {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {26069#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {26069#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {26070#(<= 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); {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {26070#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {26070#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {26071#(<= 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); {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {26071#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {26071#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {26072#(<= 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); {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {26072#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {26072#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {26073#(<= 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); {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {26073#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {26073#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {26074#(<= 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); {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {26074#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {26074#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {26075#(<= 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); {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {26075#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {26075#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {26076#(<= 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); {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {26076#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {26076#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,202 INFO L273 TraceCheckUtils]: 43: Hoare triple {26077#(<= 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); {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {26077#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {26077#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,204 INFO L273 TraceCheckUtils]: 46: Hoare triple {26078#(<= 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); {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,204 INFO L273 TraceCheckUtils]: 47: Hoare triple {26078#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {26078#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {26079#(<= 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); {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {26079#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {26079#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {26080#(<= 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); {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {26080#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {26080#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,209 INFO L273 TraceCheckUtils]: 55: Hoare triple {26081#(<= 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); {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {26081#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {26081#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,210 INFO L273 TraceCheckUtils]: 58: Hoare triple {26082#(<= 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); {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {26082#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {26082#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {26083#(<= 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); {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {26083#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {26083#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,214 INFO L273 TraceCheckUtils]: 64: Hoare triple {26084#(<= 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); {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,214 INFO L273 TraceCheckUtils]: 65: Hoare triple {26084#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {26084#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {26085#(<= 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); {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {26085#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {26085#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {26086#(<= 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); {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {26086#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,218 INFO L273 TraceCheckUtils]: 72: Hoare triple {26086#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,218 INFO L273 TraceCheckUtils]: 73: Hoare triple {26087#(<= 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); {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {26087#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,220 INFO L273 TraceCheckUtils]: 75: Hoare triple {26087#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,220 INFO L273 TraceCheckUtils]: 76: Hoare triple {26088#(<= 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); {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,221 INFO L273 TraceCheckUtils]: 77: Hoare triple {26088#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,221 INFO L273 TraceCheckUtils]: 78: Hoare triple {26088#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,222 INFO L273 TraceCheckUtils]: 79: Hoare triple {26089#(<= 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); {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,222 INFO L273 TraceCheckUtils]: 80: Hoare triple {26089#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,223 INFO L273 TraceCheckUtils]: 81: Hoare triple {26089#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,223 INFO L273 TraceCheckUtils]: 82: Hoare triple {26090#(<= 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); {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,224 INFO L273 TraceCheckUtils]: 83: Hoare triple {26090#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,224 INFO L273 TraceCheckUtils]: 84: Hoare triple {26090#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,225 INFO L273 TraceCheckUtils]: 85: Hoare triple {26091#(<= 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); {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {26091#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,226 INFO L273 TraceCheckUtils]: 87: Hoare triple {26091#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,227 INFO L273 TraceCheckUtils]: 88: Hoare triple {26092#(<= 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); {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {26092#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,228 INFO L273 TraceCheckUtils]: 90: Hoare triple {26092#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,228 INFO L273 TraceCheckUtils]: 91: Hoare triple {26093#(<= 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); {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,229 INFO L273 TraceCheckUtils]: 92: Hoare triple {26093#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,229 INFO L273 TraceCheckUtils]: 93: Hoare triple {26093#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,230 INFO L273 TraceCheckUtils]: 94: Hoare triple {26094#(<= 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); {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,230 INFO L273 TraceCheckUtils]: 95: Hoare triple {26094#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,231 INFO L273 TraceCheckUtils]: 96: Hoare triple {26094#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,231 INFO L273 TraceCheckUtils]: 97: Hoare triple {26095#(<= 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); {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,232 INFO L273 TraceCheckUtils]: 98: Hoare triple {26095#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,233 INFO L273 TraceCheckUtils]: 99: Hoare triple {26095#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,233 INFO L273 TraceCheckUtils]: 100: Hoare triple {26096#(<= 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); {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {26096#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,234 INFO L273 TraceCheckUtils]: 102: Hoare triple {26096#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,235 INFO L273 TraceCheckUtils]: 103: Hoare triple {26097#(<= 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); {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,235 INFO L273 TraceCheckUtils]: 104: Hoare triple {26097#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,236 INFO L273 TraceCheckUtils]: 105: Hoare triple {26097#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {26098#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:29,236 INFO L273 TraceCheckUtils]: 106: Hoare triple {26098#(<= main_~k~0 33)} assume !(~k~0 < 100000); {26063#false} is VALID [2018-11-23 11:53:29,237 INFO L273 TraceCheckUtils]: 107: Hoare triple {26063#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); {26063#false} is VALID [2018-11-23 11:53:29,237 INFO L273 TraceCheckUtils]: 108: Hoare triple {26063#false} ~x~0 := 0; {26063#false} is VALID [2018-11-23 11:53:29,237 INFO L273 TraceCheckUtils]: 109: Hoare triple {26063#false} assume !(~x~0 < ~i~0); {26063#false} is VALID [2018-11-23 11:53:29,237 INFO L273 TraceCheckUtils]: 110: Hoare triple {26063#false} ~x~0 := 1 + ~i~0; {26063#false} is VALID [2018-11-23 11:53:29,237 INFO L273 TraceCheckUtils]: 111: Hoare triple {26063#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); {26063#false} is VALID [2018-11-23 11:53:29,238 INFO L256 TraceCheckUtils]: 112: Hoare triple {26063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26063#false} is VALID [2018-11-23 11:53:29,238 INFO L273 TraceCheckUtils]: 113: Hoare triple {26063#false} ~cond := #in~cond; {26063#false} is VALID [2018-11-23 11:53:29,238 INFO L273 TraceCheckUtils]: 114: Hoare triple {26063#false} assume 0 == ~cond; {26063#false} is VALID [2018-11-23 11:53:29,238 INFO L273 TraceCheckUtils]: 115: Hoare triple {26063#false} assume !false; {26063#false} is VALID [2018-11-23 11:53:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:29,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:29,248 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-23 11:53:29,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:29,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:29,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:29,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:29,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {26062#true} call ULTIMATE.init(); {26062#true} is VALID [2018-11-23 11:53:29,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {26062#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26062#true} is VALID [2018-11-23 11:53:29,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {26062#true} assume true; {26062#true} is VALID [2018-11-23 11:53:29,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26062#true} {26062#true} #130#return; {26062#true} is VALID [2018-11-23 11:53:29,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {26062#true} call #t~ret15 := main(); {26062#true} is VALID [2018-11-23 11:53:29,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {26062#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {26117#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:29,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {26117#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {26121#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:29,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {26121#(<= 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); {26121#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:29,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {26121#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26121#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:29,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {26121#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {26066#(<= 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); {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {26066#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {26066#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:29,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {26066#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {26067#(<= 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); {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {26067#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26067#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:29,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {26067#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {26068#(<= 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); {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {26068#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26068#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:29,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {26068#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {26069#(<= 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); {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {26069#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26069#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:29,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {26069#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {26070#(<= 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); {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {26070#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26070#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:29,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {26070#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {26071#(<= 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); {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {26071#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26071#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:29,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {26071#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {26072#(<= 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); {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {26072#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26072#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:29,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {26072#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {26073#(<= 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); {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {26073#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26073#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:29,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {26073#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {26074#(<= 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); {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {26074#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26074#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:29,625 INFO L273 TraceCheckUtils]: 36: Hoare triple {26074#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {26075#(<= 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); {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {26075#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26075#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:29,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {26075#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {26076#(<= 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); {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {26076#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26076#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:29,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {26076#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {26077#(<= 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); {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {26077#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26077#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:29,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {26077#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,630 INFO L273 TraceCheckUtils]: 46: Hoare triple {26078#(<= 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); {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,631 INFO L273 TraceCheckUtils]: 47: Hoare triple {26078#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26078#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:29,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {26078#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,632 INFO L273 TraceCheckUtils]: 49: Hoare triple {26079#(<= 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); {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,633 INFO L273 TraceCheckUtils]: 50: Hoare triple {26079#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26079#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:29,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {26079#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {26080#(<= 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); {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {26080#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26080#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:29,635 INFO L273 TraceCheckUtils]: 54: Hoare triple {26080#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {26081#(<= 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); {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {26081#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26081#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:29,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {26081#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {26082#(<= 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); {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {26082#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26082#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:29,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {26082#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {26083#(<= 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); {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {26083#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26083#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:29,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {26083#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,641 INFO L273 TraceCheckUtils]: 64: Hoare triple {26084#(<= 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); {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {26084#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26084#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:29,642 INFO L273 TraceCheckUtils]: 66: Hoare triple {26084#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,643 INFO L273 TraceCheckUtils]: 67: Hoare triple {26085#(<= 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); {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,643 INFO L273 TraceCheckUtils]: 68: Hoare triple {26085#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26085#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:29,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {26085#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {26086#(<= 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); {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,645 INFO L273 TraceCheckUtils]: 71: Hoare triple {26086#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26086#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:29,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {26086#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,646 INFO L273 TraceCheckUtils]: 73: Hoare triple {26087#(<= 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); {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {26087#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26087#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:29,648 INFO L273 TraceCheckUtils]: 75: Hoare triple {26087#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,648 INFO L273 TraceCheckUtils]: 76: Hoare triple {26088#(<= 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); {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {26088#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26088#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:29,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {26088#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,650 INFO L273 TraceCheckUtils]: 79: Hoare triple {26089#(<= 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); {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {26089#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26089#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:29,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {26089#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,652 INFO L273 TraceCheckUtils]: 82: Hoare triple {26090#(<= 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); {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,652 INFO L273 TraceCheckUtils]: 83: Hoare triple {26090#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26090#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:29,653 INFO L273 TraceCheckUtils]: 84: Hoare triple {26090#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,653 INFO L273 TraceCheckUtils]: 85: Hoare triple {26091#(<= 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); {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,654 INFO L273 TraceCheckUtils]: 86: Hoare triple {26091#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26091#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:29,655 INFO L273 TraceCheckUtils]: 87: Hoare triple {26091#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,655 INFO L273 TraceCheckUtils]: 88: Hoare triple {26092#(<= 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); {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,656 INFO L273 TraceCheckUtils]: 89: Hoare triple {26092#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26092#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:29,656 INFO L273 TraceCheckUtils]: 90: Hoare triple {26092#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {26093#(<= 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); {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {26093#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26093#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:29,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {26093#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,659 INFO L273 TraceCheckUtils]: 94: Hoare triple {26094#(<= 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); {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,659 INFO L273 TraceCheckUtils]: 95: Hoare triple {26094#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26094#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:29,660 INFO L273 TraceCheckUtils]: 96: Hoare triple {26094#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,660 INFO L273 TraceCheckUtils]: 97: Hoare triple {26095#(<= 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); {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,661 INFO L273 TraceCheckUtils]: 98: Hoare triple {26095#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26095#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:29,662 INFO L273 TraceCheckUtils]: 99: Hoare triple {26095#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,662 INFO L273 TraceCheckUtils]: 100: Hoare triple {26096#(<= 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); {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,663 INFO L273 TraceCheckUtils]: 101: Hoare triple {26096#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26096#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:29,663 INFO L273 TraceCheckUtils]: 102: Hoare triple {26096#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,664 INFO L273 TraceCheckUtils]: 103: Hoare triple {26097#(<= 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); {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,664 INFO L273 TraceCheckUtils]: 104: Hoare triple {26097#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {26097#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:29,665 INFO L273 TraceCheckUtils]: 105: Hoare triple {26097#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {26098#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:29,666 INFO L273 TraceCheckUtils]: 106: Hoare triple {26098#(<= main_~k~0 33)} assume !(~k~0 < 100000); {26063#false} is VALID [2018-11-23 11:53:29,666 INFO L273 TraceCheckUtils]: 107: Hoare triple {26063#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); {26063#false} is VALID [2018-11-23 11:53:29,666 INFO L273 TraceCheckUtils]: 108: Hoare triple {26063#false} ~x~0 := 0; {26063#false} is VALID [2018-11-23 11:53:29,666 INFO L273 TraceCheckUtils]: 109: Hoare triple {26063#false} assume !(~x~0 < ~i~0); {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L273 TraceCheckUtils]: 110: Hoare triple {26063#false} ~x~0 := 1 + ~i~0; {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L273 TraceCheckUtils]: 111: Hoare triple {26063#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); {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L256 TraceCheckUtils]: 112: Hoare triple {26063#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L273 TraceCheckUtils]: 113: Hoare triple {26063#false} ~cond := #in~cond; {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L273 TraceCheckUtils]: 114: Hoare triple {26063#false} assume 0 == ~cond; {26063#false} is VALID [2018-11-23 11:53:29,667 INFO L273 TraceCheckUtils]: 115: Hoare triple {26063#false} assume !false; {26063#false} is VALID [2018-11-23 11:53:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:29,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-11-23 11:53:29,697 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 116 [2018-11-23 11:53:29,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:29,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:53:29,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:29,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:53:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:53:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:53:29,840 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand 39 states. [2018-11-23 11:53:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:32,636 INFO L93 Difference]: Finished difference Result 189 states and 250 transitions. [2018-11-23 11:53:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:53:32,636 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 116 [2018-11-23 11:53:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 11:53:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 243 transitions. [2018-11-23 11:53:32,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 243 transitions. [2018-11-23 11:53:32,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:32,872 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:53:32,872 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 11:53:32,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-11-23 11:53:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 11:53:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-11-23 11:53:33,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:33,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 147 states. [2018-11-23 11:53:33,045 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 147 states. [2018-11-23 11:53:33,045 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 147 states. [2018-11-23 11:53:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,048 INFO L93 Difference]: Finished difference Result 155 states and 204 transitions. [2018-11-23 11:53:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2018-11-23 11:53:33,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,048 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 155 states. [2018-11-23 11:53:33,049 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 155 states. [2018-11-23 11:53:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,051 INFO L93 Difference]: Finished difference Result 155 states and 204 transitions. [2018-11-23 11:53:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 204 transitions. [2018-11-23 11:53:33,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:33,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 11:53:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2018-11-23 11:53:33,054 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 116 [2018-11-23 11:53:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:33,054 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2018-11-23 11:53:33,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:53:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2018-11-23 11:53:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:53:33,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:33,055 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:33,055 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:33,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1365071511, now seen corresponding path program 23 times [2018-11-23 11:53:33,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:33,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:33,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {27282#true} call ULTIMATE.init(); {27282#true} is VALID [2018-11-23 11:53:33,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {27282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27282#true} is VALID [2018-11-23 11:53:33,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {27282#true} assume true; {27282#true} is VALID [2018-11-23 11:53:33,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27282#true} {27282#true} #130#return; {27282#true} is VALID [2018-11-23 11:53:33,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {27282#true} call #t~ret15 := main(); {27282#true} is VALID [2018-11-23 11:53:33,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {27282#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27284#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:33,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {27284#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {27285#(= main_~k~0 0)} is VALID [2018-11-23 11:53:33,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {27285#(= 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); {27285#(= main_~k~0 0)} is VALID [2018-11-23 11:53:33,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {27285#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27285#(= main_~k~0 0)} is VALID [2018-11-23 11:53:33,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {27285#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:33,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {27286#(<= 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); {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:33,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {27286#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:33,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {27286#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:33,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {27287#(<= 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); {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:33,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {27287#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:33,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {27287#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:33,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {27288#(<= 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); {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:33,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {27288#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:33,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {27288#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:33,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {27289#(<= 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); {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:33,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {27289#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:33,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {27289#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:33,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {27290#(<= 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); {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:33,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {27290#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:33,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {27290#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:33,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {27291#(<= 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); {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:33,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {27291#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:33,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {27291#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:33,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {27292#(<= 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); {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:33,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {27292#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:33,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {27292#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:33,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {27293#(<= 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); {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:33,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {27293#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:33,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {27293#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:33,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {27294#(<= 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); {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:33,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {27294#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:33,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {27294#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:33,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {27295#(<= 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); {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:33,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {27295#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:33,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {27295#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:33,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {27296#(<= 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); {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:33,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {27296#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:33,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {27296#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:33,879 INFO L273 TraceCheckUtils]: 43: Hoare triple {27297#(<= 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); {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:33,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {27297#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:33,880 INFO L273 TraceCheckUtils]: 45: Hoare triple {27297#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:33,880 INFO L273 TraceCheckUtils]: 46: Hoare triple {27298#(<= 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); {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:33,881 INFO L273 TraceCheckUtils]: 47: Hoare triple {27298#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:33,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {27298#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:33,882 INFO L273 TraceCheckUtils]: 49: Hoare triple {27299#(<= 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); {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:33,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {27299#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:33,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {27299#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:33,884 INFO L273 TraceCheckUtils]: 52: Hoare triple {27300#(<= 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); {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:33,884 INFO L273 TraceCheckUtils]: 53: Hoare triple {27300#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:33,885 INFO L273 TraceCheckUtils]: 54: Hoare triple {27300#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:33,885 INFO L273 TraceCheckUtils]: 55: Hoare triple {27301#(<= 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); {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:33,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {27301#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:33,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {27301#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:33,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {27302#(<= 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); {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:33,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {27302#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:33,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {27302#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:33,889 INFO L273 TraceCheckUtils]: 61: Hoare triple {27303#(<= 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); {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:33,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {27303#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:33,890 INFO L273 TraceCheckUtils]: 63: Hoare triple {27303#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:33,891 INFO L273 TraceCheckUtils]: 64: Hoare triple {27304#(<= 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); {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:33,891 INFO L273 TraceCheckUtils]: 65: Hoare triple {27304#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:33,892 INFO L273 TraceCheckUtils]: 66: Hoare triple {27304#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:33,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {27305#(<= 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); {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:33,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {27305#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:33,894 INFO L273 TraceCheckUtils]: 69: Hoare triple {27305#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:33,894 INFO L273 TraceCheckUtils]: 70: Hoare triple {27306#(<= 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); {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:33,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {27306#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:33,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {27306#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:33,896 INFO L273 TraceCheckUtils]: 73: Hoare triple {27307#(<= 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); {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:33,896 INFO L273 TraceCheckUtils]: 74: Hoare triple {27307#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:33,897 INFO L273 TraceCheckUtils]: 75: Hoare triple {27307#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:33,897 INFO L273 TraceCheckUtils]: 76: Hoare triple {27308#(<= 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); {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:33,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {27308#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:33,899 INFO L273 TraceCheckUtils]: 78: Hoare triple {27308#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:33,899 INFO L273 TraceCheckUtils]: 79: Hoare triple {27309#(<= 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); {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:33,900 INFO L273 TraceCheckUtils]: 80: Hoare triple {27309#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:33,900 INFO L273 TraceCheckUtils]: 81: Hoare triple {27309#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:33,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {27310#(<= 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); {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:33,901 INFO L273 TraceCheckUtils]: 83: Hoare triple {27310#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:33,902 INFO L273 TraceCheckUtils]: 84: Hoare triple {27310#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:33,903 INFO L273 TraceCheckUtils]: 85: Hoare triple {27311#(<= 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); {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:33,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {27311#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:33,904 INFO L273 TraceCheckUtils]: 87: Hoare triple {27311#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:33,904 INFO L273 TraceCheckUtils]: 88: Hoare triple {27312#(<= 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); {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:33,905 INFO L273 TraceCheckUtils]: 89: Hoare triple {27312#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:33,906 INFO L273 TraceCheckUtils]: 90: Hoare triple {27312#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:33,906 INFO L273 TraceCheckUtils]: 91: Hoare triple {27313#(<= 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); {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:33,907 INFO L273 TraceCheckUtils]: 92: Hoare triple {27313#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:33,907 INFO L273 TraceCheckUtils]: 93: Hoare triple {27313#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:33,908 INFO L273 TraceCheckUtils]: 94: Hoare triple {27314#(<= 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); {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:33,908 INFO L273 TraceCheckUtils]: 95: Hoare triple {27314#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:33,909 INFO L273 TraceCheckUtils]: 96: Hoare triple {27314#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:33,910 INFO L273 TraceCheckUtils]: 97: Hoare triple {27315#(<= 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); {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:33,910 INFO L273 TraceCheckUtils]: 98: Hoare triple {27315#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:33,911 INFO L273 TraceCheckUtils]: 99: Hoare triple {27315#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:33,911 INFO L273 TraceCheckUtils]: 100: Hoare triple {27316#(<= 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); {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:33,912 INFO L273 TraceCheckUtils]: 101: Hoare triple {27316#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:33,912 INFO L273 TraceCheckUtils]: 102: Hoare triple {27316#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:33,913 INFO L273 TraceCheckUtils]: 103: Hoare triple {27317#(<= 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); {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:33,913 INFO L273 TraceCheckUtils]: 104: Hoare triple {27317#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:33,914 INFO L273 TraceCheckUtils]: 105: Hoare triple {27317#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:33,915 INFO L273 TraceCheckUtils]: 106: Hoare triple {27318#(<= 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); {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:33,915 INFO L273 TraceCheckUtils]: 107: Hoare triple {27318#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:33,916 INFO L273 TraceCheckUtils]: 108: Hoare triple {27318#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {27319#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:33,916 INFO L273 TraceCheckUtils]: 109: Hoare triple {27319#(<= main_~k~0 34)} assume !(~k~0 < 100000); {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L273 TraceCheckUtils]: 110: Hoare triple {27283#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); {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L273 TraceCheckUtils]: 111: Hoare triple {27283#false} ~x~0 := 0; {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L273 TraceCheckUtils]: 112: Hoare triple {27283#false} assume !(~x~0 < ~i~0); {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {27283#false} ~x~0 := 1 + ~i~0; {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {27283#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); {27283#false} is VALID [2018-11-23 11:53:33,917 INFO L256 TraceCheckUtils]: 115: Hoare triple {27283#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27283#false} is VALID [2018-11-23 11:53:33,918 INFO L273 TraceCheckUtils]: 116: Hoare triple {27283#false} ~cond := #in~cond; {27283#false} is VALID [2018-11-23 11:53:33,918 INFO L273 TraceCheckUtils]: 117: Hoare triple {27283#false} assume 0 == ~cond; {27283#false} is VALID [2018-11-23 11:53:33,918 INFO L273 TraceCheckUtils]: 118: Hoare triple {27283#false} assume !false; {27283#false} is VALID [2018-11-23 11:53:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:33,928 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-23 11:53:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:34,054 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 11:53:34,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:34,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:34,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {27282#true} call ULTIMATE.init(); {27282#true} is VALID [2018-11-23 11:53:34,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {27282#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27282#true} is VALID [2018-11-23 11:53:34,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {27282#true} assume true; {27282#true} is VALID [2018-11-23 11:53:34,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27282#true} {27282#true} #130#return; {27282#true} is VALID [2018-11-23 11:53:34,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {27282#true} call #t~ret15 := main(); {27282#true} is VALID [2018-11-23 11:53:34,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {27282#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {27338#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:34,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {27338#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {27342#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:34,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {27342#(<= 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); {27342#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:34,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {27342#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27342#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:34,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {27342#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:34,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {27286#(<= 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); {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:34,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {27286#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {27286#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:34,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {27286#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:34,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {27287#(<= 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); {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:34,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {27287#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27287#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:34,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {27287#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:34,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {27288#(<= 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); {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:34,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {27288#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27288#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:34,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {27288#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:34,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {27289#(<= 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); {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:34,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {27289#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27289#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:34,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {27289#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:34,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {27290#(<= 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); {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:34,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {27290#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27290#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:34,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {27290#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:34,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {27291#(<= 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); {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:34,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {27291#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27291#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:34,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {27291#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:34,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {27292#(<= 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); {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:34,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {27292#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27292#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:34,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {27292#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:34,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {27293#(<= 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); {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:34,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {27293#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27293#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:34,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {27293#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:34,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {27294#(<= 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); {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:34,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {27294#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27294#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:34,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {27294#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:34,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {27295#(<= 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); {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:34,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {27295#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27295#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:34,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {27295#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:34,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {27296#(<= 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); {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:34,363 INFO L273 TraceCheckUtils]: 41: Hoare triple {27296#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27296#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:34,364 INFO L273 TraceCheckUtils]: 42: Hoare triple {27296#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:34,364 INFO L273 TraceCheckUtils]: 43: Hoare triple {27297#(<= 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); {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:34,365 INFO L273 TraceCheckUtils]: 44: Hoare triple {27297#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27297#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:34,365 INFO L273 TraceCheckUtils]: 45: Hoare triple {27297#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:34,366 INFO L273 TraceCheckUtils]: 46: Hoare triple {27298#(<= 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); {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:34,366 INFO L273 TraceCheckUtils]: 47: Hoare triple {27298#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27298#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:34,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {27298#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:34,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {27299#(<= 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); {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:34,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {27299#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27299#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:34,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {27299#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:34,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {27300#(<= 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); {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:34,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {27300#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27300#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:34,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {27300#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:34,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {27301#(<= 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); {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:34,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {27301#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27301#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:34,372 INFO L273 TraceCheckUtils]: 57: Hoare triple {27301#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:34,373 INFO L273 TraceCheckUtils]: 58: Hoare triple {27302#(<= 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); {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:34,373 INFO L273 TraceCheckUtils]: 59: Hoare triple {27302#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27302#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:34,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {27302#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:34,374 INFO L273 TraceCheckUtils]: 61: Hoare triple {27303#(<= 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); {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:34,375 INFO L273 TraceCheckUtils]: 62: Hoare triple {27303#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27303#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:34,375 INFO L273 TraceCheckUtils]: 63: Hoare triple {27303#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:34,376 INFO L273 TraceCheckUtils]: 64: Hoare triple {27304#(<= 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); {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:34,376 INFO L273 TraceCheckUtils]: 65: Hoare triple {27304#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27304#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:34,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {27304#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:34,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {27305#(<= 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); {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:34,378 INFO L273 TraceCheckUtils]: 68: Hoare triple {27305#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27305#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:34,379 INFO L273 TraceCheckUtils]: 69: Hoare triple {27305#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:34,379 INFO L273 TraceCheckUtils]: 70: Hoare triple {27306#(<= 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); {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:34,380 INFO L273 TraceCheckUtils]: 71: Hoare triple {27306#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27306#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:34,380 INFO L273 TraceCheckUtils]: 72: Hoare triple {27306#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:34,381 INFO L273 TraceCheckUtils]: 73: Hoare triple {27307#(<= 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); {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:34,381 INFO L273 TraceCheckUtils]: 74: Hoare triple {27307#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27307#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:34,382 INFO L273 TraceCheckUtils]: 75: Hoare triple {27307#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:34,383 INFO L273 TraceCheckUtils]: 76: Hoare triple {27308#(<= 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); {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:34,383 INFO L273 TraceCheckUtils]: 77: Hoare triple {27308#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27308#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:34,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {27308#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:34,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {27309#(<= 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); {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:34,385 INFO L273 TraceCheckUtils]: 80: Hoare triple {27309#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27309#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:34,385 INFO L273 TraceCheckUtils]: 81: Hoare triple {27309#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:34,386 INFO L273 TraceCheckUtils]: 82: Hoare triple {27310#(<= 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); {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:34,386 INFO L273 TraceCheckUtils]: 83: Hoare triple {27310#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27310#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:34,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {27310#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:34,388 INFO L273 TraceCheckUtils]: 85: Hoare triple {27311#(<= 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); {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:34,388 INFO L273 TraceCheckUtils]: 86: Hoare triple {27311#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27311#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:34,389 INFO L273 TraceCheckUtils]: 87: Hoare triple {27311#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:34,389 INFO L273 TraceCheckUtils]: 88: Hoare triple {27312#(<= 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); {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:34,390 INFO L273 TraceCheckUtils]: 89: Hoare triple {27312#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27312#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:34,390 INFO L273 TraceCheckUtils]: 90: Hoare triple {27312#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:34,391 INFO L273 TraceCheckUtils]: 91: Hoare triple {27313#(<= 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); {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:34,391 INFO L273 TraceCheckUtils]: 92: Hoare triple {27313#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27313#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:34,392 INFO L273 TraceCheckUtils]: 93: Hoare triple {27313#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:34,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {27314#(<= 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); {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:34,393 INFO L273 TraceCheckUtils]: 95: Hoare triple {27314#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27314#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:34,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {27314#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:34,394 INFO L273 TraceCheckUtils]: 97: Hoare triple {27315#(<= 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); {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:34,395 INFO L273 TraceCheckUtils]: 98: Hoare triple {27315#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27315#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:34,395 INFO L273 TraceCheckUtils]: 99: Hoare triple {27315#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:34,396 INFO L273 TraceCheckUtils]: 100: Hoare triple {27316#(<= 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); {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:34,396 INFO L273 TraceCheckUtils]: 101: Hoare triple {27316#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27316#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:34,397 INFO L273 TraceCheckUtils]: 102: Hoare triple {27316#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:34,397 INFO L273 TraceCheckUtils]: 103: Hoare triple {27317#(<= 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); {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:34,398 INFO L273 TraceCheckUtils]: 104: Hoare triple {27317#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27317#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:34,399 INFO L273 TraceCheckUtils]: 105: Hoare triple {27317#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:34,399 INFO L273 TraceCheckUtils]: 106: Hoare triple {27318#(<= 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); {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:34,400 INFO L273 TraceCheckUtils]: 107: Hoare triple {27318#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {27318#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:34,400 INFO L273 TraceCheckUtils]: 108: Hoare triple {27318#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {27319#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:34,401 INFO L273 TraceCheckUtils]: 109: Hoare triple {27319#(<= main_~k~0 34)} assume !(~k~0 < 100000); {27283#false} is VALID [2018-11-23 11:53:34,401 INFO L273 TraceCheckUtils]: 110: Hoare triple {27283#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); {27283#false} is VALID [2018-11-23 11:53:34,401 INFO L273 TraceCheckUtils]: 111: Hoare triple {27283#false} ~x~0 := 0; {27283#false} is VALID [2018-11-23 11:53:34,401 INFO L273 TraceCheckUtils]: 112: Hoare triple {27283#false} assume !(~x~0 < ~i~0); {27283#false} is VALID [2018-11-23 11:53:34,402 INFO L273 TraceCheckUtils]: 113: Hoare triple {27283#false} ~x~0 := 1 + ~i~0; {27283#false} is VALID [2018-11-23 11:53:34,402 INFO L273 TraceCheckUtils]: 114: Hoare triple {27283#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); {27283#false} is VALID [2018-11-23 11:53:34,402 INFO L256 TraceCheckUtils]: 115: Hoare triple {27283#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {27283#false} is VALID [2018-11-23 11:53:34,402 INFO L273 TraceCheckUtils]: 116: Hoare triple {27283#false} ~cond := #in~cond; {27283#false} is VALID [2018-11-23 11:53:34,402 INFO L273 TraceCheckUtils]: 117: Hoare triple {27283#false} assume 0 == ~cond; {27283#false} is VALID [2018-11-23 11:53:34,403 INFO L273 TraceCheckUtils]: 118: Hoare triple {27283#false} assume !false; {27283#false} is VALID [2018-11-23 11:53:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2018-11-23 11:53:34,433 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-11-23 11:53:34,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:34,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:53:34,548 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-23 11:53:34,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:53:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:53:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:53:34,549 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand 40 states. [2018-11-23 11:53:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,504 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2018-11-23 11:53:37,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:53:37,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 119 [2018-11-23 11:53:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 11:53:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 247 transitions. [2018-11-23 11:53:37,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 247 transitions. [2018-11-23 11:53:37,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:37,752 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:53:37,752 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 11:53:37,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-11-23 11:53:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 11:53:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-11-23 11:53:37,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:37,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 150 states. [2018-11-23 11:53:37,849 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 150 states. [2018-11-23 11:53:37,849 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 150 states. [2018-11-23 11:53:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,853 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2018-11-23 11:53:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 208 transitions. [2018-11-23 11:53:37,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,853 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 158 states. [2018-11-23 11:53:37,853 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 158 states. [2018-11-23 11:53:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,855 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2018-11-23 11:53:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 208 transitions. [2018-11-23 11:53:37,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:37,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:53:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2018-11-23 11:53:37,858 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 119 [2018-11-23 11:53:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:37,858 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2018-11-23 11:53:37,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:53:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2018-11-23 11:53:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 11:53:37,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:37,859 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:37,859 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:37,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2133712256, now seen corresponding path program 24 times [2018-11-23 11:53:37,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:37,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:39,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {28528#true} call ULTIMATE.init(); {28528#true} is VALID [2018-11-23 11:53:39,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {28528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28528#true} is VALID [2018-11-23 11:53:39,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {28528#true} assume true; {28528#true} is VALID [2018-11-23 11:53:39,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28528#true} {28528#true} #130#return; {28528#true} is VALID [2018-11-23 11:53:39,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {28528#true} call #t~ret15 := main(); {28528#true} is VALID [2018-11-23 11:53:39,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {28528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28530#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:39,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {28530#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {28531#(= main_~k~0 0)} is VALID [2018-11-23 11:53:39,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {28531#(= 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); {28531#(= main_~k~0 0)} is VALID [2018-11-23 11:53:39,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {28531#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28531#(= main_~k~0 0)} is VALID [2018-11-23 11:53:39,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {28531#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:39,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {28532#(<= 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); {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:39,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {28532#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:39,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {28532#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:39,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {28533#(<= 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); {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:39,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {28533#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:39,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {28533#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:39,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {28534#(<= 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); {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:39,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {28534#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:39,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {28534#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:39,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {28535#(<= 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); {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:39,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {28535#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:39,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {28535#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:39,658 INFO L273 TraceCheckUtils]: 22: Hoare triple {28536#(<= 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); {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:39,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {28536#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:39,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {28536#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:39,660 INFO L273 TraceCheckUtils]: 25: Hoare triple {28537#(<= 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); {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:39,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {28537#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:39,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {28537#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:39,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {28538#(<= 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); {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:39,662 INFO L273 TraceCheckUtils]: 29: Hoare triple {28538#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:39,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {28538#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:39,663 INFO L273 TraceCheckUtils]: 31: Hoare triple {28539#(<= 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); {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:39,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {28539#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:39,664 INFO L273 TraceCheckUtils]: 33: Hoare triple {28539#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:39,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {28540#(<= 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); {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:39,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {28540#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:39,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {28540#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:39,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {28541#(<= 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); {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:39,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {28541#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:39,668 INFO L273 TraceCheckUtils]: 39: Hoare triple {28541#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:39,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {28542#(<= 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); {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:39,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {28542#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:39,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {28542#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:39,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {28543#(<= 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); {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:39,670 INFO L273 TraceCheckUtils]: 44: Hoare triple {28543#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:39,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {28543#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:39,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {28544#(<= 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); {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:39,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {28544#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:39,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {28544#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:39,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {28545#(<= 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); {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:39,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {28545#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:39,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {28545#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:39,675 INFO L273 TraceCheckUtils]: 52: Hoare triple {28546#(<= 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); {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:39,675 INFO L273 TraceCheckUtils]: 53: Hoare triple {28546#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:39,676 INFO L273 TraceCheckUtils]: 54: Hoare triple {28546#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:39,676 INFO L273 TraceCheckUtils]: 55: Hoare triple {28547#(<= 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); {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:39,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {28547#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:39,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {28547#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:39,678 INFO L273 TraceCheckUtils]: 58: Hoare triple {28548#(<= 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); {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:39,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {28548#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:39,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {28548#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:39,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {28549#(<= 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); {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:39,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {28549#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:39,681 INFO L273 TraceCheckUtils]: 63: Hoare triple {28549#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:39,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {28550#(<= 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); {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:39,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {28550#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:39,682 INFO L273 TraceCheckUtils]: 66: Hoare triple {28550#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:39,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {28551#(<= 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); {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:39,683 INFO L273 TraceCheckUtils]: 68: Hoare triple {28551#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:39,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {28551#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:39,684 INFO L273 TraceCheckUtils]: 70: Hoare triple {28552#(<= 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); {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:39,685 INFO L273 TraceCheckUtils]: 71: Hoare triple {28552#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:39,685 INFO L273 TraceCheckUtils]: 72: Hoare triple {28552#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:39,686 INFO L273 TraceCheckUtils]: 73: Hoare triple {28553#(<= 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); {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:39,686 INFO L273 TraceCheckUtils]: 74: Hoare triple {28553#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:39,687 INFO L273 TraceCheckUtils]: 75: Hoare triple {28553#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:39,688 INFO L273 TraceCheckUtils]: 76: Hoare triple {28554#(<= 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); {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:39,688 INFO L273 TraceCheckUtils]: 77: Hoare triple {28554#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:39,689 INFO L273 TraceCheckUtils]: 78: Hoare triple {28554#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:39,689 INFO L273 TraceCheckUtils]: 79: Hoare triple {28555#(<= 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); {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:39,690 INFO L273 TraceCheckUtils]: 80: Hoare triple {28555#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:39,690 INFO L273 TraceCheckUtils]: 81: Hoare triple {28555#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:39,691 INFO L273 TraceCheckUtils]: 82: Hoare triple {28556#(<= 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); {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:39,691 INFO L273 TraceCheckUtils]: 83: Hoare triple {28556#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:39,692 INFO L273 TraceCheckUtils]: 84: Hoare triple {28556#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:39,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {28557#(<= 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); {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:39,693 INFO L273 TraceCheckUtils]: 86: Hoare triple {28557#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:39,693 INFO L273 TraceCheckUtils]: 87: Hoare triple {28557#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:39,694 INFO L273 TraceCheckUtils]: 88: Hoare triple {28558#(<= 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); {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:39,694 INFO L273 TraceCheckUtils]: 89: Hoare triple {28558#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:39,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {28558#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:39,696 INFO L273 TraceCheckUtils]: 91: Hoare triple {28559#(<= 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); {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:39,696 INFO L273 TraceCheckUtils]: 92: Hoare triple {28559#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:39,697 INFO L273 TraceCheckUtils]: 93: Hoare triple {28559#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:39,697 INFO L273 TraceCheckUtils]: 94: Hoare triple {28560#(<= 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); {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:39,698 INFO L273 TraceCheckUtils]: 95: Hoare triple {28560#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:39,698 INFO L273 TraceCheckUtils]: 96: Hoare triple {28560#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:39,699 INFO L273 TraceCheckUtils]: 97: Hoare triple {28561#(<= 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); {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:39,699 INFO L273 TraceCheckUtils]: 98: Hoare triple {28561#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:39,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {28561#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:39,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {28562#(<= 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); {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:39,701 INFO L273 TraceCheckUtils]: 101: Hoare triple {28562#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:39,702 INFO L273 TraceCheckUtils]: 102: Hoare triple {28562#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:39,702 INFO L273 TraceCheckUtils]: 103: Hoare triple {28563#(<= 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); {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:39,703 INFO L273 TraceCheckUtils]: 104: Hoare triple {28563#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:39,703 INFO L273 TraceCheckUtils]: 105: Hoare triple {28563#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:39,704 INFO L273 TraceCheckUtils]: 106: Hoare triple {28564#(<= 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); {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:39,704 INFO L273 TraceCheckUtils]: 107: Hoare triple {28564#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:39,705 INFO L273 TraceCheckUtils]: 108: Hoare triple {28564#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:39,705 INFO L273 TraceCheckUtils]: 109: Hoare triple {28565#(<= 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); {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:39,706 INFO L273 TraceCheckUtils]: 110: Hoare triple {28565#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:39,706 INFO L273 TraceCheckUtils]: 111: Hoare triple {28565#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {28566#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:39,707 INFO L273 TraceCheckUtils]: 112: Hoare triple {28566#(<= main_~k~0 35)} assume !(~k~0 < 100000); {28529#false} is VALID [2018-11-23 11:53:39,707 INFO L273 TraceCheckUtils]: 113: Hoare triple {28529#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); {28529#false} is VALID [2018-11-23 11:53:39,707 INFO L273 TraceCheckUtils]: 114: Hoare triple {28529#false} ~x~0 := 0; {28529#false} is VALID [2018-11-23 11:53:39,708 INFO L273 TraceCheckUtils]: 115: Hoare triple {28529#false} assume !(~x~0 < ~i~0); {28529#false} is VALID [2018-11-23 11:53:39,708 INFO L273 TraceCheckUtils]: 116: Hoare triple {28529#false} ~x~0 := 1 + ~i~0; {28529#false} is VALID [2018-11-23 11:53:39,708 INFO L273 TraceCheckUtils]: 117: Hoare triple {28529#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); {28529#false} is VALID [2018-11-23 11:53:39,708 INFO L256 TraceCheckUtils]: 118: Hoare triple {28529#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28529#false} is VALID [2018-11-23 11:53:39,708 INFO L273 TraceCheckUtils]: 119: Hoare triple {28529#false} ~cond := #in~cond; {28529#false} is VALID [2018-11-23 11:53:39,709 INFO L273 TraceCheckUtils]: 120: Hoare triple {28529#false} assume 0 == ~cond; {28529#false} is VALID [2018-11-23 11:53:39,709 INFO L273 TraceCheckUtils]: 121: Hoare triple {28529#false} assume !false; {28529#false} is VALID [2018-11-23 11:53:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:39,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:39,723 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-23 11:53:39,737 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:39,956 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-11-23 11:53:39,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:39,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:40,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {28528#true} call ULTIMATE.init(); {28528#true} is VALID [2018-11-23 11:53:40,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {28528#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28528#true} is VALID [2018-11-23 11:53:40,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {28528#true} assume true; {28528#true} is VALID [2018-11-23 11:53:40,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28528#true} {28528#true} #130#return; {28528#true} is VALID [2018-11-23 11:53:40,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {28528#true} call #t~ret15 := main(); {28528#true} is VALID [2018-11-23 11:53:40,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {28528#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {28585#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:40,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {28585#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {28589#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:40,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {28589#(<= 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); {28589#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:40,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {28589#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28589#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:40,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {28589#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:40,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {28532#(<= 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); {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:40,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {28532#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {28532#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:40,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {28532#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:40,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {28533#(<= 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); {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:40,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {28533#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28533#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:40,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {28533#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:40,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {28534#(<= 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); {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:40,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {28534#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28534#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:40,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {28534#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:40,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {28535#(<= 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); {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:40,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {28535#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28535#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:40,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {28535#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:40,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {28536#(<= 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); {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:40,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {28536#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28536#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:40,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {28536#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:40,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {28537#(<= 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); {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:40,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {28537#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28537#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:40,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {28537#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:40,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {28538#(<= 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); {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:40,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {28538#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28538#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:40,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {28538#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:40,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {28539#(<= 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); {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:40,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {28539#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28539#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:40,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {28539#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:40,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {28540#(<= 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); {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:40,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {28540#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28540#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:40,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {28540#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:40,615 INFO L273 TraceCheckUtils]: 37: Hoare triple {28541#(<= 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); {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:40,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {28541#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28541#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:40,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {28541#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:40,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {28542#(<= 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); {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:40,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {28542#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28542#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:40,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {28542#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:40,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {28543#(<= 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); {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:40,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {28543#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28543#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:40,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {28543#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:40,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {28544#(<= 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); {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:40,620 INFO L273 TraceCheckUtils]: 47: Hoare triple {28544#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28544#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:40,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {28544#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:40,621 INFO L273 TraceCheckUtils]: 49: Hoare triple {28545#(<= 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); {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:40,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {28545#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28545#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:40,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {28545#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:40,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {28546#(<= 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); {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:40,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {28546#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28546#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:40,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {28546#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:40,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {28547#(<= 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); {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:40,625 INFO L273 TraceCheckUtils]: 56: Hoare triple {28547#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28547#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:40,626 INFO L273 TraceCheckUtils]: 57: Hoare triple {28547#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:40,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {28548#(<= 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); {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:40,627 INFO L273 TraceCheckUtils]: 59: Hoare triple {28548#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28548#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:40,628 INFO L273 TraceCheckUtils]: 60: Hoare triple {28548#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:40,628 INFO L273 TraceCheckUtils]: 61: Hoare triple {28549#(<= 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); {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:40,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {28549#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28549#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:40,629 INFO L273 TraceCheckUtils]: 63: Hoare triple {28549#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:40,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {28550#(<= 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); {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:40,630 INFO L273 TraceCheckUtils]: 65: Hoare triple {28550#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28550#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:40,631 INFO L273 TraceCheckUtils]: 66: Hoare triple {28550#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:40,632 INFO L273 TraceCheckUtils]: 67: Hoare triple {28551#(<= 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); {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:40,632 INFO L273 TraceCheckUtils]: 68: Hoare triple {28551#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28551#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:40,633 INFO L273 TraceCheckUtils]: 69: Hoare triple {28551#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:40,633 INFO L273 TraceCheckUtils]: 70: Hoare triple {28552#(<= 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); {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:40,634 INFO L273 TraceCheckUtils]: 71: Hoare triple {28552#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28552#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:40,634 INFO L273 TraceCheckUtils]: 72: Hoare triple {28552#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:40,635 INFO L273 TraceCheckUtils]: 73: Hoare triple {28553#(<= 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); {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:40,635 INFO L273 TraceCheckUtils]: 74: Hoare triple {28553#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28553#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:40,636 INFO L273 TraceCheckUtils]: 75: Hoare triple {28553#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:40,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {28554#(<= 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); {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:40,637 INFO L273 TraceCheckUtils]: 77: Hoare triple {28554#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28554#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:40,638 INFO L273 TraceCheckUtils]: 78: Hoare triple {28554#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:40,638 INFO L273 TraceCheckUtils]: 79: Hoare triple {28555#(<= 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); {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:40,639 INFO L273 TraceCheckUtils]: 80: Hoare triple {28555#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28555#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:40,639 INFO L273 TraceCheckUtils]: 81: Hoare triple {28555#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:40,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {28556#(<= 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); {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:40,640 INFO L273 TraceCheckUtils]: 83: Hoare triple {28556#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28556#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:40,641 INFO L273 TraceCheckUtils]: 84: Hoare triple {28556#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:40,642 INFO L273 TraceCheckUtils]: 85: Hoare triple {28557#(<= 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); {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:40,642 INFO L273 TraceCheckUtils]: 86: Hoare triple {28557#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28557#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:40,643 INFO L273 TraceCheckUtils]: 87: Hoare triple {28557#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:40,643 INFO L273 TraceCheckUtils]: 88: Hoare triple {28558#(<= 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); {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:40,644 INFO L273 TraceCheckUtils]: 89: Hoare triple {28558#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28558#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:40,644 INFO L273 TraceCheckUtils]: 90: Hoare triple {28558#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:40,645 INFO L273 TraceCheckUtils]: 91: Hoare triple {28559#(<= 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); {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:40,645 INFO L273 TraceCheckUtils]: 92: Hoare triple {28559#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28559#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:40,646 INFO L273 TraceCheckUtils]: 93: Hoare triple {28559#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:40,646 INFO L273 TraceCheckUtils]: 94: Hoare triple {28560#(<= 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); {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:40,647 INFO L273 TraceCheckUtils]: 95: Hoare triple {28560#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28560#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:40,648 INFO L273 TraceCheckUtils]: 96: Hoare triple {28560#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:40,648 INFO L273 TraceCheckUtils]: 97: Hoare triple {28561#(<= 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); {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:40,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {28561#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28561#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:40,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {28561#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:40,650 INFO L273 TraceCheckUtils]: 100: Hoare triple {28562#(<= 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); {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:40,650 INFO L273 TraceCheckUtils]: 101: Hoare triple {28562#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28562#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:40,651 INFO L273 TraceCheckUtils]: 102: Hoare triple {28562#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:40,651 INFO L273 TraceCheckUtils]: 103: Hoare triple {28563#(<= 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); {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:40,652 INFO L273 TraceCheckUtils]: 104: Hoare triple {28563#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28563#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:40,652 INFO L273 TraceCheckUtils]: 105: Hoare triple {28563#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:40,653 INFO L273 TraceCheckUtils]: 106: Hoare triple {28564#(<= 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); {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:40,653 INFO L273 TraceCheckUtils]: 107: Hoare triple {28564#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28564#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:40,654 INFO L273 TraceCheckUtils]: 108: Hoare triple {28564#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:40,655 INFO L273 TraceCheckUtils]: 109: Hoare triple {28565#(<= 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); {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:40,655 INFO L273 TraceCheckUtils]: 110: Hoare triple {28565#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {28565#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:40,656 INFO L273 TraceCheckUtils]: 111: Hoare triple {28565#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {28566#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:40,656 INFO L273 TraceCheckUtils]: 112: Hoare triple {28566#(<= main_~k~0 35)} assume !(~k~0 < 100000); {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L273 TraceCheckUtils]: 113: Hoare triple {28529#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); {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L273 TraceCheckUtils]: 114: Hoare triple {28529#false} ~x~0 := 0; {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L273 TraceCheckUtils]: 115: Hoare triple {28529#false} assume !(~x~0 < ~i~0); {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L273 TraceCheckUtils]: 116: Hoare triple {28529#false} ~x~0 := 1 + ~i~0; {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L273 TraceCheckUtils]: 117: Hoare triple {28529#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); {28529#false} is VALID [2018-11-23 11:53:40,657 INFO L256 TraceCheckUtils]: 118: Hoare triple {28529#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {28529#false} is VALID [2018-11-23 11:53:40,658 INFO L273 TraceCheckUtils]: 119: Hoare triple {28529#false} ~cond := #in~cond; {28529#false} is VALID [2018-11-23 11:53:40,658 INFO L273 TraceCheckUtils]: 120: Hoare triple {28529#false} assume 0 == ~cond; {28529#false} is VALID [2018-11-23 11:53:40,658 INFO L273 TraceCheckUtils]: 121: Hoare triple {28529#false} assume !false; {28529#false} is VALID [2018-11-23 11:53:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:40,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:40,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2018-11-23 11:53:40,689 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 122 [2018-11-23 11:53:40,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:40,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:53:40,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:40,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:53:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:53:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:53:40,805 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand 41 states. [2018-11-23 11:53:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,194 INFO L93 Difference]: Finished difference Result 195 states and 258 transitions. [2018-11-23 11:53:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:53:43,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 122 [2018-11-23 11:53:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 11:53:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 251 transitions. [2018-11-23 11:53:43,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 251 transitions. [2018-11-23 11:53:43,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:43,428 INFO L225 Difference]: With dead ends: 195 [2018-11-23 11:53:43,428 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:53:43,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-11-23 11:53:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:53:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-11-23 11:53:43,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:43,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 153 states. [2018-11-23 11:53:43,519 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 153 states. [2018-11-23 11:53:43,519 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 153 states. [2018-11-23 11:53:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,522 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2018-11-23 11:53:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2018-11-23 11:53:43,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:43,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:43,522 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 161 states. [2018-11-23 11:53:43,522 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 161 states. [2018-11-23 11:53:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,525 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2018-11-23 11:53:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2018-11-23 11:53:43,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:43,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:43,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:43,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:53:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2018-11-23 11:53:43,528 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 122 [2018-11-23 11:53:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:43,529 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2018-11-23 11:53:43,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:53:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2018-11-23 11:53:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 11:53:43,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:43,530 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:43,530 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:43,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash 160391671, now seen corresponding path program 25 times [2018-11-23 11:53:43,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:43,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {29800#true} call ULTIMATE.init(); {29800#true} is VALID [2018-11-23 11:53:44,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {29800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29800#true} is VALID [2018-11-23 11:53:44,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {29800#true} assume true; {29800#true} is VALID [2018-11-23 11:53:44,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29800#true} {29800#true} #130#return; {29800#true} is VALID [2018-11-23 11:53:44,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {29800#true} call #t~ret15 := main(); {29800#true} is VALID [2018-11-23 11:53:44,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {29800#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29802#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:44,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {29802#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {29803#(= main_~k~0 0)} is VALID [2018-11-23 11:53:44,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {29803#(= 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); {29803#(= main_~k~0 0)} is VALID [2018-11-23 11:53:44,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {29803#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29803#(= main_~k~0 0)} is VALID [2018-11-23 11:53:44,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {29803#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {29804#(<= 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); {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {29804#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {29804#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {29805#(<= 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); {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {29805#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {29805#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {29806#(<= 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); {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {29806#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {29806#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {29807#(<= 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); {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {29807#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {29807#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {29808#(<= 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); {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {29808#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {29808#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {29809#(<= 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); {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {29809#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {29809#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {29810#(<= 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); {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {29810#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {29810#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {29811#(<= 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); {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {29811#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {29811#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {29812#(<= 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); {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {29812#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {29812#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {29813#(<= 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); {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {29813#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {29813#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,445 INFO L273 TraceCheckUtils]: 40: Hoare triple {29814#(<= 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); {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {29814#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {29814#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {29815#(<= 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); {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {29815#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {29815#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {29816#(<= 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); {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {29816#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,449 INFO L273 TraceCheckUtils]: 48: Hoare triple {29816#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,449 INFO L273 TraceCheckUtils]: 49: Hoare triple {29817#(<= 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); {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,450 INFO L273 TraceCheckUtils]: 50: Hoare triple {29817#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {29817#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,451 INFO L273 TraceCheckUtils]: 52: Hoare triple {29818#(<= 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); {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,451 INFO L273 TraceCheckUtils]: 53: Hoare triple {29818#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {29818#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,453 INFO L273 TraceCheckUtils]: 55: Hoare triple {29819#(<= 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); {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,453 INFO L273 TraceCheckUtils]: 56: Hoare triple {29819#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,454 INFO L273 TraceCheckUtils]: 57: Hoare triple {29819#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,454 INFO L273 TraceCheckUtils]: 58: Hoare triple {29820#(<= 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); {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,455 INFO L273 TraceCheckUtils]: 59: Hoare triple {29820#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,455 INFO L273 TraceCheckUtils]: 60: Hoare triple {29820#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,456 INFO L273 TraceCheckUtils]: 61: Hoare triple {29821#(<= 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); {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,456 INFO L273 TraceCheckUtils]: 62: Hoare triple {29821#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {29821#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,457 INFO L273 TraceCheckUtils]: 64: Hoare triple {29822#(<= 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); {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,458 INFO L273 TraceCheckUtils]: 65: Hoare triple {29822#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,459 INFO L273 TraceCheckUtils]: 66: Hoare triple {29822#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,459 INFO L273 TraceCheckUtils]: 67: Hoare triple {29823#(<= 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); {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {29823#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {29823#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,461 INFO L273 TraceCheckUtils]: 70: Hoare triple {29824#(<= 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); {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {29824#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,462 INFO L273 TraceCheckUtils]: 72: Hoare triple {29824#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,462 INFO L273 TraceCheckUtils]: 73: Hoare triple {29825#(<= 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); {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,463 INFO L273 TraceCheckUtils]: 74: Hoare triple {29825#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {29825#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,464 INFO L273 TraceCheckUtils]: 76: Hoare triple {29826#(<= 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); {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,464 INFO L273 TraceCheckUtils]: 77: Hoare triple {29826#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,465 INFO L273 TraceCheckUtils]: 78: Hoare triple {29826#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,466 INFO L273 TraceCheckUtils]: 79: Hoare triple {29827#(<= 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); {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,466 INFO L273 TraceCheckUtils]: 80: Hoare triple {29827#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,467 INFO L273 TraceCheckUtils]: 81: Hoare triple {29827#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,467 INFO L273 TraceCheckUtils]: 82: Hoare triple {29828#(<= 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); {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,468 INFO L273 TraceCheckUtils]: 83: Hoare triple {29828#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {29828#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,469 INFO L273 TraceCheckUtils]: 85: Hoare triple {29829#(<= 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); {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {29829#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,470 INFO L273 TraceCheckUtils]: 87: Hoare triple {29829#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,471 INFO L273 TraceCheckUtils]: 88: Hoare triple {29830#(<= 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); {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {29830#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,472 INFO L273 TraceCheckUtils]: 90: Hoare triple {29830#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {29831#(<= 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); {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {29831#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,473 INFO L273 TraceCheckUtils]: 93: Hoare triple {29831#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {29832#(<= 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); {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {29832#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {29832#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,475 INFO L273 TraceCheckUtils]: 97: Hoare triple {29833#(<= 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); {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {29833#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,477 INFO L273 TraceCheckUtils]: 99: Hoare triple {29833#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,477 INFO L273 TraceCheckUtils]: 100: Hoare triple {29834#(<= 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); {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,477 INFO L273 TraceCheckUtils]: 101: Hoare triple {29834#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,478 INFO L273 TraceCheckUtils]: 102: Hoare triple {29834#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {29835#(<= 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); {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,479 INFO L273 TraceCheckUtils]: 104: Hoare triple {29835#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,480 INFO L273 TraceCheckUtils]: 105: Hoare triple {29835#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,480 INFO L273 TraceCheckUtils]: 106: Hoare triple {29836#(<= 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); {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {29836#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,481 INFO L273 TraceCheckUtils]: 108: Hoare triple {29836#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,482 INFO L273 TraceCheckUtils]: 109: Hoare triple {29837#(<= 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); {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,482 INFO L273 TraceCheckUtils]: 110: Hoare triple {29837#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,483 INFO L273 TraceCheckUtils]: 111: Hoare triple {29837#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {29838#(<= 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); {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,484 INFO L273 TraceCheckUtils]: 113: Hoare triple {29838#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,485 INFO L273 TraceCheckUtils]: 114: Hoare triple {29838#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {29839#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:44,485 INFO L273 TraceCheckUtils]: 115: Hoare triple {29839#(<= main_~k~0 36)} assume !(~k~0 < 100000); {29801#false} is VALID [2018-11-23 11:53:44,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {29801#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); {29801#false} is VALID [2018-11-23 11:53:44,486 INFO L273 TraceCheckUtils]: 117: Hoare triple {29801#false} ~x~0 := 0; {29801#false} is VALID [2018-11-23 11:53:44,486 INFO L273 TraceCheckUtils]: 118: Hoare triple {29801#false} assume !(~x~0 < ~i~0); {29801#false} is VALID [2018-11-23 11:53:44,486 INFO L273 TraceCheckUtils]: 119: Hoare triple {29801#false} ~x~0 := 1 + ~i~0; {29801#false} is VALID [2018-11-23 11:53:44,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {29801#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); {29801#false} is VALID [2018-11-23 11:53:44,487 INFO L256 TraceCheckUtils]: 121: Hoare triple {29801#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29801#false} is VALID [2018-11-23 11:53:44,487 INFO L273 TraceCheckUtils]: 122: Hoare triple {29801#false} ~cond := #in~cond; {29801#false} is VALID [2018-11-23 11:53:44,487 INFO L273 TraceCheckUtils]: 123: Hoare triple {29801#false} assume 0 == ~cond; {29801#false} is VALID [2018-11-23 11:53:44,487 INFO L273 TraceCheckUtils]: 124: Hoare triple {29801#false} assume !false; {29801#false} is VALID [2018-11-23 11:53:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:44,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:44,499 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-23 11:53:44,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:44,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {29800#true} call ULTIMATE.init(); {29800#true} is VALID [2018-11-23 11:53:44,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {29800#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29800#true} is VALID [2018-11-23 11:53:44,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {29800#true} assume true; {29800#true} is VALID [2018-11-23 11:53:44,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29800#true} {29800#true} #130#return; {29800#true} is VALID [2018-11-23 11:53:44,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {29800#true} call #t~ret15 := main(); {29800#true} is VALID [2018-11-23 11:53:44,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {29800#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {29858#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:44,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {29858#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {29862#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:44,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {29862#(<= 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); {29862#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:44,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {29862#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29862#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:44,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {29862#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {29804#(<= 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); {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {29804#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {29804#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:44,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {29804#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {29805#(<= 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); {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {29805#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29805#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:44,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {29805#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {29806#(<= 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); {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {29806#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29806#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:44,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {29806#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {29807#(<= 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); {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {29807#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29807#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:44,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {29807#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {29808#(<= 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); {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {29808#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29808#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:44,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {29808#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {29809#(<= 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); {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {29809#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29809#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:44,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {29809#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {29810#(<= 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); {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {29810#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29810#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:44,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {29810#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {29811#(<= 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); {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {29811#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29811#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:44,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {29811#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {29812#(<= 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); {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {29812#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29812#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:44,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {29812#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {29813#(<= 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); {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {29813#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29813#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:44,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {29813#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {29814#(<= 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); {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {29814#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29814#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:44,879 INFO L273 TraceCheckUtils]: 42: Hoare triple {29814#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {29815#(<= 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); {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,880 INFO L273 TraceCheckUtils]: 44: Hoare triple {29815#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29815#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:44,881 INFO L273 TraceCheckUtils]: 45: Hoare triple {29815#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,881 INFO L273 TraceCheckUtils]: 46: Hoare triple {29816#(<= 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); {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,882 INFO L273 TraceCheckUtils]: 47: Hoare triple {29816#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29816#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:44,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {29816#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {29817#(<= 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); {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,884 INFO L273 TraceCheckUtils]: 50: Hoare triple {29817#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29817#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:44,884 INFO L273 TraceCheckUtils]: 51: Hoare triple {29817#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,885 INFO L273 TraceCheckUtils]: 52: Hoare triple {29818#(<= 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); {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,885 INFO L273 TraceCheckUtils]: 53: Hoare triple {29818#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29818#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:44,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {29818#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {29819#(<= 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); {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {29819#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29819#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:44,888 INFO L273 TraceCheckUtils]: 57: Hoare triple {29819#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {29820#(<= 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); {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {29820#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29820#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:44,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {29820#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {29821#(<= 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); {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {29821#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29821#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:44,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {29821#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,891 INFO L273 TraceCheckUtils]: 64: Hoare triple {29822#(<= 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); {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,892 INFO L273 TraceCheckUtils]: 65: Hoare triple {29822#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29822#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:44,892 INFO L273 TraceCheckUtils]: 66: Hoare triple {29822#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,893 INFO L273 TraceCheckUtils]: 67: Hoare triple {29823#(<= 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); {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {29823#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29823#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:44,894 INFO L273 TraceCheckUtils]: 69: Hoare triple {29823#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {29824#(<= 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); {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {29824#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29824#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:44,896 INFO L273 TraceCheckUtils]: 72: Hoare triple {29824#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,896 INFO L273 TraceCheckUtils]: 73: Hoare triple {29825#(<= 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); {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,897 INFO L273 TraceCheckUtils]: 74: Hoare triple {29825#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29825#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:44,897 INFO L273 TraceCheckUtils]: 75: Hoare triple {29825#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,898 INFO L273 TraceCheckUtils]: 76: Hoare triple {29826#(<= 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); {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {29826#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29826#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:44,899 INFO L273 TraceCheckUtils]: 78: Hoare triple {29826#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,899 INFO L273 TraceCheckUtils]: 79: Hoare triple {29827#(<= 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); {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,900 INFO L273 TraceCheckUtils]: 80: Hoare triple {29827#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29827#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:44,901 INFO L273 TraceCheckUtils]: 81: Hoare triple {29827#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {29828#(<= 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); {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,901 INFO L273 TraceCheckUtils]: 83: Hoare triple {29828#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29828#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:44,902 INFO L273 TraceCheckUtils]: 84: Hoare triple {29828#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,903 INFO L273 TraceCheckUtils]: 85: Hoare triple {29829#(<= 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); {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {29829#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29829#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:44,904 INFO L273 TraceCheckUtils]: 87: Hoare triple {29829#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,904 INFO L273 TraceCheckUtils]: 88: Hoare triple {29830#(<= 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); {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,905 INFO L273 TraceCheckUtils]: 89: Hoare triple {29830#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29830#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:44,905 INFO L273 TraceCheckUtils]: 90: Hoare triple {29830#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,906 INFO L273 TraceCheckUtils]: 91: Hoare triple {29831#(<= 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); {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,906 INFO L273 TraceCheckUtils]: 92: Hoare triple {29831#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29831#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:44,907 INFO L273 TraceCheckUtils]: 93: Hoare triple {29831#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,908 INFO L273 TraceCheckUtils]: 94: Hoare triple {29832#(<= 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); {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,908 INFO L273 TraceCheckUtils]: 95: Hoare triple {29832#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29832#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:44,909 INFO L273 TraceCheckUtils]: 96: Hoare triple {29832#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,909 INFO L273 TraceCheckUtils]: 97: Hoare triple {29833#(<= 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); {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,910 INFO L273 TraceCheckUtils]: 98: Hoare triple {29833#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29833#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:44,910 INFO L273 TraceCheckUtils]: 99: Hoare triple {29833#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,911 INFO L273 TraceCheckUtils]: 100: Hoare triple {29834#(<= 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); {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,911 INFO L273 TraceCheckUtils]: 101: Hoare triple {29834#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29834#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:44,912 INFO L273 TraceCheckUtils]: 102: Hoare triple {29834#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,912 INFO L273 TraceCheckUtils]: 103: Hoare triple {29835#(<= 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); {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,913 INFO L273 TraceCheckUtils]: 104: Hoare triple {29835#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29835#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:44,914 INFO L273 TraceCheckUtils]: 105: Hoare triple {29835#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,914 INFO L273 TraceCheckUtils]: 106: Hoare triple {29836#(<= 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); {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,914 INFO L273 TraceCheckUtils]: 107: Hoare triple {29836#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29836#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:44,915 INFO L273 TraceCheckUtils]: 108: Hoare triple {29836#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,916 INFO L273 TraceCheckUtils]: 109: Hoare triple {29837#(<= 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); {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,916 INFO L273 TraceCheckUtils]: 110: Hoare triple {29837#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29837#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:44,917 INFO L273 TraceCheckUtils]: 111: Hoare triple {29837#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,917 INFO L273 TraceCheckUtils]: 112: Hoare triple {29838#(<= 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); {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,918 INFO L273 TraceCheckUtils]: 113: Hoare triple {29838#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {29838#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:44,918 INFO L273 TraceCheckUtils]: 114: Hoare triple {29838#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {29839#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:44,919 INFO L273 TraceCheckUtils]: 115: Hoare triple {29839#(<= main_~k~0 36)} assume !(~k~0 < 100000); {29801#false} is VALID [2018-11-23 11:53:44,919 INFO L273 TraceCheckUtils]: 116: Hoare triple {29801#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); {29801#false} is VALID [2018-11-23 11:53:44,919 INFO L273 TraceCheckUtils]: 117: Hoare triple {29801#false} ~x~0 := 0; {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L273 TraceCheckUtils]: 118: Hoare triple {29801#false} assume !(~x~0 < ~i~0); {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L273 TraceCheckUtils]: 119: Hoare triple {29801#false} ~x~0 := 1 + ~i~0; {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L273 TraceCheckUtils]: 120: Hoare triple {29801#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); {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L256 TraceCheckUtils]: 121: Hoare triple {29801#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L273 TraceCheckUtils]: 122: Hoare triple {29801#false} ~cond := #in~cond; {29801#false} is VALID [2018-11-23 11:53:44,920 INFO L273 TraceCheckUtils]: 123: Hoare triple {29801#false} assume 0 == ~cond; {29801#false} is VALID [2018-11-23 11:53:44,921 INFO L273 TraceCheckUtils]: 124: Hoare triple {29801#false} assume !false; {29801#false} is VALID [2018-11-23 11:53:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:44,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:44,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2018-11-23 11:53:44,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 125 [2018-11-23 11:53:44,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:44,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:53:45,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:45,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:53:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:53:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:53:45,073 INFO L87 Difference]: Start difference. First operand 153 states and 201 transitions. Second operand 42 states. [2018-11-23 11:53:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,505 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2018-11-23 11:53:47,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:53:47,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 125 [2018-11-23 11:53:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 255 transitions. [2018-11-23 11:53:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 255 transitions. [2018-11-23 11:53:47,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 255 transitions. [2018-11-23 11:53:47,738 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-23 11:53:47,742 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:53:47,742 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 11:53:47,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-11-23 11:53:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 11:53:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-11-23 11:53:47,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:47,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 156 states. [2018-11-23 11:53:47,852 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 156 states. [2018-11-23 11:53:47,852 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 156 states. [2018-11-23 11:53:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,855 INFO L93 Difference]: Finished difference Result 164 states and 216 transitions. [2018-11-23 11:53:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 216 transitions. [2018-11-23 11:53:47,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,856 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 164 states. [2018-11-23 11:53:47,856 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 164 states. [2018-11-23 11:53:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,858 INFO L93 Difference]: Finished difference Result 164 states and 216 transitions. [2018-11-23 11:53:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 216 transitions. [2018-11-23 11:53:47,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:47,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:53:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 205 transitions. [2018-11-23 11:53:47,861 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 205 transitions. Word has length 125 [2018-11-23 11:53:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:47,861 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 205 transitions. [2018-11-23 11:53:47,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:53:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 205 transitions. [2018-11-23 11:53:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 11:53:47,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:47,862 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:47,862 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2004100320, now seen corresponding path program 26 times [2018-11-23 11:53:47,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:47,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:48,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {31098#true} call ULTIMATE.init(); {31098#true} is VALID [2018-11-23 11:53:48,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {31098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31098#true} is VALID [2018-11-23 11:53:48,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {31098#true} assume true; {31098#true} is VALID [2018-11-23 11:53:48,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31098#true} {31098#true} #130#return; {31098#true} is VALID [2018-11-23 11:53:48,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {31098#true} call #t~ret15 := main(); {31098#true} is VALID [2018-11-23 11:53:48,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {31098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31100#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:48,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {31100#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {31101#(= main_~k~0 0)} is VALID [2018-11-23 11:53:48,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {31101#(= 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); {31101#(= main_~k~0 0)} is VALID [2018-11-23 11:53:48,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {31101#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31101#(= main_~k~0 0)} is VALID [2018-11-23 11:53:48,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {31101#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:48,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {31102#(<= 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); {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:48,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {31102#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:48,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {31102#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:48,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {31103#(<= 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); {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:48,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {31103#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:48,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {31103#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:48,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {31104#(<= 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); {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:48,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {31104#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:48,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {31104#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:48,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {31105#(<= 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); {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:48,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {31105#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:48,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {31105#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:48,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {31106#(<= 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); {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:48,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {31106#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:48,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {31106#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:48,750 INFO L273 TraceCheckUtils]: 25: Hoare triple {31107#(<= 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); {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:48,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {31107#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:48,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {31107#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:48,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {31108#(<= 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); {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:48,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {31108#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:48,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {31108#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:48,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {31109#(<= 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); {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:48,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {31109#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:48,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {31109#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:48,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {31110#(<= 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); {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:48,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {31110#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:48,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {31110#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:48,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {31111#(<= 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); {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:48,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {31111#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:48,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {31111#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:48,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {31112#(<= 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); {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:48,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {31112#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:48,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {31112#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:48,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {31113#(<= 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); {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:48,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {31113#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:48,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {31113#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:48,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {31114#(<= 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); {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:48,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {31114#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:48,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {31114#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:48,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {31115#(<= 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); {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:48,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {31115#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:48,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {31115#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:48,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {31116#(<= 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); {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:48,765 INFO L273 TraceCheckUtils]: 53: Hoare triple {31116#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:48,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {31116#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:48,766 INFO L273 TraceCheckUtils]: 55: Hoare triple {31117#(<= 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); {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:48,767 INFO L273 TraceCheckUtils]: 56: Hoare triple {31117#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:48,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {31117#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:48,768 INFO L273 TraceCheckUtils]: 58: Hoare triple {31118#(<= 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); {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:48,769 INFO L273 TraceCheckUtils]: 59: Hoare triple {31118#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:48,769 INFO L273 TraceCheckUtils]: 60: Hoare triple {31118#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:48,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {31119#(<= 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); {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:48,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {31119#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:48,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {31119#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:48,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {31120#(<= 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); {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:48,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {31120#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:48,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {31120#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:48,773 INFO L273 TraceCheckUtils]: 67: Hoare triple {31121#(<= 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); {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:48,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {31121#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:48,774 INFO L273 TraceCheckUtils]: 69: Hoare triple {31121#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:48,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {31122#(<= 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); {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:48,775 INFO L273 TraceCheckUtils]: 71: Hoare triple {31122#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:48,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {31122#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:48,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {31123#(<= 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); {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:48,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {31123#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:48,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {31123#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:48,778 INFO L273 TraceCheckUtils]: 76: Hoare triple {31124#(<= 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); {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:48,778 INFO L273 TraceCheckUtils]: 77: Hoare triple {31124#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:48,779 INFO L273 TraceCheckUtils]: 78: Hoare triple {31124#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:48,779 INFO L273 TraceCheckUtils]: 79: Hoare triple {31125#(<= 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); {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:48,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {31125#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:48,781 INFO L273 TraceCheckUtils]: 81: Hoare triple {31125#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:48,781 INFO L273 TraceCheckUtils]: 82: Hoare triple {31126#(<= 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); {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:48,783 INFO L273 TraceCheckUtils]: 83: Hoare triple {31126#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:48,784 INFO L273 TraceCheckUtils]: 84: Hoare triple {31126#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:48,785 INFO L273 TraceCheckUtils]: 85: Hoare triple {31127#(<= 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); {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:48,785 INFO L273 TraceCheckUtils]: 86: Hoare triple {31127#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:48,785 INFO L273 TraceCheckUtils]: 87: Hoare triple {31127#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:48,786 INFO L273 TraceCheckUtils]: 88: Hoare triple {31128#(<= 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); {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:48,786 INFO L273 TraceCheckUtils]: 89: Hoare triple {31128#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:48,786 INFO L273 TraceCheckUtils]: 90: Hoare triple {31128#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:48,787 INFO L273 TraceCheckUtils]: 91: Hoare triple {31129#(<= 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); {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:48,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {31129#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:48,788 INFO L273 TraceCheckUtils]: 93: Hoare triple {31129#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:48,788 INFO L273 TraceCheckUtils]: 94: Hoare triple {31130#(<= 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); {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:48,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {31130#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:48,790 INFO L273 TraceCheckUtils]: 96: Hoare triple {31130#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:48,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {31131#(<= 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); {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:48,791 INFO L273 TraceCheckUtils]: 98: Hoare triple {31131#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:48,791 INFO L273 TraceCheckUtils]: 99: Hoare triple {31131#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:48,792 INFO L273 TraceCheckUtils]: 100: Hoare triple {31132#(<= 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); {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:48,792 INFO L273 TraceCheckUtils]: 101: Hoare triple {31132#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:48,793 INFO L273 TraceCheckUtils]: 102: Hoare triple {31132#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:48,793 INFO L273 TraceCheckUtils]: 103: Hoare triple {31133#(<= 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); {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:48,794 INFO L273 TraceCheckUtils]: 104: Hoare triple {31133#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:48,794 INFO L273 TraceCheckUtils]: 105: Hoare triple {31133#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:48,795 INFO L273 TraceCheckUtils]: 106: Hoare triple {31134#(<= 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); {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:48,795 INFO L273 TraceCheckUtils]: 107: Hoare triple {31134#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:48,796 INFO L273 TraceCheckUtils]: 108: Hoare triple {31134#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:48,797 INFO L273 TraceCheckUtils]: 109: Hoare triple {31135#(<= 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); {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:48,797 INFO L273 TraceCheckUtils]: 110: Hoare triple {31135#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:48,798 INFO L273 TraceCheckUtils]: 111: Hoare triple {31135#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:48,798 INFO L273 TraceCheckUtils]: 112: Hoare triple {31136#(<= 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); {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:48,799 INFO L273 TraceCheckUtils]: 113: Hoare triple {31136#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:48,799 INFO L273 TraceCheckUtils]: 114: Hoare triple {31136#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:48,820 INFO L273 TraceCheckUtils]: 115: Hoare triple {31137#(<= 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); {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:48,834 INFO L273 TraceCheckUtils]: 116: Hoare triple {31137#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:48,843 INFO L273 TraceCheckUtils]: 117: Hoare triple {31137#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {31138#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:48,846 INFO L273 TraceCheckUtils]: 118: Hoare triple {31138#(<= main_~k~0 37)} assume !(~k~0 < 100000); {31099#false} is VALID [2018-11-23 11:53:48,846 INFO L273 TraceCheckUtils]: 119: Hoare triple {31099#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); {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 120: Hoare triple {31099#false} ~x~0 := 0; {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 121: Hoare triple {31099#false} assume !(~x~0 < ~i~0); {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 122: Hoare triple {31099#false} ~x~0 := 1 + ~i~0; {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 123: Hoare triple {31099#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); {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L256 TraceCheckUtils]: 124: Hoare triple {31099#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 125: Hoare triple {31099#false} ~cond := #in~cond; {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 126: Hoare triple {31099#false} assume 0 == ~cond; {31099#false} is VALID [2018-11-23 11:53:48,847 INFO L273 TraceCheckUtils]: 127: Hoare triple {31099#false} assume !false; {31099#false} is VALID [2018-11-23 11:53:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:48,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:48,859 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-23 11:53:48,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:48,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:48,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:48,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:49,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {31098#true} call ULTIMATE.init(); {31098#true} is VALID [2018-11-23 11:53:49,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {31098#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31098#true} is VALID [2018-11-23 11:53:49,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {31098#true} assume true; {31098#true} is VALID [2018-11-23 11:53:49,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31098#true} {31098#true} #130#return; {31098#true} is VALID [2018-11-23 11:53:49,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {31098#true} call #t~ret15 := main(); {31098#true} is VALID [2018-11-23 11:53:49,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {31098#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {31157#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:49,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {31157#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {31161#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:49,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {31161#(<= 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); {31161#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:49,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {31161#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31161#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:49,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {31161#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {31102#(<= 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); {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {31102#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {31102#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:49,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {31102#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {31103#(<= 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); {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {31103#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31103#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:49,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {31103#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {31104#(<= 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); {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {31104#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31104#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:49,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {31104#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {31105#(<= 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); {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {31105#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31105#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:49,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {31105#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {31106#(<= 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); {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {31106#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31106#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:49,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {31106#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {31107#(<= 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); {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {31107#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31107#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:49,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {31107#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {31108#(<= 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); {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {31108#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31108#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:49,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {31108#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {31109#(<= 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); {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {31109#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31109#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:49,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {31109#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {31110#(<= 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); {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {31110#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31110#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:49,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {31110#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {31111#(<= 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); {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {31111#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31111#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:49,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {31111#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {31112#(<= 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); {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {31112#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31112#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:49,261 INFO L273 TraceCheckUtils]: 42: Hoare triple {31112#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {31113#(<= 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); {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,262 INFO L273 TraceCheckUtils]: 44: Hoare triple {31113#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31113#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 45: Hoare triple {31113#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,263 INFO L273 TraceCheckUtils]: 46: Hoare triple {31114#(<= 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); {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {31114#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31114#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:49,264 INFO L273 TraceCheckUtils]: 48: Hoare triple {31114#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {31115#(<= 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); {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {31115#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31115#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:49,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {31115#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {31116#(<= 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); {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,267 INFO L273 TraceCheckUtils]: 53: Hoare triple {31116#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31116#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:49,268 INFO L273 TraceCheckUtils]: 54: Hoare triple {31116#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,268 INFO L273 TraceCheckUtils]: 55: Hoare triple {31117#(<= 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); {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,268 INFO L273 TraceCheckUtils]: 56: Hoare triple {31117#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31117#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:49,269 INFO L273 TraceCheckUtils]: 57: Hoare triple {31117#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,270 INFO L273 TraceCheckUtils]: 58: Hoare triple {31118#(<= 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); {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {31118#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31118#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:49,271 INFO L273 TraceCheckUtils]: 60: Hoare triple {31118#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,271 INFO L273 TraceCheckUtils]: 61: Hoare triple {31119#(<= 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); {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,272 INFO L273 TraceCheckUtils]: 62: Hoare triple {31119#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31119#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:49,272 INFO L273 TraceCheckUtils]: 63: Hoare triple {31119#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {31120#(<= 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); {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,273 INFO L273 TraceCheckUtils]: 65: Hoare triple {31120#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31120#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:49,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {31120#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {31121#(<= 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); {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {31121#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31121#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:49,276 INFO L273 TraceCheckUtils]: 69: Hoare triple {31121#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {31122#(<= 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); {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {31122#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31122#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:49,277 INFO L273 TraceCheckUtils]: 72: Hoare triple {31122#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,278 INFO L273 TraceCheckUtils]: 73: Hoare triple {31123#(<= 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); {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {31123#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31123#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:49,279 INFO L273 TraceCheckUtils]: 75: Hoare triple {31123#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,279 INFO L273 TraceCheckUtils]: 76: Hoare triple {31124#(<= 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); {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,280 INFO L273 TraceCheckUtils]: 77: Hoare triple {31124#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31124#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:49,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {31124#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,281 INFO L273 TraceCheckUtils]: 79: Hoare triple {31125#(<= 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); {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,281 INFO L273 TraceCheckUtils]: 80: Hoare triple {31125#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31125#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:49,282 INFO L273 TraceCheckUtils]: 81: Hoare triple {31125#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,282 INFO L273 TraceCheckUtils]: 82: Hoare triple {31126#(<= 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); {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {31126#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31126#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:49,284 INFO L273 TraceCheckUtils]: 84: Hoare triple {31126#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,284 INFO L273 TraceCheckUtils]: 85: Hoare triple {31127#(<= 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); {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,285 INFO L273 TraceCheckUtils]: 86: Hoare triple {31127#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31127#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:49,285 INFO L273 TraceCheckUtils]: 87: Hoare triple {31127#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,286 INFO L273 TraceCheckUtils]: 88: Hoare triple {31128#(<= 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); {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,286 INFO L273 TraceCheckUtils]: 89: Hoare triple {31128#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31128#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:49,287 INFO L273 TraceCheckUtils]: 90: Hoare triple {31128#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,287 INFO L273 TraceCheckUtils]: 91: Hoare triple {31129#(<= 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); {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {31129#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31129#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:49,288 INFO L273 TraceCheckUtils]: 93: Hoare triple {31129#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:49,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {31130#(<= 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); {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:49,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {31130#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31130#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:49,290 INFO L273 TraceCheckUtils]: 96: Hoare triple {31130#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:49,291 INFO L273 TraceCheckUtils]: 97: Hoare triple {31131#(<= 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); {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:49,291 INFO L273 TraceCheckUtils]: 98: Hoare triple {31131#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31131#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:49,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {31131#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:49,292 INFO L273 TraceCheckUtils]: 100: Hoare triple {31132#(<= 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); {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:49,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {31132#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31132#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:49,293 INFO L273 TraceCheckUtils]: 102: Hoare triple {31132#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:49,294 INFO L273 TraceCheckUtils]: 103: Hoare triple {31133#(<= 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); {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:49,294 INFO L273 TraceCheckUtils]: 104: Hoare triple {31133#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31133#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:49,295 INFO L273 TraceCheckUtils]: 105: Hoare triple {31133#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:49,295 INFO L273 TraceCheckUtils]: 106: Hoare triple {31134#(<= 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); {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:49,296 INFO L273 TraceCheckUtils]: 107: Hoare triple {31134#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31134#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:49,297 INFO L273 TraceCheckUtils]: 108: Hoare triple {31134#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:49,297 INFO L273 TraceCheckUtils]: 109: Hoare triple {31135#(<= 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); {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:49,297 INFO L273 TraceCheckUtils]: 110: Hoare triple {31135#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31135#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:49,298 INFO L273 TraceCheckUtils]: 111: Hoare triple {31135#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:49,299 INFO L273 TraceCheckUtils]: 112: Hoare triple {31136#(<= 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); {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:49,299 INFO L273 TraceCheckUtils]: 113: Hoare triple {31136#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31136#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:49,300 INFO L273 TraceCheckUtils]: 114: Hoare triple {31136#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:49,300 INFO L273 TraceCheckUtils]: 115: Hoare triple {31137#(<= 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); {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:49,302 INFO L273 TraceCheckUtils]: 116: Hoare triple {31137#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {31137#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:49,302 INFO L273 TraceCheckUtils]: 117: Hoare triple {31137#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {31138#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:49,303 INFO L273 TraceCheckUtils]: 118: Hoare triple {31138#(<= main_~k~0 37)} assume !(~k~0 < 100000); {31099#false} is VALID [2018-11-23 11:53:49,303 INFO L273 TraceCheckUtils]: 119: Hoare triple {31099#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); {31099#false} is VALID [2018-11-23 11:53:49,303 INFO L273 TraceCheckUtils]: 120: Hoare triple {31099#false} ~x~0 := 0; {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L273 TraceCheckUtils]: 121: Hoare triple {31099#false} assume !(~x~0 < ~i~0); {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L273 TraceCheckUtils]: 122: Hoare triple {31099#false} ~x~0 := 1 + ~i~0; {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L273 TraceCheckUtils]: 123: Hoare triple {31099#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); {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L256 TraceCheckUtils]: 124: Hoare triple {31099#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L273 TraceCheckUtils]: 125: Hoare triple {31099#false} ~cond := #in~cond; {31099#false} is VALID [2018-11-23 11:53:49,304 INFO L273 TraceCheckUtils]: 126: Hoare triple {31099#false} assume 0 == ~cond; {31099#false} is VALID [2018-11-23 11:53:49,305 INFO L273 TraceCheckUtils]: 127: Hoare triple {31099#false} assume !false; {31099#false} is VALID [2018-11-23 11:53:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:49,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:49,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2018-11-23 11:53:49,336 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 128 [2018-11-23 11:53:49,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:49,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:53:49,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:49,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:53:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:53:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:53:49,506 INFO L87 Difference]: Start difference. First operand 156 states and 205 transitions. Second operand 43 states. [2018-11-23 11:53:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:52,676 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2018-11-23 11:53:52,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:53:52,677 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 128 [2018-11-23 11:53:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 259 transitions. [2018-11-23 11:53:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 259 transitions. [2018-11-23 11:53:52,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 259 transitions. [2018-11-23 11:53:52,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:52,918 INFO L225 Difference]: With dead ends: 201 [2018-11-23 11:53:52,918 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:53:52,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-11-23 11:53:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:53:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2018-11-23 11:53:53,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:53,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 159 states. [2018-11-23 11:53:53,063 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 159 states. [2018-11-23 11:53:53,063 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 159 states. [2018-11-23 11:53:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,066 INFO L93 Difference]: Finished difference Result 167 states and 220 transitions. [2018-11-23 11:53:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2018-11-23 11:53:53,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:53,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:53,067 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 167 states. [2018-11-23 11:53:53,067 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 167 states. [2018-11-23 11:53:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,069 INFO L93 Difference]: Finished difference Result 167 states and 220 transitions. [2018-11-23 11:53:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2018-11-23 11:53:53,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:53,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:53,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:53,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:53:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2018-11-23 11:53:53,072 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 128 [2018-11-23 11:53:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:53,072 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2018-11-23 11:53:53,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:53:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2018-11-23 11:53:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 11:53:53,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:53,073 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:53,073 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:53,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 253977943, now seen corresponding path program 27 times [2018-11-23 11:53:53,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:53,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:53,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {32422#true} call ULTIMATE.init(); {32422#true} is VALID [2018-11-23 11:53:53,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {32422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32422#true} is VALID [2018-11-23 11:53:53,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {32422#true} assume true; {32422#true} is VALID [2018-11-23 11:53:53,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32422#true} {32422#true} #130#return; {32422#true} is VALID [2018-11-23 11:53:53,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {32422#true} call #t~ret15 := main(); {32422#true} is VALID [2018-11-23 11:53:53,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {32422#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32424#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:53,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {32424#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {32425#(= main_~k~0 0)} is VALID [2018-11-23 11:53:53,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {32425#(= 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); {32425#(= main_~k~0 0)} is VALID [2018-11-23 11:53:53,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {32425#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32425#(= main_~k~0 0)} is VALID [2018-11-23 11:53:53,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {32425#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:53,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {32426#(<= 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); {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:53,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {32426#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:53,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {32426#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:53,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {32427#(<= 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); {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:53,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {32427#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:53,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {32427#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:53,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {32428#(<= 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); {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:53,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {32428#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:53,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {32428#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:53,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {32429#(<= 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); {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:53,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {32429#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:53,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {32429#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:53,988 INFO L273 TraceCheckUtils]: 22: Hoare triple {32430#(<= 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); {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:53,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {32430#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:53,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {32430#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:53,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {32431#(<= 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); {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:53,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {32431#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:53,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {32431#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:53,992 INFO L273 TraceCheckUtils]: 28: Hoare triple {32432#(<= 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); {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:53,992 INFO L273 TraceCheckUtils]: 29: Hoare triple {32432#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:53,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {32432#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:53,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {32433#(<= 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); {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:53,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {32433#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:53,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {32433#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:53,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {32434#(<= 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); {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:53,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {32434#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:53,996 INFO L273 TraceCheckUtils]: 36: Hoare triple {32434#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:53,996 INFO L273 TraceCheckUtils]: 37: Hoare triple {32435#(<= 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); {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:53,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {32435#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:53,998 INFO L273 TraceCheckUtils]: 39: Hoare triple {32435#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:53,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {32436#(<= 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); {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:53,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {32436#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:53,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {32436#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {32437#(<= 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); {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {32437#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {32437#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {32438#(<= 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); {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,002 INFO L273 TraceCheckUtils]: 47: Hoare triple {32438#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {32438#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {32439#(<= 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); {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {32439#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {32439#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {32440#(<= 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); {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {32440#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {32440#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {32441#(<= 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); {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,007 INFO L273 TraceCheckUtils]: 56: Hoare triple {32441#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {32441#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {32442#(<= 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); {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {32442#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {32442#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {32443#(<= 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); {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {32443#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {32443#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {32444#(<= 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); {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {32444#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {32444#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {32445#(<= 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); {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {32445#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {32445#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {32446#(<= 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); {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,015 INFO L273 TraceCheckUtils]: 71: Hoare triple {32446#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {32446#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {32447#(<= 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); {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {32447#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {32447#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {32448#(<= 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); {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,018 INFO L273 TraceCheckUtils]: 77: Hoare triple {32448#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {32448#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {32449#(<= 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); {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {32449#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {32449#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {32450#(<= 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); {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {32450#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {32450#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {32451#(<= 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); {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {32451#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,023 INFO L273 TraceCheckUtils]: 87: Hoare triple {32451#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {32452#(<= 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); {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,024 INFO L273 TraceCheckUtils]: 89: Hoare triple {32452#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,025 INFO L273 TraceCheckUtils]: 90: Hoare triple {32452#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,025 INFO L273 TraceCheckUtils]: 91: Hoare triple {32453#(<= 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); {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,026 INFO L273 TraceCheckUtils]: 92: Hoare triple {32453#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,027 INFO L273 TraceCheckUtils]: 93: Hoare triple {32453#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,027 INFO L273 TraceCheckUtils]: 94: Hoare triple {32454#(<= 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); {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,027 INFO L273 TraceCheckUtils]: 95: Hoare triple {32454#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,028 INFO L273 TraceCheckUtils]: 96: Hoare triple {32454#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {32455#(<= 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); {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,029 INFO L273 TraceCheckUtils]: 98: Hoare triple {32455#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {32455#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,030 INFO L273 TraceCheckUtils]: 100: Hoare triple {32456#(<= 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); {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,031 INFO L273 TraceCheckUtils]: 101: Hoare triple {32456#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,031 INFO L273 TraceCheckUtils]: 102: Hoare triple {32456#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,032 INFO L273 TraceCheckUtils]: 103: Hoare triple {32457#(<= 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); {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,032 INFO L273 TraceCheckUtils]: 104: Hoare triple {32457#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,033 INFO L273 TraceCheckUtils]: 105: Hoare triple {32457#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,033 INFO L273 TraceCheckUtils]: 106: Hoare triple {32458#(<= 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); {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,034 INFO L273 TraceCheckUtils]: 107: Hoare triple {32458#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,034 INFO L273 TraceCheckUtils]: 108: Hoare triple {32458#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,035 INFO L273 TraceCheckUtils]: 109: Hoare triple {32459#(<= 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); {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,035 INFO L273 TraceCheckUtils]: 110: Hoare triple {32459#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {32459#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,037 INFO L273 TraceCheckUtils]: 112: Hoare triple {32460#(<= 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); {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,037 INFO L273 TraceCheckUtils]: 113: Hoare triple {32460#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,038 INFO L273 TraceCheckUtils]: 114: Hoare triple {32460#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,038 INFO L273 TraceCheckUtils]: 115: Hoare triple {32461#(<= 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); {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,058 INFO L273 TraceCheckUtils]: 116: Hoare triple {32461#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,071 INFO L273 TraceCheckUtils]: 117: Hoare triple {32461#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,086 INFO L273 TraceCheckUtils]: 118: Hoare triple {32462#(<= 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); {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,092 INFO L273 TraceCheckUtils]: 119: Hoare triple {32462#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,092 INFO L273 TraceCheckUtils]: 120: Hoare triple {32462#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {32463#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 121: Hoare triple {32463#(<= main_~k~0 38)} assume !(~k~0 < 100000); {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 122: Hoare triple {32423#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); {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 123: Hoare triple {32423#false} ~x~0 := 0; {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 124: Hoare triple {32423#false} assume !(~x~0 < ~i~0); {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 125: Hoare triple {32423#false} ~x~0 := 1 + ~i~0; {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 126: Hoare triple {32423#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); {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L256 TraceCheckUtils]: 127: Hoare triple {32423#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32423#false} is VALID [2018-11-23 11:53:54,093 INFO L273 TraceCheckUtils]: 128: Hoare triple {32423#false} ~cond := #in~cond; {32423#false} is VALID [2018-11-23 11:53:54,094 INFO L273 TraceCheckUtils]: 129: Hoare triple {32423#false} assume 0 == ~cond; {32423#false} is VALID [2018-11-23 11:53:54,094 INFO L273 TraceCheckUtils]: 130: Hoare triple {32423#false} assume !false; {32423#false} is VALID [2018-11-23 11:53:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:54,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:54,106 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-23 11:53:54,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:54,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-23 11:53:54,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:54,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:54,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {32422#true} call ULTIMATE.init(); {32422#true} is VALID [2018-11-23 11:53:54,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {32422#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32422#true} is VALID [2018-11-23 11:53:54,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {32422#true} assume true; {32422#true} is VALID [2018-11-23 11:53:54,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32422#true} {32422#true} #130#return; {32422#true} is VALID [2018-11-23 11:53:54,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {32422#true} call #t~ret15 := main(); {32422#true} is VALID [2018-11-23 11:53:54,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {32422#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {32482#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:54,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {32482#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {32486#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:54,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {32486#(<= 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); {32486#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:54,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {32486#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32486#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:54,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {32486#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:54,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {32426#(<= 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); {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:54,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {32426#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {32426#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:54,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {32426#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:54,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {32427#(<= 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); {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:54,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {32427#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32427#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:54,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {32427#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:54,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {32428#(<= 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); {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:54,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {32428#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32428#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:54,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {32428#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:54,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {32429#(<= 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); {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:54,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {32429#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32429#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:54,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {32429#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:54,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {32430#(<= 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); {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:54,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {32430#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32430#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:54,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {32430#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:54,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {32431#(<= 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); {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:54,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {32431#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32431#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:54,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {32431#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:54,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {32432#(<= 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); {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:54,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {32432#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32432#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:54,718 INFO L273 TraceCheckUtils]: 30: Hoare triple {32432#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:54,718 INFO L273 TraceCheckUtils]: 31: Hoare triple {32433#(<= 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); {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:54,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {32433#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32433#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:54,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {32433#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:54,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {32434#(<= 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); {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:54,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {32434#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32434#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:54,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {32434#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:54,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {32435#(<= 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); {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:54,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {32435#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32435#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:54,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {32435#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:54,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {32436#(<= 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); {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:54,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {32436#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32436#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:54,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {32436#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {32437#(<= 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); {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {32437#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32437#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:54,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {32437#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {32438#(<= 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); {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {32438#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32438#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:54,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {32438#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {32439#(<= 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); {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {32439#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32439#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:54,758 INFO L273 TraceCheckUtils]: 51: Hoare triple {32439#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {32440#(<= 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); {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,759 INFO L273 TraceCheckUtils]: 53: Hoare triple {32440#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32440#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:54,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {32440#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {32441#(<= 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); {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {32441#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32441#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:54,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {32441#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,761 INFO L273 TraceCheckUtils]: 58: Hoare triple {32442#(<= 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); {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,762 INFO L273 TraceCheckUtils]: 59: Hoare triple {32442#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32442#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:54,762 INFO L273 TraceCheckUtils]: 60: Hoare triple {32442#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {32443#(<= 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); {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {32443#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32443#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:54,764 INFO L273 TraceCheckUtils]: 63: Hoare triple {32443#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {32444#(<= 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); {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {32444#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32444#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:54,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {32444#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,766 INFO L273 TraceCheckUtils]: 67: Hoare triple {32445#(<= 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); {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {32445#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32445#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:54,767 INFO L273 TraceCheckUtils]: 69: Hoare triple {32445#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,768 INFO L273 TraceCheckUtils]: 70: Hoare triple {32446#(<= 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); {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,768 INFO L273 TraceCheckUtils]: 71: Hoare triple {32446#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32446#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:54,769 INFO L273 TraceCheckUtils]: 72: Hoare triple {32446#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,770 INFO L273 TraceCheckUtils]: 73: Hoare triple {32447#(<= 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); {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,770 INFO L273 TraceCheckUtils]: 74: Hoare triple {32447#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32447#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:54,771 INFO L273 TraceCheckUtils]: 75: Hoare triple {32447#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,771 INFO L273 TraceCheckUtils]: 76: Hoare triple {32448#(<= 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); {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,772 INFO L273 TraceCheckUtils]: 77: Hoare triple {32448#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32448#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:54,772 INFO L273 TraceCheckUtils]: 78: Hoare triple {32448#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,773 INFO L273 TraceCheckUtils]: 79: Hoare triple {32449#(<= 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); {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,773 INFO L273 TraceCheckUtils]: 80: Hoare triple {32449#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32449#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:54,774 INFO L273 TraceCheckUtils]: 81: Hoare triple {32449#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,775 INFO L273 TraceCheckUtils]: 82: Hoare triple {32450#(<= 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); {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,775 INFO L273 TraceCheckUtils]: 83: Hoare triple {32450#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32450#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:54,776 INFO L273 TraceCheckUtils]: 84: Hoare triple {32450#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,776 INFO L273 TraceCheckUtils]: 85: Hoare triple {32451#(<= 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); {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,777 INFO L273 TraceCheckUtils]: 86: Hoare triple {32451#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32451#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:54,777 INFO L273 TraceCheckUtils]: 87: Hoare triple {32451#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,778 INFO L273 TraceCheckUtils]: 88: Hoare triple {32452#(<= 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); {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,778 INFO L273 TraceCheckUtils]: 89: Hoare triple {32452#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32452#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:54,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {32452#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,779 INFO L273 TraceCheckUtils]: 91: Hoare triple {32453#(<= 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); {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {32453#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32453#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:54,781 INFO L273 TraceCheckUtils]: 93: Hoare triple {32453#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,781 INFO L273 TraceCheckUtils]: 94: Hoare triple {32454#(<= 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); {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,782 INFO L273 TraceCheckUtils]: 95: Hoare triple {32454#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32454#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:54,782 INFO L273 TraceCheckUtils]: 96: Hoare triple {32454#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,783 INFO L273 TraceCheckUtils]: 97: Hoare triple {32455#(<= 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); {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,783 INFO L273 TraceCheckUtils]: 98: Hoare triple {32455#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32455#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:54,784 INFO L273 TraceCheckUtils]: 99: Hoare triple {32455#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,784 INFO L273 TraceCheckUtils]: 100: Hoare triple {32456#(<= 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); {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,785 INFO L273 TraceCheckUtils]: 101: Hoare triple {32456#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32456#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:54,786 INFO L273 TraceCheckUtils]: 102: Hoare triple {32456#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,786 INFO L273 TraceCheckUtils]: 103: Hoare triple {32457#(<= 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); {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,787 INFO L273 TraceCheckUtils]: 104: Hoare triple {32457#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32457#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:54,787 INFO L273 TraceCheckUtils]: 105: Hoare triple {32457#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,788 INFO L273 TraceCheckUtils]: 106: Hoare triple {32458#(<= 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); {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,788 INFO L273 TraceCheckUtils]: 107: Hoare triple {32458#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32458#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:54,789 INFO L273 TraceCheckUtils]: 108: Hoare triple {32458#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,789 INFO L273 TraceCheckUtils]: 109: Hoare triple {32459#(<= 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); {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {32459#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32459#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:54,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {32459#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {32460#(<= 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); {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,792 INFO L273 TraceCheckUtils]: 113: Hoare triple {32460#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32460#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:54,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {32460#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,793 INFO L273 TraceCheckUtils]: 115: Hoare triple {32461#(<= 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); {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,793 INFO L273 TraceCheckUtils]: 116: Hoare triple {32461#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32461#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:54,794 INFO L273 TraceCheckUtils]: 117: Hoare triple {32461#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,794 INFO L273 TraceCheckUtils]: 118: Hoare triple {32462#(<= 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); {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,795 INFO L273 TraceCheckUtils]: 119: Hoare triple {32462#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {32462#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:54,795 INFO L273 TraceCheckUtils]: 120: Hoare triple {32462#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {32463#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:54,796 INFO L273 TraceCheckUtils]: 121: Hoare triple {32463#(<= main_~k~0 38)} assume !(~k~0 < 100000); {32423#false} is VALID [2018-11-23 11:53:54,796 INFO L273 TraceCheckUtils]: 122: Hoare triple {32423#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); {32423#false} is VALID [2018-11-23 11:53:54,796 INFO L273 TraceCheckUtils]: 123: Hoare triple {32423#false} ~x~0 := 0; {32423#false} is VALID [2018-11-23 11:53:54,797 INFO L273 TraceCheckUtils]: 124: Hoare triple {32423#false} assume !(~x~0 < ~i~0); {32423#false} is VALID [2018-11-23 11:53:54,797 INFO L273 TraceCheckUtils]: 125: Hoare triple {32423#false} ~x~0 := 1 + ~i~0; {32423#false} is VALID [2018-11-23 11:53:54,797 INFO L273 TraceCheckUtils]: 126: Hoare triple {32423#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); {32423#false} is VALID [2018-11-23 11:53:54,797 INFO L256 TraceCheckUtils]: 127: Hoare triple {32423#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {32423#false} is VALID [2018-11-23 11:53:54,797 INFO L273 TraceCheckUtils]: 128: Hoare triple {32423#false} ~cond := #in~cond; {32423#false} is VALID [2018-11-23 11:53:54,798 INFO L273 TraceCheckUtils]: 129: Hoare triple {32423#false} assume 0 == ~cond; {32423#false} is VALID [2018-11-23 11:53:54,798 INFO L273 TraceCheckUtils]: 130: Hoare triple {32423#false} assume !false; {32423#false} is VALID [2018-11-23 11:53:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2018-11-23 11:53:54,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 131 [2018-11-23 11:53:54,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:54,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:53:54,991 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-23 11:53:54,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:53:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:53:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:53:54,992 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand 44 states. [2018-11-23 11:53:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,497 INFO L93 Difference]: Finished difference Result 204 states and 270 transitions. [2018-11-23 11:53:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:53:57,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 131 [2018-11-23 11:53:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 263 transitions. [2018-11-23 11:53:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 263 transitions. [2018-11-23 11:53:57,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 263 transitions. [2018-11-23 11:53:57,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:57,743 INFO L225 Difference]: With dead ends: 204 [2018-11-23 11:53:57,744 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 11:53:57,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-11-23 11:53:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 11:53:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2018-11-23 11:53:57,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:57,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 162 states. [2018-11-23 11:53:57,864 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 162 states. [2018-11-23 11:53:57,864 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 162 states. [2018-11-23 11:53:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,867 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2018-11-23 11:53:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2018-11-23 11:53:57,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:57,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:57,867 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 170 states. [2018-11-23 11:53:57,867 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 170 states. [2018-11-23 11:53:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:57,870 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2018-11-23 11:53:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2018-11-23 11:53:57,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:57,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:57,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:57,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:53:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2018-11-23 11:53:57,874 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 213 transitions. Word has length 131 [2018-11-23 11:53:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:57,874 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 213 transitions. [2018-11-23 11:53:57,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:53:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2018-11-23 11:53:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 11:53:57,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:57,875 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:57,875 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1409246272, now seen corresponding path program 28 times [2018-11-23 11:53:57,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:57,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:58,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {33772#true} call ULTIMATE.init(); {33772#true} is VALID [2018-11-23 11:53:58,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {33772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33772#true} is VALID [2018-11-23 11:53:58,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {33772#true} assume true; {33772#true} is VALID [2018-11-23 11:53:58,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33772#true} {33772#true} #130#return; {33772#true} is VALID [2018-11-23 11:53:58,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {33772#true} call #t~ret15 := main(); {33772#true} is VALID [2018-11-23 11:53:58,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {33772#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33774#(= 0 main_~i~0)} is VALID [2018-11-23 11:53:58,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {33774#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {33775#(= main_~k~0 0)} is VALID [2018-11-23 11:53:58,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {33775#(= 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); {33775#(= main_~k~0 0)} is VALID [2018-11-23 11:53:58,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {33775#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33775#(= main_~k~0 0)} is VALID [2018-11-23 11:53:58,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {33775#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:58,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {33776#(<= 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); {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:58,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {33776#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:58,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {33776#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:58,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {33777#(<= 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); {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:58,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {33777#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:58,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {33777#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:58,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {33778#(<= 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); {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:58,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {33778#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:58,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {33778#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:58,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {33779#(<= 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); {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:58,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {33779#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:58,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {33779#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:58,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {33780#(<= 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); {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:58,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {33780#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:58,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {33780#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:58,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {33781#(<= 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); {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:58,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {33781#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:58,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {33781#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:58,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {33782#(<= 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); {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:58,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {33782#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:58,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {33782#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:58,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {33783#(<= 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); {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:58,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {33783#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:58,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {33783#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:58,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {33784#(<= 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); {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:58,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {33784#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:58,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {33784#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:58,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {33785#(<= 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); {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:58,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {33785#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:58,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {33785#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:58,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {33786#(<= 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); {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:58,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {33786#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:58,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {33786#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:58,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {33787#(<= 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); {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:58,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {33787#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:58,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {33787#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:58,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {33788#(<= 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); {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:58,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {33788#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:58,848 INFO L273 TraceCheckUtils]: 48: Hoare triple {33788#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:58,848 INFO L273 TraceCheckUtils]: 49: Hoare triple {33789#(<= 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); {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:58,849 INFO L273 TraceCheckUtils]: 50: Hoare triple {33789#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:58,849 INFO L273 TraceCheckUtils]: 51: Hoare triple {33789#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:58,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {33790#(<= 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); {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:58,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {33790#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:58,851 INFO L273 TraceCheckUtils]: 54: Hoare triple {33790#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:58,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {33791#(<= 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); {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:58,852 INFO L273 TraceCheckUtils]: 56: Hoare triple {33791#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:58,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {33791#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:58,853 INFO L273 TraceCheckUtils]: 58: Hoare triple {33792#(<= 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); {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:58,854 INFO L273 TraceCheckUtils]: 59: Hoare triple {33792#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:58,854 INFO L273 TraceCheckUtils]: 60: Hoare triple {33792#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 61: Hoare triple {33793#(<= 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); {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:58,855 INFO L273 TraceCheckUtils]: 62: Hoare triple {33793#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:58,856 INFO L273 TraceCheckUtils]: 63: Hoare triple {33793#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:58,856 INFO L273 TraceCheckUtils]: 64: Hoare triple {33794#(<= 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); {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:58,857 INFO L273 TraceCheckUtils]: 65: Hoare triple {33794#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:58,857 INFO L273 TraceCheckUtils]: 66: Hoare triple {33794#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:58,858 INFO L273 TraceCheckUtils]: 67: Hoare triple {33795#(<= 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); {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:58,858 INFO L273 TraceCheckUtils]: 68: Hoare triple {33795#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:58,859 INFO L273 TraceCheckUtils]: 69: Hoare triple {33795#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:58,860 INFO L273 TraceCheckUtils]: 70: Hoare triple {33796#(<= 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); {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:58,860 INFO L273 TraceCheckUtils]: 71: Hoare triple {33796#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:58,861 INFO L273 TraceCheckUtils]: 72: Hoare triple {33796#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:58,861 INFO L273 TraceCheckUtils]: 73: Hoare triple {33797#(<= 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); {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:58,862 INFO L273 TraceCheckUtils]: 74: Hoare triple {33797#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:58,862 INFO L273 TraceCheckUtils]: 75: Hoare triple {33797#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:58,863 INFO L273 TraceCheckUtils]: 76: Hoare triple {33798#(<= 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); {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:58,863 INFO L273 TraceCheckUtils]: 77: Hoare triple {33798#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:58,864 INFO L273 TraceCheckUtils]: 78: Hoare triple {33798#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:58,864 INFO L273 TraceCheckUtils]: 79: Hoare triple {33799#(<= 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); {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:58,865 INFO L273 TraceCheckUtils]: 80: Hoare triple {33799#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:58,866 INFO L273 TraceCheckUtils]: 81: Hoare triple {33799#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:58,866 INFO L273 TraceCheckUtils]: 82: Hoare triple {33800#(<= 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); {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:58,867 INFO L273 TraceCheckUtils]: 83: Hoare triple {33800#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:58,867 INFO L273 TraceCheckUtils]: 84: Hoare triple {33800#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:58,868 INFO L273 TraceCheckUtils]: 85: Hoare triple {33801#(<= 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); {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:58,868 INFO L273 TraceCheckUtils]: 86: Hoare triple {33801#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:58,869 INFO L273 TraceCheckUtils]: 87: Hoare triple {33801#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:58,869 INFO L273 TraceCheckUtils]: 88: Hoare triple {33802#(<= 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); {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:58,870 INFO L273 TraceCheckUtils]: 89: Hoare triple {33802#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:58,870 INFO L273 TraceCheckUtils]: 90: Hoare triple {33802#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:58,871 INFO L273 TraceCheckUtils]: 91: Hoare triple {33803#(<= 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); {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:58,871 INFO L273 TraceCheckUtils]: 92: Hoare triple {33803#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:58,872 INFO L273 TraceCheckUtils]: 93: Hoare triple {33803#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:58,873 INFO L273 TraceCheckUtils]: 94: Hoare triple {33804#(<= 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); {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:58,873 INFO L273 TraceCheckUtils]: 95: Hoare triple {33804#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:58,874 INFO L273 TraceCheckUtils]: 96: Hoare triple {33804#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:58,874 INFO L273 TraceCheckUtils]: 97: Hoare triple {33805#(<= 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); {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:58,875 INFO L273 TraceCheckUtils]: 98: Hoare triple {33805#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:58,875 INFO L273 TraceCheckUtils]: 99: Hoare triple {33805#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:58,876 INFO L273 TraceCheckUtils]: 100: Hoare triple {33806#(<= 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); {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:58,876 INFO L273 TraceCheckUtils]: 101: Hoare triple {33806#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:58,877 INFO L273 TraceCheckUtils]: 102: Hoare triple {33806#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:58,877 INFO L273 TraceCheckUtils]: 103: Hoare triple {33807#(<= 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); {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:58,878 INFO L273 TraceCheckUtils]: 104: Hoare triple {33807#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:58,879 INFO L273 TraceCheckUtils]: 105: Hoare triple {33807#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:58,879 INFO L273 TraceCheckUtils]: 106: Hoare triple {33808#(<= 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); {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:58,879 INFO L273 TraceCheckUtils]: 107: Hoare triple {33808#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:58,880 INFO L273 TraceCheckUtils]: 108: Hoare triple {33808#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:58,881 INFO L273 TraceCheckUtils]: 109: Hoare triple {33809#(<= 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); {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:58,881 INFO L273 TraceCheckUtils]: 110: Hoare triple {33809#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:58,882 INFO L273 TraceCheckUtils]: 111: Hoare triple {33809#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:58,882 INFO L273 TraceCheckUtils]: 112: Hoare triple {33810#(<= 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); {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:58,883 INFO L273 TraceCheckUtils]: 113: Hoare triple {33810#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:58,884 INFO L273 TraceCheckUtils]: 114: Hoare triple {33810#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:58,884 INFO L273 TraceCheckUtils]: 115: Hoare triple {33811#(<= 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); {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:58,885 INFO L273 TraceCheckUtils]: 116: Hoare triple {33811#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:58,885 INFO L273 TraceCheckUtils]: 117: Hoare triple {33811#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:58,886 INFO L273 TraceCheckUtils]: 118: Hoare triple {33812#(<= 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); {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:58,886 INFO L273 TraceCheckUtils]: 119: Hoare triple {33812#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:58,887 INFO L273 TraceCheckUtils]: 120: Hoare triple {33812#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:58,888 INFO L273 TraceCheckUtils]: 121: Hoare triple {33813#(<= 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); {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:58,888 INFO L273 TraceCheckUtils]: 122: Hoare triple {33813#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:58,889 INFO L273 TraceCheckUtils]: 123: Hoare triple {33813#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {33814#(<= main_~k~0 39)} is VALID [2018-11-23 11:53:58,889 INFO L273 TraceCheckUtils]: 124: Hoare triple {33814#(<= main_~k~0 39)} assume !(~k~0 < 100000); {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L273 TraceCheckUtils]: 125: Hoare triple {33773#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); {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L273 TraceCheckUtils]: 126: Hoare triple {33773#false} ~x~0 := 0; {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L273 TraceCheckUtils]: 127: Hoare triple {33773#false} assume !(~x~0 < ~i~0); {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L273 TraceCheckUtils]: 128: Hoare triple {33773#false} ~x~0 := 1 + ~i~0; {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L273 TraceCheckUtils]: 129: Hoare triple {33773#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); {33773#false} is VALID [2018-11-23 11:53:58,890 INFO L256 TraceCheckUtils]: 130: Hoare triple {33773#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33773#false} is VALID [2018-11-23 11:53:58,891 INFO L273 TraceCheckUtils]: 131: Hoare triple {33773#false} ~cond := #in~cond; {33773#false} is VALID [2018-11-23 11:53:58,891 INFO L273 TraceCheckUtils]: 132: Hoare triple {33773#false} assume 0 == ~cond; {33773#false} is VALID [2018-11-23 11:53:58,891 INFO L273 TraceCheckUtils]: 133: Hoare triple {33773#false} assume !false; {33773#false} is VALID [2018-11-23 11:53:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:58,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:58,904 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-23 11:53:58,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:58,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:58,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:59,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:59,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {33772#true} call ULTIMATE.init(); {33772#true} is VALID [2018-11-23 11:53:59,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {33772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33772#true} is VALID [2018-11-23 11:53:59,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {33772#true} assume true; {33772#true} is VALID [2018-11-23 11:53:59,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33772#true} {33772#true} #130#return; {33772#true} is VALID [2018-11-23 11:53:59,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {33772#true} call #t~ret15 := main(); {33772#true} is VALID [2018-11-23 11:53:59,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {33772#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {33833#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:59,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {33833#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {33837#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:59,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {33837#(<= 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); {33837#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:59,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {33837#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33837#(<= main_~k~0 0)} is VALID [2018-11-23 11:53:59,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {33837#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:59,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {33776#(<= 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); {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:59,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {33776#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {33776#(<= main_~k~0 1)} is VALID [2018-11-23 11:53:59,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {33776#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:59,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {33777#(<= 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); {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:59,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {33777#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33777#(<= main_~k~0 2)} is VALID [2018-11-23 11:53:59,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {33777#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:59,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {33778#(<= 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); {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:59,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {33778#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33778#(<= main_~k~0 3)} is VALID [2018-11-23 11:53:59,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {33778#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:59,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {33779#(<= 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); {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:59,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {33779#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33779#(<= main_~k~0 4)} is VALID [2018-11-23 11:53:59,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {33779#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:59,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {33780#(<= 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); {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:59,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {33780#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33780#(<= main_~k~0 5)} is VALID [2018-11-23 11:53:59,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {33780#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:59,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {33781#(<= 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); {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:59,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {33781#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33781#(<= main_~k~0 6)} is VALID [2018-11-23 11:53:59,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {33781#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:59,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {33782#(<= 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); {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:59,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {33782#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33782#(<= main_~k~0 7)} is VALID [2018-11-23 11:53:59,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {33782#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:59,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {33783#(<= 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); {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:59,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {33783#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33783#(<= main_~k~0 8)} is VALID [2018-11-23 11:53:59,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {33783#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:59,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {33784#(<= 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); {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:59,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {33784#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33784#(<= main_~k~0 9)} is VALID [2018-11-23 11:53:59,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {33784#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:59,323 INFO L273 TraceCheckUtils]: 37: Hoare triple {33785#(<= 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); {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:59,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {33785#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33785#(<= main_~k~0 10)} is VALID [2018-11-23 11:53:59,325 INFO L273 TraceCheckUtils]: 39: Hoare triple {33785#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:59,325 INFO L273 TraceCheckUtils]: 40: Hoare triple {33786#(<= 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); {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:59,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {33786#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33786#(<= main_~k~0 11)} is VALID [2018-11-23 11:53:59,326 INFO L273 TraceCheckUtils]: 42: Hoare triple {33786#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:59,327 INFO L273 TraceCheckUtils]: 43: Hoare triple {33787#(<= 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); {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:59,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {33787#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33787#(<= main_~k~0 12)} is VALID [2018-11-23 11:53:59,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {33787#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:59,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {33788#(<= 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); {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:59,329 INFO L273 TraceCheckUtils]: 47: Hoare triple {33788#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33788#(<= main_~k~0 13)} is VALID [2018-11-23 11:53:59,330 INFO L273 TraceCheckUtils]: 48: Hoare triple {33788#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:59,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {33789#(<= 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); {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:59,331 INFO L273 TraceCheckUtils]: 50: Hoare triple {33789#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33789#(<= main_~k~0 14)} is VALID [2018-11-23 11:53:59,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {33789#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:59,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {33790#(<= 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); {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:59,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {33790#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33790#(<= main_~k~0 15)} is VALID [2018-11-23 11:53:59,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {33790#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:59,334 INFO L273 TraceCheckUtils]: 55: Hoare triple {33791#(<= 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); {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:59,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {33791#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33791#(<= main_~k~0 16)} is VALID [2018-11-23 11:53:59,335 INFO L273 TraceCheckUtils]: 57: Hoare triple {33791#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:59,335 INFO L273 TraceCheckUtils]: 58: Hoare triple {33792#(<= 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); {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:59,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {33792#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33792#(<= main_~k~0 17)} is VALID [2018-11-23 11:53:59,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {33792#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:59,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {33793#(<= 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); {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:59,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {33793#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33793#(<= main_~k~0 18)} is VALID [2018-11-23 11:53:59,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {33793#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:59,339 INFO L273 TraceCheckUtils]: 64: Hoare triple {33794#(<= 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); {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:59,339 INFO L273 TraceCheckUtils]: 65: Hoare triple {33794#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33794#(<= main_~k~0 19)} is VALID [2018-11-23 11:53:59,340 INFO L273 TraceCheckUtils]: 66: Hoare triple {33794#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:59,340 INFO L273 TraceCheckUtils]: 67: Hoare triple {33795#(<= 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); {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:59,341 INFO L273 TraceCheckUtils]: 68: Hoare triple {33795#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33795#(<= main_~k~0 20)} is VALID [2018-11-23 11:53:59,342 INFO L273 TraceCheckUtils]: 69: Hoare triple {33795#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:59,342 INFO L273 TraceCheckUtils]: 70: Hoare triple {33796#(<= 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); {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:59,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {33796#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33796#(<= main_~k~0 21)} is VALID [2018-11-23 11:53:59,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {33796#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:59,344 INFO L273 TraceCheckUtils]: 73: Hoare triple {33797#(<= 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); {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:59,344 INFO L273 TraceCheckUtils]: 74: Hoare triple {33797#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33797#(<= main_~k~0 22)} is VALID [2018-11-23 11:53:59,345 INFO L273 TraceCheckUtils]: 75: Hoare triple {33797#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:59,346 INFO L273 TraceCheckUtils]: 76: Hoare triple {33798#(<= 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); {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:59,346 INFO L273 TraceCheckUtils]: 77: Hoare triple {33798#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33798#(<= main_~k~0 23)} is VALID [2018-11-23 11:53:59,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {33798#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:59,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {33799#(<= 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); {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:59,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {33799#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33799#(<= main_~k~0 24)} is VALID [2018-11-23 11:53:59,348 INFO L273 TraceCheckUtils]: 81: Hoare triple {33799#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:59,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {33800#(<= 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); {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:59,349 INFO L273 TraceCheckUtils]: 83: Hoare triple {33800#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33800#(<= main_~k~0 25)} is VALID [2018-11-23 11:53:59,350 INFO L273 TraceCheckUtils]: 84: Hoare triple {33800#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:59,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {33801#(<= 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); {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:59,351 INFO L273 TraceCheckUtils]: 86: Hoare triple {33801#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33801#(<= main_~k~0 26)} is VALID [2018-11-23 11:53:59,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {33801#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:59,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {33802#(<= 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); {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:59,353 INFO L273 TraceCheckUtils]: 89: Hoare triple {33802#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33802#(<= main_~k~0 27)} is VALID [2018-11-23 11:53:59,354 INFO L273 TraceCheckUtils]: 90: Hoare triple {33802#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:59,354 INFO L273 TraceCheckUtils]: 91: Hoare triple {33803#(<= 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); {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:59,355 INFO L273 TraceCheckUtils]: 92: Hoare triple {33803#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33803#(<= main_~k~0 28)} is VALID [2018-11-23 11:53:59,355 INFO L273 TraceCheckUtils]: 93: Hoare triple {33803#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:59,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {33804#(<= 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); {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:59,356 INFO L273 TraceCheckUtils]: 95: Hoare triple {33804#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33804#(<= main_~k~0 29)} is VALID [2018-11-23 11:53:59,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {33804#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:59,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {33805#(<= 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); {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:59,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {33805#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33805#(<= main_~k~0 30)} is VALID [2018-11-23 11:53:59,359 INFO L273 TraceCheckUtils]: 99: Hoare triple {33805#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:59,359 INFO L273 TraceCheckUtils]: 100: Hoare triple {33806#(<= 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); {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:59,360 INFO L273 TraceCheckUtils]: 101: Hoare triple {33806#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33806#(<= main_~k~0 31)} is VALID [2018-11-23 11:53:59,361 INFO L273 TraceCheckUtils]: 102: Hoare triple {33806#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:59,361 INFO L273 TraceCheckUtils]: 103: Hoare triple {33807#(<= 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); {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:59,362 INFO L273 TraceCheckUtils]: 104: Hoare triple {33807#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33807#(<= main_~k~0 32)} is VALID [2018-11-23 11:53:59,362 INFO L273 TraceCheckUtils]: 105: Hoare triple {33807#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:59,363 INFO L273 TraceCheckUtils]: 106: Hoare triple {33808#(<= 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); {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:59,363 INFO L273 TraceCheckUtils]: 107: Hoare triple {33808#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33808#(<= main_~k~0 33)} is VALID [2018-11-23 11:53:59,364 INFO L273 TraceCheckUtils]: 108: Hoare triple {33808#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:59,364 INFO L273 TraceCheckUtils]: 109: Hoare triple {33809#(<= 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); {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:59,365 INFO L273 TraceCheckUtils]: 110: Hoare triple {33809#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33809#(<= main_~k~0 34)} is VALID [2018-11-23 11:53:59,366 INFO L273 TraceCheckUtils]: 111: Hoare triple {33809#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:59,366 INFO L273 TraceCheckUtils]: 112: Hoare triple {33810#(<= 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); {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:59,367 INFO L273 TraceCheckUtils]: 113: Hoare triple {33810#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33810#(<= main_~k~0 35)} is VALID [2018-11-23 11:53:59,367 INFO L273 TraceCheckUtils]: 114: Hoare triple {33810#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:59,368 INFO L273 TraceCheckUtils]: 115: Hoare triple {33811#(<= 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); {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:59,368 INFO L273 TraceCheckUtils]: 116: Hoare triple {33811#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33811#(<= main_~k~0 36)} is VALID [2018-11-23 11:53:59,369 INFO L273 TraceCheckUtils]: 117: Hoare triple {33811#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:59,370 INFO L273 TraceCheckUtils]: 118: Hoare triple {33812#(<= 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); {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:59,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {33812#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33812#(<= main_~k~0 37)} is VALID [2018-11-23 11:53:59,371 INFO L273 TraceCheckUtils]: 120: Hoare triple {33812#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:59,371 INFO L273 TraceCheckUtils]: 121: Hoare triple {33813#(<= 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); {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:59,372 INFO L273 TraceCheckUtils]: 122: Hoare triple {33813#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {33813#(<= main_~k~0 38)} is VALID [2018-11-23 11:53:59,372 INFO L273 TraceCheckUtils]: 123: Hoare triple {33813#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {33814#(<= main_~k~0 39)} is VALID [2018-11-23 11:53:59,373 INFO L273 TraceCheckUtils]: 124: Hoare triple {33814#(<= main_~k~0 39)} assume !(~k~0 < 100000); {33773#false} is VALID [2018-11-23 11:53:59,373 INFO L273 TraceCheckUtils]: 125: Hoare triple {33773#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); {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L273 TraceCheckUtils]: 126: Hoare triple {33773#false} ~x~0 := 0; {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L273 TraceCheckUtils]: 127: Hoare triple {33773#false} assume !(~x~0 < ~i~0); {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L273 TraceCheckUtils]: 128: Hoare triple {33773#false} ~x~0 := 1 + ~i~0; {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L273 TraceCheckUtils]: 129: Hoare triple {33773#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); {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L256 TraceCheckUtils]: 130: Hoare triple {33773#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {33773#false} is VALID [2018-11-23 11:53:59,374 INFO L273 TraceCheckUtils]: 131: Hoare triple {33773#false} ~cond := #in~cond; {33773#false} is VALID [2018-11-23 11:53:59,375 INFO L273 TraceCheckUtils]: 132: Hoare triple {33773#false} assume 0 == ~cond; {33773#false} is VALID [2018-11-23 11:53:59,375 INFO L273 TraceCheckUtils]: 133: Hoare triple {33773#false} assume !false; {33773#false} is VALID [2018-11-23 11:53:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:53:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2018-11-23 11:53:59,406 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 134 [2018-11-23 11:53:59,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:59,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:53:59,535 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-23 11:53:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:53:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:53:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:53:59,536 INFO L87 Difference]: Start difference. First operand 162 states and 213 transitions. Second operand 45 states. [2018-11-23 11:54:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,444 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2018-11-23 11:54:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:54:02,444 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 134 [2018-11-23 11:54:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:54:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 267 transitions. [2018-11-23 11:54:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:54:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 267 transitions. [2018-11-23 11:54:02,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 267 transitions. [2018-11-23 11:54:02,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:02,694 INFO L225 Difference]: With dead ends: 207 [2018-11-23 11:54:02,694 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:54:02,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 11:54:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:54:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2018-11-23 11:54:02,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:02,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 165 states. [2018-11-23 11:54:02,802 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 165 states. [2018-11-23 11:54:02,802 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 165 states. [2018-11-23 11:54:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,806 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2018-11-23 11:54:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 228 transitions. [2018-11-23 11:54:02,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,807 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 173 states. [2018-11-23 11:54:02,807 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 173 states. [2018-11-23 11:54:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,809 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2018-11-23 11:54:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 228 transitions. [2018-11-23 11:54:02,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:02,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:54:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-11-23 11:54:02,812 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 134 [2018-11-23 11:54:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:02,812 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-11-23 11:54:02,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 11:54:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-11-23 11:54:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 11:54:02,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:02,813 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:02,813 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:02,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 515858615, now seen corresponding path program 29 times [2018-11-23 11:54:02,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:02,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:03,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {35148#true} call ULTIMATE.init(); {35148#true} is VALID [2018-11-23 11:54:03,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {35148#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35148#true} is VALID [2018-11-23 11:54:03,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {35148#true} assume true; {35148#true} is VALID [2018-11-23 11:54:03,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35148#true} {35148#true} #130#return; {35148#true} is VALID [2018-11-23 11:54:03,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {35148#true} call #t~ret15 := main(); {35148#true} is VALID [2018-11-23 11:54:03,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {35148#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {35150#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:03,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {35150#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {35151#(= main_~k~0 0)} is VALID [2018-11-23 11:54:03,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {35151#(= 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); {35151#(= main_~k~0 0)} is VALID [2018-11-23 11:54:03,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {35151#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35151#(= main_~k~0 0)} is VALID [2018-11-23 11:54:03,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {35151#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:03,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {35152#(<= 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); {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:03,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {35152#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:03,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {35152#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:03,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {35153#(<= 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); {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:03,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {35153#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:03,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {35153#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:03,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {35154#(<= 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); {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:03,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {35154#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:03,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {35154#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:03,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {35155#(<= 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); {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:03,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {35155#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:03,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {35155#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:03,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {35156#(<= 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); {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:03,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {35156#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:03,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {35156#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:03,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {35157#(<= 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); {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:03,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {35157#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:03,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {35157#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:03,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {35158#(<= 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); {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:03,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {35158#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:03,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {35158#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:03,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {35159#(<= 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); {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:03,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {35159#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:03,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {35159#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:03,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {35160#(<= 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); {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:03,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {35160#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:03,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {35160#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:03,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {35161#(<= 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); {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:03,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {35161#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:03,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {35161#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:03,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {35162#(<= 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); {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:03,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {35162#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:03,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {35162#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:03,777 INFO L273 TraceCheckUtils]: 43: Hoare triple {35163#(<= 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); {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:03,777 INFO L273 TraceCheckUtils]: 44: Hoare triple {35163#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:03,778 INFO L273 TraceCheckUtils]: 45: Hoare triple {35163#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:03,779 INFO L273 TraceCheckUtils]: 46: Hoare triple {35164#(<= 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); {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:03,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {35164#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:03,780 INFO L273 TraceCheckUtils]: 48: Hoare triple {35164#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:03,780 INFO L273 TraceCheckUtils]: 49: Hoare triple {35165#(<= 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); {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:03,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {35165#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:03,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {35165#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:03,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {35166#(<= 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); {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:03,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {35166#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:03,783 INFO L273 TraceCheckUtils]: 54: Hoare triple {35166#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:03,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {35167#(<= 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); {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:03,784 INFO L273 TraceCheckUtils]: 56: Hoare triple {35167#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:03,785 INFO L273 TraceCheckUtils]: 57: Hoare triple {35167#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:03,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {35168#(<= 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); {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:03,786 INFO L273 TraceCheckUtils]: 59: Hoare triple {35168#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:03,786 INFO L273 TraceCheckUtils]: 60: Hoare triple {35168#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:03,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {35169#(<= 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); {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:03,787 INFO L273 TraceCheckUtils]: 62: Hoare triple {35169#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:03,788 INFO L273 TraceCheckUtils]: 63: Hoare triple {35169#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:03,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {35170#(<= 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); {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:03,789 INFO L273 TraceCheckUtils]: 65: Hoare triple {35170#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:03,790 INFO L273 TraceCheckUtils]: 66: Hoare triple {35170#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:03,790 INFO L273 TraceCheckUtils]: 67: Hoare triple {35171#(<= 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); {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 68: Hoare triple {35171#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 69: Hoare triple {35171#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:03,792 INFO L273 TraceCheckUtils]: 70: Hoare triple {35172#(<= 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); {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:03,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {35172#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 72: Hoare triple {35172#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 73: Hoare triple {35173#(<= 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); {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:03,794 INFO L273 TraceCheckUtils]: 74: Hoare triple {35173#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:03,794 INFO L273 TraceCheckUtils]: 75: Hoare triple {35173#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:03,795 INFO L273 TraceCheckUtils]: 76: Hoare triple {35174#(<= 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); {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:03,795 INFO L273 TraceCheckUtils]: 77: Hoare triple {35174#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:03,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {35174#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 79: Hoare triple {35175#(<= 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); {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 80: Hoare triple {35175#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:03,798 INFO L273 TraceCheckUtils]: 81: Hoare triple {35175#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:03,798 INFO L273 TraceCheckUtils]: 82: Hoare triple {35176#(<= 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); {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 83: Hoare triple {35176#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {35176#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:03,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {35177#(<= 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); {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:03,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {35177#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 87: Hoare triple {35177#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 88: Hoare triple {35178#(<= 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); {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:03,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {35178#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 90: Hoare triple {35178#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 91: Hoare triple {35179#(<= 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); {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:03,804 INFO L273 TraceCheckUtils]: 92: Hoare triple {35179#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:03,804 INFO L273 TraceCheckUtils]: 93: Hoare triple {35179#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 94: Hoare triple {35180#(<= 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); {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 95: Hoare triple {35180#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:03,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {35180#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:03,806 INFO L273 TraceCheckUtils]: 97: Hoare triple {35181#(<= 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); {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:03,807 INFO L273 TraceCheckUtils]: 98: Hoare triple {35181#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:03,807 INFO L273 TraceCheckUtils]: 99: Hoare triple {35181#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:03,808 INFO L273 TraceCheckUtils]: 100: Hoare triple {35182#(<= 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); {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:03,808 INFO L273 TraceCheckUtils]: 101: Hoare triple {35182#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:03,809 INFO L273 TraceCheckUtils]: 102: Hoare triple {35182#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {35183#(<= 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); {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 104: Hoare triple {35183#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:03,811 INFO L273 TraceCheckUtils]: 105: Hoare triple {35183#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:03,811 INFO L273 TraceCheckUtils]: 106: Hoare triple {35184#(<= 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); {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 107: Hoare triple {35184#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 108: Hoare triple {35184#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 109: Hoare triple {35185#(<= 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); {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 110: Hoare triple {35185#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 111: Hoare triple {35185#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 112: Hoare triple {35186#(<= 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); {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {35186#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 114: Hoare triple {35186#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 115: Hoare triple {35187#(<= 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); {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 116: Hoare triple {35187#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 117: Hoare triple {35187#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 118: Hoare triple {35188#(<= 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); {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 119: Hoare triple {35188#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 120: Hoare triple {35188#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 121: Hoare triple {35189#(<= 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); {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 122: Hoare triple {35189#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 123: Hoare triple {35189#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 124: Hoare triple {35190#(<= 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); {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 125: Hoare triple {35190#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 126: Hoare triple {35190#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {35191#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 127: Hoare triple {35191#(<= main_~k~0 40)} assume !(~k~0 < 100000); {35149#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 128: Hoare triple {35149#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); {35149#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 129: Hoare triple {35149#false} ~x~0 := 0; {35149#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 130: Hoare triple {35149#false} assume !(~x~0 < ~i~0); {35149#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 131: Hoare triple {35149#false} ~x~0 := 1 + ~i~0; {35149#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 132: Hoare triple {35149#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); {35149#false} is VALID [2018-11-23 11:54:03,824 INFO L256 TraceCheckUtils]: 133: Hoare triple {35149#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {35149#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 134: Hoare triple {35149#false} ~cond := #in~cond; {35149#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 135: Hoare triple {35149#false} assume 0 == ~cond; {35149#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 136: Hoare triple {35149#false} assume !false; {35149#false} is VALID [2018-11-23 11:54:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:03,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:03,838 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-23 11:54:03,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:04,010 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-11-23 11:54:04,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:04,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:04,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {35148#true} call ULTIMATE.init(); {35148#true} is VALID [2018-11-23 11:54:04,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {35148#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35148#true} is VALID [2018-11-23 11:54:04,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {35148#true} assume true; {35148#true} is VALID [2018-11-23 11:54:04,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35148#true} {35148#true} #130#return; {35148#true} is VALID [2018-11-23 11:54:04,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {35148#true} call #t~ret15 := main(); {35148#true} is VALID [2018-11-23 11:54:04,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {35148#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {35210#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:04,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {35210#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {35214#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:04,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {35214#(<= 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); {35214#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:04,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {35214#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35214#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:04,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {35214#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:04,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {35152#(<= 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); {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:04,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {35152#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {35152#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:04,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {35152#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:04,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {35153#(<= 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); {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:04,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {35153#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35153#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:04,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {35153#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:04,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {35154#(<= 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); {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:04,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {35154#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35154#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:04,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {35154#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:04,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {35155#(<= 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); {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:04,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {35155#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35155#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:04,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {35155#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:04,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {35156#(<= 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); {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:04,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {35156#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35156#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:04,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {35156#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:04,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {35157#(<= 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); {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:04,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {35157#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35157#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:04,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {35157#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:04,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {35158#(<= 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); {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:04,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {35158#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35158#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:04,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {35158#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:04,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {35159#(<= 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); {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:04,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {35159#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35159#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:04,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {35159#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:04,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {35160#(<= 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); {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:04,464 INFO L273 TraceCheckUtils]: 35: Hoare triple {35160#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35160#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:04,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {35160#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:04,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {35161#(<= 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); {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:04,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {35161#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35161#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:04,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {35161#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:04,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {35162#(<= 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); {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:04,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {35162#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35162#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:04,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {35162#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:04,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {35163#(<= 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); {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:04,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {35163#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35163#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:04,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {35163#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:04,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {35164#(<= 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); {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:04,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {35164#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35164#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:04,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {35164#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:04,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {35165#(<= 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); {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:04,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {35165#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35165#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:04,472 INFO L273 TraceCheckUtils]: 51: Hoare triple {35165#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:04,473 INFO L273 TraceCheckUtils]: 52: Hoare triple {35166#(<= 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); {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:04,473 INFO L273 TraceCheckUtils]: 53: Hoare triple {35166#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35166#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:04,474 INFO L273 TraceCheckUtils]: 54: Hoare triple {35166#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:04,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {35167#(<= 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); {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:04,475 INFO L273 TraceCheckUtils]: 56: Hoare triple {35167#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35167#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:04,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {35167#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:04,476 INFO L273 TraceCheckUtils]: 58: Hoare triple {35168#(<= 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); {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:04,477 INFO L273 TraceCheckUtils]: 59: Hoare triple {35168#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35168#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:04,478 INFO L273 TraceCheckUtils]: 60: Hoare triple {35168#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:04,478 INFO L273 TraceCheckUtils]: 61: Hoare triple {35169#(<= 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); {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:04,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {35169#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35169#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:04,479 INFO L273 TraceCheckUtils]: 63: Hoare triple {35169#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:04,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {35170#(<= 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); {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:04,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {35170#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35170#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:04,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {35170#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:04,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {35171#(<= 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); {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:04,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {35171#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35171#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:04,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {35171#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:04,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {35172#(<= 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); {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:04,483 INFO L273 TraceCheckUtils]: 71: Hoare triple {35172#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35172#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:04,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {35172#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:04,485 INFO L273 TraceCheckUtils]: 73: Hoare triple {35173#(<= 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); {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:04,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {35173#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35173#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:04,486 INFO L273 TraceCheckUtils]: 75: Hoare triple {35173#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:04,486 INFO L273 TraceCheckUtils]: 76: Hoare triple {35174#(<= 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); {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:04,487 INFO L273 TraceCheckUtils]: 77: Hoare triple {35174#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35174#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:04,487 INFO L273 TraceCheckUtils]: 78: Hoare triple {35174#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:04,488 INFO L273 TraceCheckUtils]: 79: Hoare triple {35175#(<= 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); {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:04,488 INFO L273 TraceCheckUtils]: 80: Hoare triple {35175#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35175#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:04,489 INFO L273 TraceCheckUtils]: 81: Hoare triple {35175#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:04,490 INFO L273 TraceCheckUtils]: 82: Hoare triple {35176#(<= 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); {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:04,490 INFO L273 TraceCheckUtils]: 83: Hoare triple {35176#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35176#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:04,491 INFO L273 TraceCheckUtils]: 84: Hoare triple {35176#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:04,491 INFO L273 TraceCheckUtils]: 85: Hoare triple {35177#(<= 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); {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:04,492 INFO L273 TraceCheckUtils]: 86: Hoare triple {35177#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35177#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:04,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {35177#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:04,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {35178#(<= 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); {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:04,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {35178#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35178#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:04,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {35178#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:04,495 INFO L273 TraceCheckUtils]: 91: Hoare triple {35179#(<= 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); {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:04,495 INFO L273 TraceCheckUtils]: 92: Hoare triple {35179#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35179#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:04,496 INFO L273 TraceCheckUtils]: 93: Hoare triple {35179#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:04,496 INFO L273 TraceCheckUtils]: 94: Hoare triple {35180#(<= 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); {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:04,497 INFO L273 TraceCheckUtils]: 95: Hoare triple {35180#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35180#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:04,498 INFO L273 TraceCheckUtils]: 96: Hoare triple {35180#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:04,498 INFO L273 TraceCheckUtils]: 97: Hoare triple {35181#(<= 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); {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:04,499 INFO L273 TraceCheckUtils]: 98: Hoare triple {35181#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35181#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:04,499 INFO L273 TraceCheckUtils]: 99: Hoare triple {35181#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:04,500 INFO L273 TraceCheckUtils]: 100: Hoare triple {35182#(<= 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); {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:04,500 INFO L273 TraceCheckUtils]: 101: Hoare triple {35182#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35182#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:04,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {35182#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:04,501 INFO L273 TraceCheckUtils]: 103: Hoare triple {35183#(<= 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); {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:04,502 INFO L273 TraceCheckUtils]: 104: Hoare triple {35183#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35183#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:04,503 INFO L273 TraceCheckUtils]: 105: Hoare triple {35183#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:04,503 INFO L273 TraceCheckUtils]: 106: Hoare triple {35184#(<= 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); {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:04,504 INFO L273 TraceCheckUtils]: 107: Hoare triple {35184#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35184#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:04,504 INFO L273 TraceCheckUtils]: 108: Hoare triple {35184#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:04,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {35185#(<= 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); {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:04,505 INFO L273 TraceCheckUtils]: 110: Hoare triple {35185#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35185#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:04,506 INFO L273 TraceCheckUtils]: 111: Hoare triple {35185#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:04,506 INFO L273 TraceCheckUtils]: 112: Hoare triple {35186#(<= 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); {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:04,507 INFO L273 TraceCheckUtils]: 113: Hoare triple {35186#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35186#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:04,508 INFO L273 TraceCheckUtils]: 114: Hoare triple {35186#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:04,508 INFO L273 TraceCheckUtils]: 115: Hoare triple {35187#(<= 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); {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:04,509 INFO L273 TraceCheckUtils]: 116: Hoare triple {35187#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35187#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:04,509 INFO L273 TraceCheckUtils]: 117: Hoare triple {35187#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:04,510 INFO L273 TraceCheckUtils]: 118: Hoare triple {35188#(<= 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); {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:04,510 INFO L273 TraceCheckUtils]: 119: Hoare triple {35188#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35188#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:04,511 INFO L273 TraceCheckUtils]: 120: Hoare triple {35188#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:04,512 INFO L273 TraceCheckUtils]: 121: Hoare triple {35189#(<= 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); {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:04,512 INFO L273 TraceCheckUtils]: 122: Hoare triple {35189#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35189#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:04,513 INFO L273 TraceCheckUtils]: 123: Hoare triple {35189#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:04,513 INFO L273 TraceCheckUtils]: 124: Hoare triple {35190#(<= 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); {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:04,514 INFO L273 TraceCheckUtils]: 125: Hoare triple {35190#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {35190#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:04,514 INFO L273 TraceCheckUtils]: 126: Hoare triple {35190#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {35191#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:04,515 INFO L273 TraceCheckUtils]: 127: Hoare triple {35191#(<= main_~k~0 40)} assume !(~k~0 < 100000); {35149#false} is VALID [2018-11-23 11:54:04,515 INFO L273 TraceCheckUtils]: 128: Hoare triple {35149#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); {35149#false} is VALID [2018-11-23 11:54:04,515 INFO L273 TraceCheckUtils]: 129: Hoare triple {35149#false} ~x~0 := 0; {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L273 TraceCheckUtils]: 130: Hoare triple {35149#false} assume !(~x~0 < ~i~0); {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L273 TraceCheckUtils]: 131: Hoare triple {35149#false} ~x~0 := 1 + ~i~0; {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L273 TraceCheckUtils]: 132: Hoare triple {35149#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); {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L256 TraceCheckUtils]: 133: Hoare triple {35149#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L273 TraceCheckUtils]: 134: Hoare triple {35149#false} ~cond := #in~cond; {35149#false} is VALID [2018-11-23 11:54:04,516 INFO L273 TraceCheckUtils]: 135: Hoare triple {35149#false} assume 0 == ~cond; {35149#false} is VALID [2018-11-23 11:54:04,517 INFO L273 TraceCheckUtils]: 136: Hoare triple {35149#false} assume !false; {35149#false} is VALID [2018-11-23 11:54:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:04,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:04,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2018-11-23 11:54:04,549 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 137 [2018-11-23 11:54:04,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:04,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:54:04,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:04,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:54:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:54:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:54:04,682 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 46 states. [2018-11-23 11:54:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:08,273 INFO L93 Difference]: Finished difference Result 210 states and 278 transitions. [2018-11-23 11:54:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:54:08,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 137 [2018-11-23 11:54:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:54:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 271 transitions. [2018-11-23 11:54:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:54:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 271 transitions. [2018-11-23 11:54:08,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 271 transitions. [2018-11-23 11:54:08,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:08,532 INFO L225 Difference]: With dead ends: 210 [2018-11-23 11:54:08,532 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 11:54:08,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-11-23 11:54:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 11:54:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-11-23 11:54:08,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:08,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 168 states. [2018-11-23 11:54:08,643 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 168 states. [2018-11-23 11:54:08,643 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 168 states. [2018-11-23 11:54:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:08,648 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2018-11-23 11:54:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2018-11-23 11:54:08,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:08,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:08,649 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 176 states. [2018-11-23 11:54:08,649 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 176 states. [2018-11-23 11:54:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:08,652 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2018-11-23 11:54:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2018-11-23 11:54:08,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:08,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:08,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:08,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:54:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 221 transitions. [2018-11-23 11:54:08,656 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 221 transitions. Word has length 137 [2018-11-23 11:54:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:08,657 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 221 transitions. [2018-11-23 11:54:08,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:54:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 221 transitions. [2018-11-23 11:54:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 11:54:08,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:08,658 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:08,658 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:08,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash 617243744, now seen corresponding path program 30 times [2018-11-23 11:54:08,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:08,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:08,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:10,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {36550#true} call ULTIMATE.init(); {36550#true} is VALID [2018-11-23 11:54:10,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {36550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36550#true} is VALID [2018-11-23 11:54:10,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {36550#true} assume true; {36550#true} is VALID [2018-11-23 11:54:10,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36550#true} {36550#true} #130#return; {36550#true} is VALID [2018-11-23 11:54:10,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {36550#true} call #t~ret15 := main(); {36550#true} is VALID [2018-11-23 11:54:10,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {36550#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36552#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:10,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {36552#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {36553#(= main_~k~0 0)} is VALID [2018-11-23 11:54:10,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {36553#(= 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); {36553#(= main_~k~0 0)} is VALID [2018-11-23 11:54:10,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {36553#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36553#(= main_~k~0 0)} is VALID [2018-11-23 11:54:10,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {36553#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:10,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {36554#(<= 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); {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:10,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {36554#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:10,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {36554#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:10,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {36555#(<= 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); {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:10,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {36555#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:10,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {36555#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:10,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {36556#(<= 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); {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:10,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {36556#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:10,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {36556#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:10,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {36557#(<= 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); {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:10,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {36557#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:10,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {36557#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:10,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {36558#(<= 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); {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:10,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {36558#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:10,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {36558#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:10,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {36559#(<= 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); {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:10,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {36559#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:10,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {36559#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:10,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {36560#(<= 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); {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:10,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {36560#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:10,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {36560#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:10,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {36561#(<= 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); {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:10,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {36561#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:10,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {36561#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:10,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {36562#(<= 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); {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:10,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {36562#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:10,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {36562#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:10,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {36563#(<= 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); {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:10,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {36563#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:10,132 INFO L273 TraceCheckUtils]: 39: Hoare triple {36563#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:10,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {36564#(<= 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); {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:10,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {36564#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:10,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {36564#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:10,133 INFO L273 TraceCheckUtils]: 43: Hoare triple {36565#(<= 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); {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:10,133 INFO L273 TraceCheckUtils]: 44: Hoare triple {36565#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:10,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {36565#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:10,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {36566#(<= 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); {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:10,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {36566#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:10,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {36566#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:10,136 INFO L273 TraceCheckUtils]: 49: Hoare triple {36567#(<= 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); {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:10,137 INFO L273 TraceCheckUtils]: 50: Hoare triple {36567#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:10,137 INFO L273 TraceCheckUtils]: 51: Hoare triple {36567#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:10,138 INFO L273 TraceCheckUtils]: 52: Hoare triple {36568#(<= 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); {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:10,138 INFO L273 TraceCheckUtils]: 53: Hoare triple {36568#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:10,139 INFO L273 TraceCheckUtils]: 54: Hoare triple {36568#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:10,140 INFO L273 TraceCheckUtils]: 55: Hoare triple {36569#(<= 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); {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:10,140 INFO L273 TraceCheckUtils]: 56: Hoare triple {36569#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:10,141 INFO L273 TraceCheckUtils]: 57: Hoare triple {36569#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:10,141 INFO L273 TraceCheckUtils]: 58: Hoare triple {36570#(<= 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); {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:10,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {36570#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:10,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {36570#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:10,143 INFO L273 TraceCheckUtils]: 61: Hoare triple {36571#(<= 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); {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:10,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {36571#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:10,144 INFO L273 TraceCheckUtils]: 63: Hoare triple {36571#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:10,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {36572#(<= 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); {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:10,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {36572#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:10,146 INFO L273 TraceCheckUtils]: 66: Hoare triple {36572#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:10,146 INFO L273 TraceCheckUtils]: 67: Hoare triple {36573#(<= 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); {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:10,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {36573#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:10,148 INFO L273 TraceCheckUtils]: 69: Hoare triple {36573#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:10,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {36574#(<= 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); {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:10,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {36574#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:10,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {36574#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:10,150 INFO L273 TraceCheckUtils]: 73: Hoare triple {36575#(<= 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); {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:10,150 INFO L273 TraceCheckUtils]: 74: Hoare triple {36575#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:10,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {36575#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:10,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {36576#(<= 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); {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:10,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {36576#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:10,153 INFO L273 TraceCheckUtils]: 78: Hoare triple {36576#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:10,153 INFO L273 TraceCheckUtils]: 79: Hoare triple {36577#(<= 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); {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:10,154 INFO L273 TraceCheckUtils]: 80: Hoare triple {36577#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:10,154 INFO L273 TraceCheckUtils]: 81: Hoare triple {36577#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:10,155 INFO L273 TraceCheckUtils]: 82: Hoare triple {36578#(<= 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); {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:10,155 INFO L273 TraceCheckUtils]: 83: Hoare triple {36578#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:10,156 INFO L273 TraceCheckUtils]: 84: Hoare triple {36578#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:10,157 INFO L273 TraceCheckUtils]: 85: Hoare triple {36579#(<= 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); {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:10,157 INFO L273 TraceCheckUtils]: 86: Hoare triple {36579#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:10,158 INFO L273 TraceCheckUtils]: 87: Hoare triple {36579#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:10,158 INFO L273 TraceCheckUtils]: 88: Hoare triple {36580#(<= 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); {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:10,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {36580#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:10,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {36580#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:10,160 INFO L273 TraceCheckUtils]: 91: Hoare triple {36581#(<= 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); {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:10,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {36581#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:10,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {36581#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:10,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {36582#(<= 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); {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:10,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {36582#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:10,163 INFO L273 TraceCheckUtils]: 96: Hoare triple {36582#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:10,163 INFO L273 TraceCheckUtils]: 97: Hoare triple {36583#(<= 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); {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:10,164 INFO L273 TraceCheckUtils]: 98: Hoare triple {36583#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:10,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {36583#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:10,165 INFO L273 TraceCheckUtils]: 100: Hoare triple {36584#(<= 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); {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:10,166 INFO L273 TraceCheckUtils]: 101: Hoare triple {36584#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:10,166 INFO L273 TraceCheckUtils]: 102: Hoare triple {36584#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:10,167 INFO L273 TraceCheckUtils]: 103: Hoare triple {36585#(<= 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); {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:10,167 INFO L273 TraceCheckUtils]: 104: Hoare triple {36585#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:10,168 INFO L273 TraceCheckUtils]: 105: Hoare triple {36585#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:10,169 INFO L273 TraceCheckUtils]: 106: Hoare triple {36586#(<= 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); {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:10,169 INFO L273 TraceCheckUtils]: 107: Hoare triple {36586#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:10,170 INFO L273 TraceCheckUtils]: 108: Hoare triple {36586#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:10,170 INFO L273 TraceCheckUtils]: 109: Hoare triple {36587#(<= 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); {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:10,171 INFO L273 TraceCheckUtils]: 110: Hoare triple {36587#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:10,171 INFO L273 TraceCheckUtils]: 111: Hoare triple {36587#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:10,172 INFO L273 TraceCheckUtils]: 112: Hoare triple {36588#(<= 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); {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:10,172 INFO L273 TraceCheckUtils]: 113: Hoare triple {36588#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:10,173 INFO L273 TraceCheckUtils]: 114: Hoare triple {36588#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:10,174 INFO L273 TraceCheckUtils]: 115: Hoare triple {36589#(<= 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); {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:10,174 INFO L273 TraceCheckUtils]: 116: Hoare triple {36589#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:10,175 INFO L273 TraceCheckUtils]: 117: Hoare triple {36589#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:10,175 INFO L273 TraceCheckUtils]: 118: Hoare triple {36590#(<= 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); {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:10,176 INFO L273 TraceCheckUtils]: 119: Hoare triple {36590#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:10,177 INFO L273 TraceCheckUtils]: 120: Hoare triple {36590#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:10,177 INFO L273 TraceCheckUtils]: 121: Hoare triple {36591#(<= 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); {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:10,178 INFO L273 TraceCheckUtils]: 122: Hoare triple {36591#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:10,178 INFO L273 TraceCheckUtils]: 123: Hoare triple {36591#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:10,179 INFO L273 TraceCheckUtils]: 124: Hoare triple {36592#(<= 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); {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:10,179 INFO L273 TraceCheckUtils]: 125: Hoare triple {36592#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:10,180 INFO L273 TraceCheckUtils]: 126: Hoare triple {36592#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:10,180 INFO L273 TraceCheckUtils]: 127: Hoare triple {36593#(<= 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); {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:10,181 INFO L273 TraceCheckUtils]: 128: Hoare triple {36593#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:10,182 INFO L273 TraceCheckUtils]: 129: Hoare triple {36593#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {36594#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:10,182 INFO L273 TraceCheckUtils]: 130: Hoare triple {36594#(<= main_~k~0 41)} assume !(~k~0 < 100000); {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L273 TraceCheckUtils]: 131: Hoare triple {36551#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); {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L273 TraceCheckUtils]: 132: Hoare triple {36551#false} ~x~0 := 0; {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L273 TraceCheckUtils]: 133: Hoare triple {36551#false} assume !(~x~0 < ~i~0); {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L273 TraceCheckUtils]: 134: Hoare triple {36551#false} ~x~0 := 1 + ~i~0; {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L273 TraceCheckUtils]: 135: Hoare triple {36551#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); {36551#false} is VALID [2018-11-23 11:54:10,183 INFO L256 TraceCheckUtils]: 136: Hoare triple {36551#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36551#false} is VALID [2018-11-23 11:54:10,184 INFO L273 TraceCheckUtils]: 137: Hoare triple {36551#false} ~cond := #in~cond; {36551#false} is VALID [2018-11-23 11:54:10,184 INFO L273 TraceCheckUtils]: 138: Hoare triple {36551#false} assume 0 == ~cond; {36551#false} is VALID [2018-11-23 11:54:10,184 INFO L273 TraceCheckUtils]: 139: Hoare triple {36551#false} assume !false; {36551#false} is VALID [2018-11-23 11:54:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:10,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:10,197 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-23 11:54:10,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:10,543 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2018-11-23 11:54:10,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:10,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:11,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {36550#true} call ULTIMATE.init(); {36550#true} is VALID [2018-11-23 11:54:11,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {36550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36550#true} is VALID [2018-11-23 11:54:11,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {36550#true} assume true; {36550#true} is VALID [2018-11-23 11:54:11,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36550#true} {36550#true} #130#return; {36550#true} is VALID [2018-11-23 11:54:11,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {36550#true} call #t~ret15 := main(); {36550#true} is VALID [2018-11-23 11:54:11,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {36550#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {36613#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:11,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {36613#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {36617#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {36617#(<= 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); {36617#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {36617#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36617#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:11,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {36617#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:11,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {36554#(<= 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); {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:11,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {36554#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {36554#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:11,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {36554#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:11,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {36555#(<= 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); {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:11,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {36555#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36555#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:11,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {36555#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:11,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {36556#(<= 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); {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:11,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {36556#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36556#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:11,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {36556#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:11,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {36557#(<= 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); {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:11,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {36557#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36557#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:11,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {36557#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:11,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {36558#(<= 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); {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:11,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {36558#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36558#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:11,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {36558#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:11,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {36559#(<= 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); {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:11,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {36559#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36559#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:11,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {36559#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:11,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {36560#(<= 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); {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:11,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {36560#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36560#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:11,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {36560#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:11,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {36561#(<= 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); {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:11,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {36561#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36561#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:11,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {36561#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:11,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {36562#(<= 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); {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:11,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {36562#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36562#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:11,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {36562#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:11,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {36563#(<= 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); {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:11,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {36563#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36563#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:11,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {36563#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:11,341 INFO L273 TraceCheckUtils]: 40: Hoare triple {36564#(<= 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); {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:11,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {36564#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36564#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:11,343 INFO L273 TraceCheckUtils]: 42: Hoare triple {36564#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:11,343 INFO L273 TraceCheckUtils]: 43: Hoare triple {36565#(<= 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); {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:11,344 INFO L273 TraceCheckUtils]: 44: Hoare triple {36565#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36565#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:11,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {36565#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:11,345 INFO L273 TraceCheckUtils]: 46: Hoare triple {36566#(<= 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); {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:11,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {36566#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36566#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:11,346 INFO L273 TraceCheckUtils]: 48: Hoare triple {36566#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:11,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {36567#(<= 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); {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:11,347 INFO L273 TraceCheckUtils]: 50: Hoare triple {36567#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36567#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {36567#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:11,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {36568#(<= 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); {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:11,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {36568#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36568#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:11,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {36568#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:11,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {36569#(<= 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); {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:11,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {36569#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36569#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:11,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {36569#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:11,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {36570#(<= 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); {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:11,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {36570#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36570#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:11,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {36570#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:11,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {36571#(<= 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); {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:11,354 INFO L273 TraceCheckUtils]: 62: Hoare triple {36571#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36571#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:11,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {36571#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:11,355 INFO L273 TraceCheckUtils]: 64: Hoare triple {36572#(<= 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); {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:11,356 INFO L273 TraceCheckUtils]: 65: Hoare triple {36572#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36572#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:11,356 INFO L273 TraceCheckUtils]: 66: Hoare triple {36572#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:11,357 INFO L273 TraceCheckUtils]: 67: Hoare triple {36573#(<= 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); {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:11,357 INFO L273 TraceCheckUtils]: 68: Hoare triple {36573#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36573#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:11,358 INFO L273 TraceCheckUtils]: 69: Hoare triple {36573#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:11,358 INFO L273 TraceCheckUtils]: 70: Hoare triple {36574#(<= 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); {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:11,359 INFO L273 TraceCheckUtils]: 71: Hoare triple {36574#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36574#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:11,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {36574#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:11,360 INFO L273 TraceCheckUtils]: 73: Hoare triple {36575#(<= 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); {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:11,361 INFO L273 TraceCheckUtils]: 74: Hoare triple {36575#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36575#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:11,361 INFO L273 TraceCheckUtils]: 75: Hoare triple {36575#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:11,362 INFO L273 TraceCheckUtils]: 76: Hoare triple {36576#(<= 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); {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:11,362 INFO L273 TraceCheckUtils]: 77: Hoare triple {36576#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36576#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:11,363 INFO L273 TraceCheckUtils]: 78: Hoare triple {36576#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:11,363 INFO L273 TraceCheckUtils]: 79: Hoare triple {36577#(<= 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); {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:11,364 INFO L273 TraceCheckUtils]: 80: Hoare triple {36577#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36577#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:11,364 INFO L273 TraceCheckUtils]: 81: Hoare triple {36577#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:11,365 INFO L273 TraceCheckUtils]: 82: Hoare triple {36578#(<= 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); {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:11,365 INFO L273 TraceCheckUtils]: 83: Hoare triple {36578#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36578#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:11,366 INFO L273 TraceCheckUtils]: 84: Hoare triple {36578#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:11,367 INFO L273 TraceCheckUtils]: 85: Hoare triple {36579#(<= 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); {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:11,367 INFO L273 TraceCheckUtils]: 86: Hoare triple {36579#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36579#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:11,368 INFO L273 TraceCheckUtils]: 87: Hoare triple {36579#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:11,368 INFO L273 TraceCheckUtils]: 88: Hoare triple {36580#(<= 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); {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:11,369 INFO L273 TraceCheckUtils]: 89: Hoare triple {36580#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36580#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:11,369 INFO L273 TraceCheckUtils]: 90: Hoare triple {36580#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:11,370 INFO L273 TraceCheckUtils]: 91: Hoare triple {36581#(<= 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); {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:11,370 INFO L273 TraceCheckUtils]: 92: Hoare triple {36581#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36581#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:11,371 INFO L273 TraceCheckUtils]: 93: Hoare triple {36581#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:11,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {36582#(<= 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); {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:11,372 INFO L273 TraceCheckUtils]: 95: Hoare triple {36582#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36582#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:11,372 INFO L273 TraceCheckUtils]: 96: Hoare triple {36582#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:11,373 INFO L273 TraceCheckUtils]: 97: Hoare triple {36583#(<= 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); {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:11,373 INFO L273 TraceCheckUtils]: 98: Hoare triple {36583#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36583#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:11,374 INFO L273 TraceCheckUtils]: 99: Hoare triple {36583#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:11,375 INFO L273 TraceCheckUtils]: 100: Hoare triple {36584#(<= 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); {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:11,375 INFO L273 TraceCheckUtils]: 101: Hoare triple {36584#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36584#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:11,376 INFO L273 TraceCheckUtils]: 102: Hoare triple {36584#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:11,376 INFO L273 TraceCheckUtils]: 103: Hoare triple {36585#(<= 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); {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:11,377 INFO L273 TraceCheckUtils]: 104: Hoare triple {36585#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36585#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:11,377 INFO L273 TraceCheckUtils]: 105: Hoare triple {36585#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:11,378 INFO L273 TraceCheckUtils]: 106: Hoare triple {36586#(<= 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); {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:11,378 INFO L273 TraceCheckUtils]: 107: Hoare triple {36586#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36586#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:11,379 INFO L273 TraceCheckUtils]: 108: Hoare triple {36586#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:11,379 INFO L273 TraceCheckUtils]: 109: Hoare triple {36587#(<= 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); {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:11,380 INFO L273 TraceCheckUtils]: 110: Hoare triple {36587#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36587#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:11,381 INFO L273 TraceCheckUtils]: 111: Hoare triple {36587#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:11,381 INFO L273 TraceCheckUtils]: 112: Hoare triple {36588#(<= 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); {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:11,381 INFO L273 TraceCheckUtils]: 113: Hoare triple {36588#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36588#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:11,382 INFO L273 TraceCheckUtils]: 114: Hoare triple {36588#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:11,383 INFO L273 TraceCheckUtils]: 115: Hoare triple {36589#(<= 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); {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:11,383 INFO L273 TraceCheckUtils]: 116: Hoare triple {36589#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36589#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:11,384 INFO L273 TraceCheckUtils]: 117: Hoare triple {36589#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:11,384 INFO L273 TraceCheckUtils]: 118: Hoare triple {36590#(<= 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); {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:11,385 INFO L273 TraceCheckUtils]: 119: Hoare triple {36590#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36590#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:11,385 INFO L273 TraceCheckUtils]: 120: Hoare triple {36590#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:11,386 INFO L273 TraceCheckUtils]: 121: Hoare triple {36591#(<= 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); {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:11,386 INFO L273 TraceCheckUtils]: 122: Hoare triple {36591#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36591#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:11,387 INFO L273 TraceCheckUtils]: 123: Hoare triple {36591#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:11,387 INFO L273 TraceCheckUtils]: 124: Hoare triple {36592#(<= 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); {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:11,388 INFO L273 TraceCheckUtils]: 125: Hoare triple {36592#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36592#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:11,389 INFO L273 TraceCheckUtils]: 126: Hoare triple {36592#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:11,389 INFO L273 TraceCheckUtils]: 127: Hoare triple {36593#(<= 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); {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:11,390 INFO L273 TraceCheckUtils]: 128: Hoare triple {36593#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {36593#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:11,390 INFO L273 TraceCheckUtils]: 129: Hoare triple {36593#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {36594#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:11,391 INFO L273 TraceCheckUtils]: 130: Hoare triple {36594#(<= main_~k~0 41)} assume !(~k~0 < 100000); {36551#false} is VALID [2018-11-23 11:54:11,391 INFO L273 TraceCheckUtils]: 131: Hoare triple {36551#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); {36551#false} is VALID [2018-11-23 11:54:11,391 INFO L273 TraceCheckUtils]: 132: Hoare triple {36551#false} ~x~0 := 0; {36551#false} is VALID [2018-11-23 11:54:11,391 INFO L273 TraceCheckUtils]: 133: Hoare triple {36551#false} assume !(~x~0 < ~i~0); {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L273 TraceCheckUtils]: 134: Hoare triple {36551#false} ~x~0 := 1 + ~i~0; {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L273 TraceCheckUtils]: 135: Hoare triple {36551#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); {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L256 TraceCheckUtils]: 136: Hoare triple {36551#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L273 TraceCheckUtils]: 137: Hoare triple {36551#false} ~cond := #in~cond; {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L273 TraceCheckUtils]: 138: Hoare triple {36551#false} assume 0 == ~cond; {36551#false} is VALID [2018-11-23 11:54:11,392 INFO L273 TraceCheckUtils]: 139: Hoare triple {36551#false} assume !false; {36551#false} is VALID [2018-11-23 11:54:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:11,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:11,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2018-11-23 11:54:11,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2018-11-23 11:54:11,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:11,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 11:54:11,557 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-23 11:54:11,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 11:54:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 11:54:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:54:11,559 INFO L87 Difference]: Start difference. First operand 168 states and 221 transitions. Second operand 47 states. [2018-11-23 11:54:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:14,975 INFO L93 Difference]: Finished difference Result 213 states and 282 transitions. [2018-11-23 11:54:14,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:54:14,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2018-11-23 11:54:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:54:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2018-11-23 11:54:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:54:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 275 transitions. [2018-11-23 11:54:14,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 275 transitions. [2018-11-23 11:54:15,294 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-23 11:54:15,298 INFO L225 Difference]: With dead ends: 213 [2018-11-23 11:54:15,298 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 11:54:15,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-11-23 11:54:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 11:54:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-11-23 11:54:15,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:15,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 171 states. [2018-11-23 11:54:15,415 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 171 states. [2018-11-23 11:54:15,415 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 171 states. [2018-11-23 11:54:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:15,419 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2018-11-23 11:54:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 236 transitions. [2018-11-23 11:54:15,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:15,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:15,419 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 179 states. [2018-11-23 11:54:15,419 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 179 states. [2018-11-23 11:54:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:15,421 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2018-11-23 11:54:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 236 transitions. [2018-11-23 11:54:15,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:15,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:15,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:15,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:54:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2018-11-23 11:54:15,424 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 140 [2018-11-23 11:54:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:15,425 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2018-11-23 11:54:15,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 11:54:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2018-11-23 11:54:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 11:54:15,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:15,425 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:15,425 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:15,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1619612695, now seen corresponding path program 31 times [2018-11-23 11:54:15,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:15,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:15,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:16,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {37978#true} call ULTIMATE.init(); {37978#true} is VALID [2018-11-23 11:54:16,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {37978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37978#true} is VALID [2018-11-23 11:54:16,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {37978#true} assume true; {37978#true} is VALID [2018-11-23 11:54:16,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37978#true} {37978#true} #130#return; {37978#true} is VALID [2018-11-23 11:54:16,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {37978#true} call #t~ret15 := main(); {37978#true} is VALID [2018-11-23 11:54:16,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {37978#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {37980#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:16,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {37980#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {37981#(= main_~k~0 0)} is VALID [2018-11-23 11:54:16,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {37981#(= 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); {37981#(= main_~k~0 0)} is VALID [2018-11-23 11:54:16,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {37981#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37981#(= main_~k~0 0)} is VALID [2018-11-23 11:54:16,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {37981#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:16,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {37982#(<= 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); {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:16,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {37982#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:16,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {37982#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:16,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {37983#(<= 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); {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:16,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {37983#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:16,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {37983#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:16,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {37984#(<= 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); {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:16,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {37984#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:16,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {37984#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:16,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {37985#(<= 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); {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:16,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {37985#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:16,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {37985#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:16,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {37986#(<= 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); {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:16,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {37986#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:16,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {37986#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:16,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {37987#(<= 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); {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:16,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {37987#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:16,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {37987#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:16,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {37988#(<= 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); {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:16,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {37988#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:16,726 INFO L273 TraceCheckUtils]: 30: Hoare triple {37988#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:16,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {37989#(<= 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); {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:16,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {37989#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:16,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {37989#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:16,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {37990#(<= 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); {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:16,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {37990#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:16,730 INFO L273 TraceCheckUtils]: 36: Hoare triple {37990#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:16,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {37991#(<= 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); {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:16,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {37991#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:16,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {37991#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:16,732 INFO L273 TraceCheckUtils]: 40: Hoare triple {37992#(<= 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); {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:16,732 INFO L273 TraceCheckUtils]: 41: Hoare triple {37992#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:16,733 INFO L273 TraceCheckUtils]: 42: Hoare triple {37992#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:16,733 INFO L273 TraceCheckUtils]: 43: Hoare triple {37993#(<= 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); {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:16,734 INFO L273 TraceCheckUtils]: 44: Hoare triple {37993#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:16,734 INFO L273 TraceCheckUtils]: 45: Hoare triple {37993#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:16,735 INFO L273 TraceCheckUtils]: 46: Hoare triple {37994#(<= 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); {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:16,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {37994#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:16,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {37994#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:16,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {37995#(<= 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); {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:16,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {37995#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:16,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {37995#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:16,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {37996#(<= 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); {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:16,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {37996#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:16,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {37996#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:16,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {37997#(<= 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); {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:16,740 INFO L273 TraceCheckUtils]: 56: Hoare triple {37997#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:16,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {37997#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:16,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {37998#(<= 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); {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:16,742 INFO L273 TraceCheckUtils]: 59: Hoare triple {37998#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:16,742 INFO L273 TraceCheckUtils]: 60: Hoare triple {37998#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:16,743 INFO L273 TraceCheckUtils]: 61: Hoare triple {37999#(<= 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); {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:16,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {37999#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:16,744 INFO L273 TraceCheckUtils]: 63: Hoare triple {37999#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:16,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {38000#(<= 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); {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:16,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {38000#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:16,746 INFO L273 TraceCheckUtils]: 66: Hoare triple {38000#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:16,746 INFO L273 TraceCheckUtils]: 67: Hoare triple {38001#(<= 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); {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:16,747 INFO L273 TraceCheckUtils]: 68: Hoare triple {38001#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:16,747 INFO L273 TraceCheckUtils]: 69: Hoare triple {38001#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:16,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {38002#(<= 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); {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:16,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {38002#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:16,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {38002#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:16,749 INFO L273 TraceCheckUtils]: 73: Hoare triple {38003#(<= 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); {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:16,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {38003#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:16,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {38003#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:16,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {38004#(<= 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); {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:16,751 INFO L273 TraceCheckUtils]: 77: Hoare triple {38004#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:16,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {38004#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:16,753 INFO L273 TraceCheckUtils]: 79: Hoare triple {38005#(<= 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); {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:16,753 INFO L273 TraceCheckUtils]: 80: Hoare triple {38005#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:16,754 INFO L273 TraceCheckUtils]: 81: Hoare triple {38005#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:16,754 INFO L273 TraceCheckUtils]: 82: Hoare triple {38006#(<= 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); {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:16,755 INFO L273 TraceCheckUtils]: 83: Hoare triple {38006#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:16,755 INFO L273 TraceCheckUtils]: 84: Hoare triple {38006#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:16,756 INFO L273 TraceCheckUtils]: 85: Hoare triple {38007#(<= 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); {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:16,756 INFO L273 TraceCheckUtils]: 86: Hoare triple {38007#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:16,757 INFO L273 TraceCheckUtils]: 87: Hoare triple {38007#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:16,757 INFO L273 TraceCheckUtils]: 88: Hoare triple {38008#(<= 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); {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:16,758 INFO L273 TraceCheckUtils]: 89: Hoare triple {38008#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:16,758 INFO L273 TraceCheckUtils]: 90: Hoare triple {38008#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:16,759 INFO L273 TraceCheckUtils]: 91: Hoare triple {38009#(<= 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); {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:16,759 INFO L273 TraceCheckUtils]: 92: Hoare triple {38009#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:16,760 INFO L273 TraceCheckUtils]: 93: Hoare triple {38009#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:16,761 INFO L273 TraceCheckUtils]: 94: Hoare triple {38010#(<= 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); {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:16,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {38010#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:16,762 INFO L273 TraceCheckUtils]: 96: Hoare triple {38010#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:16,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {38011#(<= 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); {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:16,763 INFO L273 TraceCheckUtils]: 98: Hoare triple {38011#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:16,763 INFO L273 TraceCheckUtils]: 99: Hoare triple {38011#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:16,764 INFO L273 TraceCheckUtils]: 100: Hoare triple {38012#(<= 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); {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:16,764 INFO L273 TraceCheckUtils]: 101: Hoare triple {38012#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:16,765 INFO L273 TraceCheckUtils]: 102: Hoare triple {38012#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:16,765 INFO L273 TraceCheckUtils]: 103: Hoare triple {38013#(<= 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); {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:16,766 INFO L273 TraceCheckUtils]: 104: Hoare triple {38013#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:16,766 INFO L273 TraceCheckUtils]: 105: Hoare triple {38013#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:16,767 INFO L273 TraceCheckUtils]: 106: Hoare triple {38014#(<= 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); {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:16,767 INFO L273 TraceCheckUtils]: 107: Hoare triple {38014#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:16,768 INFO L273 TraceCheckUtils]: 108: Hoare triple {38014#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:16,769 INFO L273 TraceCheckUtils]: 109: Hoare triple {38015#(<= 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); {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:16,769 INFO L273 TraceCheckUtils]: 110: Hoare triple {38015#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:16,770 INFO L273 TraceCheckUtils]: 111: Hoare triple {38015#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:16,770 INFO L273 TraceCheckUtils]: 112: Hoare triple {38016#(<= 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); {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:16,771 INFO L273 TraceCheckUtils]: 113: Hoare triple {38016#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:16,771 INFO L273 TraceCheckUtils]: 114: Hoare triple {38016#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:16,772 INFO L273 TraceCheckUtils]: 115: Hoare triple {38017#(<= 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); {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:16,772 INFO L273 TraceCheckUtils]: 116: Hoare triple {38017#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:16,773 INFO L273 TraceCheckUtils]: 117: Hoare triple {38017#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:16,773 INFO L273 TraceCheckUtils]: 118: Hoare triple {38018#(<= 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); {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:16,774 INFO L273 TraceCheckUtils]: 119: Hoare triple {38018#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:16,774 INFO L273 TraceCheckUtils]: 120: Hoare triple {38018#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:16,775 INFO L273 TraceCheckUtils]: 121: Hoare triple {38019#(<= 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); {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:16,775 INFO L273 TraceCheckUtils]: 122: Hoare triple {38019#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:16,776 INFO L273 TraceCheckUtils]: 123: Hoare triple {38019#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:16,777 INFO L273 TraceCheckUtils]: 124: Hoare triple {38020#(<= 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); {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:16,777 INFO L273 TraceCheckUtils]: 125: Hoare triple {38020#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:16,778 INFO L273 TraceCheckUtils]: 126: Hoare triple {38020#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:16,778 INFO L273 TraceCheckUtils]: 127: Hoare triple {38021#(<= 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); {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:16,779 INFO L273 TraceCheckUtils]: 128: Hoare triple {38021#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:16,779 INFO L273 TraceCheckUtils]: 129: Hoare triple {38021#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:16,780 INFO L273 TraceCheckUtils]: 130: Hoare triple {38022#(<= 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); {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:16,780 INFO L273 TraceCheckUtils]: 131: Hoare triple {38022#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:16,781 INFO L273 TraceCheckUtils]: 132: Hoare triple {38022#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {38023#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:16,781 INFO L273 TraceCheckUtils]: 133: Hoare triple {38023#(<= main_~k~0 42)} assume !(~k~0 < 100000); {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L273 TraceCheckUtils]: 134: Hoare triple {37979#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); {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L273 TraceCheckUtils]: 135: Hoare triple {37979#false} ~x~0 := 0; {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L273 TraceCheckUtils]: 136: Hoare triple {37979#false} assume !(~x~0 < ~i~0); {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L273 TraceCheckUtils]: 137: Hoare triple {37979#false} ~x~0 := 1 + ~i~0; {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L273 TraceCheckUtils]: 138: Hoare triple {37979#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); {37979#false} is VALID [2018-11-23 11:54:16,782 INFO L256 TraceCheckUtils]: 139: Hoare triple {37979#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {37979#false} is VALID [2018-11-23 11:54:16,783 INFO L273 TraceCheckUtils]: 140: Hoare triple {37979#false} ~cond := #in~cond; {37979#false} is VALID [2018-11-23 11:54:16,783 INFO L273 TraceCheckUtils]: 141: Hoare triple {37979#false} assume 0 == ~cond; {37979#false} is VALID [2018-11-23 11:54:16,783 INFO L273 TraceCheckUtils]: 142: Hoare triple {37979#false} assume !false; {37979#false} is VALID [2018-11-23 11:54:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:16,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:16,797 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-23 11:54:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:16,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:17,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {37978#true} call ULTIMATE.init(); {37978#true} is VALID [2018-11-23 11:54:17,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {37978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37978#true} is VALID [2018-11-23 11:54:17,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {37978#true} assume true; {37978#true} is VALID [2018-11-23 11:54:17,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37978#true} {37978#true} #130#return; {37978#true} is VALID [2018-11-23 11:54:17,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {37978#true} call #t~ret15 := main(); {37978#true} is VALID [2018-11-23 11:54:17,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {37978#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {38042#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:17,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {38042#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {38046#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:17,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {38046#(<= 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); {38046#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:17,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {38046#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38046#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:17,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {38046#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:17,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {37982#(<= 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); {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:17,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {37982#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {37982#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:17,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {37982#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:17,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {37983#(<= 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); {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:17,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {37983#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37983#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:17,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {37983#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:17,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {37984#(<= 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); {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:17,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {37984#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37984#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:17,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {37984#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:17,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {37985#(<= 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); {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:17,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {37985#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37985#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:17,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {37985#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:17,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {37986#(<= 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); {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:17,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {37986#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37986#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:17,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {37986#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:17,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {37987#(<= 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); {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:17,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {37987#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37987#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:17,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {37987#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:17,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {37988#(<= 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); {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:17,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {37988#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37988#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:17,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {37988#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:17,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {37989#(<= 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); {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:17,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {37989#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37989#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:17,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {37989#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:17,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {37990#(<= 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); {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:17,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {37990#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37990#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:17,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {37990#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:17,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {37991#(<= 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); {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:17,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {37991#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37991#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:17,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {37991#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:17,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {37992#(<= 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); {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:17,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {37992#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37992#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:17,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {37992#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:17,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {37993#(<= 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); {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:17,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {37993#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37993#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:17,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {37993#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:17,231 INFO L273 TraceCheckUtils]: 46: Hoare triple {37994#(<= 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); {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:17,231 INFO L273 TraceCheckUtils]: 47: Hoare triple {37994#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37994#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:17,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {37994#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:17,232 INFO L273 TraceCheckUtils]: 49: Hoare triple {37995#(<= 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); {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:17,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {37995#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37995#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:17,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {37995#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:17,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {37996#(<= 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); {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:17,234 INFO L273 TraceCheckUtils]: 53: Hoare triple {37996#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37996#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:17,235 INFO L273 TraceCheckUtils]: 54: Hoare triple {37996#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:17,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {37997#(<= 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); {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:17,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {37997#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37997#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:17,237 INFO L273 TraceCheckUtils]: 57: Hoare triple {37997#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:17,237 INFO L273 TraceCheckUtils]: 58: Hoare triple {37998#(<= 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); {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:17,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {37998#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37998#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:17,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {37998#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:17,239 INFO L273 TraceCheckUtils]: 61: Hoare triple {37999#(<= 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); {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:17,239 INFO L273 TraceCheckUtils]: 62: Hoare triple {37999#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {37999#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:17,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {37999#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:17,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {38000#(<= 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); {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:17,241 INFO L273 TraceCheckUtils]: 65: Hoare triple {38000#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38000#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:17,241 INFO L273 TraceCheckUtils]: 66: Hoare triple {38000#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:17,242 INFO L273 TraceCheckUtils]: 67: Hoare triple {38001#(<= 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); {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:17,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {38001#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38001#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:17,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {38001#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:17,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {38002#(<= 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); {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:17,244 INFO L273 TraceCheckUtils]: 71: Hoare triple {38002#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38002#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:17,245 INFO L273 TraceCheckUtils]: 72: Hoare triple {38002#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:17,245 INFO L273 TraceCheckUtils]: 73: Hoare triple {38003#(<= 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); {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:17,245 INFO L273 TraceCheckUtils]: 74: Hoare triple {38003#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38003#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:17,246 INFO L273 TraceCheckUtils]: 75: Hoare triple {38003#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:17,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {38004#(<= 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); {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:17,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {38004#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38004#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:17,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {38004#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:17,248 INFO L273 TraceCheckUtils]: 79: Hoare triple {38005#(<= 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); {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:17,249 INFO L273 TraceCheckUtils]: 80: Hoare triple {38005#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38005#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:17,249 INFO L273 TraceCheckUtils]: 81: Hoare triple {38005#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:17,250 INFO L273 TraceCheckUtils]: 82: Hoare triple {38006#(<= 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); {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:17,250 INFO L273 TraceCheckUtils]: 83: Hoare triple {38006#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38006#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:17,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {38006#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:17,251 INFO L273 TraceCheckUtils]: 85: Hoare triple {38007#(<= 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); {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:17,252 INFO L273 TraceCheckUtils]: 86: Hoare triple {38007#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38007#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:17,253 INFO L273 TraceCheckUtils]: 87: Hoare triple {38007#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:17,253 INFO L273 TraceCheckUtils]: 88: Hoare triple {38008#(<= 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); {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:17,253 INFO L273 TraceCheckUtils]: 89: Hoare triple {38008#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38008#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:17,254 INFO L273 TraceCheckUtils]: 90: Hoare triple {38008#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:17,255 INFO L273 TraceCheckUtils]: 91: Hoare triple {38009#(<= 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); {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:17,255 INFO L273 TraceCheckUtils]: 92: Hoare triple {38009#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38009#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:17,256 INFO L273 TraceCheckUtils]: 93: Hoare triple {38009#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:17,256 INFO L273 TraceCheckUtils]: 94: Hoare triple {38010#(<= 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); {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:17,257 INFO L273 TraceCheckUtils]: 95: Hoare triple {38010#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38010#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:17,257 INFO L273 TraceCheckUtils]: 96: Hoare triple {38010#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:17,258 INFO L273 TraceCheckUtils]: 97: Hoare triple {38011#(<= 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); {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:17,258 INFO L273 TraceCheckUtils]: 98: Hoare triple {38011#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38011#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:17,259 INFO L273 TraceCheckUtils]: 99: Hoare triple {38011#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:17,259 INFO L273 TraceCheckUtils]: 100: Hoare triple {38012#(<= 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); {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:17,260 INFO L273 TraceCheckUtils]: 101: Hoare triple {38012#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38012#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:17,260 INFO L273 TraceCheckUtils]: 102: Hoare triple {38012#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:17,261 INFO L273 TraceCheckUtils]: 103: Hoare triple {38013#(<= 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); {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:17,261 INFO L273 TraceCheckUtils]: 104: Hoare triple {38013#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38013#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:17,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {38013#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:17,263 INFO L273 TraceCheckUtils]: 106: Hoare triple {38014#(<= 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); {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:17,263 INFO L273 TraceCheckUtils]: 107: Hoare triple {38014#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38014#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:17,264 INFO L273 TraceCheckUtils]: 108: Hoare triple {38014#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:17,264 INFO L273 TraceCheckUtils]: 109: Hoare triple {38015#(<= 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); {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:17,265 INFO L273 TraceCheckUtils]: 110: Hoare triple {38015#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38015#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:17,265 INFO L273 TraceCheckUtils]: 111: Hoare triple {38015#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:17,266 INFO L273 TraceCheckUtils]: 112: Hoare triple {38016#(<= 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); {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:17,266 INFO L273 TraceCheckUtils]: 113: Hoare triple {38016#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38016#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:17,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {38016#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:17,267 INFO L273 TraceCheckUtils]: 115: Hoare triple {38017#(<= 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); {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:17,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {38017#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38017#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:17,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {38017#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:17,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {38018#(<= 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); {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:17,269 INFO L273 TraceCheckUtils]: 119: Hoare triple {38018#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38018#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:17,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {38018#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:17,271 INFO L273 TraceCheckUtils]: 121: Hoare triple {38019#(<= 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); {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:17,271 INFO L273 TraceCheckUtils]: 122: Hoare triple {38019#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38019#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:17,272 INFO L273 TraceCheckUtils]: 123: Hoare triple {38019#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:17,272 INFO L273 TraceCheckUtils]: 124: Hoare triple {38020#(<= 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); {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:17,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {38020#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38020#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:17,273 INFO L273 TraceCheckUtils]: 126: Hoare triple {38020#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:17,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {38021#(<= 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); {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:17,274 INFO L273 TraceCheckUtils]: 128: Hoare triple {38021#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38021#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:17,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {38021#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:17,275 INFO L273 TraceCheckUtils]: 130: Hoare triple {38022#(<= 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); {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:17,276 INFO L273 TraceCheckUtils]: 131: Hoare triple {38022#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {38022#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:17,277 INFO L273 TraceCheckUtils]: 132: Hoare triple {38022#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {38023#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:17,277 INFO L273 TraceCheckUtils]: 133: Hoare triple {38023#(<= main_~k~0 42)} assume !(~k~0 < 100000); {37979#false} is VALID [2018-11-23 11:54:17,277 INFO L273 TraceCheckUtils]: 134: Hoare triple {37979#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); {37979#false} is VALID [2018-11-23 11:54:17,277 INFO L273 TraceCheckUtils]: 135: Hoare triple {37979#false} ~x~0 := 0; {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L273 TraceCheckUtils]: 136: Hoare triple {37979#false} assume !(~x~0 < ~i~0); {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L273 TraceCheckUtils]: 137: Hoare triple {37979#false} ~x~0 := 1 + ~i~0; {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L273 TraceCheckUtils]: 138: Hoare triple {37979#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); {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L256 TraceCheckUtils]: 139: Hoare triple {37979#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L273 TraceCheckUtils]: 140: Hoare triple {37979#false} ~cond := #in~cond; {37979#false} is VALID [2018-11-23 11:54:17,278 INFO L273 TraceCheckUtils]: 141: Hoare triple {37979#false} assume 0 == ~cond; {37979#false} is VALID [2018-11-23 11:54:17,279 INFO L273 TraceCheckUtils]: 142: Hoare triple {37979#false} assume !false; {37979#false} is VALID [2018-11-23 11:54:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:17,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:17,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2018-11-23 11:54:17,312 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 143 [2018-11-23 11:54:17,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:17,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:54:17,460 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-23 11:54:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:54:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:54:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:54:17,461 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand 48 states. [2018-11-23 11:54:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:19,805 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2018-11-23 11:54:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:54:19,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 143 [2018-11-23 11:54:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:54:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 279 transitions. [2018-11-23 11:54:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:54:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 279 transitions. [2018-11-23 11:54:19,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 279 transitions. [2018-11-23 11:54:20,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:20,075 INFO L225 Difference]: With dead ends: 216 [2018-11-23 11:54:20,075 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 11:54:20,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-11-23 11:54:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 11:54:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-11-23 11:54:20,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:20,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 174 states. [2018-11-23 11:54:20,207 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 174 states. [2018-11-23 11:54:20,207 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 174 states. [2018-11-23 11:54:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:20,210 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2018-11-23 11:54:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-11-23 11:54:20,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:20,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:20,211 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 182 states. [2018-11-23 11:54:20,211 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 182 states. [2018-11-23 11:54:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:20,213 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2018-11-23 11:54:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2018-11-23 11:54:20,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:20,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:20,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:20,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 11:54:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2018-11-23 11:54:20,216 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 143 [2018-11-23 11:54:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:20,217 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2018-11-23 11:54:20,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:54:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2018-11-23 11:54:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 11:54:20,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:20,217 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:20,218 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:20,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 285422848, now seen corresponding path program 32 times [2018-11-23 11:54:20,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:20,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:22,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2018-11-23 11:54:22,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {39432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39432#true} is VALID [2018-11-23 11:54:22,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {39432#true} assume true; {39432#true} is VALID [2018-11-23 11:54:22,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39432#true} {39432#true} #130#return; {39432#true} is VALID [2018-11-23 11:54:22,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {39432#true} call #t~ret15 := main(); {39432#true} is VALID [2018-11-23 11:54:22,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {39432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {39434#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:22,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {39434#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {39435#(= main_~k~0 0)} is VALID [2018-11-23 11:54:22,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {39435#(= 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); {39435#(= main_~k~0 0)} is VALID [2018-11-23 11:54:22,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {39435#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39435#(= main_~k~0 0)} is VALID [2018-11-23 11:54:22,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {39435#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:22,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {39436#(<= 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); {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:22,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {39436#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:22,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {39436#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:22,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {39437#(<= 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); {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:22,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {39437#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:22,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {39437#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:22,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {39438#(<= 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); {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:22,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {39438#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:22,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {39438#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:22,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {39439#(<= 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); {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:22,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {39439#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:22,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {39439#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:22,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {39440#(<= 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); {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:22,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {39440#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:22,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {39440#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:22,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {39441#(<= 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); {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:22,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {39441#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:22,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {39441#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:22,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {39442#(<= 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); {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:22,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {39442#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:22,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {39442#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:22,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {39443#(<= 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); {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:22,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {39443#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:22,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {39443#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:22,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {39444#(<= 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); {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:22,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {39444#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:22,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {39444#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:22,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {39445#(<= 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); {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:22,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {39445#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:22,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {39445#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:22,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {39446#(<= 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); {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:22,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {39446#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:22,164 INFO L273 TraceCheckUtils]: 42: Hoare triple {39446#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:22,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {39447#(<= 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); {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:22,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {39447#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:22,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {39447#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:22,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {39448#(<= 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); {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:22,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {39448#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:22,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {39448#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:22,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {39449#(<= 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); {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:22,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {39449#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:22,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {39449#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:22,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {39450#(<= 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); {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:22,170 INFO L273 TraceCheckUtils]: 53: Hoare triple {39450#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:22,170 INFO L273 TraceCheckUtils]: 54: Hoare triple {39450#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:22,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {39451#(<= 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); {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:22,171 INFO L273 TraceCheckUtils]: 56: Hoare triple {39451#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:22,172 INFO L273 TraceCheckUtils]: 57: Hoare triple {39451#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:22,173 INFO L273 TraceCheckUtils]: 58: Hoare triple {39452#(<= 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); {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:22,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {39452#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:22,174 INFO L273 TraceCheckUtils]: 60: Hoare triple {39452#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:22,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {39453#(<= 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); {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:22,175 INFO L273 TraceCheckUtils]: 62: Hoare triple {39453#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:22,176 INFO L273 TraceCheckUtils]: 63: Hoare triple {39453#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:22,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {39454#(<= 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); {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:22,177 INFO L273 TraceCheckUtils]: 65: Hoare triple {39454#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:22,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {39454#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:22,178 INFO L273 TraceCheckUtils]: 67: Hoare triple {39455#(<= 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); {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:22,178 INFO L273 TraceCheckUtils]: 68: Hoare triple {39455#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:22,179 INFO L273 TraceCheckUtils]: 69: Hoare triple {39455#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:22,180 INFO L273 TraceCheckUtils]: 70: Hoare triple {39456#(<= 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); {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:22,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {39456#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:22,181 INFO L273 TraceCheckUtils]: 72: Hoare triple {39456#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:22,181 INFO L273 TraceCheckUtils]: 73: Hoare triple {39457#(<= 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); {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:22,182 INFO L273 TraceCheckUtils]: 74: Hoare triple {39457#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:22,182 INFO L273 TraceCheckUtils]: 75: Hoare triple {39457#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:22,183 INFO L273 TraceCheckUtils]: 76: Hoare triple {39458#(<= 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); {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:22,183 INFO L273 TraceCheckUtils]: 77: Hoare triple {39458#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:22,184 INFO L273 TraceCheckUtils]: 78: Hoare triple {39458#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:22,185 INFO L273 TraceCheckUtils]: 79: Hoare triple {39459#(<= 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); {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:22,185 INFO L273 TraceCheckUtils]: 80: Hoare triple {39459#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:22,186 INFO L273 TraceCheckUtils]: 81: Hoare triple {39459#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:22,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {39460#(<= 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); {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:22,187 INFO L273 TraceCheckUtils]: 83: Hoare triple {39460#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:22,188 INFO L273 TraceCheckUtils]: 84: Hoare triple {39460#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:22,188 INFO L273 TraceCheckUtils]: 85: Hoare triple {39461#(<= 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); {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:22,189 INFO L273 TraceCheckUtils]: 86: Hoare triple {39461#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:22,189 INFO L273 TraceCheckUtils]: 87: Hoare triple {39461#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:22,190 INFO L273 TraceCheckUtils]: 88: Hoare triple {39462#(<= 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); {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:22,190 INFO L273 TraceCheckUtils]: 89: Hoare triple {39462#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:22,191 INFO L273 TraceCheckUtils]: 90: Hoare triple {39462#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:22,192 INFO L273 TraceCheckUtils]: 91: Hoare triple {39463#(<= 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); {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:22,192 INFO L273 TraceCheckUtils]: 92: Hoare triple {39463#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:22,193 INFO L273 TraceCheckUtils]: 93: Hoare triple {39463#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:22,193 INFO L273 TraceCheckUtils]: 94: Hoare triple {39464#(<= 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); {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:22,194 INFO L273 TraceCheckUtils]: 95: Hoare triple {39464#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:22,195 INFO L273 TraceCheckUtils]: 96: Hoare triple {39464#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:22,195 INFO L273 TraceCheckUtils]: 97: Hoare triple {39465#(<= 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); {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:22,196 INFO L273 TraceCheckUtils]: 98: Hoare triple {39465#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:22,196 INFO L273 TraceCheckUtils]: 99: Hoare triple {39465#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:22,197 INFO L273 TraceCheckUtils]: 100: Hoare triple {39466#(<= 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); {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:22,197 INFO L273 TraceCheckUtils]: 101: Hoare triple {39466#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:22,198 INFO L273 TraceCheckUtils]: 102: Hoare triple {39466#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:22,198 INFO L273 TraceCheckUtils]: 103: Hoare triple {39467#(<= 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); {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:22,199 INFO L273 TraceCheckUtils]: 104: Hoare triple {39467#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:22,200 INFO L273 TraceCheckUtils]: 105: Hoare triple {39467#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:22,200 INFO L273 TraceCheckUtils]: 106: Hoare triple {39468#(<= 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); {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:22,201 INFO L273 TraceCheckUtils]: 107: Hoare triple {39468#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:22,201 INFO L273 TraceCheckUtils]: 108: Hoare triple {39468#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:22,202 INFO L273 TraceCheckUtils]: 109: Hoare triple {39469#(<= 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); {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:22,202 INFO L273 TraceCheckUtils]: 110: Hoare triple {39469#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:22,203 INFO L273 TraceCheckUtils]: 111: Hoare triple {39469#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:22,204 INFO L273 TraceCheckUtils]: 112: Hoare triple {39470#(<= 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); {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:22,204 INFO L273 TraceCheckUtils]: 113: Hoare triple {39470#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:22,205 INFO L273 TraceCheckUtils]: 114: Hoare triple {39470#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:22,205 INFO L273 TraceCheckUtils]: 115: Hoare triple {39471#(<= 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); {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:22,206 INFO L273 TraceCheckUtils]: 116: Hoare triple {39471#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:22,207 INFO L273 TraceCheckUtils]: 117: Hoare triple {39471#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:22,207 INFO L273 TraceCheckUtils]: 118: Hoare triple {39472#(<= 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); {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:22,208 INFO L273 TraceCheckUtils]: 119: Hoare triple {39472#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:22,208 INFO L273 TraceCheckUtils]: 120: Hoare triple {39472#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:22,209 INFO L273 TraceCheckUtils]: 121: Hoare triple {39473#(<= 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); {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:22,209 INFO L273 TraceCheckUtils]: 122: Hoare triple {39473#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:22,210 INFO L273 TraceCheckUtils]: 123: Hoare triple {39473#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:22,211 INFO L273 TraceCheckUtils]: 124: Hoare triple {39474#(<= 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); {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:22,211 INFO L273 TraceCheckUtils]: 125: Hoare triple {39474#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:22,212 INFO L273 TraceCheckUtils]: 126: Hoare triple {39474#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:22,212 INFO L273 TraceCheckUtils]: 127: Hoare triple {39475#(<= 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); {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:22,213 INFO L273 TraceCheckUtils]: 128: Hoare triple {39475#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:22,214 INFO L273 TraceCheckUtils]: 129: Hoare triple {39475#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:22,214 INFO L273 TraceCheckUtils]: 130: Hoare triple {39476#(<= 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); {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:22,215 INFO L273 TraceCheckUtils]: 131: Hoare triple {39476#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:22,215 INFO L273 TraceCheckUtils]: 132: Hoare triple {39476#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:22,216 INFO L273 TraceCheckUtils]: 133: Hoare triple {39477#(<= 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); {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:22,216 INFO L273 TraceCheckUtils]: 134: Hoare triple {39477#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:22,217 INFO L273 TraceCheckUtils]: 135: Hoare triple {39477#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {39478#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:22,218 INFO L273 TraceCheckUtils]: 136: Hoare triple {39478#(<= main_~k~0 43)} assume !(~k~0 < 100000); {39433#false} is VALID [2018-11-23 11:54:22,218 INFO L273 TraceCheckUtils]: 137: Hoare triple {39433#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); {39433#false} is VALID [2018-11-23 11:54:22,218 INFO L273 TraceCheckUtils]: 138: Hoare triple {39433#false} ~x~0 := 0; {39433#false} is VALID [2018-11-23 11:54:22,218 INFO L273 TraceCheckUtils]: 139: Hoare triple {39433#false} assume !(~x~0 < ~i~0); {39433#false} is VALID [2018-11-23 11:54:22,218 INFO L273 TraceCheckUtils]: 140: Hoare triple {39433#false} ~x~0 := 1 + ~i~0; {39433#false} is VALID [2018-11-23 11:54:22,219 INFO L273 TraceCheckUtils]: 141: Hoare triple {39433#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); {39433#false} is VALID [2018-11-23 11:54:22,219 INFO L256 TraceCheckUtils]: 142: Hoare triple {39433#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {39433#false} is VALID [2018-11-23 11:54:22,219 INFO L273 TraceCheckUtils]: 143: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2018-11-23 11:54:22,219 INFO L273 TraceCheckUtils]: 144: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2018-11-23 11:54:22,219 INFO L273 TraceCheckUtils]: 145: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2018-11-23 11:54:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:22,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:22,234 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-23 11:54:22,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:22,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:22,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:22,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:23,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2018-11-23 11:54:23,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {39432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39432#true} is VALID [2018-11-23 11:54:23,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {39432#true} assume true; {39432#true} is VALID [2018-11-23 11:54:23,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39432#true} {39432#true} #130#return; {39432#true} is VALID [2018-11-23 11:54:23,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {39432#true} call #t~ret15 := main(); {39432#true} is VALID [2018-11-23 11:54:23,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {39432#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {39497#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:23,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {39497#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {39501#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:23,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {39501#(<= 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); {39501#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:23,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {39501#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39501#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:23,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {39501#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:23,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {39436#(<= 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); {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:23,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {39436#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {39436#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:23,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {39436#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:23,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {39437#(<= 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); {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:23,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {39437#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39437#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:23,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {39437#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:23,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {39438#(<= 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); {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:23,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {39438#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39438#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:23,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {39438#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:23,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {39439#(<= 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); {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:23,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {39439#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39439#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:23,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {39439#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:23,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {39440#(<= 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); {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:23,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {39440#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39440#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:23,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {39440#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:23,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {39441#(<= 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); {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:23,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {39441#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39441#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:23,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {39441#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:23,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {39442#(<= 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); {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:23,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {39442#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39442#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:23,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {39442#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:23,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {39443#(<= 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); {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:23,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {39443#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39443#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:23,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {39443#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:23,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {39444#(<= 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); {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:23,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {39444#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39444#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:23,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {39444#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:23,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {39445#(<= 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); {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:23,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {39445#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39445#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:23,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {39445#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:23,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {39446#(<= 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); {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:23,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {39446#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39446#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:23,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {39446#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:23,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {39447#(<= 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); {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:23,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {39447#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39447#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:23,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {39447#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:23,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {39448#(<= 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); {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:23,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {39448#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39448#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:23,565 INFO L273 TraceCheckUtils]: 48: Hoare triple {39448#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:23,565 INFO L273 TraceCheckUtils]: 49: Hoare triple {39449#(<= 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); {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:23,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {39449#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39449#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:23,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {39449#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:23,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {39450#(<= 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); {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:23,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {39450#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39450#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:23,568 INFO L273 TraceCheckUtils]: 54: Hoare triple {39450#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:23,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {39451#(<= 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); {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:23,569 INFO L273 TraceCheckUtils]: 56: Hoare triple {39451#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39451#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:23,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {39451#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:23,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {39452#(<= 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); {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:23,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {39452#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39452#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:23,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {39452#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:23,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {39453#(<= 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); {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:23,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {39453#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39453#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:23,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {39453#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:23,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {39454#(<= 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); {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:23,574 INFO L273 TraceCheckUtils]: 65: Hoare triple {39454#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39454#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:23,575 INFO L273 TraceCheckUtils]: 66: Hoare triple {39454#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:23,575 INFO L273 TraceCheckUtils]: 67: Hoare triple {39455#(<= 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); {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:23,576 INFO L273 TraceCheckUtils]: 68: Hoare triple {39455#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39455#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:23,576 INFO L273 TraceCheckUtils]: 69: Hoare triple {39455#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:23,577 INFO L273 TraceCheckUtils]: 70: Hoare triple {39456#(<= 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); {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:23,577 INFO L273 TraceCheckUtils]: 71: Hoare triple {39456#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39456#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:23,578 INFO L273 TraceCheckUtils]: 72: Hoare triple {39456#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:23,578 INFO L273 TraceCheckUtils]: 73: Hoare triple {39457#(<= 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); {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:23,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {39457#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39457#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:23,580 INFO L273 TraceCheckUtils]: 75: Hoare triple {39457#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:23,580 INFO L273 TraceCheckUtils]: 76: Hoare triple {39458#(<= 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); {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:23,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {39458#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39458#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:23,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {39458#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:23,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {39459#(<= 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); {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:23,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {39459#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39459#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:23,583 INFO L273 TraceCheckUtils]: 81: Hoare triple {39459#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:23,583 INFO L273 TraceCheckUtils]: 82: Hoare triple {39460#(<= 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); {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:23,584 INFO L273 TraceCheckUtils]: 83: Hoare triple {39460#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39460#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:23,584 INFO L273 TraceCheckUtils]: 84: Hoare triple {39460#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:23,585 INFO L273 TraceCheckUtils]: 85: Hoare triple {39461#(<= 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); {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:23,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {39461#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39461#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:23,586 INFO L273 TraceCheckUtils]: 87: Hoare triple {39461#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:23,587 INFO L273 TraceCheckUtils]: 88: Hoare triple {39462#(<= 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); {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:23,587 INFO L273 TraceCheckUtils]: 89: Hoare triple {39462#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39462#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:23,588 INFO L273 TraceCheckUtils]: 90: Hoare triple {39462#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:23,588 INFO L273 TraceCheckUtils]: 91: Hoare triple {39463#(<= 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); {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:23,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {39463#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39463#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:23,589 INFO L273 TraceCheckUtils]: 93: Hoare triple {39463#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:23,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {39464#(<= 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); {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:23,590 INFO L273 TraceCheckUtils]: 95: Hoare triple {39464#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39464#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:23,591 INFO L273 TraceCheckUtils]: 96: Hoare triple {39464#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:23,592 INFO L273 TraceCheckUtils]: 97: Hoare triple {39465#(<= 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); {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:23,592 INFO L273 TraceCheckUtils]: 98: Hoare triple {39465#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39465#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:23,593 INFO L273 TraceCheckUtils]: 99: Hoare triple {39465#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:23,593 INFO L273 TraceCheckUtils]: 100: Hoare triple {39466#(<= 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); {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:23,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {39466#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39466#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:23,595 INFO L273 TraceCheckUtils]: 102: Hoare triple {39466#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:23,595 INFO L273 TraceCheckUtils]: 103: Hoare triple {39467#(<= 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); {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:23,596 INFO L273 TraceCheckUtils]: 104: Hoare triple {39467#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39467#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:23,596 INFO L273 TraceCheckUtils]: 105: Hoare triple {39467#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:23,597 INFO L273 TraceCheckUtils]: 106: Hoare triple {39468#(<= 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); {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:23,597 INFO L273 TraceCheckUtils]: 107: Hoare triple {39468#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39468#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:23,598 INFO L273 TraceCheckUtils]: 108: Hoare triple {39468#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:23,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {39469#(<= 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); {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:23,599 INFO L273 TraceCheckUtils]: 110: Hoare triple {39469#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39469#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:23,600 INFO L273 TraceCheckUtils]: 111: Hoare triple {39469#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:23,600 INFO L273 TraceCheckUtils]: 112: Hoare triple {39470#(<= 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); {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:23,601 INFO L273 TraceCheckUtils]: 113: Hoare triple {39470#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39470#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:23,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {39470#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:23,602 INFO L273 TraceCheckUtils]: 115: Hoare triple {39471#(<= 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); {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:23,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {39471#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39471#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:23,603 INFO L273 TraceCheckUtils]: 117: Hoare triple {39471#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:23,603 INFO L273 TraceCheckUtils]: 118: Hoare triple {39472#(<= 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); {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:23,604 INFO L273 TraceCheckUtils]: 119: Hoare triple {39472#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39472#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:23,605 INFO L273 TraceCheckUtils]: 120: Hoare triple {39472#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:23,605 INFO L273 TraceCheckUtils]: 121: Hoare triple {39473#(<= 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); {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:23,605 INFO L273 TraceCheckUtils]: 122: Hoare triple {39473#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39473#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:23,606 INFO L273 TraceCheckUtils]: 123: Hoare triple {39473#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:23,607 INFO L273 TraceCheckUtils]: 124: Hoare triple {39474#(<= 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); {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:23,607 INFO L273 TraceCheckUtils]: 125: Hoare triple {39474#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39474#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:23,608 INFO L273 TraceCheckUtils]: 126: Hoare triple {39474#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:23,608 INFO L273 TraceCheckUtils]: 127: Hoare triple {39475#(<= 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); {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:23,609 INFO L273 TraceCheckUtils]: 128: Hoare triple {39475#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39475#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:23,609 INFO L273 TraceCheckUtils]: 129: Hoare triple {39475#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:23,610 INFO L273 TraceCheckUtils]: 130: Hoare triple {39476#(<= 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); {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:23,610 INFO L273 TraceCheckUtils]: 131: Hoare triple {39476#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39476#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:23,611 INFO L273 TraceCheckUtils]: 132: Hoare triple {39476#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:23,611 INFO L273 TraceCheckUtils]: 133: Hoare triple {39477#(<= 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); {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:23,612 INFO L273 TraceCheckUtils]: 134: Hoare triple {39477#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {39477#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:23,613 INFO L273 TraceCheckUtils]: 135: Hoare triple {39477#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {39478#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:23,613 INFO L273 TraceCheckUtils]: 136: Hoare triple {39478#(<= main_~k~0 43)} assume !(~k~0 < 100000); {39433#false} is VALID [2018-11-23 11:54:23,613 INFO L273 TraceCheckUtils]: 137: Hoare triple {39433#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); {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L273 TraceCheckUtils]: 138: Hoare triple {39433#false} ~x~0 := 0; {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L273 TraceCheckUtils]: 139: Hoare triple {39433#false} assume !(~x~0 < ~i~0); {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L273 TraceCheckUtils]: 140: Hoare triple {39433#false} ~x~0 := 1 + ~i~0; {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L273 TraceCheckUtils]: 141: Hoare triple {39433#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); {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L256 TraceCheckUtils]: 142: Hoare triple {39433#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {39433#false} is VALID [2018-11-23 11:54:23,614 INFO L273 TraceCheckUtils]: 143: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2018-11-23 11:54:23,615 INFO L273 TraceCheckUtils]: 144: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2018-11-23 11:54:23,615 INFO L273 TraceCheckUtils]: 145: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2018-11-23 11:54:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:23,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:23,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2018-11-23 11:54:23,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 146 [2018-11-23 11:54:23,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:23,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 11:54:23,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:23,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 11:54:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 11:54:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:54:23,791 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand 49 states. [2018-11-23 11:54:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,555 INFO L93 Difference]: Finished difference Result 219 states and 290 transitions. [2018-11-23 11:54:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 11:54:27,555 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 146 [2018-11-23 11:54:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:54:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 283 transitions. [2018-11-23 11:54:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:54:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 283 transitions. [2018-11-23 11:54:27,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 283 transitions. [2018-11-23 11:54:27,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:27,833 INFO L225 Difference]: With dead ends: 219 [2018-11-23 11:54:27,833 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:54:27,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-11-23 11:54:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:54:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2018-11-23 11:54:27,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:27,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 177 states. [2018-11-23 11:54:27,939 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 177 states. [2018-11-23 11:54:27,939 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 177 states. [2018-11-23 11:54:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,943 INFO L93 Difference]: Finished difference Result 185 states and 244 transitions. [2018-11-23 11:54:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2018-11-23 11:54:27,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:27,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:27,943 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 185 states. [2018-11-23 11:54:27,943 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 185 states. [2018-11-23 11:54:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:27,947 INFO L93 Difference]: Finished difference Result 185 states and 244 transitions. [2018-11-23 11:54:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2018-11-23 11:54:27,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:27,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:27,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:27,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 11:54:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2018-11-23 11:54:27,950 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 146 [2018-11-23 11:54:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:27,950 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2018-11-23 11:54:27,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 11:54:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2018-11-23 11:54:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-23 11:54:27,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:27,951 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:27,951 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:27,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash -936951945, now seen corresponding path program 33 times [2018-11-23 11:54:27,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:27,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:29,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {40912#true} call ULTIMATE.init(); {40912#true} is VALID [2018-11-23 11:54:29,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {40912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40912#true} is VALID [2018-11-23 11:54:29,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {40912#true} assume true; {40912#true} is VALID [2018-11-23 11:54:29,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40912#true} {40912#true} #130#return; {40912#true} is VALID [2018-11-23 11:54:29,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {40912#true} call #t~ret15 := main(); {40912#true} is VALID [2018-11-23 11:54:29,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {40912#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40914#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:29,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {40914#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {40915#(= main_~k~0 0)} is VALID [2018-11-23 11:54:29,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {40915#(= 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); {40915#(= main_~k~0 0)} is VALID [2018-11-23 11:54:29,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {40915#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40915#(= main_~k~0 0)} is VALID [2018-11-23 11:54:29,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {40915#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {40916#(<= 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); {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {40916#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {40916#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {40917#(<= 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); {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {40917#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {40917#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {40918#(<= 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); {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {40918#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {40918#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {40919#(<= 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); {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {40919#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {40919#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {40920#(<= 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); {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {40920#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {40920#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {40921#(<= 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); {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {40921#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {40921#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {40922#(<= 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); {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {40922#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {40922#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {40923#(<= 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); {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {40923#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {40923#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {40924#(<= 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); {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {40924#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {40924#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {40925#(<= 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); {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {40925#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {40925#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {40926#(<= 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); {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {40926#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {40926#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {40927#(<= 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); {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {40927#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {40927#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {40928#(<= 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); {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {40928#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {40928#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {40929#(<= 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); {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,264 INFO L273 TraceCheckUtils]: 50: Hoare triple {40929#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,265 INFO L273 TraceCheckUtils]: 51: Hoare triple {40929#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {40930#(<= 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); {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {40930#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {40930#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {40931#(<= 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); {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {40931#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {40931#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {40932#(<= 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); {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {40932#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,270 INFO L273 TraceCheckUtils]: 60: Hoare triple {40932#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {40933#(<= 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); {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,271 INFO L273 TraceCheckUtils]: 62: Hoare triple {40933#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,271 INFO L273 TraceCheckUtils]: 63: Hoare triple {40933#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,272 INFO L273 TraceCheckUtils]: 64: Hoare triple {40934#(<= 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); {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,272 INFO L273 TraceCheckUtils]: 65: Hoare triple {40934#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:29,273 INFO L273 TraceCheckUtils]: 66: Hoare triple {40934#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {40935#(<= 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); {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,274 INFO L273 TraceCheckUtils]: 68: Hoare triple {40935#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:29,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {40935#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {40936#(<= 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); {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,276 INFO L273 TraceCheckUtils]: 71: Hoare triple {40936#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:29,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {40936#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,277 INFO L273 TraceCheckUtils]: 73: Hoare triple {40937#(<= 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); {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {40937#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:29,278 INFO L273 TraceCheckUtils]: 75: Hoare triple {40937#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,279 INFO L273 TraceCheckUtils]: 76: Hoare triple {40938#(<= 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); {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {40938#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:29,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {40938#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {40939#(<= 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); {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,281 INFO L273 TraceCheckUtils]: 80: Hoare triple {40939#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:29,282 INFO L273 TraceCheckUtils]: 81: Hoare triple {40939#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,282 INFO L273 TraceCheckUtils]: 82: Hoare triple {40940#(<= 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); {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {40940#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:29,283 INFO L273 TraceCheckUtils]: 84: Hoare triple {40940#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,284 INFO L273 TraceCheckUtils]: 85: Hoare triple {40941#(<= 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); {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,284 INFO L273 TraceCheckUtils]: 86: Hoare triple {40941#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:29,285 INFO L273 TraceCheckUtils]: 87: Hoare triple {40941#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,286 INFO L273 TraceCheckUtils]: 88: Hoare triple {40942#(<= 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); {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,286 INFO L273 TraceCheckUtils]: 89: Hoare triple {40942#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:29,287 INFO L273 TraceCheckUtils]: 90: Hoare triple {40942#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,287 INFO L273 TraceCheckUtils]: 91: Hoare triple {40943#(<= 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); {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {40943#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:29,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {40943#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {40944#(<= 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); {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,290 INFO L273 TraceCheckUtils]: 95: Hoare triple {40944#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:29,290 INFO L273 TraceCheckUtils]: 96: Hoare triple {40944#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,291 INFO L273 TraceCheckUtils]: 97: Hoare triple {40945#(<= 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); {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,291 INFO L273 TraceCheckUtils]: 98: Hoare triple {40945#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:29,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {40945#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,292 INFO L273 TraceCheckUtils]: 100: Hoare triple {40946#(<= 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); {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,293 INFO L273 TraceCheckUtils]: 101: Hoare triple {40946#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:29,294 INFO L273 TraceCheckUtils]: 102: Hoare triple {40946#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,294 INFO L273 TraceCheckUtils]: 103: Hoare triple {40947#(<= 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); {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,295 INFO L273 TraceCheckUtils]: 104: Hoare triple {40947#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:29,295 INFO L273 TraceCheckUtils]: 105: Hoare triple {40947#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,296 INFO L273 TraceCheckUtils]: 106: Hoare triple {40948#(<= 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); {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,296 INFO L273 TraceCheckUtils]: 107: Hoare triple {40948#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:29,297 INFO L273 TraceCheckUtils]: 108: Hoare triple {40948#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,298 INFO L273 TraceCheckUtils]: 109: Hoare triple {40949#(<= 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); {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,298 INFO L273 TraceCheckUtils]: 110: Hoare triple {40949#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:29,299 INFO L273 TraceCheckUtils]: 111: Hoare triple {40949#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:29,299 INFO L273 TraceCheckUtils]: 112: Hoare triple {40950#(<= 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); {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:29,300 INFO L273 TraceCheckUtils]: 113: Hoare triple {40950#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:29,301 INFO L273 TraceCheckUtils]: 114: Hoare triple {40950#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:29,301 INFO L273 TraceCheckUtils]: 115: Hoare triple {40951#(<= 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); {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:29,302 INFO L273 TraceCheckUtils]: 116: Hoare triple {40951#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:29,302 INFO L273 TraceCheckUtils]: 117: Hoare triple {40951#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:29,303 INFO L273 TraceCheckUtils]: 118: Hoare triple {40952#(<= 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); {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:29,303 INFO L273 TraceCheckUtils]: 119: Hoare triple {40952#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:29,304 INFO L273 TraceCheckUtils]: 120: Hoare triple {40952#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:29,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {40953#(<= 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); {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:29,305 INFO L273 TraceCheckUtils]: 122: Hoare triple {40953#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:29,306 INFO L273 TraceCheckUtils]: 123: Hoare triple {40953#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:29,306 INFO L273 TraceCheckUtils]: 124: Hoare triple {40954#(<= 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); {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:29,307 INFO L273 TraceCheckUtils]: 125: Hoare triple {40954#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:29,307 INFO L273 TraceCheckUtils]: 126: Hoare triple {40954#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:29,308 INFO L273 TraceCheckUtils]: 127: Hoare triple {40955#(<= 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); {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:29,308 INFO L273 TraceCheckUtils]: 128: Hoare triple {40955#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:29,309 INFO L273 TraceCheckUtils]: 129: Hoare triple {40955#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:29,310 INFO L273 TraceCheckUtils]: 130: Hoare triple {40956#(<= 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); {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:29,310 INFO L273 TraceCheckUtils]: 131: Hoare triple {40956#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:29,311 INFO L273 TraceCheckUtils]: 132: Hoare triple {40956#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:29,311 INFO L273 TraceCheckUtils]: 133: Hoare triple {40957#(<= 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); {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:29,312 INFO L273 TraceCheckUtils]: 134: Hoare triple {40957#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:29,313 INFO L273 TraceCheckUtils]: 135: Hoare triple {40957#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:29,313 INFO L273 TraceCheckUtils]: 136: Hoare triple {40958#(<= 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); {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:29,314 INFO L273 TraceCheckUtils]: 137: Hoare triple {40958#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:29,314 INFO L273 TraceCheckUtils]: 138: Hoare triple {40958#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {40959#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:29,315 INFO L273 TraceCheckUtils]: 139: Hoare triple {40959#(<= main_~k~0 44)} assume !(~k~0 < 100000); {40913#false} is VALID [2018-11-23 11:54:29,315 INFO L273 TraceCheckUtils]: 140: Hoare triple {40913#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); {40913#false} is VALID [2018-11-23 11:54:29,315 INFO L273 TraceCheckUtils]: 141: Hoare triple {40913#false} ~x~0 := 0; {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L273 TraceCheckUtils]: 142: Hoare triple {40913#false} assume !(~x~0 < ~i~0); {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L273 TraceCheckUtils]: 143: Hoare triple {40913#false} ~x~0 := 1 + ~i~0; {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L273 TraceCheckUtils]: 144: Hoare triple {40913#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); {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L256 TraceCheckUtils]: 145: Hoare triple {40913#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L273 TraceCheckUtils]: 146: Hoare triple {40913#false} ~cond := #in~cond; {40913#false} is VALID [2018-11-23 11:54:29,316 INFO L273 TraceCheckUtils]: 147: Hoare triple {40913#false} assume 0 == ~cond; {40913#false} is VALID [2018-11-23 11:54:29,317 INFO L273 TraceCheckUtils]: 148: Hoare triple {40913#false} assume !false; {40913#false} is VALID [2018-11-23 11:54:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:29,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:29,332 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-23 11:54:29,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:29,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-23 11:54:29,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:29,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:29,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {40912#true} call ULTIMATE.init(); {40912#true} is VALID [2018-11-23 11:54:29,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {40912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40912#true} is VALID [2018-11-23 11:54:29,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {40912#true} assume true; {40912#true} is VALID [2018-11-23 11:54:29,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40912#true} {40912#true} #130#return; {40912#true} is VALID [2018-11-23 11:54:29,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {40912#true} call #t~ret15 := main(); {40912#true} is VALID [2018-11-23 11:54:29,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {40912#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {40978#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:29,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {40978#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {40982#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:29,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {40982#(<= 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); {40982#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:29,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {40982#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40982#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:29,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {40982#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {40916#(<= 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); {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {40916#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {40916#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:29,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {40916#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {40917#(<= 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); {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {40917#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40917#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:29,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {40917#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {40918#(<= 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); {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {40918#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40918#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:29,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {40918#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {40919#(<= 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); {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {40919#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40919#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:29,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {40919#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {40920#(<= 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); {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {40920#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40920#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:29,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {40920#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {40921#(<= 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); {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {40921#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40921#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:29,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {40921#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {40922#(<= 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); {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {40922#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40922#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:29,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {40922#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {40923#(<= 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); {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {40923#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40923#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:29,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {40923#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {40924#(<= 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); {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {40924#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40924#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:29,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {40924#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {40925#(<= 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); {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {40925#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40925#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:29,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {40925#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {40926#(<= 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); {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {40926#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40926#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:29,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {40926#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {40927#(<= 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); {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {40927#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40927#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:29,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {40927#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {40928#(<= 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); {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,990 INFO L273 TraceCheckUtils]: 47: Hoare triple {40928#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40928#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:29,991 INFO L273 TraceCheckUtils]: 48: Hoare triple {40928#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,991 INFO L273 TraceCheckUtils]: 49: Hoare triple {40929#(<= 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); {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,992 INFO L273 TraceCheckUtils]: 50: Hoare triple {40929#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40929#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:29,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {40929#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,993 INFO L273 TraceCheckUtils]: 52: Hoare triple {40930#(<= 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); {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,994 INFO L273 TraceCheckUtils]: 53: Hoare triple {40930#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40930#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:29,994 INFO L273 TraceCheckUtils]: 54: Hoare triple {40930#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {40931#(<= 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); {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {40931#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40931#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:29,996 INFO L273 TraceCheckUtils]: 57: Hoare triple {40931#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {40932#(<= 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); {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {40932#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40932#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:29,997 INFO L273 TraceCheckUtils]: 60: Hoare triple {40932#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {40933#(<= 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); {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {40933#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40933#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:29,999 INFO L273 TraceCheckUtils]: 63: Hoare triple {40933#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:30,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {40934#(<= 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); {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:30,000 INFO L273 TraceCheckUtils]: 65: Hoare triple {40934#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40934#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:30,001 INFO L273 TraceCheckUtils]: 66: Hoare triple {40934#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:30,001 INFO L273 TraceCheckUtils]: 67: Hoare triple {40935#(<= 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); {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:30,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {40935#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40935#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:30,002 INFO L273 TraceCheckUtils]: 69: Hoare triple {40935#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:30,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {40936#(<= 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); {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:30,003 INFO L273 TraceCheckUtils]: 71: Hoare triple {40936#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40936#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:30,004 INFO L273 TraceCheckUtils]: 72: Hoare triple {40936#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:30,004 INFO L273 TraceCheckUtils]: 73: Hoare triple {40937#(<= 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); {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:30,005 INFO L273 TraceCheckUtils]: 74: Hoare triple {40937#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40937#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:30,006 INFO L273 TraceCheckUtils]: 75: Hoare triple {40937#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:30,006 INFO L273 TraceCheckUtils]: 76: Hoare triple {40938#(<= 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); {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:30,006 INFO L273 TraceCheckUtils]: 77: Hoare triple {40938#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40938#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:30,007 INFO L273 TraceCheckUtils]: 78: Hoare triple {40938#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:30,008 INFO L273 TraceCheckUtils]: 79: Hoare triple {40939#(<= 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); {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:30,008 INFO L273 TraceCheckUtils]: 80: Hoare triple {40939#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40939#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:30,009 INFO L273 TraceCheckUtils]: 81: Hoare triple {40939#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:30,009 INFO L273 TraceCheckUtils]: 82: Hoare triple {40940#(<= 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); {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:30,010 INFO L273 TraceCheckUtils]: 83: Hoare triple {40940#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40940#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:30,010 INFO L273 TraceCheckUtils]: 84: Hoare triple {40940#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:30,011 INFO L273 TraceCheckUtils]: 85: Hoare triple {40941#(<= 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); {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:30,011 INFO L273 TraceCheckUtils]: 86: Hoare triple {40941#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40941#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:30,012 INFO L273 TraceCheckUtils]: 87: Hoare triple {40941#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:30,012 INFO L273 TraceCheckUtils]: 88: Hoare triple {40942#(<= 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); {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:30,013 INFO L273 TraceCheckUtils]: 89: Hoare triple {40942#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40942#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:30,014 INFO L273 TraceCheckUtils]: 90: Hoare triple {40942#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:30,014 INFO L273 TraceCheckUtils]: 91: Hoare triple {40943#(<= 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); {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:30,015 INFO L273 TraceCheckUtils]: 92: Hoare triple {40943#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40943#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:30,015 INFO L273 TraceCheckUtils]: 93: Hoare triple {40943#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:30,016 INFO L273 TraceCheckUtils]: 94: Hoare triple {40944#(<= 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); {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:30,016 INFO L273 TraceCheckUtils]: 95: Hoare triple {40944#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40944#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:30,017 INFO L273 TraceCheckUtils]: 96: Hoare triple {40944#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:30,017 INFO L273 TraceCheckUtils]: 97: Hoare triple {40945#(<= 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); {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:30,018 INFO L273 TraceCheckUtils]: 98: Hoare triple {40945#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40945#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:30,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {40945#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:30,019 INFO L273 TraceCheckUtils]: 100: Hoare triple {40946#(<= 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); {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:30,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {40946#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40946#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:30,020 INFO L273 TraceCheckUtils]: 102: Hoare triple {40946#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:30,021 INFO L273 TraceCheckUtils]: 103: Hoare triple {40947#(<= 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); {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:30,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {40947#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40947#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:30,022 INFO L273 TraceCheckUtils]: 105: Hoare triple {40947#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:30,022 INFO L273 TraceCheckUtils]: 106: Hoare triple {40948#(<= 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); {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:30,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {40948#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40948#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:30,023 INFO L273 TraceCheckUtils]: 108: Hoare triple {40948#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:30,024 INFO L273 TraceCheckUtils]: 109: Hoare triple {40949#(<= 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); {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:30,024 INFO L273 TraceCheckUtils]: 110: Hoare triple {40949#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40949#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:30,025 INFO L273 TraceCheckUtils]: 111: Hoare triple {40949#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:30,025 INFO L273 TraceCheckUtils]: 112: Hoare triple {40950#(<= 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); {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:30,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {40950#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40950#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:30,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {40950#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:30,027 INFO L273 TraceCheckUtils]: 115: Hoare triple {40951#(<= 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); {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:30,027 INFO L273 TraceCheckUtils]: 116: Hoare triple {40951#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40951#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:30,028 INFO L273 TraceCheckUtils]: 117: Hoare triple {40951#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:30,029 INFO L273 TraceCheckUtils]: 118: Hoare triple {40952#(<= 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); {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:30,029 INFO L273 TraceCheckUtils]: 119: Hoare triple {40952#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40952#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {40952#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:30,030 INFO L273 TraceCheckUtils]: 121: Hoare triple {40953#(<= 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); {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 122: Hoare triple {40953#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40953#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:30,031 INFO L273 TraceCheckUtils]: 123: Hoare triple {40953#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 124: Hoare triple {40954#(<= 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); {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:30,032 INFO L273 TraceCheckUtils]: 125: Hoare triple {40954#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40954#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:30,033 INFO L273 TraceCheckUtils]: 126: Hoare triple {40954#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 127: Hoare triple {40955#(<= 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); {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:30,034 INFO L273 TraceCheckUtils]: 128: Hoare triple {40955#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40955#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 129: Hoare triple {40955#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:30,035 INFO L273 TraceCheckUtils]: 130: Hoare triple {40956#(<= 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); {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 131: Hoare triple {40956#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40956#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:30,036 INFO L273 TraceCheckUtils]: 132: Hoare triple {40956#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 133: Hoare triple {40957#(<= 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); {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:30,037 INFO L273 TraceCheckUtils]: 134: Hoare triple {40957#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40957#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 135: Hoare triple {40957#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:30,038 INFO L273 TraceCheckUtils]: 136: Hoare triple {40958#(<= 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); {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:30,039 INFO L273 TraceCheckUtils]: 137: Hoare triple {40958#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {40958#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 138: Hoare triple {40958#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {40959#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 139: Hoare triple {40959#(<= main_~k~0 44)} assume !(~k~0 < 100000); {40913#false} is VALID [2018-11-23 11:54:30,040 INFO L273 TraceCheckUtils]: 140: Hoare triple {40913#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); {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 141: Hoare triple {40913#false} ~x~0 := 0; {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 142: Hoare triple {40913#false} assume !(~x~0 < ~i~0); {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 143: Hoare triple {40913#false} ~x~0 := 1 + ~i~0; {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 144: Hoare triple {40913#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); {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L256 TraceCheckUtils]: 145: Hoare triple {40913#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {40913#false} is VALID [2018-11-23 11:54:30,041 INFO L273 TraceCheckUtils]: 146: Hoare triple {40913#false} ~cond := #in~cond; {40913#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 147: Hoare triple {40913#false} assume 0 == ~cond; {40913#false} is VALID [2018-11-23 11:54:30,042 INFO L273 TraceCheckUtils]: 148: Hoare triple {40913#false} assume !false; {40913#false} is VALID [2018-11-23 11:54:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:30,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:30,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2018-11-23 11:54:30,077 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 149 [2018-11-23 11:54:30,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:30,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 11:54:30,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:54:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:54:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:54:30,222 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand 50 states. [2018-11-23 11:54:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:34,133 INFO L93 Difference]: Finished difference Result 222 states and 294 transitions. [2018-11-23 11:54:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:54:34,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 149 [2018-11-23 11:54:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:54:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 287 transitions. [2018-11-23 11:54:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:54:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 287 transitions. [2018-11-23 11:54:34,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 287 transitions. [2018-11-23 11:54:34,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:34,408 INFO L225 Difference]: With dead ends: 222 [2018-11-23 11:54:34,408 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 11:54:34,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-11-23 11:54:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 11:54:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-11-23 11:54:34,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:34,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 180 states. [2018-11-23 11:54:34,598 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 180 states. [2018-11-23 11:54:34,598 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 180 states. [2018-11-23 11:54:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:34,602 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2018-11-23 11:54:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2018-11-23 11:54:34,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:34,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:34,602 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 188 states. [2018-11-23 11:54:34,603 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 188 states. [2018-11-23 11:54:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:34,605 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2018-11-23 11:54:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2018-11-23 11:54:34,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:34,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:34,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:34,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 11:54:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2018-11-23 11:54:34,608 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 149 [2018-11-23 11:54:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2018-11-23 11:54:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:54:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2018-11-23 11:54:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 11:54:34,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:34,609 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:34,609 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:34,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 323292576, now seen corresponding path program 34 times [2018-11-23 11:54:34,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:34,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:35,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {42418#true} call ULTIMATE.init(); {42418#true} is VALID [2018-11-23 11:54:35,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {42418#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42418#true} is VALID [2018-11-23 11:54:35,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {42418#true} assume true; {42418#true} is VALID [2018-11-23 11:54:35,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42418#true} {42418#true} #130#return; {42418#true} is VALID [2018-11-23 11:54:35,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {42418#true} call #t~ret15 := main(); {42418#true} is VALID [2018-11-23 11:54:35,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {42418#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {42420#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:35,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {42420#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {42421#(= main_~k~0 0)} is VALID [2018-11-23 11:54:35,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {42421#(= 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); {42421#(= main_~k~0 0)} is VALID [2018-11-23 11:54:35,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {42421#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42421#(= main_~k~0 0)} is VALID [2018-11-23 11:54:35,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {42421#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {42422#(<= 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); {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {42422#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:35,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {42422#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {42423#(<= 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); {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {42423#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:35,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {42423#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {42424#(<= 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); {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {42424#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:35,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {42424#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {42425#(<= 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); {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {42425#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:35,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {42425#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {42426#(<= 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); {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {42426#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:35,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {42426#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {42427#(<= 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); {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {42427#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:35,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {42427#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {42428#(<= 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); {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {42428#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:35,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {42428#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {42429#(<= 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); {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {42429#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:35,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {42429#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {42430#(<= 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); {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {42430#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:35,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {42430#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {42431#(<= 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); {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {42431#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:35,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {42431#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {42432#(<= 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); {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {42432#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:35,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {42432#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {42433#(<= 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); {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {42433#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:35,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {42433#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {42434#(<= 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); {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {42434#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:35,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {42434#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {42435#(<= 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); {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {42435#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:35,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {42435#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {42436#(<= 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); {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {42436#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:35,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {42436#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {42437#(<= 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); {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {42437#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:35,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {42437#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,701 INFO L273 TraceCheckUtils]: 58: Hoare triple {42438#(<= 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); {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {42438#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:35,702 INFO L273 TraceCheckUtils]: 60: Hoare triple {42438#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:35,702 INFO L273 TraceCheckUtils]: 61: Hoare triple {42439#(<= 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); {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:35,703 INFO L273 TraceCheckUtils]: 62: Hoare triple {42439#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:35,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {42439#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:35,704 INFO L273 TraceCheckUtils]: 64: Hoare triple {42440#(<= 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); {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:35,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {42440#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:35,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {42440#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:35,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {42441#(<= 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); {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:35,706 INFO L273 TraceCheckUtils]: 68: Hoare triple {42441#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:35,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {42441#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:35,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {42442#(<= 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); {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:35,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {42442#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:35,709 INFO L273 TraceCheckUtils]: 72: Hoare triple {42442#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:35,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {42443#(<= 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); {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:35,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {42443#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:35,710 INFO L273 TraceCheckUtils]: 75: Hoare triple {42443#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:35,711 INFO L273 TraceCheckUtils]: 76: Hoare triple {42444#(<= 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); {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:35,711 INFO L273 TraceCheckUtils]: 77: Hoare triple {42444#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:35,712 INFO L273 TraceCheckUtils]: 78: Hoare triple {42444#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:35,712 INFO L273 TraceCheckUtils]: 79: Hoare triple {42445#(<= 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); {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:35,713 INFO L273 TraceCheckUtils]: 80: Hoare triple {42445#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:35,713 INFO L273 TraceCheckUtils]: 81: Hoare triple {42445#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:35,714 INFO L273 TraceCheckUtils]: 82: Hoare triple {42446#(<= 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); {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:35,714 INFO L273 TraceCheckUtils]: 83: Hoare triple {42446#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:35,715 INFO L273 TraceCheckUtils]: 84: Hoare triple {42446#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:35,716 INFO L273 TraceCheckUtils]: 85: Hoare triple {42447#(<= 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); {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:35,716 INFO L273 TraceCheckUtils]: 86: Hoare triple {42447#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:35,717 INFO L273 TraceCheckUtils]: 87: Hoare triple {42447#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:35,717 INFO L273 TraceCheckUtils]: 88: Hoare triple {42448#(<= 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); {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:35,718 INFO L273 TraceCheckUtils]: 89: Hoare triple {42448#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:35,718 INFO L273 TraceCheckUtils]: 90: Hoare triple {42448#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:35,719 INFO L273 TraceCheckUtils]: 91: Hoare triple {42449#(<= 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); {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:35,719 INFO L273 TraceCheckUtils]: 92: Hoare triple {42449#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:35,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {42449#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:35,720 INFO L273 TraceCheckUtils]: 94: Hoare triple {42450#(<= 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); {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:35,721 INFO L273 TraceCheckUtils]: 95: Hoare triple {42450#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:35,722 INFO L273 TraceCheckUtils]: 96: Hoare triple {42450#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:35,722 INFO L273 TraceCheckUtils]: 97: Hoare triple {42451#(<= 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); {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:35,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {42451#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:35,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {42451#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:35,724 INFO L273 TraceCheckUtils]: 100: Hoare triple {42452#(<= 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); {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:35,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {42452#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:35,725 INFO L273 TraceCheckUtils]: 102: Hoare triple {42452#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:35,725 INFO L273 TraceCheckUtils]: 103: Hoare triple {42453#(<= 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); {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:35,726 INFO L273 TraceCheckUtils]: 104: Hoare triple {42453#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:35,727 INFO L273 TraceCheckUtils]: 105: Hoare triple {42453#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:35,727 INFO L273 TraceCheckUtils]: 106: Hoare triple {42454#(<= 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); {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:35,728 INFO L273 TraceCheckUtils]: 107: Hoare triple {42454#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:35,728 INFO L273 TraceCheckUtils]: 108: Hoare triple {42454#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:35,729 INFO L273 TraceCheckUtils]: 109: Hoare triple {42455#(<= 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); {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:35,729 INFO L273 TraceCheckUtils]: 110: Hoare triple {42455#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:35,730 INFO L273 TraceCheckUtils]: 111: Hoare triple {42455#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:35,730 INFO L273 TraceCheckUtils]: 112: Hoare triple {42456#(<= 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); {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:35,731 INFO L273 TraceCheckUtils]: 113: Hoare triple {42456#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:35,731 INFO L273 TraceCheckUtils]: 114: Hoare triple {42456#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:35,732 INFO L273 TraceCheckUtils]: 115: Hoare triple {42457#(<= 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); {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:35,732 INFO L273 TraceCheckUtils]: 116: Hoare triple {42457#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:35,733 INFO L273 TraceCheckUtils]: 117: Hoare triple {42457#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:35,734 INFO L273 TraceCheckUtils]: 118: Hoare triple {42458#(<= 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); {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:35,734 INFO L273 TraceCheckUtils]: 119: Hoare triple {42458#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:35,735 INFO L273 TraceCheckUtils]: 120: Hoare triple {42458#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:35,735 INFO L273 TraceCheckUtils]: 121: Hoare triple {42459#(<= 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); {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:35,736 INFO L273 TraceCheckUtils]: 122: Hoare triple {42459#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:35,736 INFO L273 TraceCheckUtils]: 123: Hoare triple {42459#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:35,737 INFO L273 TraceCheckUtils]: 124: Hoare triple {42460#(<= 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); {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:35,737 INFO L273 TraceCheckUtils]: 125: Hoare triple {42460#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:35,738 INFO L273 TraceCheckUtils]: 126: Hoare triple {42460#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:35,739 INFO L273 TraceCheckUtils]: 127: Hoare triple {42461#(<= 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); {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:35,739 INFO L273 TraceCheckUtils]: 128: Hoare triple {42461#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:35,740 INFO L273 TraceCheckUtils]: 129: Hoare triple {42461#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:35,740 INFO L273 TraceCheckUtils]: 130: Hoare triple {42462#(<= 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); {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:35,741 INFO L273 TraceCheckUtils]: 131: Hoare triple {42462#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:35,741 INFO L273 TraceCheckUtils]: 132: Hoare triple {42462#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:35,742 INFO L273 TraceCheckUtils]: 133: Hoare triple {42463#(<= 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); {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:35,742 INFO L273 TraceCheckUtils]: 134: Hoare triple {42463#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:35,743 INFO L273 TraceCheckUtils]: 135: Hoare triple {42463#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:35,743 INFO L273 TraceCheckUtils]: 136: Hoare triple {42464#(<= 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); {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:35,744 INFO L273 TraceCheckUtils]: 137: Hoare triple {42464#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:35,744 INFO L273 TraceCheckUtils]: 138: Hoare triple {42464#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:35,745 INFO L273 TraceCheckUtils]: 139: Hoare triple {42465#(<= main_~k~0 44)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:35,745 INFO L273 TraceCheckUtils]: 140: Hoare triple {42465#(<= main_~k~0 44)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:35,746 INFO L273 TraceCheckUtils]: 141: Hoare triple {42465#(<= main_~k~0 44)} ~k~0 := 1 + ~k~0; {42466#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:35,747 INFO L273 TraceCheckUtils]: 142: Hoare triple {42466#(<= main_~k~0 45)} assume !(~k~0 < 100000); {42419#false} is VALID [2018-11-23 11:54:35,747 INFO L273 TraceCheckUtils]: 143: Hoare triple {42419#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); {42419#false} is VALID [2018-11-23 11:54:35,747 INFO L273 TraceCheckUtils]: 144: Hoare triple {42419#false} ~x~0 := 0; {42419#false} is VALID [2018-11-23 11:54:35,747 INFO L273 TraceCheckUtils]: 145: Hoare triple {42419#false} assume !(~x~0 < ~i~0); {42419#false} is VALID [2018-11-23 11:54:35,747 INFO L273 TraceCheckUtils]: 146: Hoare triple {42419#false} ~x~0 := 1 + ~i~0; {42419#false} is VALID [2018-11-23 11:54:35,748 INFO L273 TraceCheckUtils]: 147: Hoare triple {42419#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); {42419#false} is VALID [2018-11-23 11:54:35,764 INFO L256 TraceCheckUtils]: 148: Hoare triple {42419#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42419#false} is VALID [2018-11-23 11:54:35,765 INFO L273 TraceCheckUtils]: 149: Hoare triple {42419#false} ~cond := #in~cond; {42419#false} is VALID [2018-11-23 11:54:35,765 INFO L273 TraceCheckUtils]: 150: Hoare triple {42419#false} assume 0 == ~cond; {42419#false} is VALID [2018-11-23 11:54:35,765 INFO L273 TraceCheckUtils]: 151: Hoare triple {42419#false} assume !false; {42419#false} is VALID [2018-11-23 11:54:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:35,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:35,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:35,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:35,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:35,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:35,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:36,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {42418#true} call ULTIMATE.init(); {42418#true} is VALID [2018-11-23 11:54:36,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {42418#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42418#true} is VALID [2018-11-23 11:54:36,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {42418#true} assume true; {42418#true} is VALID [2018-11-23 11:54:36,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42418#true} {42418#true} #130#return; {42418#true} is VALID [2018-11-23 11:54:36,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {42418#true} call #t~ret15 := main(); {42418#true} is VALID [2018-11-23 11:54:36,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {42418#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {42485#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:36,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {42485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {42489#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:36,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {42489#(<= 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); {42489#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:36,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {42489#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42489#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:36,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {42489#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:36,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {42422#(<= 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); {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:36,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {42422#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {42422#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:36,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {42422#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:36,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {42423#(<= 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); {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:36,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {42423#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42423#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:36,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {42423#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:36,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {42424#(<= 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); {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:36,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {42424#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42424#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:36,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {42424#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:36,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {42425#(<= 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); {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:36,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {42425#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42425#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:36,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {42425#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:36,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {42426#(<= 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); {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:36,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {42426#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42426#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:36,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {42426#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:36,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {42427#(<= 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); {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:36,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {42427#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42427#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:36,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {42427#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:36,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {42428#(<= 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); {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:36,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {42428#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42428#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:36,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {42428#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:36,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {42429#(<= 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); {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:36,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {42429#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42429#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:36,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {42429#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:36,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {42430#(<= 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); {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:36,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {42430#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42430#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:36,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {42430#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:36,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {42431#(<= 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); {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:36,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {42431#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42431#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:36,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {42431#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:36,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {42432#(<= 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); {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:36,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {42432#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42432#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:36,291 INFO L273 TraceCheckUtils]: 42: Hoare triple {42432#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:36,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {42433#(<= 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); {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:36,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {42433#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42433#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:36,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {42433#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:36,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {42434#(<= 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); {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:36,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {42434#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42434#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:36,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {42434#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:36,294 INFO L273 TraceCheckUtils]: 49: Hoare triple {42435#(<= 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); {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:36,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {42435#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42435#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:36,295 INFO L273 TraceCheckUtils]: 51: Hoare triple {42435#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:36,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {42436#(<= 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); {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:36,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {42436#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42436#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:36,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {42436#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:36,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {42437#(<= 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); {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:36,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {42437#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42437#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:36,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {42437#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:36,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {42438#(<= 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); {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:36,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {42438#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42438#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:36,300 INFO L273 TraceCheckUtils]: 60: Hoare triple {42438#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:36,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {42439#(<= 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); {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:36,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {42439#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42439#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:36,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {42439#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,302 INFO L273 TraceCheckUtils]: 64: Hoare triple {42440#(<= 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); {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {42440#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42440#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:36,304 INFO L273 TraceCheckUtils]: 66: Hoare triple {42440#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,304 INFO L273 TraceCheckUtils]: 67: Hoare triple {42441#(<= 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); {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,304 INFO L273 TraceCheckUtils]: 68: Hoare triple {42441#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42441#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:36,305 INFO L273 TraceCheckUtils]: 69: Hoare triple {42441#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,306 INFO L273 TraceCheckUtils]: 70: Hoare triple {42442#(<= 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); {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,306 INFO L273 TraceCheckUtils]: 71: Hoare triple {42442#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42442#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:36,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {42442#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,307 INFO L273 TraceCheckUtils]: 73: Hoare triple {42443#(<= 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); {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,308 INFO L273 TraceCheckUtils]: 74: Hoare triple {42443#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42443#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:36,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {42443#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,309 INFO L273 TraceCheckUtils]: 76: Hoare triple {42444#(<= 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); {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,309 INFO L273 TraceCheckUtils]: 77: Hoare triple {42444#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42444#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:36,310 INFO L273 TraceCheckUtils]: 78: Hoare triple {42444#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,311 INFO L273 TraceCheckUtils]: 79: Hoare triple {42445#(<= 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); {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,311 INFO L273 TraceCheckUtils]: 80: Hoare triple {42445#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42445#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:36,312 INFO L273 TraceCheckUtils]: 81: Hoare triple {42445#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,312 INFO L273 TraceCheckUtils]: 82: Hoare triple {42446#(<= 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); {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,313 INFO L273 TraceCheckUtils]: 83: Hoare triple {42446#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42446#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:36,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {42446#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,314 INFO L273 TraceCheckUtils]: 85: Hoare triple {42447#(<= 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); {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,314 INFO L273 TraceCheckUtils]: 86: Hoare triple {42447#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42447#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:36,315 INFO L273 TraceCheckUtils]: 87: Hoare triple {42447#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {42448#(<= 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); {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,316 INFO L273 TraceCheckUtils]: 89: Hoare triple {42448#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42448#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:36,317 INFO L273 TraceCheckUtils]: 90: Hoare triple {42448#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,317 INFO L273 TraceCheckUtils]: 91: Hoare triple {42449#(<= 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); {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,318 INFO L273 TraceCheckUtils]: 92: Hoare triple {42449#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42449#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:36,318 INFO L273 TraceCheckUtils]: 93: Hoare triple {42449#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,319 INFO L273 TraceCheckUtils]: 94: Hoare triple {42450#(<= 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); {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,319 INFO L273 TraceCheckUtils]: 95: Hoare triple {42450#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42450#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:36,320 INFO L273 TraceCheckUtils]: 96: Hoare triple {42450#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,320 INFO L273 TraceCheckUtils]: 97: Hoare triple {42451#(<= 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); {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,321 INFO L273 TraceCheckUtils]: 98: Hoare triple {42451#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42451#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:36,322 INFO L273 TraceCheckUtils]: 99: Hoare triple {42451#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,322 INFO L273 TraceCheckUtils]: 100: Hoare triple {42452#(<= 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); {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,322 INFO L273 TraceCheckUtils]: 101: Hoare triple {42452#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42452#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:36,323 INFO L273 TraceCheckUtils]: 102: Hoare triple {42452#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,324 INFO L273 TraceCheckUtils]: 103: Hoare triple {42453#(<= 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); {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,324 INFO L273 TraceCheckUtils]: 104: Hoare triple {42453#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42453#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:36,325 INFO L273 TraceCheckUtils]: 105: Hoare triple {42453#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,325 INFO L273 TraceCheckUtils]: 106: Hoare triple {42454#(<= 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); {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,326 INFO L273 TraceCheckUtils]: 107: Hoare triple {42454#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42454#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:36,326 INFO L273 TraceCheckUtils]: 108: Hoare triple {42454#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,327 INFO L273 TraceCheckUtils]: 109: Hoare triple {42455#(<= 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); {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,327 INFO L273 TraceCheckUtils]: 110: Hoare triple {42455#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42455#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:36,328 INFO L273 TraceCheckUtils]: 111: Hoare triple {42455#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,329 INFO L273 TraceCheckUtils]: 112: Hoare triple {42456#(<= 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); {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,329 INFO L273 TraceCheckUtils]: 113: Hoare triple {42456#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42456#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:36,330 INFO L273 TraceCheckUtils]: 114: Hoare triple {42456#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:36,330 INFO L273 TraceCheckUtils]: 115: Hoare triple {42457#(<= 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); {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:36,331 INFO L273 TraceCheckUtils]: 116: Hoare triple {42457#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42457#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:36,331 INFO L273 TraceCheckUtils]: 117: Hoare triple {42457#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:36,332 INFO L273 TraceCheckUtils]: 118: Hoare triple {42458#(<= 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); {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:36,332 INFO L273 TraceCheckUtils]: 119: Hoare triple {42458#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42458#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:36,333 INFO L273 TraceCheckUtils]: 120: Hoare triple {42458#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:36,334 INFO L273 TraceCheckUtils]: 121: Hoare triple {42459#(<= 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); {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:36,334 INFO L273 TraceCheckUtils]: 122: Hoare triple {42459#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42459#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:36,335 INFO L273 TraceCheckUtils]: 123: Hoare triple {42459#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:36,335 INFO L273 TraceCheckUtils]: 124: Hoare triple {42460#(<= 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); {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:36,336 INFO L273 TraceCheckUtils]: 125: Hoare triple {42460#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42460#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:36,337 INFO L273 TraceCheckUtils]: 126: Hoare triple {42460#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:36,337 INFO L273 TraceCheckUtils]: 127: Hoare triple {42461#(<= 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); {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:36,338 INFO L273 TraceCheckUtils]: 128: Hoare triple {42461#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42461#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:36,338 INFO L273 TraceCheckUtils]: 129: Hoare triple {42461#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:36,339 INFO L273 TraceCheckUtils]: 130: Hoare triple {42462#(<= 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); {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:36,339 INFO L273 TraceCheckUtils]: 131: Hoare triple {42462#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42462#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:36,340 INFO L273 TraceCheckUtils]: 132: Hoare triple {42462#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:36,340 INFO L273 TraceCheckUtils]: 133: Hoare triple {42463#(<= 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); {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:36,341 INFO L273 TraceCheckUtils]: 134: Hoare triple {42463#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42463#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:36,341 INFO L273 TraceCheckUtils]: 135: Hoare triple {42463#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:36,342 INFO L273 TraceCheckUtils]: 136: Hoare triple {42464#(<= 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); {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:36,342 INFO L273 TraceCheckUtils]: 137: Hoare triple {42464#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42464#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:36,343 INFO L273 TraceCheckUtils]: 138: Hoare triple {42464#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:36,344 INFO L273 TraceCheckUtils]: 139: Hoare triple {42465#(<= main_~k~0 44)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:36,344 INFO L273 TraceCheckUtils]: 140: Hoare triple {42465#(<= main_~k~0 44)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {42465#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:36,345 INFO L273 TraceCheckUtils]: 141: Hoare triple {42465#(<= main_~k~0 44)} ~k~0 := 1 + ~k~0; {42466#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:36,345 INFO L273 TraceCheckUtils]: 142: Hoare triple {42466#(<= main_~k~0 45)} assume !(~k~0 < 100000); {42419#false} is VALID [2018-11-23 11:54:36,346 INFO L273 TraceCheckUtils]: 143: Hoare triple {42419#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); {42419#false} is VALID [2018-11-23 11:54:36,346 INFO L273 TraceCheckUtils]: 144: Hoare triple {42419#false} ~x~0 := 0; {42419#false} is VALID [2018-11-23 11:54:36,346 INFO L273 TraceCheckUtils]: 145: Hoare triple {42419#false} assume !(~x~0 < ~i~0); {42419#false} is VALID [2018-11-23 11:54:36,346 INFO L273 TraceCheckUtils]: 146: Hoare triple {42419#false} ~x~0 := 1 + ~i~0; {42419#false} is VALID [2018-11-23 11:54:36,346 INFO L273 TraceCheckUtils]: 147: Hoare triple {42419#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); {42419#false} is VALID [2018-11-23 11:54:36,347 INFO L256 TraceCheckUtils]: 148: Hoare triple {42419#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {42419#false} is VALID [2018-11-23 11:54:36,347 INFO L273 TraceCheckUtils]: 149: Hoare triple {42419#false} ~cond := #in~cond; {42419#false} is VALID [2018-11-23 11:54:36,347 INFO L273 TraceCheckUtils]: 150: Hoare triple {42419#false} assume 0 == ~cond; {42419#false} is VALID [2018-11-23 11:54:36,347 INFO L273 TraceCheckUtils]: 151: Hoare triple {42419#false} assume !false; {42419#false} is VALID [2018-11-23 11:54:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:36,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:36,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2018-11-23 11:54:36,394 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 152 [2018-11-23 11:54:36,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:36,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 11:54:36,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:36,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 11:54:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 11:54:36,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:54:36,629 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand 51 states. [2018-11-23 11:54:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:40,466 INFO L93 Difference]: Finished difference Result 225 states and 298 transitions. [2018-11-23 11:54:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:54:40,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 152 [2018-11-23 11:54:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:54:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 291 transitions. [2018-11-23 11:54:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:54:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 291 transitions. [2018-11-23 11:54:40,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 291 transitions. [2018-11-23 11:54:40,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:40,756 INFO L225 Difference]: With dead ends: 225 [2018-11-23 11:54:40,757 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 11:54:40,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:54:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 11:54:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-11-23 11:54:41,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:41,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 183 states. [2018-11-23 11:54:41,127 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 183 states. [2018-11-23 11:54:41,127 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 183 states. [2018-11-23 11:54:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:41,131 INFO L93 Difference]: Finished difference Result 191 states and 252 transitions. [2018-11-23 11:54:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 252 transitions. [2018-11-23 11:54:41,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:41,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:41,131 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 191 states. [2018-11-23 11:54:41,131 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 191 states. [2018-11-23 11:54:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:41,134 INFO L93 Difference]: Finished difference Result 191 states and 252 transitions. [2018-11-23 11:54:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 252 transitions. [2018-11-23 11:54:41,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:41,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:41,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:41,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 11:54:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 241 transitions. [2018-11-23 11:54:41,137 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 241 transitions. Word has length 152 [2018-11-23 11:54:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:41,138 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 241 transitions. [2018-11-23 11:54:41,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 11:54:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 241 transitions. [2018-11-23 11:54:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 11:54:41,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:41,138 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:41,139 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:41,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1958683351, now seen corresponding path program 35 times [2018-11-23 11:54:41,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:41,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:41,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:42,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {43950#true} call ULTIMATE.init(); {43950#true} is VALID [2018-11-23 11:54:42,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {43950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43950#true} is VALID [2018-11-23 11:54:42,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {43950#true} assume true; {43950#true} is VALID [2018-11-23 11:54:42,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43950#true} {43950#true} #130#return; {43950#true} is VALID [2018-11-23 11:54:42,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {43950#true} call #t~ret15 := main(); {43950#true} is VALID [2018-11-23 11:54:42,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {43950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {43952#(= 0 main_~i~0)} is VALID [2018-11-23 11:54:42,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {43952#(= 0 main_~i~0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {43953#(= main_~k~0 0)} is VALID [2018-11-23 11:54:42,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {43953#(= 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); {43953#(= main_~k~0 0)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {43953#(= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43953#(= main_~k~0 0)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {43953#(= main_~k~0 0)} ~k~0 := 1 + ~k~0; {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {43954#(<= 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); {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {43954#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:42,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {43954#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {43955#(<= 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); {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {43955#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:42,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {43955#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {43956#(<= 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); {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {43956#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:42,465 INFO L273 TraceCheckUtils]: 18: Hoare triple {43956#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {43957#(<= 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); {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {43957#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:42,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {43957#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {43958#(<= 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); {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {43958#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:42,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {43958#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {43959#(<= 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); {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {43959#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:42,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {43959#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {43960#(<= 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); {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {43960#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:42,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {43960#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {43961#(<= 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); {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {43961#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:42,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {43961#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {43962#(<= 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); {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {43962#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:42,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {43962#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {43963#(<= 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); {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {43963#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:42,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {43963#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,477 INFO L273 TraceCheckUtils]: 40: Hoare triple {43964#(<= 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); {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {43964#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:42,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {43964#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {43965#(<= 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); {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {43965#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:42,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {43965#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {43966#(<= 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); {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {43966#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:42,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {43966#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {43967#(<= 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); {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,482 INFO L273 TraceCheckUtils]: 50: Hoare triple {43967#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:42,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {43967#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {43968#(<= 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); {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {43968#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:42,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {43968#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,485 INFO L273 TraceCheckUtils]: 55: Hoare triple {43969#(<= 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); {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,486 INFO L273 TraceCheckUtils]: 56: Hoare triple {43969#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:42,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {43969#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,487 INFO L273 TraceCheckUtils]: 58: Hoare triple {43970#(<= 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); {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,487 INFO L273 TraceCheckUtils]: 59: Hoare triple {43970#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:42,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {43970#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,488 INFO L273 TraceCheckUtils]: 61: Hoare triple {43971#(<= 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); {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {43971#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:42,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {43971#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {43972#(<= 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); {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {43972#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:42,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {43972#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,492 INFO L273 TraceCheckUtils]: 67: Hoare triple {43973#(<= 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); {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,492 INFO L273 TraceCheckUtils]: 68: Hoare triple {43973#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:42,493 INFO L273 TraceCheckUtils]: 69: Hoare triple {43973#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,493 INFO L273 TraceCheckUtils]: 70: Hoare triple {43974#(<= 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); {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {43974#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:42,494 INFO L273 TraceCheckUtils]: 72: Hoare triple {43974#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {43975#(<= 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); {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {43975#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:42,496 INFO L273 TraceCheckUtils]: 75: Hoare triple {43975#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {43976#(<= 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); {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {43976#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {43976#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {43977#(<= 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); {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {43977#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:42,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {43977#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {43978#(<= 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); {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,500 INFO L273 TraceCheckUtils]: 83: Hoare triple {43978#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:42,501 INFO L273 TraceCheckUtils]: 84: Hoare triple {43978#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,501 INFO L273 TraceCheckUtils]: 85: Hoare triple {43979#(<= 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); {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {43979#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:42,503 INFO L273 TraceCheckUtils]: 87: Hoare triple {43979#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,503 INFO L273 TraceCheckUtils]: 88: Hoare triple {43980#(<= 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); {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,504 INFO L273 TraceCheckUtils]: 89: Hoare triple {43980#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:42,504 INFO L273 TraceCheckUtils]: 90: Hoare triple {43980#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {43981#(<= 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); {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,505 INFO L273 TraceCheckUtils]: 92: Hoare triple {43981#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:42,506 INFO L273 TraceCheckUtils]: 93: Hoare triple {43981#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,506 INFO L273 TraceCheckUtils]: 94: Hoare triple {43982#(<= 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); {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,507 INFO L273 TraceCheckUtils]: 95: Hoare triple {43982#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:42,507 INFO L273 TraceCheckUtils]: 96: Hoare triple {43982#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,508 INFO L273 TraceCheckUtils]: 97: Hoare triple {43983#(<= 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); {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,508 INFO L273 TraceCheckUtils]: 98: Hoare triple {43983#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:42,509 INFO L273 TraceCheckUtils]: 99: Hoare triple {43983#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,510 INFO L273 TraceCheckUtils]: 100: Hoare triple {43984#(<= 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); {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,510 INFO L273 TraceCheckUtils]: 101: Hoare triple {43984#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:42,511 INFO L273 TraceCheckUtils]: 102: Hoare triple {43984#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,511 INFO L273 TraceCheckUtils]: 103: Hoare triple {43985#(<= 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); {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,512 INFO L273 TraceCheckUtils]: 104: Hoare triple {43985#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:42,512 INFO L273 TraceCheckUtils]: 105: Hoare triple {43985#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,513 INFO L273 TraceCheckUtils]: 106: Hoare triple {43986#(<= 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); {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,513 INFO L273 TraceCheckUtils]: 107: Hoare triple {43986#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:42,514 INFO L273 TraceCheckUtils]: 108: Hoare triple {43986#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,514 INFO L273 TraceCheckUtils]: 109: Hoare triple {43987#(<= 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); {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,515 INFO L273 TraceCheckUtils]: 110: Hoare triple {43987#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:42,516 INFO L273 TraceCheckUtils]: 111: Hoare triple {43987#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,516 INFO L273 TraceCheckUtils]: 112: Hoare triple {43988#(<= 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); {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,517 INFO L273 TraceCheckUtils]: 113: Hoare triple {43988#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:42,517 INFO L273 TraceCheckUtils]: 114: Hoare triple {43988#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,518 INFO L273 TraceCheckUtils]: 115: Hoare triple {43989#(<= 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); {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,518 INFO L273 TraceCheckUtils]: 116: Hoare triple {43989#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:42,519 INFO L273 TraceCheckUtils]: 117: Hoare triple {43989#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:42,519 INFO L273 TraceCheckUtils]: 118: Hoare triple {43990#(<= 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); {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:42,520 INFO L273 TraceCheckUtils]: 119: Hoare triple {43990#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:42,521 INFO L273 TraceCheckUtils]: 120: Hoare triple {43990#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:42,521 INFO L273 TraceCheckUtils]: 121: Hoare triple {43991#(<= 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); {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:42,522 INFO L273 TraceCheckUtils]: 122: Hoare triple {43991#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:42,522 INFO L273 TraceCheckUtils]: 123: Hoare triple {43991#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:42,523 INFO L273 TraceCheckUtils]: 124: Hoare triple {43992#(<= 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); {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:42,523 INFO L273 TraceCheckUtils]: 125: Hoare triple {43992#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:42,524 INFO L273 TraceCheckUtils]: 126: Hoare triple {43992#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:42,525 INFO L273 TraceCheckUtils]: 127: Hoare triple {43993#(<= 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); {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:42,525 INFO L273 TraceCheckUtils]: 128: Hoare triple {43993#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:42,526 INFO L273 TraceCheckUtils]: 129: Hoare triple {43993#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:42,526 INFO L273 TraceCheckUtils]: 130: Hoare triple {43994#(<= 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); {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:42,527 INFO L273 TraceCheckUtils]: 131: Hoare triple {43994#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:42,527 INFO L273 TraceCheckUtils]: 132: Hoare triple {43994#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:42,528 INFO L273 TraceCheckUtils]: 133: Hoare triple {43995#(<= 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); {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:42,528 INFO L273 TraceCheckUtils]: 134: Hoare triple {43995#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:42,529 INFO L273 TraceCheckUtils]: 135: Hoare triple {43995#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:42,530 INFO L273 TraceCheckUtils]: 136: Hoare triple {43996#(<= 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); {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:42,530 INFO L273 TraceCheckUtils]: 137: Hoare triple {43996#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:42,531 INFO L273 TraceCheckUtils]: 138: Hoare triple {43996#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:42,531 INFO L273 TraceCheckUtils]: 139: Hoare triple {43997#(<= main_~k~0 44)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:42,532 INFO L273 TraceCheckUtils]: 140: Hoare triple {43997#(<= main_~k~0 44)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:42,532 INFO L273 TraceCheckUtils]: 141: Hoare triple {43997#(<= main_~k~0 44)} ~k~0 := 1 + ~k~0; {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:42,533 INFO L273 TraceCheckUtils]: 142: Hoare triple {43998#(<= main_~k~0 45)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:42,533 INFO L273 TraceCheckUtils]: 143: Hoare triple {43998#(<= main_~k~0 45)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:42,534 INFO L273 TraceCheckUtils]: 144: Hoare triple {43998#(<= main_~k~0 45)} ~k~0 := 1 + ~k~0; {43999#(<= main_~k~0 46)} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 145: Hoare triple {43999#(<= main_~k~0 46)} assume !(~k~0 < 100000); {43951#false} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 146: Hoare triple {43951#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); {43951#false} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 147: Hoare triple {43951#false} ~x~0 := 0; {43951#false} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 148: Hoare triple {43951#false} assume !(~x~0 < ~i~0); {43951#false} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 149: Hoare triple {43951#false} ~x~0 := 1 + ~i~0; {43951#false} is VALID [2018-11-23 11:54:42,535 INFO L273 TraceCheckUtils]: 150: Hoare triple {43951#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); {43951#false} is VALID [2018-11-23 11:54:42,536 INFO L256 TraceCheckUtils]: 151: Hoare triple {43951#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43951#false} is VALID [2018-11-23 11:54:42,536 INFO L273 TraceCheckUtils]: 152: Hoare triple {43951#false} ~cond := #in~cond; {43951#false} is VALID [2018-11-23 11:54:42,536 INFO L273 TraceCheckUtils]: 153: Hoare triple {43951#false} assume 0 == ~cond; {43951#false} is VALID [2018-11-23 11:54:42,536 INFO L273 TraceCheckUtils]: 154: Hoare triple {43951#false} assume !false; {43951#false} is VALID [2018-11-23 11:54:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:42,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:42,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:42,764 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 11:54:42,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:42,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:43,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {43950#true} call ULTIMATE.init(); {43950#true} is VALID [2018-11-23 11:54:43,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {43950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43950#true} is VALID [2018-11-23 11:54:43,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {43950#true} assume true; {43950#true} is VALID [2018-11-23 11:54:43,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43950#true} {43950#true} #130#return; {43950#true} is VALID [2018-11-23 11:54:43,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {43950#true} call #t~ret15 := main(); {43950#true} is VALID [2018-11-23 11:54:43,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {43950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0;havoc ~x~0;havoc ~y~0; {44018#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:43,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {44018#(<= main_~i~0 0)} assume !!(~i~0 < 100000);~k~0 := ~i~0;~s~0 := 1 + ~i~0; {44022#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:43,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {44022#(<= 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); {44022#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:43,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {44022#(<= main_~k~0 0)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {44022#(<= main_~k~0 0)} is VALID [2018-11-23 11:54:43,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {44022#(<= main_~k~0 0)} ~k~0 := 1 + ~k~0; {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:43,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {43954#(<= 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); {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:43,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {43954#(<= main_~k~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {43954#(<= main_~k~0 1)} is VALID [2018-11-23 11:54:43,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {43954#(<= main_~k~0 1)} ~k~0 := 1 + ~k~0; {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:43,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {43955#(<= 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); {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:43,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {43955#(<= main_~k~0 2)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43955#(<= main_~k~0 2)} is VALID [2018-11-23 11:54:43,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {43955#(<= main_~k~0 2)} ~k~0 := 1 + ~k~0; {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:43,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {43956#(<= 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); {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:43,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {43956#(<= main_~k~0 3)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43956#(<= main_~k~0 3)} is VALID [2018-11-23 11:54:43,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {43956#(<= main_~k~0 3)} ~k~0 := 1 + ~k~0; {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:43,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {43957#(<= 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); {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:43,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {43957#(<= main_~k~0 4)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43957#(<= main_~k~0 4)} is VALID [2018-11-23 11:54:43,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {43957#(<= main_~k~0 4)} ~k~0 := 1 + ~k~0; {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:43,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {43958#(<= 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); {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:43,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {43958#(<= main_~k~0 5)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43958#(<= main_~k~0 5)} is VALID [2018-11-23 11:54:43,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {43958#(<= main_~k~0 5)} ~k~0 := 1 + ~k~0; {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:43,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {43959#(<= 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); {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:43,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {43959#(<= main_~k~0 6)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43959#(<= main_~k~0 6)} is VALID [2018-11-23 11:54:43,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {43959#(<= main_~k~0 6)} ~k~0 := 1 + ~k~0; {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:43,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {43960#(<= 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); {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:43,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {43960#(<= main_~k~0 7)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43960#(<= main_~k~0 7)} is VALID [2018-11-23 11:54:43,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {43960#(<= main_~k~0 7)} ~k~0 := 1 + ~k~0; {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:43,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {43961#(<= 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); {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:43,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {43961#(<= main_~k~0 8)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43961#(<= main_~k~0 8)} is VALID [2018-11-23 11:54:43,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {43961#(<= main_~k~0 8)} ~k~0 := 1 + ~k~0; {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:43,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {43962#(<= 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); {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:43,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {43962#(<= main_~k~0 9)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43962#(<= main_~k~0 9)} is VALID [2018-11-23 11:54:43,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {43962#(<= main_~k~0 9)} ~k~0 := 1 + ~k~0; {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:43,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {43963#(<= 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); {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:43,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {43963#(<= main_~k~0 10)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43963#(<= main_~k~0 10)} is VALID [2018-11-23 11:54:43,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {43963#(<= main_~k~0 10)} ~k~0 := 1 + ~k~0; {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:43,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {43964#(<= 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); {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:43,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {43964#(<= main_~k~0 11)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43964#(<= main_~k~0 11)} is VALID [2018-11-23 11:54:43,185 INFO L273 TraceCheckUtils]: 42: Hoare triple {43964#(<= main_~k~0 11)} ~k~0 := 1 + ~k~0; {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:43,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {43965#(<= 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); {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:43,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {43965#(<= main_~k~0 12)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43965#(<= main_~k~0 12)} is VALID [2018-11-23 11:54:43,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {43965#(<= main_~k~0 12)} ~k~0 := 1 + ~k~0; {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:43,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {43966#(<= 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); {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:43,188 INFO L273 TraceCheckUtils]: 47: Hoare triple {43966#(<= main_~k~0 13)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43966#(<= main_~k~0 13)} is VALID [2018-11-23 11:54:43,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {43966#(<= main_~k~0 13)} ~k~0 := 1 + ~k~0; {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:43,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {43967#(<= 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); {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:43,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {43967#(<= main_~k~0 14)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43967#(<= main_~k~0 14)} is VALID [2018-11-23 11:54:43,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {43967#(<= main_~k~0 14)} ~k~0 := 1 + ~k~0; {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:43,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {43968#(<= 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); {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:43,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {43968#(<= main_~k~0 15)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43968#(<= main_~k~0 15)} is VALID [2018-11-23 11:54:43,192 INFO L273 TraceCheckUtils]: 54: Hoare triple {43968#(<= main_~k~0 15)} ~k~0 := 1 + ~k~0; {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:43,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {43969#(<= 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); {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:43,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {43969#(<= main_~k~0 16)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43969#(<= main_~k~0 16)} is VALID [2018-11-23 11:54:43,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {43969#(<= main_~k~0 16)} ~k~0 := 1 + ~k~0; {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:43,194 INFO L273 TraceCheckUtils]: 58: Hoare triple {43970#(<= 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); {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:43,194 INFO L273 TraceCheckUtils]: 59: Hoare triple {43970#(<= main_~k~0 17)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43970#(<= main_~k~0 17)} is VALID [2018-11-23 11:54:43,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {43970#(<= main_~k~0 17)} ~k~0 := 1 + ~k~0; {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:43,195 INFO L273 TraceCheckUtils]: 61: Hoare triple {43971#(<= 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); {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:43,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {43971#(<= main_~k~0 18)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43971#(<= main_~k~0 18)} is VALID [2018-11-23 11:54:43,197 INFO L273 TraceCheckUtils]: 63: Hoare triple {43971#(<= main_~k~0 18)} ~k~0 := 1 + ~k~0; {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:43,197 INFO L273 TraceCheckUtils]: 64: Hoare triple {43972#(<= 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); {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:43,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {43972#(<= main_~k~0 19)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43972#(<= main_~k~0 19)} is VALID [2018-11-23 11:54:43,198 INFO L273 TraceCheckUtils]: 66: Hoare triple {43972#(<= main_~k~0 19)} ~k~0 := 1 + ~k~0; {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:43,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {43973#(<= 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); {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:43,199 INFO L273 TraceCheckUtils]: 68: Hoare triple {43973#(<= main_~k~0 20)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43973#(<= main_~k~0 20)} is VALID [2018-11-23 11:54:43,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {43973#(<= main_~k~0 20)} ~k~0 := 1 + ~k~0; {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:43,200 INFO L273 TraceCheckUtils]: 70: Hoare triple {43974#(<= 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); {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:43,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {43974#(<= main_~k~0 21)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43974#(<= main_~k~0 21)} is VALID [2018-11-23 11:54:43,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {43974#(<= main_~k~0 21)} ~k~0 := 1 + ~k~0; {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:43,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {43975#(<= 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); {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:43,203 INFO L273 TraceCheckUtils]: 74: Hoare triple {43975#(<= main_~k~0 22)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43975#(<= main_~k~0 22)} is VALID [2018-11-23 11:54:43,203 INFO L273 TraceCheckUtils]: 75: Hoare triple {43975#(<= main_~k~0 22)} ~k~0 := 1 + ~k~0; {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:43,204 INFO L273 TraceCheckUtils]: 76: Hoare triple {43976#(<= 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); {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:43,204 INFO L273 TraceCheckUtils]: 77: Hoare triple {43976#(<= main_~k~0 23)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43976#(<= main_~k~0 23)} is VALID [2018-11-23 11:54:43,205 INFO L273 TraceCheckUtils]: 78: Hoare triple {43976#(<= main_~k~0 23)} ~k~0 := 1 + ~k~0; {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:43,205 INFO L273 TraceCheckUtils]: 79: Hoare triple {43977#(<= 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); {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:43,206 INFO L273 TraceCheckUtils]: 80: Hoare triple {43977#(<= main_~k~0 24)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43977#(<= main_~k~0 24)} is VALID [2018-11-23 11:54:43,206 INFO L273 TraceCheckUtils]: 81: Hoare triple {43977#(<= main_~k~0 24)} ~k~0 := 1 + ~k~0; {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:43,207 INFO L273 TraceCheckUtils]: 82: Hoare triple {43978#(<= 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); {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:43,207 INFO L273 TraceCheckUtils]: 83: Hoare triple {43978#(<= main_~k~0 25)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43978#(<= main_~k~0 25)} is VALID [2018-11-23 11:54:43,208 INFO L273 TraceCheckUtils]: 84: Hoare triple {43978#(<= main_~k~0 25)} ~k~0 := 1 + ~k~0; {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:43,209 INFO L273 TraceCheckUtils]: 85: Hoare triple {43979#(<= 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); {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:43,209 INFO L273 TraceCheckUtils]: 86: Hoare triple {43979#(<= main_~k~0 26)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43979#(<= main_~k~0 26)} is VALID [2018-11-23 11:54:43,210 INFO L273 TraceCheckUtils]: 87: Hoare triple {43979#(<= main_~k~0 26)} ~k~0 := 1 + ~k~0; {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:43,210 INFO L273 TraceCheckUtils]: 88: Hoare triple {43980#(<= 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); {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:43,211 INFO L273 TraceCheckUtils]: 89: Hoare triple {43980#(<= main_~k~0 27)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43980#(<= main_~k~0 27)} is VALID [2018-11-23 11:54:43,211 INFO L273 TraceCheckUtils]: 90: Hoare triple {43980#(<= main_~k~0 27)} ~k~0 := 1 + ~k~0; {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:43,212 INFO L273 TraceCheckUtils]: 91: Hoare triple {43981#(<= 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); {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:43,212 INFO L273 TraceCheckUtils]: 92: Hoare triple {43981#(<= main_~k~0 28)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43981#(<= main_~k~0 28)} is VALID [2018-11-23 11:54:43,213 INFO L273 TraceCheckUtils]: 93: Hoare triple {43981#(<= main_~k~0 28)} ~k~0 := 1 + ~k~0; {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:43,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {43982#(<= 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); {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:43,214 INFO L273 TraceCheckUtils]: 95: Hoare triple {43982#(<= main_~k~0 29)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43982#(<= main_~k~0 29)} is VALID [2018-11-23 11:54:43,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {43982#(<= main_~k~0 29)} ~k~0 := 1 + ~k~0; {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:43,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {43983#(<= 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); {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:43,216 INFO L273 TraceCheckUtils]: 98: Hoare triple {43983#(<= main_~k~0 30)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43983#(<= main_~k~0 30)} is VALID [2018-11-23 11:54:43,216 INFO L273 TraceCheckUtils]: 99: Hoare triple {43983#(<= main_~k~0 30)} ~k~0 := 1 + ~k~0; {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:43,217 INFO L273 TraceCheckUtils]: 100: Hoare triple {43984#(<= 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); {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:43,217 INFO L273 TraceCheckUtils]: 101: Hoare triple {43984#(<= main_~k~0 31)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43984#(<= main_~k~0 31)} is VALID [2018-11-23 11:54:43,218 INFO L273 TraceCheckUtils]: 102: Hoare triple {43984#(<= main_~k~0 31)} ~k~0 := 1 + ~k~0; {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:43,218 INFO L273 TraceCheckUtils]: 103: Hoare triple {43985#(<= 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); {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:43,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {43985#(<= main_~k~0 32)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43985#(<= main_~k~0 32)} is VALID [2018-11-23 11:54:43,220 INFO L273 TraceCheckUtils]: 105: Hoare triple {43985#(<= main_~k~0 32)} ~k~0 := 1 + ~k~0; {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:43,220 INFO L273 TraceCheckUtils]: 106: Hoare triple {43986#(<= 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); {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:43,221 INFO L273 TraceCheckUtils]: 107: Hoare triple {43986#(<= main_~k~0 33)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43986#(<= main_~k~0 33)} is VALID [2018-11-23 11:54:43,221 INFO L273 TraceCheckUtils]: 108: Hoare triple {43986#(<= main_~k~0 33)} ~k~0 := 1 + ~k~0; {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:43,222 INFO L273 TraceCheckUtils]: 109: Hoare triple {43987#(<= 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); {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:43,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {43987#(<= main_~k~0 34)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43987#(<= main_~k~0 34)} is VALID [2018-11-23 11:54:43,223 INFO L273 TraceCheckUtils]: 111: Hoare triple {43987#(<= main_~k~0 34)} ~k~0 := 1 + ~k~0; {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:43,223 INFO L273 TraceCheckUtils]: 112: Hoare triple {43988#(<= 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); {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:43,224 INFO L273 TraceCheckUtils]: 113: Hoare triple {43988#(<= main_~k~0 35)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43988#(<= main_~k~0 35)} is VALID [2018-11-23 11:54:43,225 INFO L273 TraceCheckUtils]: 114: Hoare triple {43988#(<= main_~k~0 35)} ~k~0 := 1 + ~k~0; {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:43,225 INFO L273 TraceCheckUtils]: 115: Hoare triple {43989#(<= 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); {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:43,225 INFO L273 TraceCheckUtils]: 116: Hoare triple {43989#(<= main_~k~0 36)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43989#(<= main_~k~0 36)} is VALID [2018-11-23 11:54:43,226 INFO L273 TraceCheckUtils]: 117: Hoare triple {43989#(<= main_~k~0 36)} ~k~0 := 1 + ~k~0; {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:43,227 INFO L273 TraceCheckUtils]: 118: Hoare triple {43990#(<= 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); {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:43,227 INFO L273 TraceCheckUtils]: 119: Hoare triple {43990#(<= main_~k~0 37)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43990#(<= main_~k~0 37)} is VALID [2018-11-23 11:54:43,228 INFO L273 TraceCheckUtils]: 120: Hoare triple {43990#(<= main_~k~0 37)} ~k~0 := 1 + ~k~0; {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:43,228 INFO L273 TraceCheckUtils]: 121: Hoare triple {43991#(<= 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); {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:43,229 INFO L273 TraceCheckUtils]: 122: Hoare triple {43991#(<= main_~k~0 38)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43991#(<= main_~k~0 38)} is VALID [2018-11-23 11:54:43,229 INFO L273 TraceCheckUtils]: 123: Hoare triple {43991#(<= main_~k~0 38)} ~k~0 := 1 + ~k~0; {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:43,230 INFO L273 TraceCheckUtils]: 124: Hoare triple {43992#(<= 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); {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:43,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {43992#(<= main_~k~0 39)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43992#(<= main_~k~0 39)} is VALID [2018-11-23 11:54:43,231 INFO L273 TraceCheckUtils]: 126: Hoare triple {43992#(<= main_~k~0 39)} ~k~0 := 1 + ~k~0; {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:43,232 INFO L273 TraceCheckUtils]: 127: Hoare triple {43993#(<= 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); {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:43,232 INFO L273 TraceCheckUtils]: 128: Hoare triple {43993#(<= main_~k~0 40)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43993#(<= main_~k~0 40)} is VALID [2018-11-23 11:54:43,233 INFO L273 TraceCheckUtils]: 129: Hoare triple {43993#(<= main_~k~0 40)} ~k~0 := 1 + ~k~0; {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:43,233 INFO L273 TraceCheckUtils]: 130: Hoare triple {43994#(<= 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); {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:43,234 INFO L273 TraceCheckUtils]: 131: Hoare triple {43994#(<= main_~k~0 41)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43994#(<= main_~k~0 41)} is VALID [2018-11-23 11:54:43,235 INFO L273 TraceCheckUtils]: 132: Hoare triple {43994#(<= main_~k~0 41)} ~k~0 := 1 + ~k~0; {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:43,235 INFO L273 TraceCheckUtils]: 133: Hoare triple {43995#(<= 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); {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:43,236 INFO L273 TraceCheckUtils]: 134: Hoare triple {43995#(<= main_~k~0 42)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43995#(<= main_~k~0 42)} is VALID [2018-11-23 11:54:43,236 INFO L273 TraceCheckUtils]: 135: Hoare triple {43995#(<= main_~k~0 42)} ~k~0 := 1 + ~k~0; {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:43,237 INFO L273 TraceCheckUtils]: 136: Hoare triple {43996#(<= 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); {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:43,237 INFO L273 TraceCheckUtils]: 137: Hoare triple {43996#(<= main_~k~0 43)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43996#(<= main_~k~0 43)} is VALID [2018-11-23 11:54:43,238 INFO L273 TraceCheckUtils]: 138: Hoare triple {43996#(<= main_~k~0 43)} ~k~0 := 1 + ~k~0; {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:43,239 INFO L273 TraceCheckUtils]: 139: Hoare triple {43997#(<= main_~k~0 44)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:43,239 INFO L273 TraceCheckUtils]: 140: Hoare triple {43997#(<= main_~k~0 44)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43997#(<= main_~k~0 44)} is VALID [2018-11-23 11:54:43,240 INFO L273 TraceCheckUtils]: 141: Hoare triple {43997#(<= main_~k~0 44)} ~k~0 := 1 + ~k~0; {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:43,240 INFO L273 TraceCheckUtils]: 142: Hoare triple {43998#(<= main_~k~0 45)} assume !!(~k~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~k~0, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~s~0, 4); {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:43,241 INFO L273 TraceCheckUtils]: 143: Hoare triple {43998#(<= main_~k~0 45)} assume #t~mem0 > #t~mem1;havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {43998#(<= main_~k~0 45)} is VALID [2018-11-23 11:54:43,241 INFO L273 TraceCheckUtils]: 144: Hoare triple {43998#(<= main_~k~0 45)} ~k~0 := 1 + ~k~0; {43999#(<= main_~k~0 46)} is VALID [2018-11-23 11:54:43,242 INFO L273 TraceCheckUtils]: 145: Hoare triple {43999#(<= main_~k~0 46)} assume !(~k~0 < 100000); {43951#false} is VALID [2018-11-23 11:54:43,242 INFO L273 TraceCheckUtils]: 146: Hoare triple {43951#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); {43951#false} is VALID [2018-11-23 11:54:43,242 INFO L273 TraceCheckUtils]: 147: Hoare triple {43951#false} ~x~0 := 0; {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 148: Hoare triple {43951#false} assume !(~x~0 < ~i~0); {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 149: Hoare triple {43951#false} ~x~0 := 1 + ~i~0; {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 150: Hoare triple {43951#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); {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L256 TraceCheckUtils]: 151: Hoare triple {43951#false} call __VERIFIER_assert((if #t~mem9 >= #t~mem10 then 1 else 0)); {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 152: Hoare triple {43951#false} ~cond := #in~cond; {43951#false} is VALID [2018-11-23 11:54:43,243 INFO L273 TraceCheckUtils]: 153: Hoare triple {43951#false} assume 0 == ~cond; {43951#false} is VALID [2018-11-23 11:54:43,244 INFO L273 TraceCheckUtils]: 154: Hoare triple {43951#false} assume !false; {43951#false} is VALID [2018-11-23 11:54:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2018-11-23 11:54:43,280 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 155 [2018-11-23 11:54:43,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:43,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:54:43,428 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-23 11:54:43,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:54:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:54:43,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:54:43,430 INFO L87 Difference]: Start difference. First operand 183 states and 241 transitions. Second operand 52 states.