java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:44:40,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:44:40,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:44:40,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:44:40,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:44:40,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:44:40,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:44:40,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:44:40,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:44:40,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:44:40,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:44:40,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:44:40,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:44:40,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:44:40,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:44:40,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:44:40,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:44:40,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:44:40,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:44:40,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:44:40,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:44:40,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:44:40,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:44:40,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:44:40,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:44:40,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:44:40,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:44:40,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:44:40,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:44:40,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:44:40,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:44:40,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:44:40,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:44:40,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:44:40,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:44:40,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:44:40,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:44:40,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:44:40,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:44:40,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:44:40,322 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:44:40,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:44:40,324 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:44:40,324 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:44:40,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:44:40,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:44:40,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:44:40,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:44:40,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:44:40,325 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:44:40,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:44:40,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:44:40,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:44:40,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:44:40,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:44:40,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:44:40,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:44:40,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:44:40,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:44:40,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:44:40,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:44:40,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:44:40,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:44:40,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:44:40,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:44:40,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:44:40,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:44:40,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:44:40,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:44:40,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:44:40,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:44:40,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:44:40,404 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:44:40,404 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i [2018-11-14 18:44:40,473 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f7ef02e/215feefe38a14b21b80ad487580d016a/FLAG1d4338f4f [2018-11-14 18:44:40,917 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:44:40,918 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_true-unreach-call_ground.i [2018-11-14 18:44:40,923 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f7ef02e/215feefe38a14b21b80ad487580d016a/FLAG1d4338f4f [2018-11-14 18:44:40,940 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f7ef02e/215feefe38a14b21b80ad487580d016a [2018-11-14 18:44:40,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:44:40,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:44:40,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:44:40,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:44:40,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:44:40,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:44:40" (1/1) ... [2018-11-14 18:44:40,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2564d6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:40, skipping insertion in model container [2018-11-14 18:44:40,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:44:40" (1/1) ... [2018-11-14 18:44:40,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:44:40,993 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:44:41,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:44:41,238 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:44:41,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:44:41,298 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:44:41,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41 WrapperNode [2018-11-14 18:44:41,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:44:41,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:44:41,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:44:41,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:44:41,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... [2018-11-14 18:44:41,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:44:41,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:44:41,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:44:41,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:44:41,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:44:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:44:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:44:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:44:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:44:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:44:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:44:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:44:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:44:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:44:42,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:44:42,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:44:42 BoogieIcfgContainer [2018-11-14 18:44:42,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:44:42,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:44:42,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:44:42,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:44:42,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:44:40" (1/3) ... [2018-11-14 18:44:42,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f526e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:44:42, skipping insertion in model container [2018-11-14 18:44:42,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:44:41" (2/3) ... [2018-11-14 18:44:42,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f526e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:44:42, skipping insertion in model container [2018-11-14 18:44:42,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:44:42" (3/3) ... [2018-11-14 18:44:42,248 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_minInArray_true-unreach-call_ground.i [2018-11-14 18:44:42,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:44:42,268 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:44:42,286 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:44:42,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:44:42,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:44:42,324 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:44:42,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:44:42,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:44:42,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:44:42,325 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:44:42,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:44:42,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:44:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 18:44:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:44:42,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:42,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:42,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:42,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2135979162, now seen corresponding path program 1 times [2018-11-14 18:44:42,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:42,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:42,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 18:44:42,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-14 18:44:42,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 18:44:42,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID [2018-11-14 18:44:42,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 18:44:42,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {30#true} is VALID [2018-11-14 18:44:42,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 18:44:42,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-14 18:44:42,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 18:44:42,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {31#false} is VALID [2018-11-14 18:44:42,630 INFO L256 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {31#false} is VALID [2018-11-14 18:44:42,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 18:44:42,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 18:44:42,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 18:44:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:42,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:44:42,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:44:42,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:44:42,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:42,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:44:42,723 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-14 18:44:42,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:44:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:44:42,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:44:42,734 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 18:44:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:42,899 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 18:44:42,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:44:42,900 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:44:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:44:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 18:44:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:44:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 18:44:42,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-14 18:44:43,393 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-14 18:44:43,405 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:44:43,405 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 18:44:43,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:44:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 18:44:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 18:44:43,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:43,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 18:44:43,457 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:44:43,458 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:44:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:43,462 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:44:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:44:43,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:43,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:43,463 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:44:43,463 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:44:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:43,467 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 18:44:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:44:43,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:43,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:43,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:43,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:44:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 18:44:43,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-14 18:44:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:43,474 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 18:44:43,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:44:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 18:44:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:44:43,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:43,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:43,476 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:43,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1051366526, now seen corresponding path program 1 times [2018-11-14 18:44:43,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:43,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:43,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:43,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2018-11-14 18:44:43,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {163#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {163#true} is VALID [2018-11-14 18:44:43,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2018-11-14 18:44:43,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #57#return; {163#true} is VALID [2018-11-14 18:44:43,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret4 := main(); {163#true} is VALID [2018-11-14 18:44:43,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {165#(= main_~i~0 0)} is VALID [2018-11-14 18:44:43,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} assume true; {165#(= main_~i~0 0)} is VALID [2018-11-14 18:44:43,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {165#(= main_~i~0 0)} assume !(~i~0 < 100000); {164#false} is VALID [2018-11-14 18:44:43,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {164#false} havoc ~x~0;~x~0 := 0; {164#false} is VALID [2018-11-14 18:44:43,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {164#false} assume true; {164#false} is VALID [2018-11-14 18:44:43,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {164#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {164#false} is VALID [2018-11-14 18:44:43,577 INFO L256 TraceCheckUtils]: 11: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {164#false} is VALID [2018-11-14 18:44:43,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2018-11-14 18:44:43,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {164#false} assume ~cond == 0; {164#false} is VALID [2018-11-14 18:44:43,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {164#false} assume !false; {164#false} is VALID [2018-11-14 18:44:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:43,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:44:43,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:44:43,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:44:43,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:43,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:44:43,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:43,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:44:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:44:43,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:44:43,650 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 18:44:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:43,920 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 18:44:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:44:43,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:44:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:44:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:44:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:44:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 18:44:43,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 18:44:44,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:44,057 INFO L225 Difference]: With dead ends: 38 [2018-11-14 18:44:44,057 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 18:44:44,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:44:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 18:44:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-14 18:44:44,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:44,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-14 18:44:44,073 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-14 18:44:44,074 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-14 18:44:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:44,077 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 18:44:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 18:44:44,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:44,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:44,078 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-14 18:44:44,079 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-14 18:44:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:44,081 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 18:44:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 18:44:44,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:44,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:44,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:44,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:44:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 18:44:44,085 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-11-14 18:44:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:44,086 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 18:44:44,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:44:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 18:44:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:44:44,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:44,087 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:44,087 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:44,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1846380840, now seen corresponding path program 1 times [2018-11-14 18:44:44,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:44,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:44,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-14 18:44:44,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-14 18:44:44,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-14 18:44:44,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #57#return; {303#true} is VALID [2018-11-14 18:44:44,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-14 18:44:44,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {305#(= main_~i~0 0)} is VALID [2018-11-14 18:44:44,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(= main_~i~0 0)} assume true; {305#(= main_~i~0 0)} is VALID [2018-11-14 18:44:44,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {305#(= main_~i~0 0)} is VALID [2018-11-14 18:44:44,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {305#(= main_~i~0 0)} is VALID [2018-11-14 18:44:44,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {306#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:44,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(<= main_~i~0 1)} assume true; {306#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:44,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-14 18:44:44,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-14 18:44:44,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume true; {304#false} is VALID [2018-11-14 18:44:44,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {304#false} is VALID [2018-11-14 18:44:44,365 INFO L256 TraceCheckUtils]: 15: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {304#false} is VALID [2018-11-14 18:44:44,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-14 18:44:44,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume ~cond == 0; {304#false} is VALID [2018-11-14 18:44:44,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-14 18:44:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:44,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:44,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:44,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-14 18:44:44,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-14 18:44:44,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-14 18:44:44,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #57#return; {303#true} is VALID [2018-11-14 18:44:44,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2018-11-14 18:44:44,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {325#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:44,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(<= main_~i~0 0)} assume true; {325#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:44,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {325#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:44,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {325#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:44,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {325#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {306#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:44,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(<= main_~i~0 1)} assume true; {306#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:44,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#(<= main_~i~0 1)} assume !(~i~0 < 100000); {304#false} is VALID [2018-11-14 18:44:44,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} havoc ~x~0;~x~0 := 0; {304#false} is VALID [2018-11-14 18:44:44,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {304#false} assume true; {304#false} is VALID [2018-11-14 18:44:44,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {304#false} is VALID [2018-11-14 18:44:44,546 INFO L256 TraceCheckUtils]: 15: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {304#false} is VALID [2018-11-14 18:44:44,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-14 18:44:44,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {304#false} assume ~cond == 0; {304#false} is VALID [2018-11-14 18:44:44,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-14 18:44:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:44:44,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:44:44,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:44,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:44:44,606 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-14 18:44:44,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:44:44,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:44:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:44:44,607 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-14 18:44:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:45,289 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 18:44:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:44:45,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 18:44:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:44:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 18:44:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:44:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-14 18:44:45,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-14 18:44:45,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:45,387 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:44:45,388 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:44:45,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:44:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:44:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-14 18:44:45,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:45,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-14 18:44:45,413 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-14 18:44:45,413 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-14 18:44:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:45,416 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 18:44:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 18:44:45,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:45,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:45,417 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-14 18:44:45,417 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-14 18:44:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:45,420 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 18:44:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 18:44:45,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:45,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:45,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:45,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:44:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 18:44:45,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2018-11-14 18:44:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:45,424 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 18:44:45,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:44:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 18:44:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:44:45,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:45,426 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:45,426 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:45,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1808656174, now seen corresponding path program 2 times [2018-11-14 18:44:45,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:45,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:45,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {517#true} is VALID [2018-11-14 18:44:45,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {517#true} is VALID [2018-11-14 18:44:45,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-14 18:44:45,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #57#return; {517#true} is VALID [2018-11-14 18:44:45,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret4 := main(); {517#true} is VALID [2018-11-14 18:44:45,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {519#(= main_~i~0 0)} is VALID [2018-11-14 18:44:45,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#(= main_~i~0 0)} assume true; {519#(= main_~i~0 0)} is VALID [2018-11-14 18:44:45,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {519#(= main_~i~0 0)} is VALID [2018-11-14 18:44:45,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {519#(= main_~i~0 0)} is VALID [2018-11-14 18:44:45,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {519#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= main_~i~0 1)} assume true; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {520#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {521#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:45,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(<= main_~i~0 2)} assume true; {521#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:45,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 100000); {518#false} is VALID [2018-11-14 18:44:45,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#false} havoc ~x~0;~x~0 := 0; {518#false} is VALID [2018-11-14 18:44:45,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#false} assume true; {518#false} is VALID [2018-11-14 18:44:45,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {518#false} is VALID [2018-11-14 18:44:45,580 INFO L256 TraceCheckUtils]: 19: Hoare triple {518#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {518#false} is VALID [2018-11-14 18:44:45,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#false} ~cond := #in~cond; {518#false} is VALID [2018-11-14 18:44:45,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {518#false} assume ~cond == 0; {518#false} is VALID [2018-11-14 18:44:45,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {518#false} assume !false; {518#false} is VALID [2018-11-14 18:44:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:45,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:45,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:45,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:44:45,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:44:45,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:45,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:45,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {517#true} is VALID [2018-11-14 18:44:45,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {517#true} is VALID [2018-11-14 18:44:45,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-14 18:44:45,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #57#return; {517#true} is VALID [2018-11-14 18:44:45,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret4 := main(); {517#true} is VALID [2018-11-14 18:44:45,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {517#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {540#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:45,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#(<= main_~i~0 0)} assume true; {540#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:45,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {540#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:45,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {540#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:45,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(<= main_~i~0 1)} assume true; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {520#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:45,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {520#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {521#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:45,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(<= main_~i~0 2)} assume true; {521#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:45,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {521#(<= main_~i~0 2)} assume !(~i~0 < 100000); {518#false} is VALID [2018-11-14 18:44:45,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#false} havoc ~x~0;~x~0 := 0; {518#false} is VALID [2018-11-14 18:44:45,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {518#false} assume true; {518#false} is VALID [2018-11-14 18:44:45,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {518#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {518#false} is VALID [2018-11-14 18:44:45,798 INFO L256 TraceCheckUtils]: 19: Hoare triple {518#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {518#false} is VALID [2018-11-14 18:44:45,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#false} ~cond := #in~cond; {518#false} is VALID [2018-11-14 18:44:45,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {518#false} assume ~cond == 0; {518#false} is VALID [2018-11-14 18:44:45,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {518#false} assume !false; {518#false} is VALID [2018-11-14 18:44:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:45,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:44:45,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 18:44:45,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:45,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:44:45,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:45,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:44:45,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:44:45,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:44:45,876 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-11-14 18:44:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:46,124 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-14 18:44:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:44:46,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 18:44:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:44:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-14 18:44:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:44:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-14 18:44:46,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2018-11-14 18:44:46,238 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-14 18:44:46,241 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:44:46,241 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:44:46,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:44:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:44:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-14 18:44:46,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:46,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-14 18:44:46,259 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-14 18:44:46,260 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-14 18:44:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:46,263 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 18:44:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 18:44:46,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:46,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:46,264 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-14 18:44:46,264 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-14 18:44:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:46,267 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 18:44:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 18:44:46,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:46,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:46,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:46,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:44:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-14 18:44:46,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2018-11-14 18:44:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:46,271 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-14 18:44:46,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:44:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:44:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:44:46,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:46,272 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:46,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:46,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash 254622852, now seen corresponding path program 3 times [2018-11-14 18:44:46,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:46,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:46,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:46,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:46,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-14 18:44:46,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-14 18:44:46,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-14 18:44:46,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #57#return; {762#true} is VALID [2018-11-14 18:44:46,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-14 18:44:46,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {764#(= main_~i~0 0)} is VALID [2018-11-14 18:44:46,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {764#(= main_~i~0 0)} assume true; {764#(= main_~i~0 0)} is VALID [2018-11-14 18:44:46,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {764#(= main_~i~0 0)} is VALID [2018-11-14 18:44:46,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {764#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {764#(= main_~i~0 0)} is VALID [2018-11-14 18:44:46,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {764#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#(<= main_~i~0 1)} assume true; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~i~0 2)} assume true; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {767#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:46,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(<= main_~i~0 3)} assume true; {767#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:46,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(<= main_~i~0 3)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-14 18:44:46,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-14 18:44:46,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {763#false} assume true; {763#false} is VALID [2018-11-14 18:44:46,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {763#false} is VALID [2018-11-14 18:44:46,470 INFO L256 TraceCheckUtils]: 23: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {763#false} is VALID [2018-11-14 18:44:46,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-14 18:44:46,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {763#false} assume ~cond == 0; {763#false} is VALID [2018-11-14 18:44:46,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-14 18:44:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:46,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:46,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:44:46,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:44:46,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:46,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:46,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {762#true} call ULTIMATE.init(); {762#true} is VALID [2018-11-14 18:44:46,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {762#true} is VALID [2018-11-14 18:44:46,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {762#true} assume true; {762#true} is VALID [2018-11-14 18:44:46,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {762#true} {762#true} #57#return; {762#true} is VALID [2018-11-14 18:44:46,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {762#true} call #t~ret4 := main(); {762#true} is VALID [2018-11-14 18:44:46,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {786#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:46,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {786#(<= main_~i~0 0)} assume true; {786#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:46,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {786#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {786#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:46,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {786#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {786#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:46,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {786#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#(<= main_~i~0 1)} assume true; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {765#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:46,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~i~0 2)} assume true; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {766#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:46,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {767#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:46,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {767#(<= main_~i~0 3)} assume true; {767#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:46,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(<= main_~i~0 3)} assume !(~i~0 < 100000); {763#false} is VALID [2018-11-14 18:44:46,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#false} havoc ~x~0;~x~0 := 0; {763#false} is VALID [2018-11-14 18:44:46,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {763#false} assume true; {763#false} is VALID [2018-11-14 18:44:46,710 INFO L273 TraceCheckUtils]: 22: Hoare triple {763#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {763#false} is VALID [2018-11-14 18:44:46,711 INFO L256 TraceCheckUtils]: 23: Hoare triple {763#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {763#false} is VALID [2018-11-14 18:44:46,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {763#false} ~cond := #in~cond; {763#false} is VALID [2018-11-14 18:44:46,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {763#false} assume ~cond == 0; {763#false} is VALID [2018-11-14 18:44:46,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {763#false} assume !false; {763#false} is VALID [2018-11-14 18:44:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:46,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:46,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:44:46,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 18:44:46,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:46,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:44:46,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:46,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:44:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:44:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:44:46,778 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-11-14 18:44:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:46,936 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 18:44:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:44:46,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 18:44:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:44:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-14 18:44:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:44:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-14 18:44:46,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-14 18:44:47,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:47,065 INFO L225 Difference]: With dead ends: 50 [2018-11-14 18:44:47,065 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:44:47,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:44:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:44:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-14 18:44:47,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:47,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-14 18:44:47,081 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-14 18:44:47,081 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-14 18:44:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:47,083 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-14 18:44:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-14 18:44:47,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:47,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:47,085 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-14 18:44:47,085 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-14 18:44:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:47,087 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-14 18:44:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-14 18:44:47,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:47,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:47,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:47,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:44:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-14 18:44:47,091 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 27 [2018-11-14 18:44:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-14 18:44:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:44:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-14 18:44:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:44:47,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:47,093 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:47,093 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:47,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1651116326, now seen corresponding path program 4 times [2018-11-14 18:44:47,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:47,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:47,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:47,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2018-11-14 18:44:47,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1038#true} is VALID [2018-11-14 18:44:47,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2018-11-14 18:44:47,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #57#return; {1038#true} is VALID [2018-11-14 18:44:47,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret4 := main(); {1038#true} is VALID [2018-11-14 18:44:47,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {1038#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1040#(= main_~i~0 0)} is VALID [2018-11-14 18:44:47,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {1040#(= main_~i~0 0)} assume true; {1040#(= main_~i~0 0)} is VALID [2018-11-14 18:44:47,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {1040#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1040#(= main_~i~0 0)} is VALID [2018-11-14 18:44:47,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {1040#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1040#(= main_~i~0 0)} is VALID [2018-11-14 18:44:47,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {1040#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(<= main_~i~0 1)} assume true; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {1041#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {1041#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(<= main_~i~0 2)} assume true; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {1042#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(<= main_~i~0 3)} assume true; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1044#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:47,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {1044#(<= main_~i~0 4)} assume true; {1044#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:47,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {1044#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1039#false} is VALID [2018-11-14 18:44:47,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {1039#false} havoc ~x~0;~x~0 := 0; {1039#false} is VALID [2018-11-14 18:44:47,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {1039#false} assume true; {1039#false} is VALID [2018-11-14 18:44:47,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {1039#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1039#false} is VALID [2018-11-14 18:44:47,317 INFO L256 TraceCheckUtils]: 27: Hoare triple {1039#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1039#false} is VALID [2018-11-14 18:44:47,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {1039#false} ~cond := #in~cond; {1039#false} is VALID [2018-11-14 18:44:47,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {1039#false} assume ~cond == 0; {1039#false} is VALID [2018-11-14 18:44:47,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2018-11-14 18:44:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:47,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:47,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:44:47,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:44:47,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:47,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:47,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {1038#true} call ULTIMATE.init(); {1038#true} is VALID [2018-11-14 18:44:47,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1038#true} is VALID [2018-11-14 18:44:47,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {1038#true} assume true; {1038#true} is VALID [2018-11-14 18:44:47,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1038#true} {1038#true} #57#return; {1038#true} is VALID [2018-11-14 18:44:47,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {1038#true} call #t~ret4 := main(); {1038#true} is VALID [2018-11-14 18:44:47,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {1038#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1063#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:47,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {1063#(<= main_~i~0 0)} assume true; {1063#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:47,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {1063#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1063#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:47,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {1063#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1063#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:47,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {1063#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(<= main_~i~0 1)} assume true; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {1041#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1041#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:47,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {1041#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(<= main_~i~0 2)} assume true; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {1042#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1042#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:47,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(<= main_~i~0 3)} assume true; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1043#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:47,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1044#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:47,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {1044#(<= main_~i~0 4)} assume true; {1044#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:47,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {1044#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1039#false} is VALID [2018-11-14 18:44:47,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {1039#false} havoc ~x~0;~x~0 := 0; {1039#false} is VALID [2018-11-14 18:44:47,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {1039#false} assume true; {1039#false} is VALID [2018-11-14 18:44:47,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {1039#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1039#false} is VALID [2018-11-14 18:44:47,616 INFO L256 TraceCheckUtils]: 27: Hoare triple {1039#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1039#false} is VALID [2018-11-14 18:44:47,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {1039#false} ~cond := #in~cond; {1039#false} is VALID [2018-11-14 18:44:47,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {1039#false} assume ~cond == 0; {1039#false} is VALID [2018-11-14 18:44:47,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2018-11-14 18:44:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:47,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:47,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:44:47,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 18:44:47,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:47,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:44:47,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:47,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:44:47,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:44:47,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:44:47,682 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-11-14 18:44:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:47,877 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 18:44:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:44:47,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-14 18:44:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:44:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-14 18:44:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:44:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-14 18:44:47,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-14 18:44:47,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:47,977 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:44:47,977 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:44:47,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:44:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:44:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-14 18:44:48,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:48,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-14 18:44:48,009 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-14 18:44:48,009 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-14 18:44:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:48,011 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 18:44:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:44:48,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:48,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:48,012 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-14 18:44:48,013 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-14 18:44:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:48,015 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 18:44:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 18:44:48,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:48,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:48,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:48,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:44:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-14 18:44:48,019 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2018-11-14 18:44:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:48,019 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-14 18:44:48,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:44:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:44:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:44:48,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:48,021 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:48,021 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:48,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash -103967184, now seen corresponding path program 5 times [2018-11-14 18:44:48,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:48,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:48,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:48,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-14 18:44:48,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1345#true} is VALID [2018-11-14 18:44:48,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-14 18:44:48,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #57#return; {1345#true} is VALID [2018-11-14 18:44:48,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret4 := main(); {1345#true} is VALID [2018-11-14 18:44:48,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:48,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {1347#(= main_~i~0 0)} assume true; {1347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:48,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {1347#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:48,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {1347#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:48,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {1347#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {1348#(<= main_~i~0 1)} assume true; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {1349#(<= main_~i~0 2)} assume true; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} assume true; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {1350#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {1351#(<= main_~i~0 4)} assume true; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {1351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {1351#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {1351#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:48,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 5)} assume true; {1352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:48,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1346#false} is VALID [2018-11-14 18:44:48,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {1346#false} havoc ~x~0;~x~0 := 0; {1346#false} is VALID [2018-11-14 18:44:48,256 INFO L273 TraceCheckUtils]: 29: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-14 18:44:48,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {1346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1346#false} is VALID [2018-11-14 18:44:48,256 INFO L256 TraceCheckUtils]: 31: Hoare triple {1346#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1346#false} is VALID [2018-11-14 18:44:48,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-14 18:44:48,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {1346#false} assume ~cond == 0; {1346#false} is VALID [2018-11-14 18:44:48,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-14 18:44:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:48,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:44:48,329 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:44:48,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:48,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:48,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-14 18:44:48,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1345#true} is VALID [2018-11-14 18:44:48,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-14 18:44:48,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #57#return; {1345#true} is VALID [2018-11-14 18:44:48,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret4 := main(); {1345#true} is VALID [2018-11-14 18:44:48,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:48,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(<= main_~i~0 0)} assume true; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:48,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {1371#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1371#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:48,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {1371#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1371#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:48,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {1371#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {1348#(<= main_~i~0 1)} assume true; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:48,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1349#(<= main_~i~0 2)} assume true; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:48,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} assume true; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:48,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {1350#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {1351#(<= main_~i~0 4)} assume true; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {1351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {1351#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:48,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {1351#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:48,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 5)} assume true; {1352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:48,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1346#false} is VALID [2018-11-14 18:44:48,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {1346#false} havoc ~x~0;~x~0 := 0; {1346#false} is VALID [2018-11-14 18:44:48,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-14 18:44:48,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {1346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1346#false} is VALID [2018-11-14 18:44:48,480 INFO L256 TraceCheckUtils]: 31: Hoare triple {1346#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1346#false} is VALID [2018-11-14 18:44:48,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-14 18:44:48,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {1346#false} assume ~cond == 0; {1346#false} is VALID [2018-11-14 18:44:48,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-14 18:44:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:48,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:48,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:44:48,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 18:44:48,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:48,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:44:48,548 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-14 18:44:48,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:44:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:44:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:44:48,549 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 9 states. [2018-11-14 18:44:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:48,773 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-14 18:44:48,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:44:48,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 18:44:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:44:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-14 18:44:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:44:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2018-11-14 18:44:48,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2018-11-14 18:44:48,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:48,853 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:44:48,853 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 18:44:48,854 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:44:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 18:44:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-14 18:44:48,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:48,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-14 18:44:48,892 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-14 18:44:48,893 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-14 18:44:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:48,895 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 18:44:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 18:44:48,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:48,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:48,896 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-14 18:44:48,896 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-14 18:44:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:48,899 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 18:44:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 18:44:48,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:48,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:48,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:48,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:44:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-14 18:44:48,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2018-11-14 18:44:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:48,902 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-14 18:44:48,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:44:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 18:44:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:44:48,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:48,903 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:48,904 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:48,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 668572294, now seen corresponding path program 6 times [2018-11-14 18:44:48,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:48,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:48,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:48,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:48,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:49,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2018-11-14 18:44:49,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1683#true} is VALID [2018-11-14 18:44:49,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {1683#true} assume true; {1683#true} is VALID [2018-11-14 18:44:49,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1683#true} {1683#true} #57#return; {1683#true} is VALID [2018-11-14 18:44:49,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {1683#true} call #t~ret4 := main(); {1683#true} is VALID [2018-11-14 18:44:49,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {1683#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1685#(= main_~i~0 0)} is VALID [2018-11-14 18:44:49,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#(= main_~i~0 0)} assume true; {1685#(= main_~i~0 0)} is VALID [2018-11-14 18:44:49,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {1685#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1685#(= main_~i~0 0)} is VALID [2018-11-14 18:44:49,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {1685#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1685#(= main_~i~0 0)} is VALID [2018-11-14 18:44:49,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {1685#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 1)} assume true; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {1686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {1686#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {1686#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= main_~i~0 2)} assume true; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,098 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#(<= main_~i~0 3)} assume true; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {1689#(<= main_~i~0 4)} assume true; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {1689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {1689#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#(<= main_~i~0 5)} assume true; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,105 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {1690#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {1691#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:49,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 6)} assume true; {1691#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:49,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1684#false} is VALID [2018-11-14 18:44:49,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {1684#false} havoc ~x~0;~x~0 := 0; {1684#false} is VALID [2018-11-14 18:44:49,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {1684#false} assume true; {1684#false} is VALID [2018-11-14 18:44:49,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {1684#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1684#false} is VALID [2018-11-14 18:44:49,109 INFO L256 TraceCheckUtils]: 35: Hoare triple {1684#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1684#false} is VALID [2018-11-14 18:44:49,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2018-11-14 18:44:49,110 INFO L273 TraceCheckUtils]: 37: Hoare triple {1684#false} assume ~cond == 0; {1684#false} is VALID [2018-11-14 18:44:49,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2018-11-14 18:44:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:49,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:44:49,237 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:44:49,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:49,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:49,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2018-11-14 18:44:49,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1683#true} is VALID [2018-11-14 18:44:49,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {1683#true} assume true; {1683#true} is VALID [2018-11-14 18:44:49,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1683#true} {1683#true} #57#return; {1683#true} is VALID [2018-11-14 18:44:49,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {1683#true} call #t~ret4 := main(); {1683#true} is VALID [2018-11-14 18:44:49,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {1683#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {1710#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:49,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {1710#(<= main_~i~0 0)} assume true; {1710#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:49,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {1710#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1710#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:49,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {1710#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1710#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:49,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 1)} assume true; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {1686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {1686#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1686#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:49,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1686#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= main_~i~0 2)} assume true; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1687#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:49,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#(<= main_~i~0 3)} assume true; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,455 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1688#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:49,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,456 INFO L273 TraceCheckUtils]: 22: Hoare triple {1689#(<= main_~i~0 4)} assume true; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {1689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1689#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:49,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {1689#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {1690#(<= main_~i~0 5)} assume true; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,461 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {1690#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:49,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {1690#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {1691#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:49,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 6)} assume true; {1691#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:49,463 INFO L273 TraceCheckUtils]: 31: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1684#false} is VALID [2018-11-14 18:44:49,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {1684#false} havoc ~x~0;~x~0 := 0; {1684#false} is VALID [2018-11-14 18:44:49,464 INFO L273 TraceCheckUtils]: 33: Hoare triple {1684#false} assume true; {1684#false} is VALID [2018-11-14 18:44:49,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {1684#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1684#false} is VALID [2018-11-14 18:44:49,464 INFO L256 TraceCheckUtils]: 35: Hoare triple {1684#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {1684#false} is VALID [2018-11-14 18:44:49,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2018-11-14 18:44:49,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {1684#false} assume ~cond == 0; {1684#false} is VALID [2018-11-14 18:44:49,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2018-11-14 18:44:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:49,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:49,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:44:49,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 18:44:49,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:49,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:44:49,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:49,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:44:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:44:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:44:49,566 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 10 states. [2018-11-14 18:44:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:50,072 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 18:44:50,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:44:50,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 18:44:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:44:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-14 18:44:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:44:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-11-14 18:44:50,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2018-11-14 18:44:50,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:50,175 INFO L225 Difference]: With dead ends: 62 [2018-11-14 18:44:50,175 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:44:50,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:44:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:44:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-14 18:44:50,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:50,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-14 18:44:50,197 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-14 18:44:50,197 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-14 18:44:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:50,200 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 18:44:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 18:44:50,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:50,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:50,201 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-14 18:44:50,201 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-14 18:44:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:50,204 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 18:44:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 18:44:50,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:50,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:50,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:50,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:44:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-14 18:44:50,207 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 39 [2018-11-14 18:44:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:50,207 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-14 18:44:50,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:44:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 18:44:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 18:44:50,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:50,209 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:50,209 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:50,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1392540708, now seen corresponding path program 7 times [2018-11-14 18:44:50,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:50,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:50,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-14 18:44:50,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-14 18:44:50,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-14 18:44:50,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #57#return; {2052#true} is VALID [2018-11-14 18:44:50,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret4 := main(); {2052#true} is VALID [2018-11-14 18:44:50,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2054#(= main_~i~0 0)} is VALID [2018-11-14 18:44:50,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {2054#(= main_~i~0 0)} assume true; {2054#(= main_~i~0 0)} is VALID [2018-11-14 18:44:50,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {2054#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2054#(= main_~i~0 0)} is VALID [2018-11-14 18:44:50,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {2054#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2054#(= main_~i~0 0)} is VALID [2018-11-14 18:44:50,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {2054#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(<= main_~i~0 1)} assume true; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {2055#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 2)} assume true; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {2056#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {2056#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {2057#(<= main_~i~0 3)} assume true; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2057#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {2057#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {2057#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {2058#(<= main_~i~0 4)} assume true; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#(<= main_~i~0 5)} assume true; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {2059#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {2059#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {2059#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 6)} assume true; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,558 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2061#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:50,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {2061#(<= main_~i~0 7)} assume true; {2061#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:50,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {2061#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2053#false} is VALID [2018-11-14 18:44:50,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {2053#false} havoc ~x~0;~x~0 := 0; {2053#false} is VALID [2018-11-14 18:44:50,560 INFO L273 TraceCheckUtils]: 37: Hoare triple {2053#false} assume true; {2053#false} is VALID [2018-11-14 18:44:50,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {2053#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2053#false} is VALID [2018-11-14 18:44:50,560 INFO L256 TraceCheckUtils]: 39: Hoare triple {2053#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2053#false} is VALID [2018-11-14 18:44:50,561 INFO L273 TraceCheckUtils]: 40: Hoare triple {2053#false} ~cond := #in~cond; {2053#false} is VALID [2018-11-14 18:44:50,561 INFO L273 TraceCheckUtils]: 41: Hoare triple {2053#false} assume ~cond == 0; {2053#false} is VALID [2018-11-14 18:44:50,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-14 18:44:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:50,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:50,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:50,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:50,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:50,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {2052#true} call ULTIMATE.init(); {2052#true} is VALID [2018-11-14 18:44:50,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {2052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2052#true} is VALID [2018-11-14 18:44:50,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {2052#true} assume true; {2052#true} is VALID [2018-11-14 18:44:50,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2052#true} {2052#true} #57#return; {2052#true} is VALID [2018-11-14 18:44:50,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {2052#true} call #t~ret4 := main(); {2052#true} is VALID [2018-11-14 18:44:50,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {2052#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2080#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:50,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {2080#(<= main_~i~0 0)} assume true; {2080#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:50,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {2080#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2080#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:50,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {2080#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2080#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:50,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {2080#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(<= main_~i~0 1)} assume true; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {2055#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2055#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:50,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {2056#(<= main_~i~0 2)} assume true; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {2056#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {2056#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2056#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:50,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {2057#(<= main_~i~0 3)} assume true; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {2057#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {2057#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2057#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:50,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {2057#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {2058#(<= main_~i~0 4)} assume true; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2058#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:50,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {2059#(<= main_~i~0 5)} assume true; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {2059#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {2059#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2059#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:50,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {2059#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 6)} assume true; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2060#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:50,763 INFO L273 TraceCheckUtils]: 33: Hoare triple {2060#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2061#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:50,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {2061#(<= main_~i~0 7)} assume true; {2061#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:50,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {2061#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2053#false} is VALID [2018-11-14 18:44:50,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {2053#false} havoc ~x~0;~x~0 := 0; {2053#false} is VALID [2018-11-14 18:44:50,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {2053#false} assume true; {2053#false} is VALID [2018-11-14 18:44:50,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {2053#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2053#false} is VALID [2018-11-14 18:44:50,765 INFO L256 TraceCheckUtils]: 39: Hoare triple {2053#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2053#false} is VALID [2018-11-14 18:44:50,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {2053#false} ~cond := #in~cond; {2053#false} is VALID [2018-11-14 18:44:50,766 INFO L273 TraceCheckUtils]: 41: Hoare triple {2053#false} assume ~cond == 0; {2053#false} is VALID [2018-11-14 18:44:50,766 INFO L273 TraceCheckUtils]: 42: Hoare triple {2053#false} assume !false; {2053#false} is VALID [2018-11-14 18:44:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:50,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:50,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:44:50,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 18:44:50,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:50,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:44:50,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:50,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:44:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:44:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:44:50,985 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 11 states. [2018-11-14 18:44:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:51,368 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 18:44:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:44:51,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-14 18:44:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:44:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 18:44:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:44:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 18:44:51,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2018-11-14 18:44:51,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:51,474 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:44:51,474 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:44:51,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:44:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:44:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-14 18:44:51,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:51,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-14 18:44:51,519 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-14 18:44:51,519 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-14 18:44:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:51,521 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-14 18:44:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-14 18:44:51,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:51,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:51,522 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-14 18:44:51,522 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-14 18:44:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:51,524 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-14 18:44:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-14 18:44:51,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:51,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:51,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:51,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:44:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-14 18:44:51,527 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 43 [2018-11-14 18:44:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:51,527 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-14 18:44:51,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:44:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-14 18:44:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 18:44:51,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:51,528 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:51,528 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:51,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash -272313806, now seen corresponding path program 8 times [2018-11-14 18:44:51,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:51,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:52,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-14 18:44:52,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-14 18:44:52,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-14 18:44:52,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #57#return; {2452#true} is VALID [2018-11-14 18:44:52,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-14 18:44:52,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2454#(= main_~i~0 0)} is VALID [2018-11-14 18:44:52,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {2454#(= main_~i~0 0)} assume true; {2454#(= main_~i~0 0)} is VALID [2018-11-14 18:44:52,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {2454#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2454#(= main_~i~0 0)} is VALID [2018-11-14 18:44:52,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {2454#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2454#(= main_~i~0 0)} is VALID [2018-11-14 18:44:52,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {2454#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(<= main_~i~0 1)} assume true; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {2455#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {2455#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {2456#(<= main_~i~0 2)} assume true; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,458 INFO L273 TraceCheckUtils]: 16: Hoare triple {2456#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {2456#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#(<= main_~i~0 3)} assume true; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {2458#(<= main_~i~0 4)} assume true; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {2458#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {2458#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {2459#(<= main_~i~0 5)} assume true; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {2459#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,470 INFO L273 TraceCheckUtils]: 29: Hoare triple {2459#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {2460#(<= main_~i~0 6)} assume true; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,471 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {2460#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {2461#(<= main_~i~0 7)} assume true; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {2461#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {2461#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {2462#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:52,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {2462#(<= main_~i~0 8)} assume true; {2462#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:52,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2453#false} is VALID [2018-11-14 18:44:52,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {2453#false} havoc ~x~0;~x~0 := 0; {2453#false} is VALID [2018-11-14 18:44:52,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {2453#false} assume true; {2453#false} is VALID [2018-11-14 18:44:52,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {2453#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2453#false} is VALID [2018-11-14 18:44:52,476 INFO L256 TraceCheckUtils]: 43: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2453#false} is VALID [2018-11-14 18:44:52,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-14 18:44:52,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {2453#false} assume ~cond == 0; {2453#false} is VALID [2018-11-14 18:44:52,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-14 18:44:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:52,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:52,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:52,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:44:52,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:44:52,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:52,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:52,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2018-11-14 18:44:52,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2452#true} is VALID [2018-11-14 18:44:52,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2018-11-14 18:44:52,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #57#return; {2452#true} is VALID [2018-11-14 18:44:52,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret4 := main(); {2452#true} is VALID [2018-11-14 18:44:52,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {2452#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2481#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:52,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {2481#(<= main_~i~0 0)} assume true; {2481#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:52,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {2481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2481#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:52,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {2481#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2481#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:52,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {2481#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(<= main_~i~0 1)} assume true; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {2455#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {2455#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2455#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:52,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {2455#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {2456#(<= main_~i~0 2)} assume true; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {2456#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {2456#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2456#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:52,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {2456#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#(<= main_~i~0 3)} assume true; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2457#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:52,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {2458#(<= main_~i~0 4)} assume true; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {2458#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {2458#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2458#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:52,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {2458#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {2459#(<= main_~i~0 5)} assume true; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {2459#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {2459#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2459#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:52,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {2459#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {2460#(<= main_~i~0 6)} assume true; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {2460#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {2460#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2460#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:52,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {2460#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {2461#(<= main_~i~0 7)} assume true; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {2461#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {2461#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2461#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:52,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {2461#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {2462#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:52,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {2462#(<= main_~i~0 8)} assume true; {2462#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:52,872 INFO L273 TraceCheckUtils]: 39: Hoare triple {2462#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2453#false} is VALID [2018-11-14 18:44:52,873 INFO L273 TraceCheckUtils]: 40: Hoare triple {2453#false} havoc ~x~0;~x~0 := 0; {2453#false} is VALID [2018-11-14 18:44:52,873 INFO L273 TraceCheckUtils]: 41: Hoare triple {2453#false} assume true; {2453#false} is VALID [2018-11-14 18:44:52,873 INFO L273 TraceCheckUtils]: 42: Hoare triple {2453#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2453#false} is VALID [2018-11-14 18:44:52,873 INFO L256 TraceCheckUtils]: 43: Hoare triple {2453#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2453#false} is VALID [2018-11-14 18:44:52,873 INFO L273 TraceCheckUtils]: 44: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2018-11-14 18:44:52,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {2453#false} assume ~cond == 0; {2453#false} is VALID [2018-11-14 18:44:52,874 INFO L273 TraceCheckUtils]: 46: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2018-11-14 18:44:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:52,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:44:52,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-14 18:44:52,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:52,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:44:52,946 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-14 18:44:52,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:44:52,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:44:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:44:52,948 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 12 states. [2018-11-14 18:44:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:53,184 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-14 18:44:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:44:53,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-14 18:44:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:44:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 18:44:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:44:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 18:44:53,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-14 18:44:53,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:53,289 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:44:53,289 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 18:44:53,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:44:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 18:44:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 18:44:53,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:53,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 18:44:53,312 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 18:44:53,312 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 18:44:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:53,314 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 18:44:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 18:44:53,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:53,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:53,314 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 18:44:53,315 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 18:44:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:53,316 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 18:44:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 18:44:53,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:53,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:53,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:53,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:44:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-14 18:44:53,319 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 47 [2018-11-14 18:44:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:53,319 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-14 18:44:53,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:44:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-14 18:44:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 18:44:53,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:53,320 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:53,320 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:53,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1745943160, now seen corresponding path program 9 times [2018-11-14 18:44:53,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:53,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:53,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {2883#true} call ULTIMATE.init(); {2883#true} is VALID [2018-11-14 18:44:53,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {2883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2883#true} is VALID [2018-11-14 18:44:53,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2018-11-14 18:44:53,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #57#return; {2883#true} is VALID [2018-11-14 18:44:53,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {2883#true} call #t~ret4 := main(); {2883#true} is VALID [2018-11-14 18:44:53,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {2883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2885#(= main_~i~0 0)} is VALID [2018-11-14 18:44:53,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {2885#(= main_~i~0 0)} assume true; {2885#(= main_~i~0 0)} is VALID [2018-11-14 18:44:53,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {2885#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2885#(= main_~i~0 0)} is VALID [2018-11-14 18:44:53,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {2885#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2885#(= main_~i~0 0)} is VALID [2018-11-14 18:44:53,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {2885#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {2886#(<= main_~i~0 1)} assume true; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {2886#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {2886#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {2886#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {2887#(<= main_~i~0 2)} assume true; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {2887#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {2887#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {2888#(<= main_~i~0 3)} assume true; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {2888#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {2888#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {2888#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#(<= main_~i~0 4)} assume true; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {2890#(<= main_~i~0 5)} assume true; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {2890#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {2891#(<= main_~i~0 6)} assume true; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {2891#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {2891#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {2891#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {2892#(<= main_~i~0 7)} assume true; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {2892#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {2892#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {2892#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(<= main_~i~0 8)} assume true; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {2893#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {2893#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {2893#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {2894#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:53,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#(<= main_~i~0 9)} assume true; {2894#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:53,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2884#false} is VALID [2018-11-14 18:44:53,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {2884#false} havoc ~x~0;~x~0 := 0; {2884#false} is VALID [2018-11-14 18:44:53,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {2884#false} assume true; {2884#false} is VALID [2018-11-14 18:44:53,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {2884#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2884#false} is VALID [2018-11-14 18:44:53,582 INFO L256 TraceCheckUtils]: 47: Hoare triple {2884#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2884#false} is VALID [2018-11-14 18:44:53,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {2884#false} ~cond := #in~cond; {2884#false} is VALID [2018-11-14 18:44:53,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {2884#false} assume ~cond == 0; {2884#false} is VALID [2018-11-14 18:44:53,583 INFO L273 TraceCheckUtils]: 50: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2018-11-14 18:44:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:53,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:53,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:44:53,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:44:53,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:53,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:53,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {2883#true} call ULTIMATE.init(); {2883#true} is VALID [2018-11-14 18:44:53,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {2883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2883#true} is VALID [2018-11-14 18:44:53,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {2883#true} assume true; {2883#true} is VALID [2018-11-14 18:44:53,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2883#true} {2883#true} #57#return; {2883#true} is VALID [2018-11-14 18:44:53,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {2883#true} call #t~ret4 := main(); {2883#true} is VALID [2018-11-14 18:44:53,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {2883#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {2913#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:53,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {2913#(<= main_~i~0 0)} assume true; {2913#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:53,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {2913#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2913#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:53,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {2913#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2913#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:53,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {2913#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {2886#(<= main_~i~0 1)} assume true; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {2886#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {2886#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2886#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:53,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {2886#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {2887#(<= main_~i~0 2)} assume true; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {2887#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {2887#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2887#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:53,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {2888#(<= main_~i~0 3)} assume true; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {2888#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {2888#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2888#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:53,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {2888#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {2889#(<= main_~i~0 4)} assume true; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {2889#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2889#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:53,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {2890#(<= main_~i~0 5)} assume true; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {2890#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {2890#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2890#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:53,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {2890#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2891#(<= main_~i~0 6)} assume true; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {2891#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {2891#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2891#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:53,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {2891#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {2892#(<= main_~i~0 7)} assume true; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {2892#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {2892#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2892#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:53,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {2892#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(<= main_~i~0 8)} assume true; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {2893#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {2893#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {2893#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:53,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {2893#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {2894#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:53,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {2894#(<= main_~i~0 9)} assume true; {2894#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:53,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {2894#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2884#false} is VALID [2018-11-14 18:44:53,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {2884#false} havoc ~x~0;~x~0 := 0; {2884#false} is VALID [2018-11-14 18:44:53,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {2884#false} assume true; {2884#false} is VALID [2018-11-14 18:44:53,785 INFO L273 TraceCheckUtils]: 46: Hoare triple {2884#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2884#false} is VALID [2018-11-14 18:44:53,785 INFO L256 TraceCheckUtils]: 47: Hoare triple {2884#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {2884#false} is VALID [2018-11-14 18:44:53,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {2884#false} ~cond := #in~cond; {2884#false} is VALID [2018-11-14 18:44:53,786 INFO L273 TraceCheckUtils]: 49: Hoare triple {2884#false} assume ~cond == 0; {2884#false} is VALID [2018-11-14 18:44:53,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {2884#false} assume !false; {2884#false} is VALID [2018-11-14 18:44:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:53,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:44:53,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-14 18:44:53,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:53,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:44:53,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:53,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:44:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:44:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:44:53,960 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 13 states. [2018-11-14 18:44:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:54,264 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-14 18:44:54,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:44:54,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-14 18:44:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:44:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-14 18:44:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:44:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-14 18:44:54,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2018-11-14 18:44:54,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:54,372 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:44:54,372 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:44:54,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:44:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:44:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-14 18:44:54,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:54,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-14 18:44:54,392 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-14 18:44:54,392 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-14 18:44:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:54,393 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-14 18:44:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-14 18:44:54,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:54,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:54,394 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-14 18:44:54,394 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-14 18:44:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:54,395 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-14 18:44:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-14 18:44:54,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:54,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:54,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:54,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:44:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-14 18:44:54,397 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 51 [2018-11-14 18:44:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:54,397 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-14 18:44:54,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:44:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-14 18:44:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:44:54,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:54,398 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:54,399 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:54,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash -293364258, now seen corresponding path program 10 times [2018-11-14 18:44:54,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:54,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:54,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {3345#true} call ULTIMATE.init(); {3345#true} is VALID [2018-11-14 18:44:54,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {3345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3345#true} is VALID [2018-11-14 18:44:54,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {3345#true} assume true; {3345#true} is VALID [2018-11-14 18:44:54,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3345#true} {3345#true} #57#return; {3345#true} is VALID [2018-11-14 18:44:54,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {3345#true} call #t~ret4 := main(); {3345#true} is VALID [2018-11-14 18:44:54,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {3345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:54,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {3347#(= main_~i~0 0)} assume true; {3347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:54,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {3347#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:54,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {3347#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3347#(= main_~i~0 0)} is VALID [2018-11-14 18:44:54,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {3347#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {3348#(<= main_~i~0 1)} assume true; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {3348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {3348#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {3348#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:54,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {3349#(<= main_~i~0 2)} assume true; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:54,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {3349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:54,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {3349#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:54,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {3349#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:54,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(<= main_~i~0 3)} assume true; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:54,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:54,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:54,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {3350#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:54,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {3351#(<= main_~i~0 4)} assume true; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:54,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {3351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:54,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {3351#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:54,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {3351#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:54,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {3352#(<= main_~i~0 5)} assume true; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:54,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {3352#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:54,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {3352#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:54,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {3352#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:54,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#(<= main_~i~0 6)} assume true; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:54,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:54,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:54,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:54,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {3354#(<= main_~i~0 7)} assume true; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:54,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {3354#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:54,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {3354#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:54,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {3354#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:54,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {3355#(<= main_~i~0 8)} assume true; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:54,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {3355#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:54,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {3355#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:54,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {3355#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:54,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {3356#(<= main_~i~0 9)} assume true; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:54,784 INFO L273 TraceCheckUtils]: 43: Hoare triple {3356#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:54,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {3356#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:54,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {3356#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {3357#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:54,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {3357#(<= main_~i~0 10)} assume true; {3357#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:54,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {3357#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3346#false} is VALID [2018-11-14 18:44:54,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {3346#false} havoc ~x~0;~x~0 := 0; {3346#false} is VALID [2018-11-14 18:44:54,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {3346#false} assume true; {3346#false} is VALID [2018-11-14 18:44:54,787 INFO L273 TraceCheckUtils]: 50: Hoare triple {3346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3346#false} is VALID [2018-11-14 18:44:54,787 INFO L256 TraceCheckUtils]: 51: Hoare triple {3346#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3346#false} is VALID [2018-11-14 18:44:54,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {3346#false} ~cond := #in~cond; {3346#false} is VALID [2018-11-14 18:44:54,788 INFO L273 TraceCheckUtils]: 53: Hoare triple {3346#false} assume ~cond == 0; {3346#false} is VALID [2018-11-14 18:44:54,788 INFO L273 TraceCheckUtils]: 54: Hoare triple {3346#false} assume !false; {3346#false} is VALID [2018-11-14 18:44:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:54,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:54,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:54,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:44:54,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:44:54,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:54,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:54,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {3345#true} call ULTIMATE.init(); {3345#true} is VALID [2018-11-14 18:44:54,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {3345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3345#true} is VALID [2018-11-14 18:44:54,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {3345#true} assume true; {3345#true} is VALID [2018-11-14 18:44:54,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3345#true} {3345#true} #57#return; {3345#true} is VALID [2018-11-14 18:44:54,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {3345#true} call #t~ret4 := main(); {3345#true} is VALID [2018-11-14 18:44:54,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {3345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3376#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:54,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {3376#(<= main_~i~0 0)} assume true; {3376#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:54,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {3376#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3376#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:54,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {3376#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3376#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:54,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {3376#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {3348#(<= main_~i~0 1)} assume true; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {3348#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {3348#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3348#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:54,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {3348#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:54,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {3349#(<= main_~i~0 2)} assume true; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:55,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {3349#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:55,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {3349#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3349#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:55,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {3349#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:55,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(<= main_~i~0 3)} assume true; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:55,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:55,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3350#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:55,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {3350#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:55,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {3351#(<= main_~i~0 4)} assume true; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:55,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {3351#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:55,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {3351#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3351#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:55,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {3351#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:55,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {3352#(<= main_~i~0 5)} assume true; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:55,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {3352#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:55,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {3352#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3352#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:55,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {3352#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:55,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#(<= main_~i~0 6)} assume true; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:55,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:55,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3353#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:55,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:55,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {3354#(<= main_~i~0 7)} assume true; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:55,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {3354#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:55,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {3354#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3354#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:55,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {3354#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:55,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {3355#(<= main_~i~0 8)} assume true; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:55,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {3355#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:55,017 INFO L273 TraceCheckUtils]: 40: Hoare triple {3355#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3355#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:55,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {3355#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:55,018 INFO L273 TraceCheckUtils]: 42: Hoare triple {3356#(<= main_~i~0 9)} assume true; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:55,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {3356#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:55,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {3356#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3356#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:55,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {3356#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {3357#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:55,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {3357#(<= main_~i~0 10)} assume true; {3357#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {3357#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {3346#false} havoc ~x~0;~x~0 := 0; {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 49: Hoare triple {3346#false} assume true; {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {3346#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L256 TraceCheckUtils]: 51: Hoare triple {3346#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {3346#false} ~cond := #in~cond; {3346#false} is VALID [2018-11-14 18:44:55,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {3346#false} assume ~cond == 0; {3346#false} is VALID [2018-11-14 18:44:55,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {3346#false} assume !false; {3346#false} is VALID [2018-11-14 18:44:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:55,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:55,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:44:55,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-14 18:44:55,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:55,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:44:55,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:55,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:44:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:44:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:44:55,121 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 14 states. [2018-11-14 18:44:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:55,519 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-14 18:44:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:44:55,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-14 18:44:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:44:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-14 18:44:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:44:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-14 18:44:55,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2018-11-14 18:44:55,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:55,637 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:44:55,637 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:44:55,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:44:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:44:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-14 18:44:55,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:55,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-14 18:44:55,662 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-14 18:44:55,662 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-14 18:44:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:55,664 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-14 18:44:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 18:44:55,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:55,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:55,665 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-14 18:44:55,665 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-14 18:44:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:55,667 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-14 18:44:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 18:44:55,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:55,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:55,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:55,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:44:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-14 18:44:55,670 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 55 [2018-11-14 18:44:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:55,670 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-14 18:44:55,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:44:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 18:44:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 18:44:55,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:55,671 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:55,671 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:55,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1036524340, now seen corresponding path program 11 times [2018-11-14 18:44:55,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:55,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:55,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:55,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:55,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-14 18:44:55,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-14 18:44:55,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-14 18:44:55,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #57#return; {3838#true} is VALID [2018-11-14 18:44:55,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret4 := main(); {3838#true} is VALID [2018-11-14 18:44:55,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3840#(= main_~i~0 0)} is VALID [2018-11-14 18:44:55,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#(= main_~i~0 0)} assume true; {3840#(= main_~i~0 0)} is VALID [2018-11-14 18:44:55,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {3840#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3840#(= main_~i~0 0)} is VALID [2018-11-14 18:44:55,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {3840#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3840#(= main_~i~0 0)} is VALID [2018-11-14 18:44:55,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {3840#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:55,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {3841#(<= main_~i~0 1)} assume true; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:55,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {3841#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:55,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {3841#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:55,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {3841#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {3842#(<= main_~i~0 2)} assume true; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {3842#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {3842#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {3842#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {3843#(<= main_~i~0 3)} assume true; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {3843#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {3843#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {3843#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {3844#(<= main_~i~0 4)} assume true; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {3844#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {3844#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {3844#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {3845#(<= main_~i~0 5)} assume true; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {3845#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {3845#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {3845#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {3846#(<= main_~i~0 6)} assume true; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {3846#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {3846#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {3846#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {3847#(<= main_~i~0 7)} assume true; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {3847#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {3847#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {3847#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 8)} assume true; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,050 INFO L273 TraceCheckUtils]: 40: Hoare triple {3848#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {3848#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,051 INFO L273 TraceCheckUtils]: 42: Hoare triple {3849#(<= main_~i~0 9)} assume true; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {3849#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {3849#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {3849#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {3850#(<= main_~i~0 10)} assume true; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {3850#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {3850#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {3850#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {3851#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:56,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {3851#(<= main_~i~0 11)} assume true; {3851#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:56,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {3851#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3839#false} is VALID [2018-11-14 18:44:56,057 INFO L273 TraceCheckUtils]: 52: Hoare triple {3839#false} havoc ~x~0;~x~0 := 0; {3839#false} is VALID [2018-11-14 18:44:56,057 INFO L273 TraceCheckUtils]: 53: Hoare triple {3839#false} assume true; {3839#false} is VALID [2018-11-14 18:44:56,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {3839#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3839#false} is VALID [2018-11-14 18:44:56,058 INFO L256 TraceCheckUtils]: 55: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3839#false} is VALID [2018-11-14 18:44:56,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-14 18:44:56,058 INFO L273 TraceCheckUtils]: 57: Hoare triple {3839#false} assume ~cond == 0; {3839#false} is VALID [2018-11-14 18:44:56,058 INFO L273 TraceCheckUtils]: 58: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-14 18:44:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:56,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:56,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:44:56,102 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:44:56,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:56,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:56,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2018-11-14 18:44:56,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3838#true} is VALID [2018-11-14 18:44:56,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2018-11-14 18:44:56,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #57#return; {3838#true} is VALID [2018-11-14 18:44:56,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret4 := main(); {3838#true} is VALID [2018-11-14 18:44:56,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {3838#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {3870#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:56,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {3870#(<= main_~i~0 0)} assume true; {3870#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:56,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {3870#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3870#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:56,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {3870#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3870#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:56,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {3870#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:56,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {3841#(<= main_~i~0 1)} assume true; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:56,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {3841#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:56,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {3841#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3841#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:56,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {3841#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {3842#(<= main_~i~0 2)} assume true; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {3842#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {3842#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3842#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:56,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {3842#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {3843#(<= main_~i~0 3)} assume true; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {3843#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {3843#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3843#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:56,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {3843#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {3844#(<= main_~i~0 4)} assume true; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {3844#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {3844#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3844#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:56,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {3844#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {3845#(<= main_~i~0 5)} assume true; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {3845#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {3845#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3845#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:56,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {3845#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {3846#(<= main_~i~0 6)} assume true; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {3846#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {3846#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3846#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:56,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {3846#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {3847#(<= main_~i~0 7)} assume true; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {3847#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {3847#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3847#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:56,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {3847#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 8)} assume true; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {3848#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3848#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:56,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {3848#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {3849#(<= main_~i~0 9)} assume true; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,326 INFO L273 TraceCheckUtils]: 43: Hoare triple {3849#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {3849#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3849#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:56,327 INFO L273 TraceCheckUtils]: 45: Hoare triple {3849#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {3850#(<= main_~i~0 10)} assume true; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {3850#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,329 INFO L273 TraceCheckUtils]: 48: Hoare triple {3850#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {3850#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:56,330 INFO L273 TraceCheckUtils]: 49: Hoare triple {3850#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {3851#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:56,330 INFO L273 TraceCheckUtils]: 50: Hoare triple {3851#(<= main_~i~0 11)} assume true; {3851#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:56,331 INFO L273 TraceCheckUtils]: 51: Hoare triple {3851#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3839#false} is VALID [2018-11-14 18:44:56,331 INFO L273 TraceCheckUtils]: 52: Hoare triple {3839#false} havoc ~x~0;~x~0 := 0; {3839#false} is VALID [2018-11-14 18:44:56,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {3839#false} assume true; {3839#false} is VALID [2018-11-14 18:44:56,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {3839#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3839#false} is VALID [2018-11-14 18:44:56,332 INFO L256 TraceCheckUtils]: 55: Hoare triple {3839#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {3839#false} is VALID [2018-11-14 18:44:56,332 INFO L273 TraceCheckUtils]: 56: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2018-11-14 18:44:56,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {3839#false} assume ~cond == 0; {3839#false} is VALID [2018-11-14 18:44:56,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2018-11-14 18:44:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:44:56,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-14 18:44:56,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:56,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:44:56,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:56,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:44:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:44:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:44:56,438 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 15 states. [2018-11-14 18:44:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:56,901 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-14 18:44:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:44:56,902 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-14 18:44:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:44:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-14 18:44:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:44:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-14 18:44:56,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2018-11-14 18:44:57,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:57,090 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:44:57,090 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 18:44:57,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:44:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 18:44:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-14 18:44:57,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:57,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-14 18:44:57,118 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-14 18:44:57,118 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-14 18:44:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:57,120 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-11-14 18:44:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-14 18:44:57,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:57,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:57,121 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-14 18:44:57,121 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-14 18:44:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:57,123 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-11-14 18:44:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-14 18:44:57,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:57,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:57,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:57,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:44:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-14 18:44:57,126 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 59 [2018-11-14 18:44:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:57,127 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-14 18:44:57,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:44:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-14 18:44:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 18:44:57,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:57,128 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:57,128 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:57,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 826408330, now seen corresponding path program 12 times [2018-11-14 18:44:57,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:57,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:57,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {4362#true} call ULTIMATE.init(); {4362#true} is VALID [2018-11-14 18:44:57,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {4362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4362#true} is VALID [2018-11-14 18:44:57,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {4362#true} assume true; {4362#true} is VALID [2018-11-14 18:44:57,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4362#true} {4362#true} #57#return; {4362#true} is VALID [2018-11-14 18:44:57,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {4362#true} call #t~ret4 := main(); {4362#true} is VALID [2018-11-14 18:44:57,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {4362#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4364#(= main_~i~0 0)} is VALID [2018-11-14 18:44:57,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {4364#(= main_~i~0 0)} assume true; {4364#(= main_~i~0 0)} is VALID [2018-11-14 18:44:57,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {4364#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4364#(= main_~i~0 0)} is VALID [2018-11-14 18:44:57,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {4364#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4364#(= main_~i~0 0)} is VALID [2018-11-14 18:44:57,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {4364#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:57,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {4365#(<= main_~i~0 1)} assume true; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:57,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {4365#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:57,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {4365#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:57,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {4365#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:57,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {4366#(<= main_~i~0 2)} assume true; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:57,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {4366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:57,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {4366#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:57,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {4366#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:57,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {4367#(<= main_~i~0 3)} assume true; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:57,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {4367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:57,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {4367#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:57,776 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:57,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(<= main_~i~0 4)} assume true; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:57,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:57,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {4368#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:57,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {4368#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:57,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#(<= main_~i~0 5)} assume true; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:57,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:57,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:57,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:57,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#(<= main_~i~0 6)} assume true; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:57,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:57,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:57,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:57,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {4371#(<= main_~i~0 7)} assume true; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:57,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {4371#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:57,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {4371#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:57,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {4371#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:57,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {4372#(<= main_~i~0 8)} assume true; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:57,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {4372#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:57,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {4372#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:57,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {4372#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:57,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#(<= main_~i~0 9)} assume true; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:57,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:57,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:57,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:57,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {4374#(<= main_~i~0 10)} assume true; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:57,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {4374#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:57,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {4374#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:57,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {4374#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:57,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {4375#(<= main_~i~0 11)} assume true; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:57,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {4375#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:57,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {4375#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:57,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {4375#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {4376#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:57,811 INFO L273 TraceCheckUtils]: 54: Hoare triple {4376#(<= main_~i~0 12)} assume true; {4376#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:57,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {4376#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4363#false} is VALID [2018-11-14 18:44:57,812 INFO L273 TraceCheckUtils]: 56: Hoare triple {4363#false} havoc ~x~0;~x~0 := 0; {4363#false} is VALID [2018-11-14 18:44:57,812 INFO L273 TraceCheckUtils]: 57: Hoare triple {4363#false} assume true; {4363#false} is VALID [2018-11-14 18:44:57,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {4363#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4363#false} is VALID [2018-11-14 18:44:57,812 INFO L256 TraceCheckUtils]: 59: Hoare triple {4363#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4363#false} is VALID [2018-11-14 18:44:57,813 INFO L273 TraceCheckUtils]: 60: Hoare triple {4363#false} ~cond := #in~cond; {4363#false} is VALID [2018-11-14 18:44:57,813 INFO L273 TraceCheckUtils]: 61: Hoare triple {4363#false} assume ~cond == 0; {4363#false} is VALID [2018-11-14 18:44:57,813 INFO L273 TraceCheckUtils]: 62: Hoare triple {4363#false} assume !false; {4363#false} is VALID [2018-11-14 18:44:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:57,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:57,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:57,825 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:44:57,861 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:44:57,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:57,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:58,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {4362#true} call ULTIMATE.init(); {4362#true} is VALID [2018-11-14 18:44:58,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {4362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4362#true} is VALID [2018-11-14 18:44:58,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {4362#true} assume true; {4362#true} is VALID [2018-11-14 18:44:58,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4362#true} {4362#true} #57#return; {4362#true} is VALID [2018-11-14 18:44:58,049 INFO L256 TraceCheckUtils]: 4: Hoare triple {4362#true} call #t~ret4 := main(); {4362#true} is VALID [2018-11-14 18:44:58,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {4362#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4395#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:58,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {4395#(<= main_~i~0 0)} assume true; {4395#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:58,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {4395#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4395#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:58,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {4395#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4395#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:58,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {4395#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:58,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {4365#(<= main_~i~0 1)} assume true; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:58,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {4365#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:58,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {4365#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4365#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:58,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {4365#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:58,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {4366#(<= main_~i~0 2)} assume true; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:58,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {4366#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:58,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {4366#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4366#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:58,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {4366#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:58,056 INFO L273 TraceCheckUtils]: 18: Hoare triple {4367#(<= main_~i~0 3)} assume true; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:58,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {4367#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:58,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {4367#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4367#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:58,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:58,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(<= main_~i~0 4)} assume true; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:58,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:58,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {4368#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4368#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:58,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {4368#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:58,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {4369#(<= main_~i~0 5)} assume true; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:58,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {4369#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:58,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {4369#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4369#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:58,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {4369#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:58,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {4370#(<= main_~i~0 6)} assume true; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:58,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {4370#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:58,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {4370#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4370#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:58,065 INFO L273 TraceCheckUtils]: 33: Hoare triple {4370#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:58,065 INFO L273 TraceCheckUtils]: 34: Hoare triple {4371#(<= main_~i~0 7)} assume true; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:58,066 INFO L273 TraceCheckUtils]: 35: Hoare triple {4371#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:58,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {4371#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4371#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:58,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {4371#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:58,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {4372#(<= main_~i~0 8)} assume true; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:58,068 INFO L273 TraceCheckUtils]: 39: Hoare triple {4372#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:58,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {4372#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4372#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:58,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {4372#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:58,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {4373#(<= main_~i~0 9)} assume true; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:58,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {4373#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:58,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {4373#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4373#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:58,072 INFO L273 TraceCheckUtils]: 45: Hoare triple {4373#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:58,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {4374#(<= main_~i~0 10)} assume true; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:58,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {4374#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:58,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {4374#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4374#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:58,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {4374#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:58,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {4375#(<= main_~i~0 11)} assume true; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:58,075 INFO L273 TraceCheckUtils]: 51: Hoare triple {4375#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:58,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {4375#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4375#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:58,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {4375#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {4376#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:58,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {4376#(<= main_~i~0 12)} assume true; {4376#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:58,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {4376#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4363#false} is VALID [2018-11-14 18:44:58,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {4363#false} havoc ~x~0;~x~0 := 0; {4363#false} is VALID [2018-11-14 18:44:58,078 INFO L273 TraceCheckUtils]: 57: Hoare triple {4363#false} assume true; {4363#false} is VALID [2018-11-14 18:44:58,078 INFO L273 TraceCheckUtils]: 58: Hoare triple {4363#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4363#false} is VALID [2018-11-14 18:44:58,078 INFO L256 TraceCheckUtils]: 59: Hoare triple {4363#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4363#false} is VALID [2018-11-14 18:44:58,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {4363#false} ~cond := #in~cond; {4363#false} is VALID [2018-11-14 18:44:58,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {4363#false} assume ~cond == 0; {4363#false} is VALID [2018-11-14 18:44:58,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {4363#false} assume !false; {4363#false} is VALID [2018-11-14 18:44:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:58,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:58,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 18:44:58,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-14 18:44:58,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:58,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:44:58,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:58,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:44:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:44:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:44:58,165 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2018-11-14 18:44:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:58,725 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2018-11-14 18:44:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:44:58,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-14 18:44:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:44:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2018-11-14 18:44:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:44:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2018-11-14 18:44:58,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 102 transitions. [2018-11-14 18:44:59,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:59,277 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:44:59,277 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:44:59,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:44:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:44:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-14 18:44:59,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:59,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-14 18:44:59,296 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-14 18:44:59,297 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-14 18:44:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:59,299 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-14 18:44:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-14 18:44:59,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:59,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:59,299 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-14 18:44:59,299 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-14 18:44:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:59,301 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-14 18:44:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-14 18:44:59,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:59,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:59,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:59,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:44:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-14 18:44:59,304 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 63 [2018-11-14 18:44:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:59,304 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-14 18:44:59,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:44:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-14 18:44:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 18:44:59,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:59,305 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:59,305 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:59,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 901170400, now seen corresponding path program 13 times [2018-11-14 18:44:59,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:59,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:59,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:00,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {4917#true} call ULTIMATE.init(); {4917#true} is VALID [2018-11-14 18:45:00,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {4917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4917#true} is VALID [2018-11-14 18:45:00,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {4917#true} assume true; {4917#true} is VALID [2018-11-14 18:45:00,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4917#true} {4917#true} #57#return; {4917#true} is VALID [2018-11-14 18:45:00,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {4917#true} call #t~ret4 := main(); {4917#true} is VALID [2018-11-14 18:45:00,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {4917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4919#(= main_~i~0 0)} is VALID [2018-11-14 18:45:00,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {4919#(= main_~i~0 0)} assume true; {4919#(= main_~i~0 0)} is VALID [2018-11-14 18:45:00,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {4919#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4919#(= main_~i~0 0)} is VALID [2018-11-14 18:45:00,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {4919#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4919#(= main_~i~0 0)} is VALID [2018-11-14 18:45:00,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {4919#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {4920#(<= main_~i~0 1)} assume true; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {4920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {4920#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {4920#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {4921#(<= main_~i~0 2)} assume true; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {4921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {4921#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {4921#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {4922#(<= main_~i~0 3)} assume true; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {4922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {4922#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,126 INFO L273 TraceCheckUtils]: 21: Hoare triple {4922#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {4923#(<= main_~i~0 4)} assume true; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {4923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {4923#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {4924#(<= main_~i~0 5)} assume true; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {4924#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(<= main_~i~0 6)} assume true; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {4925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {4925#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {4925#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {4926#(<= main_~i~0 7)} assume true; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {4926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {4926#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {4926#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {4927#(<= main_~i~0 8)} assume true; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {4927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {4927#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {4927#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {4928#(<= main_~i~0 9)} assume true; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {4928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {4928#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {4928#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {4929#(<= main_~i~0 10)} assume true; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {4929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,142 INFO L273 TraceCheckUtils]: 48: Hoare triple {4929#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {4929#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {4930#(<= main_~i~0 11)} assume true; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,144 INFO L273 TraceCheckUtils]: 51: Hoare triple {4930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,144 INFO L273 TraceCheckUtils]: 52: Hoare triple {4930#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {4930#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {4931#(<= main_~i~0 12)} assume true; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {4931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {4931#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {4931#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {4932#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:00,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {4932#(<= main_~i~0 13)} assume true; {4932#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:00,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {4932#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4918#false} is VALID [2018-11-14 18:45:00,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {4918#false} havoc ~x~0;~x~0 := 0; {4918#false} is VALID [2018-11-14 18:45:00,149 INFO L273 TraceCheckUtils]: 61: Hoare triple {4918#false} assume true; {4918#false} is VALID [2018-11-14 18:45:00,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {4918#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4918#false} is VALID [2018-11-14 18:45:00,149 INFO L256 TraceCheckUtils]: 63: Hoare triple {4918#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4918#false} is VALID [2018-11-14 18:45:00,149 INFO L273 TraceCheckUtils]: 64: Hoare triple {4918#false} ~cond := #in~cond; {4918#false} is VALID [2018-11-14 18:45:00,149 INFO L273 TraceCheckUtils]: 65: Hoare triple {4918#false} assume ~cond == 0; {4918#false} is VALID [2018-11-14 18:45:00,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {4918#false} assume !false; {4918#false} is VALID [2018-11-14 18:45:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:00,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:00,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:00,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:00,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {4917#true} call ULTIMATE.init(); {4917#true} is VALID [2018-11-14 18:45:00,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {4917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4917#true} is VALID [2018-11-14 18:45:00,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {4917#true} assume true; {4917#true} is VALID [2018-11-14 18:45:00,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4917#true} {4917#true} #57#return; {4917#true} is VALID [2018-11-14 18:45:00,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {4917#true} call #t~ret4 := main(); {4917#true} is VALID [2018-11-14 18:45:00,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {4917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {4951#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:00,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {4951#(<= main_~i~0 0)} assume true; {4951#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:00,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {4951#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4951#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:00,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {4951#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4951#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:00,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {4951#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {4920#(<= main_~i~0 1)} assume true; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {4920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {4920#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4920#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:00,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {4920#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {4921#(<= main_~i~0 2)} assume true; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {4921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {4921#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4921#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:00,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {4921#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {4922#(<= main_~i~0 3)} assume true; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {4922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {4922#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4922#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:00,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {4922#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {4923#(<= main_~i~0 4)} assume true; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {4923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {4923#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4923#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:00,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,353 INFO L273 TraceCheckUtils]: 26: Hoare triple {4924#(<= main_~i~0 5)} assume true; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,354 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4924#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:00,354 INFO L273 TraceCheckUtils]: 29: Hoare triple {4924#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(<= main_~i~0 6)} assume true; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,355 INFO L273 TraceCheckUtils]: 31: Hoare triple {4925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {4925#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4925#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:00,357 INFO L273 TraceCheckUtils]: 33: Hoare triple {4925#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {4926#(<= main_~i~0 7)} assume true; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,358 INFO L273 TraceCheckUtils]: 35: Hoare triple {4926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,358 INFO L273 TraceCheckUtils]: 36: Hoare triple {4926#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4926#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:00,359 INFO L273 TraceCheckUtils]: 37: Hoare triple {4926#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {4927#(<= main_~i~0 8)} assume true; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {4927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {4927#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4927#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:00,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {4927#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {4928#(<= main_~i~0 9)} assume true; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {4928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {4928#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4928#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:00,364 INFO L273 TraceCheckUtils]: 45: Hoare triple {4928#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {4929#(<= main_~i~0 10)} assume true; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,365 INFO L273 TraceCheckUtils]: 47: Hoare triple {4929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,365 INFO L273 TraceCheckUtils]: 48: Hoare triple {4929#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4929#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:00,366 INFO L273 TraceCheckUtils]: 49: Hoare triple {4929#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {4930#(<= main_~i~0 11)} assume true; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,367 INFO L273 TraceCheckUtils]: 51: Hoare triple {4930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {4930#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4930#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:00,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {4930#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {4931#(<= main_~i~0 12)} assume true; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,370 INFO L273 TraceCheckUtils]: 55: Hoare triple {4931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,370 INFO L273 TraceCheckUtils]: 56: Hoare triple {4931#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {4931#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:00,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {4931#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {4932#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:00,371 INFO L273 TraceCheckUtils]: 58: Hoare triple {4932#(<= main_~i~0 13)} assume true; {4932#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:00,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {4932#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4918#false} is VALID [2018-11-14 18:45:00,372 INFO L273 TraceCheckUtils]: 60: Hoare triple {4918#false} havoc ~x~0;~x~0 := 0; {4918#false} is VALID [2018-11-14 18:45:00,373 INFO L273 TraceCheckUtils]: 61: Hoare triple {4918#false} assume true; {4918#false} is VALID [2018-11-14 18:45:00,373 INFO L273 TraceCheckUtils]: 62: Hoare triple {4918#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4918#false} is VALID [2018-11-14 18:45:00,373 INFO L256 TraceCheckUtils]: 63: Hoare triple {4918#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {4918#false} is VALID [2018-11-14 18:45:00,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {4918#false} ~cond := #in~cond; {4918#false} is VALID [2018-11-14 18:45:00,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {4918#false} assume ~cond == 0; {4918#false} is VALID [2018-11-14 18:45:00,374 INFO L273 TraceCheckUtils]: 66: Hoare triple {4918#false} assume !false; {4918#false} is VALID [2018-11-14 18:45:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:00,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:00,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:45:00,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 18:45:00,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:00,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:45:00,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:00,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:45:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:45:00,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:45:00,463 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 17 states. [2018-11-14 18:45:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:00,689 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-14 18:45:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:45:00,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 18:45:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:45:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2018-11-14 18:45:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:45:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2018-11-14 18:45:00,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 107 transitions. [2018-11-14 18:45:01,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:01,343 INFO L225 Difference]: With dead ends: 90 [2018-11-14 18:45:01,344 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:45:01,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:45:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:45:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-14 18:45:01,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:01,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-14 18:45:01,753 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-14 18:45:01,753 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-14 18:45:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:01,755 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-11-14 18:45:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-14 18:45:01,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:01,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:01,755 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-14 18:45:01,756 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-14 18:45:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:01,757 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-11-14 18:45:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-14 18:45:01,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:01,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:01,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:01,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 18:45:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-11-14 18:45:01,760 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 67 [2018-11-14 18:45:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:01,760 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-11-14 18:45:01,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:45:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-11-14 18:45:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 18:45:01,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:01,762 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:01,762 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:01,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -651431626, now seen corresponding path program 14 times [2018-11-14 18:45:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:01,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:02,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {5503#true} call ULTIMATE.init(); {5503#true} is VALID [2018-11-14 18:45:02,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {5503#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5503#true} is VALID [2018-11-14 18:45:02,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {5503#true} assume true; {5503#true} is VALID [2018-11-14 18:45:02,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5503#true} {5503#true} #57#return; {5503#true} is VALID [2018-11-14 18:45:02,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {5503#true} call #t~ret4 := main(); {5503#true} is VALID [2018-11-14 18:45:02,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {5503#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5505#(= main_~i~0 0)} is VALID [2018-11-14 18:45:02,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {5505#(= main_~i~0 0)} assume true; {5505#(= main_~i~0 0)} is VALID [2018-11-14 18:45:02,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {5505#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5505#(= main_~i~0 0)} is VALID [2018-11-14 18:45:02,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {5505#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5505#(= main_~i~0 0)} is VALID [2018-11-14 18:45:02,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {5505#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {5506#(<= main_~i~0 1)} assume true; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {5506#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {5506#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,476 INFO L273 TraceCheckUtils]: 13: Hoare triple {5506#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {5507#(<= main_~i~0 2)} assume true; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {5507#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {5507#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {5507#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {5508#(<= main_~i~0 3)} assume true; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {5508#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {5508#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {5508#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {5509#(<= main_~i~0 4)} assume true; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {5509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,482 INFO L273 TraceCheckUtils]: 24: Hoare triple {5509#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {5509#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {5510#(<= main_~i~0 5)} assume true; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,484 INFO L273 TraceCheckUtils]: 27: Hoare triple {5510#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {5510#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {5510#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(<= main_~i~0 6)} assume true; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {5511#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {5511#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {5512#(<= main_~i~0 7)} assume true; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {5512#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {5512#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,490 INFO L273 TraceCheckUtils]: 37: Hoare triple {5512#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,490 INFO L273 TraceCheckUtils]: 38: Hoare triple {5513#(<= main_~i~0 8)} assume true; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,491 INFO L273 TraceCheckUtils]: 39: Hoare triple {5513#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,491 INFO L273 TraceCheckUtils]: 40: Hoare triple {5513#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {5513#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {5514#(<= main_~i~0 9)} assume true; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {5514#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,493 INFO L273 TraceCheckUtils]: 44: Hoare triple {5514#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,494 INFO L273 TraceCheckUtils]: 45: Hoare triple {5514#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {5515#(<= main_~i~0 10)} assume true; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,496 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,497 INFO L273 TraceCheckUtils]: 50: Hoare triple {5516#(<= main_~i~0 11)} assume true; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,497 INFO L273 TraceCheckUtils]: 51: Hoare triple {5516#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,498 INFO L273 TraceCheckUtils]: 52: Hoare triple {5516#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,498 INFO L273 TraceCheckUtils]: 53: Hoare triple {5516#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,499 INFO L273 TraceCheckUtils]: 54: Hoare triple {5517#(<= main_~i~0 12)} assume true; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {5517#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,500 INFO L273 TraceCheckUtils]: 56: Hoare triple {5517#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,501 INFO L273 TraceCheckUtils]: 57: Hoare triple {5517#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,501 INFO L273 TraceCheckUtils]: 58: Hoare triple {5518#(<= main_~i~0 13)} assume true; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,502 INFO L273 TraceCheckUtils]: 59: Hoare triple {5518#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,502 INFO L273 TraceCheckUtils]: 60: Hoare triple {5518#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,503 INFO L273 TraceCheckUtils]: 61: Hoare triple {5518#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {5519#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:02,503 INFO L273 TraceCheckUtils]: 62: Hoare triple {5519#(<= main_~i~0 14)} assume true; {5519#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:02,504 INFO L273 TraceCheckUtils]: 63: Hoare triple {5519#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5504#false} is VALID [2018-11-14 18:45:02,504 INFO L273 TraceCheckUtils]: 64: Hoare triple {5504#false} havoc ~x~0;~x~0 := 0; {5504#false} is VALID [2018-11-14 18:45:02,504 INFO L273 TraceCheckUtils]: 65: Hoare triple {5504#false} assume true; {5504#false} is VALID [2018-11-14 18:45:02,505 INFO L273 TraceCheckUtils]: 66: Hoare triple {5504#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5504#false} is VALID [2018-11-14 18:45:02,505 INFO L256 TraceCheckUtils]: 67: Hoare triple {5504#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5504#false} is VALID [2018-11-14 18:45:02,505 INFO L273 TraceCheckUtils]: 68: Hoare triple {5504#false} ~cond := #in~cond; {5504#false} is VALID [2018-11-14 18:45:02,505 INFO L273 TraceCheckUtils]: 69: Hoare triple {5504#false} assume ~cond == 0; {5504#false} is VALID [2018-11-14 18:45:02,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {5504#false} assume !false; {5504#false} is VALID [2018-11-14 18:45:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:02,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:02,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:45:02,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:45:02,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:02,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:02,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {5503#true} call ULTIMATE.init(); {5503#true} is VALID [2018-11-14 18:45:02,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {5503#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5503#true} is VALID [2018-11-14 18:45:02,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {5503#true} assume true; {5503#true} is VALID [2018-11-14 18:45:02,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5503#true} {5503#true} #57#return; {5503#true} is VALID [2018-11-14 18:45:02,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {5503#true} call #t~ret4 := main(); {5503#true} is VALID [2018-11-14 18:45:02,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {5503#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {5538#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:02,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {5538#(<= main_~i~0 0)} assume true; {5538#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:02,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {5538#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5538#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:02,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {5538#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5538#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:02,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {5538#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {5506#(<= main_~i~0 1)} assume true; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {5506#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {5506#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5506#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:02,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {5506#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {5507#(<= main_~i~0 2)} assume true; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {5507#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {5507#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5507#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:02,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {5507#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {5508#(<= main_~i~0 3)} assume true; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {5508#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {5508#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5508#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:02,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {5508#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {5509#(<= main_~i~0 4)} assume true; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {5509#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {5509#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5509#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:02,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {5509#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {5510#(<= main_~i~0 5)} assume true; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,713 INFO L273 TraceCheckUtils]: 27: Hoare triple {5510#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {5510#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5510#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:02,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {5510#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(<= main_~i~0 6)} assume true; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {5511#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5511#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:02,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {5511#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {5512#(<= main_~i~0 7)} assume true; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,718 INFO L273 TraceCheckUtils]: 35: Hoare triple {5512#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {5512#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5512#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:02,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {5512#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,719 INFO L273 TraceCheckUtils]: 38: Hoare triple {5513#(<= main_~i~0 8)} assume true; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {5513#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {5513#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5513#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:02,724 INFO L273 TraceCheckUtils]: 41: Hoare triple {5513#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {5514#(<= main_~i~0 9)} assume true; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {5514#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,725 INFO L273 TraceCheckUtils]: 44: Hoare triple {5514#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5514#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:02,725 INFO L273 TraceCheckUtils]: 45: Hoare triple {5514#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {5515#(<= main_~i~0 10)} assume true; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {5515#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,726 INFO L273 TraceCheckUtils]: 48: Hoare triple {5515#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5515#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:02,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {5515#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {5516#(<= main_~i~0 11)} assume true; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {5516#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {5516#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5516#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:02,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {5516#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {5517#(<= main_~i~0 12)} assume true; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,730 INFO L273 TraceCheckUtils]: 55: Hoare triple {5517#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {5517#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5517#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:02,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {5517#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {5518#(<= main_~i~0 13)} assume true; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {5518#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {5518#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {5518#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:02,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {5518#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {5519#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:02,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {5519#(<= main_~i~0 14)} assume true; {5519#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:02,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {5519#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5504#false} is VALID [2018-11-14 18:45:02,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {5504#false} havoc ~x~0;~x~0 := 0; {5504#false} is VALID [2018-11-14 18:45:02,735 INFO L273 TraceCheckUtils]: 65: Hoare triple {5504#false} assume true; {5504#false} is VALID [2018-11-14 18:45:02,735 INFO L273 TraceCheckUtils]: 66: Hoare triple {5504#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5504#false} is VALID [2018-11-14 18:45:02,735 INFO L256 TraceCheckUtils]: 67: Hoare triple {5504#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {5504#false} is VALID [2018-11-14 18:45:02,736 INFO L273 TraceCheckUtils]: 68: Hoare triple {5504#false} ~cond := #in~cond; {5504#false} is VALID [2018-11-14 18:45:02,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {5504#false} assume ~cond == 0; {5504#false} is VALID [2018-11-14 18:45:02,736 INFO L273 TraceCheckUtils]: 70: Hoare triple {5504#false} assume !false; {5504#false} is VALID [2018-11-14 18:45:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:45:02,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-14 18:45:02,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:02,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:45:02,831 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-14 18:45:02,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:45:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:45:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:45:02,833 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 18 states. [2018-11-14 18:45:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:03,194 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-14 18:45:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:45:03,194 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-14 18:45:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:45:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-14 18:45:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:45:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-14 18:45:03,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 112 transitions. [2018-11-14 18:45:03,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:03,321 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:45:03,321 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:45:03,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:45:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:45:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-14 18:45:03,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:03,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-14 18:45:03,779 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-14 18:45:03,780 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-14 18:45:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:03,781 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-14 18:45:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-14 18:45:03,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:03,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:03,782 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-14 18:45:03,782 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-14 18:45:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:03,784 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-11-14 18:45:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-14 18:45:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:03,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:03,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:45:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-11-14 18:45:03,787 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 71 [2018-11-14 18:45:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:03,787 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2018-11-14 18:45:03,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:45:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-14 18:45:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 18:45:03,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:03,788 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:03,789 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:03,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:03,789 INFO L82 PathProgramCache]: Analyzing trace with hash 719782540, now seen corresponding path program 15 times [2018-11-14 18:45:03,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:03,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:03,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:03,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:04,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {6120#true} call ULTIMATE.init(); {6120#true} is VALID [2018-11-14 18:45:04,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {6120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6120#true} is VALID [2018-11-14 18:45:04,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {6120#true} assume true; {6120#true} is VALID [2018-11-14 18:45:04,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6120#true} {6120#true} #57#return; {6120#true} is VALID [2018-11-14 18:45:04,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {6120#true} call #t~ret4 := main(); {6120#true} is VALID [2018-11-14 18:45:04,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {6120#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6122#(= main_~i~0 0)} is VALID [2018-11-14 18:45:04,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {6122#(= main_~i~0 0)} assume true; {6122#(= main_~i~0 0)} is VALID [2018-11-14 18:45:04,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {6122#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6122#(= main_~i~0 0)} is VALID [2018-11-14 18:45:04,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {6122#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6122#(= main_~i~0 0)} is VALID [2018-11-14 18:45:04,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {6122#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:04,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {6123#(<= main_~i~0 1)} assume true; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:04,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {6123#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:04,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {6123#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:04,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {6123#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:04,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {6124#(<= main_~i~0 2)} assume true; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:04,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {6124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:04,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {6124#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:04,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {6124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:04,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {6125#(<= main_~i~0 3)} assume true; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:04,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {6125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:04,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {6125#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:04,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {6125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:04,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {6126#(<= main_~i~0 4)} assume true; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:04,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {6126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:04,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {6126#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:04,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {6126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:04,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {6127#(<= main_~i~0 5)} assume true; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:04,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {6127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:04,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {6127#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:04,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {6127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:04,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {6128#(<= main_~i~0 6)} assume true; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:04,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {6128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:04,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {6128#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:04,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {6128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:04,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {6129#(<= main_~i~0 7)} assume true; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:04,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {6129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:04,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {6129#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:04,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {6129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:04,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {6130#(<= main_~i~0 8)} assume true; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:04,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {6130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:04,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {6130#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:04,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {6130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:04,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {6131#(<= main_~i~0 9)} assume true; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:04,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:04,656 INFO L273 TraceCheckUtils]: 44: Hoare triple {6131#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:04,657 INFO L273 TraceCheckUtils]: 45: Hoare triple {6131#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:04,657 INFO L273 TraceCheckUtils]: 46: Hoare triple {6132#(<= main_~i~0 10)} assume true; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:04,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {6132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:04,658 INFO L273 TraceCheckUtils]: 48: Hoare triple {6132#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:04,659 INFO L273 TraceCheckUtils]: 49: Hoare triple {6132#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:04,659 INFO L273 TraceCheckUtils]: 50: Hoare triple {6133#(<= main_~i~0 11)} assume true; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:04,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {6133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:04,684 INFO L273 TraceCheckUtils]: 52: Hoare triple {6133#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:04,702 INFO L273 TraceCheckUtils]: 53: Hoare triple {6133#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:04,702 INFO L273 TraceCheckUtils]: 54: Hoare triple {6134#(<= main_~i~0 12)} assume true; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:04,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {6134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:04,703 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:04,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {6134#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:04,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {6135#(<= main_~i~0 13)} assume true; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:04,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {6135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:04,705 INFO L273 TraceCheckUtils]: 60: Hoare triple {6135#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:04,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {6135#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:04,706 INFO L273 TraceCheckUtils]: 62: Hoare triple {6136#(<= main_~i~0 14)} assume true; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:04,706 INFO L273 TraceCheckUtils]: 63: Hoare triple {6136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:04,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {6136#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:04,707 INFO L273 TraceCheckUtils]: 65: Hoare triple {6136#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {6137#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:04,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {6137#(<= main_~i~0 15)} assume true; {6137#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:04,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {6137#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6121#false} is VALID [2018-11-14 18:45:04,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {6121#false} havoc ~x~0;~x~0 := 0; {6121#false} is VALID [2018-11-14 18:45:04,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {6121#false} assume true; {6121#false} is VALID [2018-11-14 18:45:04,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {6121#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6121#false} is VALID [2018-11-14 18:45:04,709 INFO L256 TraceCheckUtils]: 71: Hoare triple {6121#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6121#false} is VALID [2018-11-14 18:45:04,709 INFO L273 TraceCheckUtils]: 72: Hoare triple {6121#false} ~cond := #in~cond; {6121#false} is VALID [2018-11-14 18:45:04,710 INFO L273 TraceCheckUtils]: 73: Hoare triple {6121#false} assume ~cond == 0; {6121#false} is VALID [2018-11-14 18:45:04,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {6121#false} assume !false; {6121#false} is VALID [2018-11-14 18:45:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:04,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:45:04,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 18:45:04,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:04,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:04,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {6120#true} call ULTIMATE.init(); {6120#true} is VALID [2018-11-14 18:45:04,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {6120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6120#true} is VALID [2018-11-14 18:45:04,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {6120#true} assume true; {6120#true} is VALID [2018-11-14 18:45:04,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6120#true} {6120#true} #57#return; {6120#true} is VALID [2018-11-14 18:45:04,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {6120#true} call #t~ret4 := main(); {6120#true} is VALID [2018-11-14 18:45:04,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {6120#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6156#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:04,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {6156#(<= main_~i~0 0)} assume true; {6156#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:04,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {6156#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6156#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:05,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {6156#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6156#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:05,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {6156#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:05,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {6123#(<= main_~i~0 1)} assume true; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:05,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {6123#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:05,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {6123#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6123#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:05,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {6123#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:05,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {6124#(<= main_~i~0 2)} assume true; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:05,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {6124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:05,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {6124#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6124#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:05,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {6124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:05,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {6125#(<= main_~i~0 3)} assume true; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:05,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {6125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:05,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {6125#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6125#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:05,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {6125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:05,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {6126#(<= main_~i~0 4)} assume true; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:05,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {6126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:05,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {6126#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6126#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:05,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {6126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:05,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {6127#(<= main_~i~0 5)} assume true; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:05,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {6127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:05,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {6127#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6127#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:05,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {6127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:05,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {6128#(<= main_~i~0 6)} assume true; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:05,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {6128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:05,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {6128#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6128#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:05,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {6128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:05,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {6129#(<= main_~i~0 7)} assume true; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:05,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {6129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:05,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {6129#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6129#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:05,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {6129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:05,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {6130#(<= main_~i~0 8)} assume true; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:05,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {6130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:05,023 INFO L273 TraceCheckUtils]: 40: Hoare triple {6130#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6130#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:05,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {6130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:05,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {6131#(<= main_~i~0 9)} assume true; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:05,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:05,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {6131#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6131#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:05,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {6131#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:05,028 INFO L273 TraceCheckUtils]: 46: Hoare triple {6132#(<= main_~i~0 10)} assume true; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:05,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {6132#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:05,028 INFO L273 TraceCheckUtils]: 48: Hoare triple {6132#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6132#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:05,029 INFO L273 TraceCheckUtils]: 49: Hoare triple {6132#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:05,029 INFO L273 TraceCheckUtils]: 50: Hoare triple {6133#(<= main_~i~0 11)} assume true; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:05,029 INFO L273 TraceCheckUtils]: 51: Hoare triple {6133#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:05,030 INFO L273 TraceCheckUtils]: 52: Hoare triple {6133#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6133#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:05,031 INFO L273 TraceCheckUtils]: 53: Hoare triple {6133#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:05,031 INFO L273 TraceCheckUtils]: 54: Hoare triple {6134#(<= main_~i~0 12)} assume true; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:05,032 INFO L273 TraceCheckUtils]: 55: Hoare triple {6134#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:05,032 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6134#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:05,033 INFO L273 TraceCheckUtils]: 57: Hoare triple {6134#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:05,034 INFO L273 TraceCheckUtils]: 58: Hoare triple {6135#(<= main_~i~0 13)} assume true; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:05,034 INFO L273 TraceCheckUtils]: 59: Hoare triple {6135#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:05,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {6135#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6135#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:05,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {6135#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:05,036 INFO L273 TraceCheckUtils]: 62: Hoare triple {6136#(<= main_~i~0 14)} assume true; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:05,036 INFO L273 TraceCheckUtils]: 63: Hoare triple {6136#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:05,037 INFO L273 TraceCheckUtils]: 64: Hoare triple {6136#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6136#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:05,038 INFO L273 TraceCheckUtils]: 65: Hoare triple {6136#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {6137#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:05,038 INFO L273 TraceCheckUtils]: 66: Hoare triple {6137#(<= main_~i~0 15)} assume true; {6137#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:05,039 INFO L273 TraceCheckUtils]: 67: Hoare triple {6137#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6121#false} is VALID [2018-11-14 18:45:05,039 INFO L273 TraceCheckUtils]: 68: Hoare triple {6121#false} havoc ~x~0;~x~0 := 0; {6121#false} is VALID [2018-11-14 18:45:05,039 INFO L273 TraceCheckUtils]: 69: Hoare triple {6121#false} assume true; {6121#false} is VALID [2018-11-14 18:45:05,039 INFO L273 TraceCheckUtils]: 70: Hoare triple {6121#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6121#false} is VALID [2018-11-14 18:45:05,040 INFO L256 TraceCheckUtils]: 71: Hoare triple {6121#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6121#false} is VALID [2018-11-14 18:45:05,040 INFO L273 TraceCheckUtils]: 72: Hoare triple {6121#false} ~cond := #in~cond; {6121#false} is VALID [2018-11-14 18:45:05,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {6121#false} assume ~cond == 0; {6121#false} is VALID [2018-11-14 18:45:05,040 INFO L273 TraceCheckUtils]: 74: Hoare triple {6121#false} assume !false; {6121#false} is VALID [2018-11-14 18:45:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:05,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:05,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 18:45:05,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-14 18:45:05,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:05,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:45:05,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:05,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:45:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:45:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:45:05,141 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 19 states. [2018-11-14 18:45:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:05,521 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2018-11-14 18:45:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:45:05,522 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-14 18:45:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:45:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-14 18:45:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:45:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-14 18:45:05,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2018-11-14 18:45:05,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:05,697 INFO L225 Difference]: With dead ends: 98 [2018-11-14 18:45:05,697 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:45:05,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:45:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:45:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-14 18:45:05,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:05,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-14 18:45:05,720 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-14 18:45:05,720 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-14 18:45:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:05,722 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-14 18:45:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-14 18:45:05,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:05,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:05,723 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-14 18:45:05,723 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-14 18:45:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:05,725 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-14 18:45:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-14 18:45:05,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:05,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:05,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:05,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:45:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2018-11-14 18:45:05,728 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 75 [2018-11-14 18:45:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:05,728 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2018-11-14 18:45:05,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:45:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-14 18:45:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 18:45:05,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:05,730 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:05,730 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:05,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:05,730 INFO L82 PathProgramCache]: Analyzing trace with hash 460159202, now seen corresponding path program 16 times [2018-11-14 18:45:05,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:05,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:05,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:05,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:06,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2018-11-14 18:45:06,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {6768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6768#true} is VALID [2018-11-14 18:45:06,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2018-11-14 18:45:06,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #57#return; {6768#true} is VALID [2018-11-14 18:45:06,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret4 := main(); {6768#true} is VALID [2018-11-14 18:45:06,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {6768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6770#(= main_~i~0 0)} is VALID [2018-11-14 18:45:06,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {6770#(= main_~i~0 0)} assume true; {6770#(= main_~i~0 0)} is VALID [2018-11-14 18:45:06,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {6770#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6770#(= main_~i~0 0)} is VALID [2018-11-14 18:45:06,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {6770#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6770#(= main_~i~0 0)} is VALID [2018-11-14 18:45:06,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {6770#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {6771#(<= main_~i~0 1)} assume true; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {6771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {6771#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {6771#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {6772#(<= main_~i~0 2)} assume true; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {6772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {6772#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {6773#(<= main_~i~0 3)} assume true; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {6773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {6773#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {6773#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {6774#(<= main_~i~0 4)} assume true; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {6774#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,146 INFO L273 TraceCheckUtils]: 26: Hoare triple {6775#(<= main_~i~0 5)} assume true; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {6775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {6775#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {6775#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {6776#(<= main_~i~0 6)} assume true; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {6776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {6776#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {6776#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {6777#(<= main_~i~0 7)} assume true; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {6777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {6778#(<= main_~i~0 8)} assume true; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {6778#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {6778#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {6779#(<= main_~i~0 9)} assume true; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {6779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {6779#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {6779#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#(<= main_~i~0 10)} assume true; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {6780#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {6780#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,162 INFO L273 TraceCheckUtils]: 50: Hoare triple {6781#(<= main_~i~0 11)} assume true; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {6781#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,163 INFO L273 TraceCheckUtils]: 52: Hoare triple {6781#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {6781#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {6782#(<= main_~i~0 12)} assume true; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,165 INFO L273 TraceCheckUtils]: 55: Hoare triple {6782#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,165 INFO L273 TraceCheckUtils]: 56: Hoare triple {6782#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,166 INFO L273 TraceCheckUtils]: 57: Hoare triple {6782#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,167 INFO L273 TraceCheckUtils]: 58: Hoare triple {6783#(<= main_~i~0 13)} assume true; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,167 INFO L273 TraceCheckUtils]: 59: Hoare triple {6783#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,168 INFO L273 TraceCheckUtils]: 60: Hoare triple {6783#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,169 INFO L273 TraceCheckUtils]: 61: Hoare triple {6783#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,169 INFO L273 TraceCheckUtils]: 62: Hoare triple {6784#(<= main_~i~0 14)} assume true; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,170 INFO L273 TraceCheckUtils]: 63: Hoare triple {6784#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,170 INFO L273 TraceCheckUtils]: 64: Hoare triple {6784#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,171 INFO L273 TraceCheckUtils]: 65: Hoare triple {6784#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {6785#(<= main_~i~0 15)} assume true; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,172 INFO L273 TraceCheckUtils]: 67: Hoare triple {6785#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,173 INFO L273 TraceCheckUtils]: 68: Hoare triple {6785#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,174 INFO L273 TraceCheckUtils]: 69: Hoare triple {6785#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {6786#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:06,174 INFO L273 TraceCheckUtils]: 70: Hoare triple {6786#(<= main_~i~0 16)} assume true; {6786#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:06,175 INFO L273 TraceCheckUtils]: 71: Hoare triple {6786#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6769#false} is VALID [2018-11-14 18:45:06,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {6769#false} havoc ~x~0;~x~0 := 0; {6769#false} is VALID [2018-11-14 18:45:06,176 INFO L273 TraceCheckUtils]: 73: Hoare triple {6769#false} assume true; {6769#false} is VALID [2018-11-14 18:45:06,176 INFO L273 TraceCheckUtils]: 74: Hoare triple {6769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6769#false} is VALID [2018-11-14 18:45:06,176 INFO L256 TraceCheckUtils]: 75: Hoare triple {6769#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6769#false} is VALID [2018-11-14 18:45:06,177 INFO L273 TraceCheckUtils]: 76: Hoare triple {6769#false} ~cond := #in~cond; {6769#false} is VALID [2018-11-14 18:45:06,177 INFO L273 TraceCheckUtils]: 77: Hoare triple {6769#false} assume ~cond == 0; {6769#false} is VALID [2018-11-14 18:45:06,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2018-11-14 18:45:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:06,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:06,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:45:06,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:45:06,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:06,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:06,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2018-11-14 18:45:06,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {6768#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6768#true} is VALID [2018-11-14 18:45:06,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2018-11-14 18:45:06,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #57#return; {6768#true} is VALID [2018-11-14 18:45:06,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret4 := main(); {6768#true} is VALID [2018-11-14 18:45:06,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {6768#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {6805#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:06,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {6805#(<= main_~i~0 0)} assume true; {6805#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:06,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {6805#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6805#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:06,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {6805#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6805#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:06,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {6805#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {6771#(<= main_~i~0 1)} assume true; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {6771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {6771#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6771#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:06,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {6771#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {6772#(<= main_~i~0 2)} assume true; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {6772#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {6772#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6772#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:06,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {6773#(<= main_~i~0 3)} assume true; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {6773#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {6773#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6773#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:06,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {6773#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {6774#(<= main_~i~0 4)} assume true; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {6774#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {6774#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6774#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:06,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {6774#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {6775#(<= main_~i~0 5)} assume true; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {6775#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {6775#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6775#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:06,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {6775#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {6776#(<= main_~i~0 6)} assume true; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {6776#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {6776#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6776#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:06,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {6776#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {6777#(<= main_~i~0 7)} assume true; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {6777#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {6777#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6777#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:06,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {6777#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,535 INFO L273 TraceCheckUtils]: 38: Hoare triple {6778#(<= main_~i~0 8)} assume true; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {6778#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {6778#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6778#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:06,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {6778#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {6779#(<= main_~i~0 9)} assume true; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {6779#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {6779#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6779#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:06,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {6779#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,577 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#(<= main_~i~0 10)} assume true; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,586 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {6780#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6780#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:06,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {6780#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {6781#(<= main_~i~0 11)} assume true; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {6781#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {6781#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6781#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:06,651 INFO L273 TraceCheckUtils]: 53: Hoare triple {6781#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,666 INFO L273 TraceCheckUtils]: 54: Hoare triple {6782#(<= main_~i~0 12)} assume true; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {6782#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {6782#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6782#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:06,699 INFO L273 TraceCheckUtils]: 57: Hoare triple {6782#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,712 INFO L273 TraceCheckUtils]: 58: Hoare triple {6783#(<= main_~i~0 13)} assume true; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,725 INFO L273 TraceCheckUtils]: 59: Hoare triple {6783#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,737 INFO L273 TraceCheckUtils]: 60: Hoare triple {6783#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6783#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:06,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {6783#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,762 INFO L273 TraceCheckUtils]: 62: Hoare triple {6784#(<= main_~i~0 14)} assume true; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {6784#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {6784#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6784#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:06,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {6784#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,820 INFO L273 TraceCheckUtils]: 66: Hoare triple {6785#(<= main_~i~0 15)} assume true; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {6785#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,854 INFO L273 TraceCheckUtils]: 68: Hoare triple {6785#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {6785#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:06,867 INFO L273 TraceCheckUtils]: 69: Hoare triple {6785#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {6786#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:06,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {6786#(<= main_~i~0 16)} assume true; {6786#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:06,890 INFO L273 TraceCheckUtils]: 71: Hoare triple {6786#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6769#false} is VALID [2018-11-14 18:45:06,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {6769#false} havoc ~x~0;~x~0 := 0; {6769#false} is VALID [2018-11-14 18:45:06,890 INFO L273 TraceCheckUtils]: 73: Hoare triple {6769#false} assume true; {6769#false} is VALID [2018-11-14 18:45:06,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {6769#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6769#false} is VALID [2018-11-14 18:45:06,891 INFO L256 TraceCheckUtils]: 75: Hoare triple {6769#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {6769#false} is VALID [2018-11-14 18:45:06,891 INFO L273 TraceCheckUtils]: 76: Hoare triple {6769#false} ~cond := #in~cond; {6769#false} is VALID [2018-11-14 18:45:06,891 INFO L273 TraceCheckUtils]: 77: Hoare triple {6769#false} assume ~cond == 0; {6769#false} is VALID [2018-11-14 18:45:06,891 INFO L273 TraceCheckUtils]: 78: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2018-11-14 18:45:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:06,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:06,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:45:06,937 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-14 18:45:06,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:06,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:45:07,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:07,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:45:07,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:45:07,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:45:07,232 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 20 states. [2018-11-14 18:45:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:07,544 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2018-11-14 18:45:07,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:45:07,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-14 18:45:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:45:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2018-11-14 18:45:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:45:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2018-11-14 18:45:07,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 122 transitions. [2018-11-14 18:45:07,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:07,711 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:45:07,712 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:45:07,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:45:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:45:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-14 18:45:07,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:07,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-14 18:45:07,732 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-14 18:45:07,732 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-14 18:45:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:07,734 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-14 18:45:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-14 18:45:07,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:07,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:07,734 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-14 18:45:07,735 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-14 18:45:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:07,736 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-14 18:45:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-14 18:45:07,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:07,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:07,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:07,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 18:45:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-11-14 18:45:07,739 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 79 [2018-11-14 18:45:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:07,739 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-11-14 18:45:07,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:45:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-11-14 18:45:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-14 18:45:07,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:07,741 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:07,741 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:07,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash -595274696, now seen corresponding path program 17 times [2018-11-14 18:45:07,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:07,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:08,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-14 18:45:08,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-14 18:45:08,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:45:08,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #57#return; {7447#true} is VALID [2018-11-14 18:45:08,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-14 18:45:08,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:45:08,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {7449#(= main_~i~0 0)} assume true; {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:45:08,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {7449#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:45:08,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {7449#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7449#(= main_~i~0 0)} is VALID [2018-11-14 18:45:08,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {7449#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {7450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {7450#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {7450#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {7451#(<= main_~i~0 2)} assume true; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {7451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {7451#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {7451#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {7452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {7452#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {7452#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {7453#(<= main_~i~0 4)} assume true; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {7453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {7453#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {7453#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {7454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {7454#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {7454#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {7455#(<= main_~i~0 6)} assume true; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {7455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {7455#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,131 INFO L273 TraceCheckUtils]: 33: Hoare triple {7455#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {7456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {7456#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {7456#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {7457#(<= main_~i~0 8)} assume true; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {7457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,135 INFO L273 TraceCheckUtils]: 40: Hoare triple {7457#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,136 INFO L273 TraceCheckUtils]: 41: Hoare triple {7457#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,137 INFO L273 TraceCheckUtils]: 43: Hoare triple {7458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {7458#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {7458#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {7459#(<= main_~i~0 10)} assume true; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {7459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {7459#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {7459#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {7460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,142 INFO L273 TraceCheckUtils]: 52: Hoare triple {7460#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {7460#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {7461#(<= main_~i~0 12)} assume true; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {7461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {7461#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {7461#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,145 INFO L273 TraceCheckUtils]: 58: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {7462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {7462#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,147 INFO L273 TraceCheckUtils]: 61: Hoare triple {7462#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,148 INFO L273 TraceCheckUtils]: 62: Hoare triple {7463#(<= main_~i~0 14)} assume true; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,148 INFO L273 TraceCheckUtils]: 63: Hoare triple {7463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,149 INFO L273 TraceCheckUtils]: 64: Hoare triple {7463#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,149 INFO L273 TraceCheckUtils]: 65: Hoare triple {7463#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {7464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,151 INFO L273 TraceCheckUtils]: 68: Hoare triple {7464#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {7464#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,152 INFO L273 TraceCheckUtils]: 70: Hoare triple {7465#(<= main_~i~0 16)} assume true; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,152 INFO L273 TraceCheckUtils]: 71: Hoare triple {7465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,153 INFO L273 TraceCheckUtils]: 72: Hoare triple {7465#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,154 INFO L273 TraceCheckUtils]: 73: Hoare triple {7465#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:08,154 INFO L273 TraceCheckUtils]: 74: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:08,155 INFO L273 TraceCheckUtils]: 75: Hoare triple {7466#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-14 18:45:08,155 INFO L273 TraceCheckUtils]: 76: Hoare triple {7448#false} havoc ~x~0;~x~0 := 0; {7448#false} is VALID [2018-11-14 18:45:08,155 INFO L273 TraceCheckUtils]: 77: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:45:08,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {7448#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7448#false} is VALID [2018-11-14 18:45:08,156 INFO L256 TraceCheckUtils]: 79: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7448#false} is VALID [2018-11-14 18:45:08,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-14 18:45:08,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {7448#false} assume ~cond == 0; {7448#false} is VALID [2018-11-14 18:45:08,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-14 18:45:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:08,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:08,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:08,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:45:08,277 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:45:08,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:08,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:08,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {7447#true} call ULTIMATE.init(); {7447#true} is VALID [2018-11-14 18:45:08,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {7447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7447#true} is VALID [2018-11-14 18:45:08,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {7447#true} assume true; {7447#true} is VALID [2018-11-14 18:45:08,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7447#true} {7447#true} #57#return; {7447#true} is VALID [2018-11-14 18:45:08,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {7447#true} call #t~ret4 := main(); {7447#true} is VALID [2018-11-14 18:45:08,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {7447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {7485#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:08,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {7485#(<= main_~i~0 0)} assume true; {7485#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:08,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {7485#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7485#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:08,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {7485#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7485#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:08,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {7485#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {7450#(<= main_~i~0 1)} assume true; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {7450#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {7450#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7450#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:08,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {7450#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {7451#(<= main_~i~0 2)} assume true; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {7451#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {7451#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7451#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:08,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {7451#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {7452#(<= main_~i~0 3)} assume true; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {7452#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {7452#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7452#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:08,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {7452#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {7453#(<= main_~i~0 4)} assume true; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {7453#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {7453#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7453#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:08,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {7453#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {7454#(<= main_~i~0 5)} assume true; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {7454#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {7454#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7454#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:08,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {7454#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {7455#(<= main_~i~0 6)} assume true; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,617 INFO L273 TraceCheckUtils]: 31: Hoare triple {7455#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {7455#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7455#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:08,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {7455#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {7456#(<= main_~i~0 7)} assume true; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {7456#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {7456#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7456#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:08,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {7456#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {7457#(<= main_~i~0 8)} assume true; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {7457#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {7457#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7457#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:08,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {7457#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {7458#(<= main_~i~0 9)} assume true; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {7458#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {7458#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7458#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:08,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {7458#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {7459#(<= main_~i~0 10)} assume true; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {7459#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {7459#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7459#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:08,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {7459#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {7460#(<= main_~i~0 11)} assume true; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {7460#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {7460#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7460#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:08,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {7460#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {7461#(<= main_~i~0 12)} assume true; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {7461#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {7461#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7461#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:08,630 INFO L273 TraceCheckUtils]: 57: Hoare triple {7461#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,631 INFO L273 TraceCheckUtils]: 58: Hoare triple {7462#(<= main_~i~0 13)} assume true; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,631 INFO L273 TraceCheckUtils]: 59: Hoare triple {7462#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {7462#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7462#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:08,633 INFO L273 TraceCheckUtils]: 61: Hoare triple {7462#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,633 INFO L273 TraceCheckUtils]: 62: Hoare triple {7463#(<= main_~i~0 14)} assume true; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,634 INFO L273 TraceCheckUtils]: 63: Hoare triple {7463#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,634 INFO L273 TraceCheckUtils]: 64: Hoare triple {7463#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7463#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:08,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {7463#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,635 INFO L273 TraceCheckUtils]: 66: Hoare triple {7464#(<= main_~i~0 15)} assume true; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,636 INFO L273 TraceCheckUtils]: 67: Hoare triple {7464#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {7464#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7464#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:08,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {7464#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {7465#(<= main_~i~0 16)} assume true; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,638 INFO L273 TraceCheckUtils]: 71: Hoare triple {7465#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {7465#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {7465#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:08,639 INFO L273 TraceCheckUtils]: 73: Hoare triple {7465#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:08,639 INFO L273 TraceCheckUtils]: 74: Hoare triple {7466#(<= main_~i~0 17)} assume true; {7466#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:08,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {7466#(<= main_~i~0 17)} assume !(~i~0 < 100000); {7448#false} is VALID [2018-11-14 18:45:08,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {7448#false} havoc ~x~0;~x~0 := 0; {7448#false} is VALID [2018-11-14 18:45:08,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {7448#false} assume true; {7448#false} is VALID [2018-11-14 18:45:08,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {7448#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7448#false} is VALID [2018-11-14 18:45:08,641 INFO L256 TraceCheckUtils]: 79: Hoare triple {7448#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {7448#false} is VALID [2018-11-14 18:45:08,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {7448#false} ~cond := #in~cond; {7448#false} is VALID [2018-11-14 18:45:08,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {7448#false} assume ~cond == 0; {7448#false} is VALID [2018-11-14 18:45:08,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {7448#false} assume !false; {7448#false} is VALID [2018-11-14 18:45:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:08,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:08,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:45:08,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-14 18:45:08,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:08,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:45:08,744 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-14 18:45:08,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:45:08,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:45:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:45:08,745 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 21 states. [2018-11-14 18:45:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:09,172 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2018-11-14 18:45:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:45:09,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-14 18:45:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:45:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 127 transitions. [2018-11-14 18:45:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:45:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 127 transitions. [2018-11-14 18:45:09,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 127 transitions. [2018-11-14 18:45:09,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:09,292 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:45:09,292 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 18:45:09,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:45:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 18:45:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-14 18:45:09,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:09,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-14 18:45:09,310 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-14 18:45:09,310 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-14 18:45:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:09,312 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-14 18:45:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-14 18:45:09,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:09,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:09,312 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-14 18:45:09,313 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-14 18:45:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:09,314 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-14 18:45:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-14 18:45:09,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:09,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:09,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:09,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 18:45:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2018-11-14 18:45:09,317 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 83 [2018-11-14 18:45:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:09,317 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2018-11-14 18:45:09,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:45:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2018-11-14 18:45:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 18:45:09,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:09,318 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:09,319 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:09,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1093833870, now seen corresponding path program 18 times [2018-11-14 18:45:09,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:09,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:09,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {8157#true} call ULTIMATE.init(); {8157#true} is VALID [2018-11-14 18:45:09,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {8157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8157#true} is VALID [2018-11-14 18:45:09,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {8157#true} assume true; {8157#true} is VALID [2018-11-14 18:45:09,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8157#true} {8157#true} #57#return; {8157#true} is VALID [2018-11-14 18:45:09,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {8157#true} call #t~ret4 := main(); {8157#true} is VALID [2018-11-14 18:45:09,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {8157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8159#(= main_~i~0 0)} is VALID [2018-11-14 18:45:09,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {8159#(= main_~i~0 0)} assume true; {8159#(= main_~i~0 0)} is VALID [2018-11-14 18:45:09,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {8159#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8159#(= main_~i~0 0)} is VALID [2018-11-14 18:45:09,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {8159#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8159#(= main_~i~0 0)} is VALID [2018-11-14 18:45:09,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {8159#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:09,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {8160#(<= main_~i~0 1)} assume true; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:09,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {8160#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:09,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {8160#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:09,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {8160#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:09,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {8161#(<= main_~i~0 2)} assume true; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:09,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {8161#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:09,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {8161#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:09,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {8161#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:09,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {8162#(<= main_~i~0 3)} assume true; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:09,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {8162#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:09,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {8162#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:09,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {8162#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:09,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {8163#(<= main_~i~0 4)} assume true; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:09,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {8163#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:09,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {8163#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:09,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {8163#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:09,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {8164#(<= main_~i~0 5)} assume true; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:09,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {8164#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:09,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {8164#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:09,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {8164#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:09,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {8165#(<= main_~i~0 6)} assume true; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:09,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {8165#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:09,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {8165#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:09,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {8165#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:09,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {8166#(<= main_~i~0 7)} assume true; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:09,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {8166#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:09,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {8166#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:09,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {8166#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:09,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {8167#(<= main_~i~0 8)} assume true; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:09,959 INFO L273 TraceCheckUtils]: 39: Hoare triple {8167#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:09,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {8167#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:09,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {8167#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:09,961 INFO L273 TraceCheckUtils]: 42: Hoare triple {8168#(<= main_~i~0 9)} assume true; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:09,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {8168#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:09,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {8168#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:09,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {8168#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:09,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {8169#(<= main_~i~0 10)} assume true; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:09,964 INFO L273 TraceCheckUtils]: 47: Hoare triple {8169#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:09,964 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:09,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:09,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {8170#(<= main_~i~0 11)} assume true; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:09,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {8170#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:09,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {8170#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:09,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {8170#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:09,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {8171#(<= main_~i~0 12)} assume true; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:09,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {8171#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:09,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {8171#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:09,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {8171#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:09,969 INFO L273 TraceCheckUtils]: 58: Hoare triple {8172#(<= main_~i~0 13)} assume true; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:09,970 INFO L273 TraceCheckUtils]: 59: Hoare triple {8172#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:09,970 INFO L273 TraceCheckUtils]: 60: Hoare triple {8172#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:09,971 INFO L273 TraceCheckUtils]: 61: Hoare triple {8172#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:09,972 INFO L273 TraceCheckUtils]: 62: Hoare triple {8173#(<= main_~i~0 14)} assume true; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:09,972 INFO L273 TraceCheckUtils]: 63: Hoare triple {8173#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:09,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {8173#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:09,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {8173#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:09,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {8174#(<= main_~i~0 15)} assume true; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:09,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {8174#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:09,975 INFO L273 TraceCheckUtils]: 68: Hoare triple {8174#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:09,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {8174#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:09,976 INFO L273 TraceCheckUtils]: 70: Hoare triple {8175#(<= main_~i~0 16)} assume true; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:09,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {8175#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:09,977 INFO L273 TraceCheckUtils]: 72: Hoare triple {8175#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:09,977 INFO L273 TraceCheckUtils]: 73: Hoare triple {8175#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:09,978 INFO L273 TraceCheckUtils]: 74: Hoare triple {8176#(<= main_~i~0 17)} assume true; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:09,978 INFO L273 TraceCheckUtils]: 75: Hoare triple {8176#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:09,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {8176#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:09,980 INFO L273 TraceCheckUtils]: 77: Hoare triple {8176#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {8177#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:09,980 INFO L273 TraceCheckUtils]: 78: Hoare triple {8177#(<= main_~i~0 18)} assume true; {8177#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:09,981 INFO L273 TraceCheckUtils]: 79: Hoare triple {8177#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8158#false} is VALID [2018-11-14 18:45:09,981 INFO L273 TraceCheckUtils]: 80: Hoare triple {8158#false} havoc ~x~0;~x~0 := 0; {8158#false} is VALID [2018-11-14 18:45:09,981 INFO L273 TraceCheckUtils]: 81: Hoare triple {8158#false} assume true; {8158#false} is VALID [2018-11-14 18:45:09,981 INFO L273 TraceCheckUtils]: 82: Hoare triple {8158#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8158#false} is VALID [2018-11-14 18:45:09,982 INFO L256 TraceCheckUtils]: 83: Hoare triple {8158#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8158#false} is VALID [2018-11-14 18:45:09,982 INFO L273 TraceCheckUtils]: 84: Hoare triple {8158#false} ~cond := #in~cond; {8158#false} is VALID [2018-11-14 18:45:09,982 INFO L273 TraceCheckUtils]: 85: Hoare triple {8158#false} assume ~cond == 0; {8158#false} is VALID [2018-11-14 18:45:09,982 INFO L273 TraceCheckUtils]: 86: Hoare triple {8158#false} assume !false; {8158#false} is VALID [2018-11-14 18:45:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:09,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:09,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:45:10,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 18:45:10,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:10,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:10,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {8157#true} call ULTIMATE.init(); {8157#true} is VALID [2018-11-14 18:45:10,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {8157#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8157#true} is VALID [2018-11-14 18:45:10,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {8157#true} assume true; {8157#true} is VALID [2018-11-14 18:45:10,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8157#true} {8157#true} #57#return; {8157#true} is VALID [2018-11-14 18:45:10,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {8157#true} call #t~ret4 := main(); {8157#true} is VALID [2018-11-14 18:45:10,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {8157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8196#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:10,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {8196#(<= main_~i~0 0)} assume true; {8196#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:10,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {8196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8196#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:10,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {8196#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8196#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:10,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {8196#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:10,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {8160#(<= main_~i~0 1)} assume true; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:10,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {8160#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:10,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {8160#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8160#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:10,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {8160#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:10,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {8161#(<= main_~i~0 2)} assume true; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:10,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {8161#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:10,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {8161#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8161#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:10,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {8161#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:10,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {8162#(<= main_~i~0 3)} assume true; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:10,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {8162#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:10,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {8162#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8162#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:10,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {8162#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:10,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {8163#(<= main_~i~0 4)} assume true; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:10,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {8163#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:10,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {8163#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8163#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:10,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {8163#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:10,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {8164#(<= main_~i~0 5)} assume true; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:10,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {8164#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:10,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {8164#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8164#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:10,370 INFO L273 TraceCheckUtils]: 29: Hoare triple {8164#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:10,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {8165#(<= main_~i~0 6)} assume true; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:10,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {8165#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:10,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {8165#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8165#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:10,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {8165#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:10,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {8166#(<= main_~i~0 7)} assume true; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:10,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {8166#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:10,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {8166#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8166#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:10,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {8166#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:10,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {8167#(<= main_~i~0 8)} assume true; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:10,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {8167#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:10,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {8167#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8167#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:10,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {8167#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:10,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {8168#(<= main_~i~0 9)} assume true; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:10,378 INFO L273 TraceCheckUtils]: 43: Hoare triple {8168#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:10,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {8168#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8168#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:10,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {8168#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:10,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {8169#(<= main_~i~0 10)} assume true; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:10,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {8169#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:10,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8169#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:10,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:10,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {8170#(<= main_~i~0 11)} assume true; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:10,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {8170#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:10,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {8170#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8170#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:10,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {8170#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:10,384 INFO L273 TraceCheckUtils]: 54: Hoare triple {8171#(<= main_~i~0 12)} assume true; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:10,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {8171#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:10,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {8171#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8171#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:10,386 INFO L273 TraceCheckUtils]: 57: Hoare triple {8171#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:10,387 INFO L273 TraceCheckUtils]: 58: Hoare triple {8172#(<= main_~i~0 13)} assume true; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:10,387 INFO L273 TraceCheckUtils]: 59: Hoare triple {8172#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:10,388 INFO L273 TraceCheckUtils]: 60: Hoare triple {8172#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8172#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:10,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {8172#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:10,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {8173#(<= main_~i~0 14)} assume true; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:10,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {8173#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:10,390 INFO L273 TraceCheckUtils]: 64: Hoare triple {8173#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8173#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:10,391 INFO L273 TraceCheckUtils]: 65: Hoare triple {8173#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:10,391 INFO L273 TraceCheckUtils]: 66: Hoare triple {8174#(<= main_~i~0 15)} assume true; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:10,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {8174#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:10,392 INFO L273 TraceCheckUtils]: 68: Hoare triple {8174#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8174#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:10,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {8174#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:10,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {8175#(<= main_~i~0 16)} assume true; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:10,394 INFO L273 TraceCheckUtils]: 71: Hoare triple {8175#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:10,394 INFO L273 TraceCheckUtils]: 72: Hoare triple {8175#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8175#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:10,395 INFO L273 TraceCheckUtils]: 73: Hoare triple {8175#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:10,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {8176#(<= main_~i~0 17)} assume true; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:10,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {8176#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:10,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {8176#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8176#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:10,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {8176#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {8177#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:10,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {8177#(<= main_~i~0 18)} assume true; {8177#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:10,398 INFO L273 TraceCheckUtils]: 79: Hoare triple {8177#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8158#false} is VALID [2018-11-14 18:45:10,399 INFO L273 TraceCheckUtils]: 80: Hoare triple {8158#false} havoc ~x~0;~x~0 := 0; {8158#false} is VALID [2018-11-14 18:45:10,399 INFO L273 TraceCheckUtils]: 81: Hoare triple {8158#false} assume true; {8158#false} is VALID [2018-11-14 18:45:10,399 INFO L273 TraceCheckUtils]: 82: Hoare triple {8158#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8158#false} is VALID [2018-11-14 18:45:10,399 INFO L256 TraceCheckUtils]: 83: Hoare triple {8158#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8158#false} is VALID [2018-11-14 18:45:10,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {8158#false} ~cond := #in~cond; {8158#false} is VALID [2018-11-14 18:45:10,400 INFO L273 TraceCheckUtils]: 85: Hoare triple {8158#false} assume ~cond == 0; {8158#false} is VALID [2018-11-14 18:45:10,400 INFO L273 TraceCheckUtils]: 86: Hoare triple {8158#false} assume !false; {8158#false} is VALID [2018-11-14 18:45:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:10,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:10,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 18:45:10,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-14 18:45:10,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:10,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:45:10,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:10,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:45:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:45:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:45:10,507 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand 22 states. [2018-11-14 18:45:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:10,959 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-11-14 18:45:10,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:45:10,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-14 18:45:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:45:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-14 18:45:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:45:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 132 transitions. [2018-11-14 18:45:10,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 132 transitions. [2018-11-14 18:45:11,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:11,082 INFO L225 Difference]: With dead ends: 110 [2018-11-14 18:45:11,082 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 18:45:11,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:45:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 18:45:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-14 18:45:11,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:11,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2018-11-14 18:45:11,099 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2018-11-14 18:45:11,099 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2018-11-14 18:45:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:11,101 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2018-11-14 18:45:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 18:45:11,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:11,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:11,102 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2018-11-14 18:45:11,102 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2018-11-14 18:45:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:11,104 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2018-11-14 18:45:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 18:45:11,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:11,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:11,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:11,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 18:45:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2018-11-14 18:45:11,106 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 87 [2018-11-14 18:45:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:11,107 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2018-11-14 18:45:11,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:45:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-14 18:45:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 18:45:11,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:11,108 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:11,108 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:11,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash 498874852, now seen corresponding path program 19 times [2018-11-14 18:45:11,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:11,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:11,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:11,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:11,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:11,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {8898#true} call ULTIMATE.init(); {8898#true} is VALID [2018-11-14 18:45:11,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {8898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8898#true} is VALID [2018-11-14 18:45:11,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {8898#true} assume true; {8898#true} is VALID [2018-11-14 18:45:11,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8898#true} {8898#true} #57#return; {8898#true} is VALID [2018-11-14 18:45:11,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {8898#true} call #t~ret4 := main(); {8898#true} is VALID [2018-11-14 18:45:11,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {8898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8900#(= main_~i~0 0)} is VALID [2018-11-14 18:45:11,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {8900#(= main_~i~0 0)} assume true; {8900#(= main_~i~0 0)} is VALID [2018-11-14 18:45:11,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {8900#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8900#(= main_~i~0 0)} is VALID [2018-11-14 18:45:11,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {8900#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8900#(= main_~i~0 0)} is VALID [2018-11-14 18:45:11,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {8900#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {8901#(<= main_~i~0 1)} assume true; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {8901#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {8901#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {8902#(<= main_~i~0 2)} assume true; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {8902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {8902#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {8902#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {8903#(<= main_~i~0 3)} assume true; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {8903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {8903#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {8903#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {8904#(<= main_~i~0 4)} assume true; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {8904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {8904#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {8904#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {8905#(<= main_~i~0 5)} assume true; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {8905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {8905#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,589 INFO L273 TraceCheckUtils]: 29: Hoare triple {8905#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {8906#(<= main_~i~0 6)} assume true; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {8906#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {8906#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,591 INFO L273 TraceCheckUtils]: 33: Hoare triple {8906#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {8907#(<= main_~i~0 7)} assume true; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,593 INFO L273 TraceCheckUtils]: 36: Hoare triple {8907#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {8907#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {8908#(<= main_~i~0 8)} assume true; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {8908#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {8908#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {8908#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {8909#(<= main_~i~0 9)} assume true; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {8909#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {8909#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {8909#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {8910#(<= main_~i~0 10)} assume true; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {8910#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 11)} assume true; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,602 INFO L273 TraceCheckUtils]: 52: Hoare triple {8911#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {8911#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,603 INFO L273 TraceCheckUtils]: 54: Hoare triple {8912#(<= main_~i~0 12)} assume true; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,604 INFO L273 TraceCheckUtils]: 55: Hoare triple {8912#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,604 INFO L273 TraceCheckUtils]: 56: Hoare triple {8912#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {8912#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,605 INFO L273 TraceCheckUtils]: 58: Hoare triple {8913#(<= main_~i~0 13)} assume true; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,606 INFO L273 TraceCheckUtils]: 59: Hoare triple {8913#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,606 INFO L273 TraceCheckUtils]: 60: Hoare triple {8913#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,607 INFO L273 TraceCheckUtils]: 61: Hoare triple {8913#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,608 INFO L273 TraceCheckUtils]: 62: Hoare triple {8914#(<= main_~i~0 14)} assume true; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,608 INFO L273 TraceCheckUtils]: 63: Hoare triple {8914#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,609 INFO L273 TraceCheckUtils]: 64: Hoare triple {8914#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,609 INFO L273 TraceCheckUtils]: 65: Hoare triple {8914#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,610 INFO L273 TraceCheckUtils]: 66: Hoare triple {8915#(<= main_~i~0 15)} assume true; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,610 INFO L273 TraceCheckUtils]: 67: Hoare triple {8915#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,611 INFO L273 TraceCheckUtils]: 68: Hoare triple {8915#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,612 INFO L273 TraceCheckUtils]: 69: Hoare triple {8915#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,612 INFO L273 TraceCheckUtils]: 70: Hoare triple {8916#(<= main_~i~0 16)} assume true; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {8916#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,613 INFO L273 TraceCheckUtils]: 72: Hoare triple {8916#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {8916#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,615 INFO L273 TraceCheckUtils]: 74: Hoare triple {8917#(<= main_~i~0 17)} assume true; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {8917#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {8917#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {8917#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,617 INFO L273 TraceCheckUtils]: 78: Hoare triple {8918#(<= main_~i~0 18)} assume true; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,617 INFO L273 TraceCheckUtils]: 79: Hoare triple {8918#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {8918#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {8918#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {8919#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:11,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {8919#(<= main_~i~0 19)} assume true; {8919#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:11,620 INFO L273 TraceCheckUtils]: 83: Hoare triple {8919#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8899#false} is VALID [2018-11-14 18:45:11,620 INFO L273 TraceCheckUtils]: 84: Hoare triple {8899#false} havoc ~x~0;~x~0 := 0; {8899#false} is VALID [2018-11-14 18:45:11,620 INFO L273 TraceCheckUtils]: 85: Hoare triple {8899#false} assume true; {8899#false} is VALID [2018-11-14 18:45:11,620 INFO L273 TraceCheckUtils]: 86: Hoare triple {8899#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8899#false} is VALID [2018-11-14 18:45:11,621 INFO L256 TraceCheckUtils]: 87: Hoare triple {8899#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8899#false} is VALID [2018-11-14 18:45:11,621 INFO L273 TraceCheckUtils]: 88: Hoare triple {8899#false} ~cond := #in~cond; {8899#false} is VALID [2018-11-14 18:45:11,621 INFO L273 TraceCheckUtils]: 89: Hoare triple {8899#false} assume ~cond == 0; {8899#false} is VALID [2018-11-14 18:45:11,621 INFO L273 TraceCheckUtils]: 90: Hoare triple {8899#false} assume !false; {8899#false} is VALID [2018-11-14 18:45:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:11,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:11,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:11,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:11,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {8898#true} call ULTIMATE.init(); {8898#true} is VALID [2018-11-14 18:45:11,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {8898#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8898#true} is VALID [2018-11-14 18:45:11,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {8898#true} assume true; {8898#true} is VALID [2018-11-14 18:45:11,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8898#true} {8898#true} #57#return; {8898#true} is VALID [2018-11-14 18:45:11,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {8898#true} call #t~ret4 := main(); {8898#true} is VALID [2018-11-14 18:45:11,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {8898#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {8938#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:11,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {8938#(<= main_~i~0 0)} assume true; {8938#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:11,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {8938#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8938#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:11,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {8938#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8938#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:11,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {8938#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {8901#(<= main_~i~0 1)} assume true; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {8901#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8901#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:11,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {8901#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {8902#(<= main_~i~0 2)} assume true; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {8902#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {8902#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8902#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:11,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {8902#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {8903#(<= main_~i~0 3)} assume true; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {8903#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {8903#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8903#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:11,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {8903#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {8904#(<= main_~i~0 4)} assume true; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,876 INFO L273 TraceCheckUtils]: 23: Hoare triple {8904#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {8904#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8904#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:11,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {8904#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {8905#(<= main_~i~0 5)} assume true; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {8905#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {8905#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8905#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:11,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {8905#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {8906#(<= main_~i~0 6)} assume true; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {8906#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {8906#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8906#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:11,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {8906#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {8907#(<= main_~i~0 7)} assume true; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {8907#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {8907#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8907#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:11,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {8907#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {8908#(<= main_~i~0 8)} assume true; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {8908#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {8908#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8908#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:11,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {8908#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {8909#(<= main_~i~0 9)} assume true; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {8909#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {8909#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8909#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:11,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {8909#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {8910#(<= main_~i~0 10)} assume true; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {8910#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8910#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:11,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 11)} assume true; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {8911#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8911#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:11,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {8911#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,894 INFO L273 TraceCheckUtils]: 54: Hoare triple {8912#(<= main_~i~0 12)} assume true; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {8912#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {8912#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8912#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:11,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {8912#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {8913#(<= main_~i~0 13)} assume true; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {8913#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {8913#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8913#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:11,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {8913#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {8914#(<= main_~i~0 14)} assume true; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {8914#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {8914#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8914#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:11,900 INFO L273 TraceCheckUtils]: 65: Hoare triple {8914#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {8915#(<= main_~i~0 15)} assume true; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,901 INFO L273 TraceCheckUtils]: 67: Hoare triple {8915#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {8915#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8915#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:11,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {8915#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,903 INFO L273 TraceCheckUtils]: 70: Hoare triple {8916#(<= main_~i~0 16)} assume true; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {8916#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,904 INFO L273 TraceCheckUtils]: 72: Hoare triple {8916#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8916#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:11,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {8916#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,905 INFO L273 TraceCheckUtils]: 74: Hoare triple {8917#(<= main_~i~0 17)} assume true; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,906 INFO L273 TraceCheckUtils]: 75: Hoare triple {8917#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {8917#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8917#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:11,909 INFO L273 TraceCheckUtils]: 77: Hoare triple {8917#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,912 INFO L273 TraceCheckUtils]: 78: Hoare triple {8918#(<= main_~i~0 18)} assume true; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,916 INFO L273 TraceCheckUtils]: 79: Hoare triple {8918#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {8918#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {8918#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:11,919 INFO L273 TraceCheckUtils]: 81: Hoare triple {8918#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {8919#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:11,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {8919#(<= main_~i~0 19)} assume true; {8919#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:11,922 INFO L273 TraceCheckUtils]: 83: Hoare triple {8919#(<= main_~i~0 19)} assume !(~i~0 < 100000); {8899#false} is VALID [2018-11-14 18:45:11,922 INFO L273 TraceCheckUtils]: 84: Hoare triple {8899#false} havoc ~x~0;~x~0 := 0; {8899#false} is VALID [2018-11-14 18:45:11,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {8899#false} assume true; {8899#false} is VALID [2018-11-14 18:45:11,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {8899#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8899#false} is VALID [2018-11-14 18:45:11,923 INFO L256 TraceCheckUtils]: 87: Hoare triple {8899#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {8899#false} is VALID [2018-11-14 18:45:11,923 INFO L273 TraceCheckUtils]: 88: Hoare triple {8899#false} ~cond := #in~cond; {8899#false} is VALID [2018-11-14 18:45:11,923 INFO L273 TraceCheckUtils]: 89: Hoare triple {8899#false} assume ~cond == 0; {8899#false} is VALID [2018-11-14 18:45:11,923 INFO L273 TraceCheckUtils]: 90: Hoare triple {8899#false} assume !false; {8899#false} is VALID [2018-11-14 18:45:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:11,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:11,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:45:11,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-14 18:45:11,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:11,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:45:12,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:12,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:45:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:45:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:45:12,084 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 23 states. [2018-11-14 18:45:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:12,814 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-11-14 18:45:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:45:12,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-14 18:45:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:45:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2018-11-14 18:45:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:45:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2018-11-14 18:45:12,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 137 transitions. [2018-11-14 18:45:12,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:12,938 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:45:12,938 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 18:45:12,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:45:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 18:45:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-14 18:45:12,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:12,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-14 18:45:12,964 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-14 18:45:12,964 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-14 18:45:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:12,965 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-14 18:45:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-14 18:45:12,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:12,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:12,966 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-14 18:45:12,966 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-14 18:45:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:12,967 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-14 18:45:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-14 18:45:12,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:12,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:12,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:12,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-14 18:45:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2018-11-14 18:45:12,969 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 91 [2018-11-14 18:45:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:12,969 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2018-11-14 18:45:12,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:45:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2018-11-14 18:45:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-14 18:45:12,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:12,970 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:12,971 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:12,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1482210246, now seen corresponding path program 20 times [2018-11-14 18:45:12,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:12,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:12,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:13,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {9670#true} call ULTIMATE.init(); {9670#true} is VALID [2018-11-14 18:45:13,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {9670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9670#true} is VALID [2018-11-14 18:45:13,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {9670#true} assume true; {9670#true} is VALID [2018-11-14 18:45:13,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9670#true} {9670#true} #57#return; {9670#true} is VALID [2018-11-14 18:45:13,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {9670#true} call #t~ret4 := main(); {9670#true} is VALID [2018-11-14 18:45:13,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {9670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9672#(= main_~i~0 0)} is VALID [2018-11-14 18:45:13,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {9672#(= main_~i~0 0)} assume true; {9672#(= main_~i~0 0)} is VALID [2018-11-14 18:45:13,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {9672#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9672#(= main_~i~0 0)} is VALID [2018-11-14 18:45:13,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {9672#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9672#(= main_~i~0 0)} is VALID [2018-11-14 18:45:13,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {9672#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {9673#(<= main_~i~0 1)} assume true; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {9673#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {9673#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {9673#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {9674#(<= main_~i~0 2)} assume true; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {9674#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {9674#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {9674#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {9675#(<= main_~i~0 3)} assume true; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {9675#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {9675#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {9675#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#(<= main_~i~0 4)} assume true; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {9677#(<= main_~i~0 5)} assume true; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,414 INFO L273 TraceCheckUtils]: 27: Hoare triple {9677#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {9677#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {9677#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {9678#(<= main_~i~0 6)} assume true; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {9678#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {9678#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {9678#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {9679#(<= main_~i~0 7)} assume true; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {9679#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {9679#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {9679#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,420 INFO L273 TraceCheckUtils]: 38: Hoare triple {9680#(<= main_~i~0 8)} assume true; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {9680#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {9680#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {9680#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 9)} assume true; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,422 INFO L273 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,423 INFO L273 TraceCheckUtils]: 44: Hoare triple {9681#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {9681#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,424 INFO L273 TraceCheckUtils]: 46: Hoare triple {9682#(<= main_~i~0 10)} assume true; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,424 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,425 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {9682#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {9683#(<= main_~i~0 11)} assume true; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {9683#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {9683#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {9683#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {9684#(<= main_~i~0 12)} assume true; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,429 INFO L273 TraceCheckUtils]: 55: Hoare triple {9684#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,429 INFO L273 TraceCheckUtils]: 56: Hoare triple {9684#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,430 INFO L273 TraceCheckUtils]: 57: Hoare triple {9684#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,430 INFO L273 TraceCheckUtils]: 58: Hoare triple {9685#(<= main_~i~0 13)} assume true; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,431 INFO L273 TraceCheckUtils]: 59: Hoare triple {9685#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,431 INFO L273 TraceCheckUtils]: 60: Hoare triple {9685#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,432 INFO L273 TraceCheckUtils]: 61: Hoare triple {9685#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,432 INFO L273 TraceCheckUtils]: 62: Hoare triple {9686#(<= main_~i~0 14)} assume true; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,433 INFO L273 TraceCheckUtils]: 63: Hoare triple {9686#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,434 INFO L273 TraceCheckUtils]: 65: Hoare triple {9686#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,435 INFO L273 TraceCheckUtils]: 66: Hoare triple {9687#(<= main_~i~0 15)} assume true; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,435 INFO L273 TraceCheckUtils]: 67: Hoare triple {9687#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,435 INFO L273 TraceCheckUtils]: 68: Hoare triple {9687#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,436 INFO L273 TraceCheckUtils]: 69: Hoare triple {9687#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,437 INFO L273 TraceCheckUtils]: 70: Hoare triple {9688#(<= main_~i~0 16)} assume true; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,437 INFO L273 TraceCheckUtils]: 71: Hoare triple {9688#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,438 INFO L273 TraceCheckUtils]: 72: Hoare triple {9688#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,438 INFO L273 TraceCheckUtils]: 73: Hoare triple {9688#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,439 INFO L273 TraceCheckUtils]: 74: Hoare triple {9689#(<= main_~i~0 17)} assume true; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,439 INFO L273 TraceCheckUtils]: 75: Hoare triple {9689#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,440 INFO L273 TraceCheckUtils]: 76: Hoare triple {9689#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,440 INFO L273 TraceCheckUtils]: 77: Hoare triple {9689#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,441 INFO L273 TraceCheckUtils]: 78: Hoare triple {9690#(<= main_~i~0 18)} assume true; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,441 INFO L273 TraceCheckUtils]: 79: Hoare triple {9690#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,442 INFO L273 TraceCheckUtils]: 80: Hoare triple {9690#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,443 INFO L273 TraceCheckUtils]: 81: Hoare triple {9690#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,443 INFO L273 TraceCheckUtils]: 82: Hoare triple {9691#(<= main_~i~0 19)} assume true; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,444 INFO L273 TraceCheckUtils]: 83: Hoare triple {9691#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,444 INFO L273 TraceCheckUtils]: 84: Hoare triple {9691#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,445 INFO L273 TraceCheckUtils]: 85: Hoare triple {9691#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {9692#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:13,445 INFO L273 TraceCheckUtils]: 86: Hoare triple {9692#(<= main_~i~0 20)} assume true; {9692#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:13,446 INFO L273 TraceCheckUtils]: 87: Hoare triple {9692#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9671#false} is VALID [2018-11-14 18:45:13,446 INFO L273 TraceCheckUtils]: 88: Hoare triple {9671#false} havoc ~x~0;~x~0 := 0; {9671#false} is VALID [2018-11-14 18:45:13,446 INFO L273 TraceCheckUtils]: 89: Hoare triple {9671#false} assume true; {9671#false} is VALID [2018-11-14 18:45:13,446 INFO L273 TraceCheckUtils]: 90: Hoare triple {9671#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9671#false} is VALID [2018-11-14 18:45:13,447 INFO L256 TraceCheckUtils]: 91: Hoare triple {9671#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9671#false} is VALID [2018-11-14 18:45:13,447 INFO L273 TraceCheckUtils]: 92: Hoare triple {9671#false} ~cond := #in~cond; {9671#false} is VALID [2018-11-14 18:45:13,447 INFO L273 TraceCheckUtils]: 93: Hoare triple {9671#false} assume ~cond == 0; {9671#false} is VALID [2018-11-14 18:45:13,447 INFO L273 TraceCheckUtils]: 94: Hoare triple {9671#false} assume !false; {9671#false} is VALID [2018-11-14 18:45:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:13,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:13,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:13,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:45:13,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:45:13,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:13,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:13,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {9670#true} call ULTIMATE.init(); {9670#true} is VALID [2018-11-14 18:45:13,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {9670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9670#true} is VALID [2018-11-14 18:45:13,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {9670#true} assume true; {9670#true} is VALID [2018-11-14 18:45:13,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9670#true} {9670#true} #57#return; {9670#true} is VALID [2018-11-14 18:45:13,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {9670#true} call #t~ret4 := main(); {9670#true} is VALID [2018-11-14 18:45:13,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {9670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {9711#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:13,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {9711#(<= main_~i~0 0)} assume true; {9711#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:13,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {9711#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9711#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:13,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {9711#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9711#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:13,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {9711#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {9673#(<= main_~i~0 1)} assume true; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {9673#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {9673#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9673#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:13,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {9673#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {9674#(<= main_~i~0 2)} assume true; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {9674#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {9674#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9674#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:13,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {9674#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {9675#(<= main_~i~0 3)} assume true; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {9675#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {9675#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9675#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:13,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {9675#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#(<= main_~i~0 4)} assume true; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9676#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:13,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {9677#(<= main_~i~0 5)} assume true; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {9677#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {9677#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9677#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:13,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {9677#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {9678#(<= main_~i~0 6)} assume true; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {9678#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {9678#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9678#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:13,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {9678#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {9679#(<= main_~i~0 7)} assume true; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {9679#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {9679#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9679#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:13,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {9679#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {9680#(<= main_~i~0 8)} assume true; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {9680#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {9680#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9680#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:13,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {9680#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 9)} assume true; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,700 INFO L273 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {9681#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9681#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:13,701 INFO L273 TraceCheckUtils]: 45: Hoare triple {9681#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {9682#(<= main_~i~0 10)} assume true; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9682#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:13,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {9682#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {9683#(<= main_~i~0 11)} assume true; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {9683#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {9683#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9683#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:13,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {9683#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {9684#(<= main_~i~0 12)} assume true; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {9684#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {9684#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9684#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:13,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {9684#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {9685#(<= main_~i~0 13)} assume true; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {9685#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,710 INFO L273 TraceCheckUtils]: 60: Hoare triple {9685#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9685#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:13,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {9685#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {9686#(<= main_~i~0 14)} assume true; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {9686#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9686#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:13,713 INFO L273 TraceCheckUtils]: 65: Hoare triple {9686#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {9687#(<= main_~i~0 15)} assume true; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {9687#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {9687#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9687#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:13,715 INFO L273 TraceCheckUtils]: 69: Hoare triple {9687#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,715 INFO L273 TraceCheckUtils]: 70: Hoare triple {9688#(<= main_~i~0 16)} assume true; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,716 INFO L273 TraceCheckUtils]: 71: Hoare triple {9688#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,716 INFO L273 TraceCheckUtils]: 72: Hoare triple {9688#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9688#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:13,717 INFO L273 TraceCheckUtils]: 73: Hoare triple {9688#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,718 INFO L273 TraceCheckUtils]: 74: Hoare triple {9689#(<= main_~i~0 17)} assume true; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {9689#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,719 INFO L273 TraceCheckUtils]: 76: Hoare triple {9689#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9689#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:13,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {9689#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {9690#(<= main_~i~0 18)} assume true; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {9690#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {9690#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9690#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:13,722 INFO L273 TraceCheckUtils]: 81: Hoare triple {9690#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,722 INFO L273 TraceCheckUtils]: 82: Hoare triple {9691#(<= main_~i~0 19)} assume true; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,723 INFO L273 TraceCheckUtils]: 83: Hoare triple {9691#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,724 INFO L273 TraceCheckUtils]: 84: Hoare triple {9691#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {9691#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:13,725 INFO L273 TraceCheckUtils]: 85: Hoare triple {9691#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {9692#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:13,725 INFO L273 TraceCheckUtils]: 86: Hoare triple {9692#(<= main_~i~0 20)} assume true; {9692#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:13,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {9692#(<= main_~i~0 20)} assume !(~i~0 < 100000); {9671#false} is VALID [2018-11-14 18:45:13,726 INFO L273 TraceCheckUtils]: 88: Hoare triple {9671#false} havoc ~x~0;~x~0 := 0; {9671#false} is VALID [2018-11-14 18:45:13,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {9671#false} assume true; {9671#false} is VALID [2018-11-14 18:45:13,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {9671#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9671#false} is VALID [2018-11-14 18:45:13,727 INFO L256 TraceCheckUtils]: 91: Hoare triple {9671#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {9671#false} is VALID [2018-11-14 18:45:13,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {9671#false} ~cond := #in~cond; {9671#false} is VALID [2018-11-14 18:45:13,727 INFO L273 TraceCheckUtils]: 93: Hoare triple {9671#false} assume ~cond == 0; {9671#false} is VALID [2018-11-14 18:45:13,727 INFO L273 TraceCheckUtils]: 94: Hoare triple {9671#false} assume !false; {9671#false} is VALID [2018-11-14 18:45:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:13,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:13,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:45:13,755 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-14 18:45:13,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:13,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:45:13,846 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-14 18:45:13,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:45:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:45:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:45:13,848 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand 24 states. [2018-11-14 18:45:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:14,323 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2018-11-14 18:45:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:45:14,323 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-14 18:45:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:45:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 142 transitions. [2018-11-14 18:45:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:45:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 142 transitions. [2018-11-14 18:45:14,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 142 transitions. [2018-11-14 18:45:14,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:14,465 INFO L225 Difference]: With dead ends: 118 [2018-11-14 18:45:14,465 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 18:45:14,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:45:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 18:45:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-14 18:45:14,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:14,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-14 18:45:14,494 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-14 18:45:14,494 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-14 18:45:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:14,496 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-14 18:45:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 18:45:14,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:14,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:14,496 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-14 18:45:14,496 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-14 18:45:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:14,498 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-14 18:45:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 18:45:14,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:14,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:14,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:14,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:45:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-11-14 18:45:14,501 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 95 [2018-11-14 18:45:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:14,501 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-14 18:45:14,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:45:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-11-14 18:45:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 18:45:14,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:14,502 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:14,502 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:14,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash -709282928, now seen corresponding path program 21 times [2018-11-14 18:45:14,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:14,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:14,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:15,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {10473#true} call ULTIMATE.init(); {10473#true} is VALID [2018-11-14 18:45:15,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {10473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10473#true} is VALID [2018-11-14 18:45:15,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {10473#true} assume true; {10473#true} is VALID [2018-11-14 18:45:15,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10473#true} {10473#true} #57#return; {10473#true} is VALID [2018-11-14 18:45:15,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {10473#true} call #t~ret4 := main(); {10473#true} is VALID [2018-11-14 18:45:15,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {10473#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10475#(= main_~i~0 0)} is VALID [2018-11-14 18:45:15,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {10475#(= main_~i~0 0)} assume true; {10475#(= main_~i~0 0)} is VALID [2018-11-14 18:45:15,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {10475#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10475#(= main_~i~0 0)} is VALID [2018-11-14 18:45:15,206 INFO L273 TraceCheckUtils]: 8: Hoare triple {10475#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10475#(= main_~i~0 0)} is VALID [2018-11-14 18:45:15,207 INFO L273 TraceCheckUtils]: 9: Hoare triple {10475#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {10476#(<= main_~i~0 1)} assume true; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {10476#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {10476#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {10477#(<= main_~i~0 2)} assume true; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {10477#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {10477#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {10478#(<= main_~i~0 3)} assume true; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {10478#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {10478#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {10479#(<= main_~i~0 4)} assume true; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {10479#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,216 INFO L273 TraceCheckUtils]: 25: Hoare triple {10479#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,216 INFO L273 TraceCheckUtils]: 26: Hoare triple {10480#(<= main_~i~0 5)} assume true; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,217 INFO L273 TraceCheckUtils]: 28: Hoare triple {10480#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {10480#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {10481#(<= main_~i~0 6)} assume true; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {10481#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,220 INFO L273 TraceCheckUtils]: 33: Hoare triple {10481#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,221 INFO L273 TraceCheckUtils]: 34: Hoare triple {10482#(<= main_~i~0 7)} assume true; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,222 INFO L273 TraceCheckUtils]: 36: Hoare triple {10482#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {10482#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,223 INFO L273 TraceCheckUtils]: 38: Hoare triple {10483#(<= main_~i~0 8)} assume true; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {10483#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,224 INFO L273 TraceCheckUtils]: 41: Hoare triple {10483#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,225 INFO L273 TraceCheckUtils]: 42: Hoare triple {10484#(<= main_~i~0 9)} assume true; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,226 INFO L273 TraceCheckUtils]: 44: Hoare triple {10484#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,227 INFO L273 TraceCheckUtils]: 45: Hoare triple {10484#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,227 INFO L273 TraceCheckUtils]: 46: Hoare triple {10485#(<= main_~i~0 10)} assume true; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,228 INFO L273 TraceCheckUtils]: 48: Hoare triple {10485#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {10485#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,229 INFO L273 TraceCheckUtils]: 50: Hoare triple {10486#(<= main_~i~0 11)} assume true; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,230 INFO L273 TraceCheckUtils]: 51: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,230 INFO L273 TraceCheckUtils]: 52: Hoare triple {10486#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,231 INFO L273 TraceCheckUtils]: 53: Hoare triple {10486#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,231 INFO L273 TraceCheckUtils]: 54: Hoare triple {10487#(<= main_~i~0 12)} assume true; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,232 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,233 INFO L273 TraceCheckUtils]: 57: Hoare triple {10487#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,233 INFO L273 TraceCheckUtils]: 58: Hoare triple {10488#(<= main_~i~0 13)} assume true; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {10488#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {10488#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,236 INFO L273 TraceCheckUtils]: 62: Hoare triple {10489#(<= main_~i~0 14)} assume true; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,236 INFO L273 TraceCheckUtils]: 63: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {10489#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {10489#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {10490#(<= main_~i~0 15)} assume true; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,238 INFO L273 TraceCheckUtils]: 67: Hoare triple {10490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {10490#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {10490#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {10491#(<= main_~i~0 16)} assume true; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {10491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {10491#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,242 INFO L273 TraceCheckUtils]: 73: Hoare triple {10491#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,242 INFO L273 TraceCheckUtils]: 74: Hoare triple {10492#(<= main_~i~0 17)} assume true; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,242 INFO L273 TraceCheckUtils]: 75: Hoare triple {10492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,243 INFO L273 TraceCheckUtils]: 76: Hoare triple {10492#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,244 INFO L273 TraceCheckUtils]: 77: Hoare triple {10492#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,244 INFO L273 TraceCheckUtils]: 78: Hoare triple {10493#(<= main_~i~0 18)} assume true; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,245 INFO L273 TraceCheckUtils]: 79: Hoare triple {10493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,245 INFO L273 TraceCheckUtils]: 80: Hoare triple {10493#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,246 INFO L273 TraceCheckUtils]: 81: Hoare triple {10493#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,246 INFO L273 TraceCheckUtils]: 82: Hoare triple {10494#(<= main_~i~0 19)} assume true; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,247 INFO L273 TraceCheckUtils]: 83: Hoare triple {10494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,247 INFO L273 TraceCheckUtils]: 84: Hoare triple {10494#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {10494#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,248 INFO L273 TraceCheckUtils]: 86: Hoare triple {10495#(<= main_~i~0 20)} assume true; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {10495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,249 INFO L273 TraceCheckUtils]: 88: Hoare triple {10495#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,250 INFO L273 TraceCheckUtils]: 89: Hoare triple {10495#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {10496#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:15,251 INFO L273 TraceCheckUtils]: 90: Hoare triple {10496#(<= main_~i~0 21)} assume true; {10496#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:15,251 INFO L273 TraceCheckUtils]: 91: Hoare triple {10496#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10474#false} is VALID [2018-11-14 18:45:15,251 INFO L273 TraceCheckUtils]: 92: Hoare triple {10474#false} havoc ~x~0;~x~0 := 0; {10474#false} is VALID [2018-11-14 18:45:15,252 INFO L273 TraceCheckUtils]: 93: Hoare triple {10474#false} assume true; {10474#false} is VALID [2018-11-14 18:45:15,252 INFO L273 TraceCheckUtils]: 94: Hoare triple {10474#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10474#false} is VALID [2018-11-14 18:45:15,252 INFO L256 TraceCheckUtils]: 95: Hoare triple {10474#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {10474#false} is VALID [2018-11-14 18:45:15,252 INFO L273 TraceCheckUtils]: 96: Hoare triple {10474#false} ~cond := #in~cond; {10474#false} is VALID [2018-11-14 18:45:15,252 INFO L273 TraceCheckUtils]: 97: Hoare triple {10474#false} assume ~cond == 0; {10474#false} is VALID [2018-11-14 18:45:15,253 INFO L273 TraceCheckUtils]: 98: Hoare triple {10474#false} assume !false; {10474#false} is VALID [2018-11-14 18:45:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:15,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:15,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:15,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:45:15,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 18:45:15,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:15,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:15,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {10473#true} call ULTIMATE.init(); {10473#true} is VALID [2018-11-14 18:45:15,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {10473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10473#true} is VALID [2018-11-14 18:45:15,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {10473#true} assume true; {10473#true} is VALID [2018-11-14 18:45:15,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10473#true} {10473#true} #57#return; {10473#true} is VALID [2018-11-14 18:45:15,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {10473#true} call #t~ret4 := main(); {10473#true} is VALID [2018-11-14 18:45:15,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {10473#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {10515#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:15,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {10515#(<= main_~i~0 0)} assume true; {10515#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:15,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {10515#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10515#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:15,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {10515#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10515#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:15,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {10515#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {10476#(<= main_~i~0 1)} assume true; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {10476#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10476#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:15,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {10476#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {10477#(<= main_~i~0 2)} assume true; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {10477#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10477#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:15,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {10477#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {10478#(<= main_~i~0 3)} assume true; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {10478#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10478#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:15,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {10478#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {10479#(<= main_~i~0 4)} assume true; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {10479#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10479#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:15,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {10479#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {10480#(<= main_~i~0 5)} assume true; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {10480#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10480#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:15,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {10480#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {10481#(<= main_~i~0 6)} assume true; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,630 INFO L273 TraceCheckUtils]: 32: Hoare triple {10481#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10481#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:15,631 INFO L273 TraceCheckUtils]: 33: Hoare triple {10481#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {10482#(<= main_~i~0 7)} assume true; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {10482#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10482#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:15,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {10482#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,634 INFO L273 TraceCheckUtils]: 38: Hoare triple {10483#(<= main_~i~0 8)} assume true; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {10483#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10483#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:15,635 INFO L273 TraceCheckUtils]: 41: Hoare triple {10483#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {10484#(<= main_~i~0 9)} assume true; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {10484#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10484#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:15,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {10484#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {10485#(<= main_~i~0 10)} assume true; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,639 INFO L273 TraceCheckUtils]: 47: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {10485#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10485#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:15,640 INFO L273 TraceCheckUtils]: 49: Hoare triple {10485#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {10486#(<= main_~i~0 11)} assume true; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,642 INFO L273 TraceCheckUtils]: 52: Hoare triple {10486#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10486#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:15,642 INFO L273 TraceCheckUtils]: 53: Hoare triple {10486#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {10487#(<= main_~i~0 12)} assume true; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10487#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:15,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {10487#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {10488#(<= main_~i~0 13)} assume true; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,645 INFO L273 TraceCheckUtils]: 59: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {10488#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10488#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:15,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {10488#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,647 INFO L273 TraceCheckUtils]: 62: Hoare triple {10489#(<= main_~i~0 14)} assume true; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {10489#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10489#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:15,649 INFO L273 TraceCheckUtils]: 65: Hoare triple {10489#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {10490#(<= main_~i~0 15)} assume true; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,650 INFO L273 TraceCheckUtils]: 67: Hoare triple {10490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,650 INFO L273 TraceCheckUtils]: 68: Hoare triple {10490#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10490#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:15,651 INFO L273 TraceCheckUtils]: 69: Hoare triple {10490#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,652 INFO L273 TraceCheckUtils]: 70: Hoare triple {10491#(<= main_~i~0 16)} assume true; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,652 INFO L273 TraceCheckUtils]: 71: Hoare triple {10491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,653 INFO L273 TraceCheckUtils]: 72: Hoare triple {10491#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10491#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:15,653 INFO L273 TraceCheckUtils]: 73: Hoare triple {10491#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,654 INFO L273 TraceCheckUtils]: 74: Hoare triple {10492#(<= main_~i~0 17)} assume true; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,654 INFO L273 TraceCheckUtils]: 75: Hoare triple {10492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {10492#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10492#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:15,656 INFO L273 TraceCheckUtils]: 77: Hoare triple {10492#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {10493#(<= main_~i~0 18)} assume true; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {10493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,657 INFO L273 TraceCheckUtils]: 80: Hoare triple {10493#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10493#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:15,658 INFO L273 TraceCheckUtils]: 81: Hoare triple {10493#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,658 INFO L273 TraceCheckUtils]: 82: Hoare triple {10494#(<= main_~i~0 19)} assume true; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,659 INFO L273 TraceCheckUtils]: 83: Hoare triple {10494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {10494#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10494#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:15,660 INFO L273 TraceCheckUtils]: 85: Hoare triple {10494#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,660 INFO L273 TraceCheckUtils]: 86: Hoare triple {10495#(<= main_~i~0 20)} assume true; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,661 INFO L273 TraceCheckUtils]: 87: Hoare triple {10495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,661 INFO L273 TraceCheckUtils]: 88: Hoare triple {10495#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {10495#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:15,662 INFO L273 TraceCheckUtils]: 89: Hoare triple {10495#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {10496#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:15,663 INFO L273 TraceCheckUtils]: 90: Hoare triple {10496#(<= main_~i~0 21)} assume true; {10496#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:15,663 INFO L273 TraceCheckUtils]: 91: Hoare triple {10496#(<= main_~i~0 21)} assume !(~i~0 < 100000); {10474#false} is VALID [2018-11-14 18:45:15,663 INFO L273 TraceCheckUtils]: 92: Hoare triple {10474#false} havoc ~x~0;~x~0 := 0; {10474#false} is VALID [2018-11-14 18:45:15,664 INFO L273 TraceCheckUtils]: 93: Hoare triple {10474#false} assume true; {10474#false} is VALID [2018-11-14 18:45:15,664 INFO L273 TraceCheckUtils]: 94: Hoare triple {10474#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10474#false} is VALID [2018-11-14 18:45:15,664 INFO L256 TraceCheckUtils]: 95: Hoare triple {10474#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {10474#false} is VALID [2018-11-14 18:45:15,664 INFO L273 TraceCheckUtils]: 96: Hoare triple {10474#false} ~cond := #in~cond; {10474#false} is VALID [2018-11-14 18:45:15,664 INFO L273 TraceCheckUtils]: 97: Hoare triple {10474#false} assume ~cond == 0; {10474#false} is VALID [2018-11-14 18:45:15,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {10474#false} assume !false; {10474#false} is VALID [2018-11-14 18:45:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:15,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:15,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 18:45:15,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-14 18:45:15,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:15,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:45:15,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:15,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:45:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:45:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:45:15,788 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 25 states. [2018-11-14 18:45:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:16,058 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2018-11-14 18:45:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:45:16,058 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-14 18:45:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:45:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 147 transitions. [2018-11-14 18:45:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:45:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 147 transitions. [2018-11-14 18:45:16,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 147 transitions. [2018-11-14 18:45:16,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:16,192 INFO L225 Difference]: With dead ends: 122 [2018-11-14 18:45:16,192 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 18:45:16,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:45:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 18:45:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-14 18:45:16,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:16,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 108 states. [2018-11-14 18:45:16,211 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 108 states. [2018-11-14 18:45:16,211 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 108 states. [2018-11-14 18:45:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:16,214 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-14 18:45:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-14 18:45:16,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:16,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:16,214 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 110 states. [2018-11-14 18:45:16,214 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 110 states. [2018-11-14 18:45:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:16,216 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2018-11-14 18:45:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-14 18:45:16,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:16,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:16,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:16,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 18:45:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-11-14 18:45:16,218 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 99 [2018-11-14 18:45:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:16,218 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-11-14 18:45:16,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:45:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-11-14 18:45:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 18:45:16,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:16,219 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:16,219 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:16,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1074296858, now seen corresponding path program 22 times [2018-11-14 18:45:16,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:16,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:16,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {11307#true} call ULTIMATE.init(); {11307#true} is VALID [2018-11-14 18:45:16,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {11307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11307#true} is VALID [2018-11-14 18:45:16,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {11307#true} assume true; {11307#true} is VALID [2018-11-14 18:45:16,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11307#true} {11307#true} #57#return; {11307#true} is VALID [2018-11-14 18:45:16,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {11307#true} call #t~ret4 := main(); {11307#true} is VALID [2018-11-14 18:45:16,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {11307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11309#(= main_~i~0 0)} is VALID [2018-11-14 18:45:16,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {11309#(= main_~i~0 0)} assume true; {11309#(= main_~i~0 0)} is VALID [2018-11-14 18:45:16,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {11309#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11309#(= main_~i~0 0)} is VALID [2018-11-14 18:45:16,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11309#(= main_~i~0 0)} is VALID [2018-11-14 18:45:16,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {11309#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:16,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {11310#(<= main_~i~0 1)} assume true; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:16,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {11310#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:16,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {11310#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:16,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {11310#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:16,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {11311#(<= main_~i~0 2)} assume true; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:16,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {11311#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:16,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {11311#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:16,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {11311#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:16,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {11312#(<= main_~i~0 3)} assume true; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:16,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {11312#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:16,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {11312#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:16,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {11312#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:16,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {11313#(<= main_~i~0 4)} assume true; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:16,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {11313#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:16,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {11313#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:16,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {11313#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:16,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {11314#(<= main_~i~0 5)} assume true; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:16,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {11314#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:16,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {11314#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:16,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {11314#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:16,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {11315#(<= main_~i~0 6)} assume true; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:16,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {11315#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:16,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {11315#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:16,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {11315#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:16,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {11316#(<= main_~i~0 7)} assume true; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:16,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {11316#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:16,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {11316#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:16,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {11316#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:16,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {11317#(<= main_~i~0 8)} assume true; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:16,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {11317#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:16,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {11317#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:16,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {11317#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:16,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {11318#(<= main_~i~0 9)} assume true; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:16,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {11318#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:16,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {11318#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:16,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {11318#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:16,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {11319#(<= main_~i~0 10)} assume true; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:16,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {11319#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:16,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {11319#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:16,669 INFO L273 TraceCheckUtils]: 49: Hoare triple {11319#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:16,669 INFO L273 TraceCheckUtils]: 50: Hoare triple {11320#(<= main_~i~0 11)} assume true; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:16,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {11320#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:16,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {11320#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:16,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {11320#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:16,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {11321#(<= main_~i~0 12)} assume true; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:16,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {11321#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:16,672 INFO L273 TraceCheckUtils]: 56: Hoare triple {11321#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:16,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {11321#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:16,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {11322#(<= main_~i~0 13)} assume true; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:16,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {11322#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:16,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {11322#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:16,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {11322#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:16,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {11323#(<= main_~i~0 14)} assume true; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:16,676 INFO L273 TraceCheckUtils]: 63: Hoare triple {11323#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:16,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {11323#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:16,677 INFO L273 TraceCheckUtils]: 65: Hoare triple {11323#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:16,678 INFO L273 TraceCheckUtils]: 66: Hoare triple {11324#(<= main_~i~0 15)} assume true; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:16,678 INFO L273 TraceCheckUtils]: 67: Hoare triple {11324#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:16,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {11324#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:16,679 INFO L273 TraceCheckUtils]: 69: Hoare triple {11324#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:16,680 INFO L273 TraceCheckUtils]: 70: Hoare triple {11325#(<= main_~i~0 16)} assume true; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:16,680 INFO L273 TraceCheckUtils]: 71: Hoare triple {11325#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:16,681 INFO L273 TraceCheckUtils]: 72: Hoare triple {11325#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:16,682 INFO L273 TraceCheckUtils]: 73: Hoare triple {11325#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:16,682 INFO L273 TraceCheckUtils]: 74: Hoare triple {11326#(<= main_~i~0 17)} assume true; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:16,683 INFO L273 TraceCheckUtils]: 75: Hoare triple {11326#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:16,683 INFO L273 TraceCheckUtils]: 76: Hoare triple {11326#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:16,684 INFO L273 TraceCheckUtils]: 77: Hoare triple {11326#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:16,684 INFO L273 TraceCheckUtils]: 78: Hoare triple {11327#(<= main_~i~0 18)} assume true; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:16,685 INFO L273 TraceCheckUtils]: 79: Hoare triple {11327#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:16,685 INFO L273 TraceCheckUtils]: 80: Hoare triple {11327#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:16,686 INFO L273 TraceCheckUtils]: 81: Hoare triple {11327#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:16,686 INFO L273 TraceCheckUtils]: 82: Hoare triple {11328#(<= main_~i~0 19)} assume true; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:16,687 INFO L273 TraceCheckUtils]: 83: Hoare triple {11328#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:16,687 INFO L273 TraceCheckUtils]: 84: Hoare triple {11328#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:16,688 INFO L273 TraceCheckUtils]: 85: Hoare triple {11328#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:16,689 INFO L273 TraceCheckUtils]: 86: Hoare triple {11329#(<= main_~i~0 20)} assume true; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:16,689 INFO L273 TraceCheckUtils]: 87: Hoare triple {11329#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:16,689 INFO L273 TraceCheckUtils]: 88: Hoare triple {11329#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:16,690 INFO L273 TraceCheckUtils]: 89: Hoare triple {11329#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:16,691 INFO L273 TraceCheckUtils]: 90: Hoare triple {11330#(<= main_~i~0 21)} assume true; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:16,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {11330#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:16,692 INFO L273 TraceCheckUtils]: 92: Hoare triple {11330#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:16,692 INFO L273 TraceCheckUtils]: 93: Hoare triple {11330#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {11331#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:16,693 INFO L273 TraceCheckUtils]: 94: Hoare triple {11331#(<= main_~i~0 22)} assume true; {11331#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:16,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {11331#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11308#false} is VALID [2018-11-14 18:45:16,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {11308#false} havoc ~x~0;~x~0 := 0; {11308#false} is VALID [2018-11-14 18:45:16,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {11308#false} assume true; {11308#false} is VALID [2018-11-14 18:45:16,694 INFO L273 TraceCheckUtils]: 98: Hoare triple {11308#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11308#false} is VALID [2018-11-14 18:45:16,694 INFO L256 TraceCheckUtils]: 99: Hoare triple {11308#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {11308#false} is VALID [2018-11-14 18:45:16,694 INFO L273 TraceCheckUtils]: 100: Hoare triple {11308#false} ~cond := #in~cond; {11308#false} is VALID [2018-11-14 18:45:16,695 INFO L273 TraceCheckUtils]: 101: Hoare triple {11308#false} assume ~cond == 0; {11308#false} is VALID [2018-11-14 18:45:16,695 INFO L273 TraceCheckUtils]: 102: Hoare triple {11308#false} assume !false; {11308#false} is VALID [2018-11-14 18:45:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:16,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:16,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:16,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:45:16,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:45:16,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:16,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:17,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {11307#true} call ULTIMATE.init(); {11307#true} is VALID [2018-11-14 18:45:17,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {11307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11307#true} is VALID [2018-11-14 18:45:17,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {11307#true} assume true; {11307#true} is VALID [2018-11-14 18:45:17,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11307#true} {11307#true} #57#return; {11307#true} is VALID [2018-11-14 18:45:17,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {11307#true} call #t~ret4 := main(); {11307#true} is VALID [2018-11-14 18:45:17,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {11307#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {11350#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:17,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {11350#(<= main_~i~0 0)} assume true; {11350#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:17,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {11350#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11350#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:17,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {11350#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11350#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:17,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {11350#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:17,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {11310#(<= main_~i~0 1)} assume true; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:17,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {11310#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:17,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {11310#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11310#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:17,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {11310#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:17,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {11311#(<= main_~i~0 2)} assume true; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:17,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {11311#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:17,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {11311#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11311#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:17,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {11311#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:17,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {11312#(<= main_~i~0 3)} assume true; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:17,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {11312#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:17,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {11312#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11312#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:17,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {11312#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:17,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {11313#(<= main_~i~0 4)} assume true; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:17,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {11313#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:17,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {11313#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11313#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:17,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {11313#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:17,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {11314#(<= main_~i~0 5)} assume true; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:17,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {11314#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:17,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {11314#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11314#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:17,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {11314#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:17,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {11315#(<= main_~i~0 6)} assume true; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:17,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {11315#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:17,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {11315#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11315#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:17,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {11315#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:17,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {11316#(<= main_~i~0 7)} assume true; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:17,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {11316#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:17,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {11316#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11316#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:17,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {11316#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:17,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {11317#(<= main_~i~0 8)} assume true; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:17,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {11317#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:17,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {11317#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11317#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:17,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {11317#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:17,172 INFO L273 TraceCheckUtils]: 42: Hoare triple {11318#(<= main_~i~0 9)} assume true; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:17,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {11318#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:17,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {11318#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11318#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:17,178 INFO L273 TraceCheckUtils]: 45: Hoare triple {11318#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:17,178 INFO L273 TraceCheckUtils]: 46: Hoare triple {11319#(<= main_~i~0 10)} assume true; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:17,180 INFO L273 TraceCheckUtils]: 47: Hoare triple {11319#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:17,180 INFO L273 TraceCheckUtils]: 48: Hoare triple {11319#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11319#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:17,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {11319#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:17,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {11320#(<= main_~i~0 11)} assume true; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:17,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {11320#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:17,186 INFO L273 TraceCheckUtils]: 52: Hoare triple {11320#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11320#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:17,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {11320#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:17,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {11321#(<= main_~i~0 12)} assume true; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:17,191 INFO L273 TraceCheckUtils]: 55: Hoare triple {11321#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:17,206 INFO L273 TraceCheckUtils]: 56: Hoare triple {11321#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11321#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:17,217 INFO L273 TraceCheckUtils]: 57: Hoare triple {11321#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:17,219 INFO L273 TraceCheckUtils]: 58: Hoare triple {11322#(<= main_~i~0 13)} assume true; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:17,219 INFO L273 TraceCheckUtils]: 59: Hoare triple {11322#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:17,221 INFO L273 TraceCheckUtils]: 60: Hoare triple {11322#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11322#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:17,221 INFO L273 TraceCheckUtils]: 61: Hoare triple {11322#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:17,221 INFO L273 TraceCheckUtils]: 62: Hoare triple {11323#(<= main_~i~0 14)} assume true; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:17,222 INFO L273 TraceCheckUtils]: 63: Hoare triple {11323#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:17,223 INFO L273 TraceCheckUtils]: 64: Hoare triple {11323#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11323#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:17,223 INFO L273 TraceCheckUtils]: 65: Hoare triple {11323#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:17,225 INFO L273 TraceCheckUtils]: 66: Hoare triple {11324#(<= main_~i~0 15)} assume true; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:17,225 INFO L273 TraceCheckUtils]: 67: Hoare triple {11324#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:17,227 INFO L273 TraceCheckUtils]: 68: Hoare triple {11324#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11324#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:17,227 INFO L273 TraceCheckUtils]: 69: Hoare triple {11324#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:17,230 INFO L273 TraceCheckUtils]: 70: Hoare triple {11325#(<= main_~i~0 16)} assume true; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:17,230 INFO L273 TraceCheckUtils]: 71: Hoare triple {11325#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:17,233 INFO L273 TraceCheckUtils]: 72: Hoare triple {11325#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11325#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:17,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {11325#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:17,235 INFO L273 TraceCheckUtils]: 74: Hoare triple {11326#(<= main_~i~0 17)} assume true; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:17,235 INFO L273 TraceCheckUtils]: 75: Hoare triple {11326#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:17,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {11326#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11326#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:17,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {11326#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:17,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {11327#(<= main_~i~0 18)} assume true; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:17,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {11327#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:17,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {11327#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11327#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:17,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {11327#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:17,242 INFO L273 TraceCheckUtils]: 82: Hoare triple {11328#(<= main_~i~0 19)} assume true; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:17,244 INFO L273 TraceCheckUtils]: 83: Hoare triple {11328#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:17,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {11328#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11328#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:17,246 INFO L273 TraceCheckUtils]: 85: Hoare triple {11328#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:17,246 INFO L273 TraceCheckUtils]: 86: Hoare triple {11329#(<= main_~i~0 20)} assume true; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:17,248 INFO L273 TraceCheckUtils]: 87: Hoare triple {11329#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:17,248 INFO L273 TraceCheckUtils]: 88: Hoare triple {11329#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11329#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:17,251 INFO L273 TraceCheckUtils]: 89: Hoare triple {11329#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:17,251 INFO L273 TraceCheckUtils]: 90: Hoare triple {11330#(<= main_~i~0 21)} assume true; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:17,254 INFO L273 TraceCheckUtils]: 91: Hoare triple {11330#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:17,254 INFO L273 TraceCheckUtils]: 92: Hoare triple {11330#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {11330#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:17,257 INFO L273 TraceCheckUtils]: 93: Hoare triple {11330#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {11331#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:17,257 INFO L273 TraceCheckUtils]: 94: Hoare triple {11331#(<= main_~i~0 22)} assume true; {11331#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 95: Hoare triple {11331#(<= main_~i~0 22)} assume !(~i~0 < 100000); {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 96: Hoare triple {11308#false} havoc ~x~0;~x~0 := 0; {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 97: Hoare triple {11308#false} assume true; {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 98: Hoare triple {11308#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L256 TraceCheckUtils]: 99: Hoare triple {11308#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 100: Hoare triple {11308#false} ~cond := #in~cond; {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 101: Hoare triple {11308#false} assume ~cond == 0; {11308#false} is VALID [2018-11-14 18:45:17,260 INFO L273 TraceCheckUtils]: 102: Hoare triple {11308#false} assume !false; {11308#false} is VALID [2018-11-14 18:45:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:17,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:17,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 18:45:17,287 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-14 18:45:17,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:17,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:45:17,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:17,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:45:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:45:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:45:17,416 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 26 states. [2018-11-14 18:45:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:17,777 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2018-11-14 18:45:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:45:17,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-14 18:45:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:45:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-14 18:45:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:45:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-14 18:45:17,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 152 transitions. [2018-11-14 18:45:17,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:17,927 INFO L225 Difference]: With dead ends: 126 [2018-11-14 18:45:17,927 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 18:45:17,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:45:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 18:45:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-14 18:45:17,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:17,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-14 18:45:17,963 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-14 18:45:17,964 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-14 18:45:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:17,965 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 18:45:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 18:45:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:17,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:17,966 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-14 18:45:17,966 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-14 18:45:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:17,968 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 18:45:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 18:45:17,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:17,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:17,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:17,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-14 18:45:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2018-11-14 18:45:17,970 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 103 [2018-11-14 18:45:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:17,970 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2018-11-14 18:45:17,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:45:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2018-11-14 18:45:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-14 18:45:17,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:17,971 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:17,972 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash -5783236, now seen corresponding path program 23 times [2018-11-14 18:45:17,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:17,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:18,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {12172#true} call ULTIMATE.init(); {12172#true} is VALID [2018-11-14 18:45:18,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {12172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12172#true} is VALID [2018-11-14 18:45:18,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {12172#true} assume true; {12172#true} is VALID [2018-11-14 18:45:18,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12172#true} {12172#true} #57#return; {12172#true} is VALID [2018-11-14 18:45:18,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {12172#true} call #t~ret4 := main(); {12172#true} is VALID [2018-11-14 18:45:18,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {12172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12174#(= main_~i~0 0)} is VALID [2018-11-14 18:45:18,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {12174#(= main_~i~0 0)} assume true; {12174#(= main_~i~0 0)} is VALID [2018-11-14 18:45:18,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {12174#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12174#(= main_~i~0 0)} is VALID [2018-11-14 18:45:18,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {12174#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12174#(= main_~i~0 0)} is VALID [2018-11-14 18:45:18,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {12174#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {12175#(<= main_~i~0 1)} assume true; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {12175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {12175#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {12175#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {12176#(<= main_~i~0 2)} assume true; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {12176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {12176#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {12176#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {12177#(<= main_~i~0 3)} assume true; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {12177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {12177#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {12177#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {12178#(<= main_~i~0 4)} assume true; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {12178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {12178#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {12178#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {12179#(<= main_~i~0 5)} assume true; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {12179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {12179#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {12179#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {12180#(<= main_~i~0 6)} assume true; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {12180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {12180#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {12180#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {12181#(<= main_~i~0 7)} assume true; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {12181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {12181#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,559 INFO L273 TraceCheckUtils]: 37: Hoare triple {12181#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {12182#(<= main_~i~0 8)} assume true; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,563 INFO L273 TraceCheckUtils]: 39: Hoare triple {12182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,563 INFO L273 TraceCheckUtils]: 40: Hoare triple {12182#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {12182#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {12183#(<= main_~i~0 9)} assume true; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {12183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {12183#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {12183#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {12184#(<= main_~i~0 10)} assume true; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {12184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {12184#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {12184#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {12185#(<= main_~i~0 11)} assume true; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,567 INFO L273 TraceCheckUtils]: 51: Hoare triple {12185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {12185#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,568 INFO L273 TraceCheckUtils]: 53: Hoare triple {12185#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,569 INFO L273 TraceCheckUtils]: 54: Hoare triple {12186#(<= main_~i~0 12)} assume true; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,569 INFO L273 TraceCheckUtils]: 55: Hoare triple {12186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,570 INFO L273 TraceCheckUtils]: 56: Hoare triple {12186#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {12186#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {12187#(<= main_~i~0 13)} assume true; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,571 INFO L273 TraceCheckUtils]: 59: Hoare triple {12187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,572 INFO L273 TraceCheckUtils]: 60: Hoare triple {12187#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {12187#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {12188#(<= main_~i~0 14)} assume true; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {12188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,574 INFO L273 TraceCheckUtils]: 64: Hoare triple {12188#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,575 INFO L273 TraceCheckUtils]: 65: Hoare triple {12188#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,575 INFO L273 TraceCheckUtils]: 66: Hoare triple {12189#(<= main_~i~0 15)} assume true; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,576 INFO L273 TraceCheckUtils]: 67: Hoare triple {12189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,576 INFO L273 TraceCheckUtils]: 68: Hoare triple {12189#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,577 INFO L273 TraceCheckUtils]: 69: Hoare triple {12189#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {12190#(<= main_~i~0 16)} assume true; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {12190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {12190#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,580 INFO L273 TraceCheckUtils]: 73: Hoare triple {12190#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,580 INFO L273 TraceCheckUtils]: 74: Hoare triple {12191#(<= main_~i~0 17)} assume true; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,581 INFO L273 TraceCheckUtils]: 75: Hoare triple {12191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {12191#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {12191#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {12192#(<= main_~i~0 18)} assume true; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,583 INFO L273 TraceCheckUtils]: 79: Hoare triple {12192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {12192#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,584 INFO L273 TraceCheckUtils]: 81: Hoare triple {12192#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {12193#(<= main_~i~0 19)} assume true; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,585 INFO L273 TraceCheckUtils]: 83: Hoare triple {12193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {12193#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,586 INFO L273 TraceCheckUtils]: 85: Hoare triple {12193#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,587 INFO L273 TraceCheckUtils]: 86: Hoare triple {12194#(<= main_~i~0 20)} assume true; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,587 INFO L273 TraceCheckUtils]: 87: Hoare triple {12194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,588 INFO L273 TraceCheckUtils]: 88: Hoare triple {12194#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,589 INFO L273 TraceCheckUtils]: 89: Hoare triple {12194#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,589 INFO L273 TraceCheckUtils]: 90: Hoare triple {12195#(<= main_~i~0 21)} assume true; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,590 INFO L273 TraceCheckUtils]: 91: Hoare triple {12195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,590 INFO L273 TraceCheckUtils]: 92: Hoare triple {12195#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,591 INFO L273 TraceCheckUtils]: 93: Hoare triple {12195#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,591 INFO L273 TraceCheckUtils]: 94: Hoare triple {12196#(<= main_~i~0 22)} assume true; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,592 INFO L273 TraceCheckUtils]: 95: Hoare triple {12196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,592 INFO L273 TraceCheckUtils]: 96: Hoare triple {12196#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,593 INFO L273 TraceCheckUtils]: 97: Hoare triple {12196#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {12197#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:18,594 INFO L273 TraceCheckUtils]: 98: Hoare triple {12197#(<= main_~i~0 23)} assume true; {12197#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:18,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {12197#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12173#false} is VALID [2018-11-14 18:45:18,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {12173#false} havoc ~x~0;~x~0 := 0; {12173#false} is VALID [2018-11-14 18:45:18,595 INFO L273 TraceCheckUtils]: 101: Hoare triple {12173#false} assume true; {12173#false} is VALID [2018-11-14 18:45:18,595 INFO L273 TraceCheckUtils]: 102: Hoare triple {12173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12173#false} is VALID [2018-11-14 18:45:18,595 INFO L256 TraceCheckUtils]: 103: Hoare triple {12173#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12173#false} is VALID [2018-11-14 18:45:18,595 INFO L273 TraceCheckUtils]: 104: Hoare triple {12173#false} ~cond := #in~cond; {12173#false} is VALID [2018-11-14 18:45:18,595 INFO L273 TraceCheckUtils]: 105: Hoare triple {12173#false} assume ~cond == 0; {12173#false} is VALID [2018-11-14 18:45:18,596 INFO L273 TraceCheckUtils]: 106: Hoare triple {12173#false} assume !false; {12173#false} is VALID [2018-11-14 18:45:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:18,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:18,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:18,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:45:18,669 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 18:45:18,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:18,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:18,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {12172#true} call ULTIMATE.init(); {12172#true} is VALID [2018-11-14 18:45:18,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {12172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12172#true} is VALID [2018-11-14 18:45:18,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {12172#true} assume true; {12172#true} is VALID [2018-11-14 18:45:18,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12172#true} {12172#true} #57#return; {12172#true} is VALID [2018-11-14 18:45:18,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {12172#true} call #t~ret4 := main(); {12172#true} is VALID [2018-11-14 18:45:18,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {12172#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {12216#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:18,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {12216#(<= main_~i~0 0)} assume true; {12216#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:18,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {12216#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12216#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:18,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {12216#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12216#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:18,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {12216#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {12175#(<= main_~i~0 1)} assume true; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {12175#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {12175#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12175#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:18,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {12175#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {12176#(<= main_~i~0 2)} assume true; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {12176#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {12176#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12176#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:18,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {12176#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {12177#(<= main_~i~0 3)} assume true; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {12177#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {12177#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12177#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:18,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {12177#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {12178#(<= main_~i~0 4)} assume true; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {12178#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {12178#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12178#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:18,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {12178#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {12179#(<= main_~i~0 5)} assume true; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {12179#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,914 INFO L273 TraceCheckUtils]: 28: Hoare triple {12179#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12179#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:18,915 INFO L273 TraceCheckUtils]: 29: Hoare triple {12179#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {12180#(<= main_~i~0 6)} assume true; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {12180#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {12180#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12180#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:18,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {12180#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {12181#(<= main_~i~0 7)} assume true; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,918 INFO L273 TraceCheckUtils]: 35: Hoare triple {12181#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {12181#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12181#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:18,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {12181#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {12182#(<= main_~i~0 8)} assume true; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {12182#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {12182#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12182#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:18,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {12182#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {12183#(<= main_~i~0 9)} assume true; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,922 INFO L273 TraceCheckUtils]: 43: Hoare triple {12183#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,923 INFO L273 TraceCheckUtils]: 44: Hoare triple {12183#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12183#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:18,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {12183#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {12184#(<= main_~i~0 10)} assume true; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {12184#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {12184#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12184#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:18,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {12184#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,926 INFO L273 TraceCheckUtils]: 50: Hoare triple {12185#(<= main_~i~0 11)} assume true; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {12185#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {12185#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12185#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:18,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {12185#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {12186#(<= main_~i~0 12)} assume true; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,929 INFO L273 TraceCheckUtils]: 55: Hoare triple {12186#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,929 INFO L273 TraceCheckUtils]: 56: Hoare triple {12186#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12186#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:18,930 INFO L273 TraceCheckUtils]: 57: Hoare triple {12186#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,930 INFO L273 TraceCheckUtils]: 58: Hoare triple {12187#(<= main_~i~0 13)} assume true; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,931 INFO L273 TraceCheckUtils]: 59: Hoare triple {12187#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,931 INFO L273 TraceCheckUtils]: 60: Hoare triple {12187#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12187#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:18,932 INFO L273 TraceCheckUtils]: 61: Hoare triple {12187#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,933 INFO L273 TraceCheckUtils]: 62: Hoare triple {12188#(<= main_~i~0 14)} assume true; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,933 INFO L273 TraceCheckUtils]: 63: Hoare triple {12188#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {12188#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12188#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:18,934 INFO L273 TraceCheckUtils]: 65: Hoare triple {12188#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,935 INFO L273 TraceCheckUtils]: 66: Hoare triple {12189#(<= main_~i~0 15)} assume true; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,935 INFO L273 TraceCheckUtils]: 67: Hoare triple {12189#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {12189#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12189#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:18,936 INFO L273 TraceCheckUtils]: 69: Hoare triple {12189#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {12190#(<= main_~i~0 16)} assume true; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {12190#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {12190#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12190#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:18,938 INFO L273 TraceCheckUtils]: 73: Hoare triple {12190#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,939 INFO L273 TraceCheckUtils]: 74: Hoare triple {12191#(<= main_~i~0 17)} assume true; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,939 INFO L273 TraceCheckUtils]: 75: Hoare triple {12191#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,940 INFO L273 TraceCheckUtils]: 76: Hoare triple {12191#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12191#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:18,941 INFO L273 TraceCheckUtils]: 77: Hoare triple {12191#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,941 INFO L273 TraceCheckUtils]: 78: Hoare triple {12192#(<= main_~i~0 18)} assume true; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,942 INFO L273 TraceCheckUtils]: 79: Hoare triple {12192#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,942 INFO L273 TraceCheckUtils]: 80: Hoare triple {12192#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12192#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:18,943 INFO L273 TraceCheckUtils]: 81: Hoare triple {12192#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,943 INFO L273 TraceCheckUtils]: 82: Hoare triple {12193#(<= main_~i~0 19)} assume true; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,944 INFO L273 TraceCheckUtils]: 83: Hoare triple {12193#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,944 INFO L273 TraceCheckUtils]: 84: Hoare triple {12193#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12193#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:18,945 INFO L273 TraceCheckUtils]: 85: Hoare triple {12193#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,945 INFO L273 TraceCheckUtils]: 86: Hoare triple {12194#(<= main_~i~0 20)} assume true; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,946 INFO L273 TraceCheckUtils]: 87: Hoare triple {12194#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,946 INFO L273 TraceCheckUtils]: 88: Hoare triple {12194#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12194#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:18,947 INFO L273 TraceCheckUtils]: 89: Hoare triple {12194#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,947 INFO L273 TraceCheckUtils]: 90: Hoare triple {12195#(<= main_~i~0 21)} assume true; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,948 INFO L273 TraceCheckUtils]: 91: Hoare triple {12195#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,948 INFO L273 TraceCheckUtils]: 92: Hoare triple {12195#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12195#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:18,949 INFO L273 TraceCheckUtils]: 93: Hoare triple {12195#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,950 INFO L273 TraceCheckUtils]: 94: Hoare triple {12196#(<= main_~i~0 22)} assume true; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,950 INFO L273 TraceCheckUtils]: 95: Hoare triple {12196#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,951 INFO L273 TraceCheckUtils]: 96: Hoare triple {12196#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {12196#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:18,951 INFO L273 TraceCheckUtils]: 97: Hoare triple {12196#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {12197#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:18,952 INFO L273 TraceCheckUtils]: 98: Hoare triple {12197#(<= main_~i~0 23)} assume true; {12197#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:18,953 INFO L273 TraceCheckUtils]: 99: Hoare triple {12197#(<= main_~i~0 23)} assume !(~i~0 < 100000); {12173#false} is VALID [2018-11-14 18:45:18,953 INFO L273 TraceCheckUtils]: 100: Hoare triple {12173#false} havoc ~x~0;~x~0 := 0; {12173#false} is VALID [2018-11-14 18:45:18,953 INFO L273 TraceCheckUtils]: 101: Hoare triple {12173#false} assume true; {12173#false} is VALID [2018-11-14 18:45:18,953 INFO L273 TraceCheckUtils]: 102: Hoare triple {12173#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12173#false} is VALID [2018-11-14 18:45:18,953 INFO L256 TraceCheckUtils]: 103: Hoare triple {12173#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {12173#false} is VALID [2018-11-14 18:45:18,954 INFO L273 TraceCheckUtils]: 104: Hoare triple {12173#false} ~cond := #in~cond; {12173#false} is VALID [2018-11-14 18:45:18,954 INFO L273 TraceCheckUtils]: 105: Hoare triple {12173#false} assume ~cond == 0; {12173#false} is VALID [2018-11-14 18:45:18,954 INFO L273 TraceCheckUtils]: 106: Hoare triple {12173#false} assume !false; {12173#false} is VALID [2018-11-14 18:45:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:18,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:18,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 18:45:18,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-14 18:45:18,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:18,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:45:19,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:19,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:45:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:45:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:45:19,090 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 27 states. [2018-11-14 18:45:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:19,671 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-14 18:45:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:45:19,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-14 18:45:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:45:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 157 transitions. [2018-11-14 18:45:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:45:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 157 transitions. [2018-11-14 18:45:19,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 157 transitions. [2018-11-14 18:45:19,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:19,812 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:45:19,812 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 18:45:19,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:45:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 18:45:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-11-14 18:45:19,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:19,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2018-11-14 18:45:19,870 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2018-11-14 18:45:19,870 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2018-11-14 18:45:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:19,872 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-11-14 18:45:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-14 18:45:19,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:19,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:19,872 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2018-11-14 18:45:19,873 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2018-11-14 18:45:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:19,875 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-11-14 18:45:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-14 18:45:19,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:19,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:19,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:19,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-14 18:45:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2018-11-14 18:45:19,877 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 107 [2018-11-14 18:45:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:19,878 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2018-11-14 18:45:19,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:45:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2018-11-14 18:45:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-14 18:45:19,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:19,879 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:19,879 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:19,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 256860050, now seen corresponding path program 24 times [2018-11-14 18:45:19,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:19,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:20,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {13068#true} call ULTIMATE.init(); {13068#true} is VALID [2018-11-14 18:45:20,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {13068#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13068#true} is VALID [2018-11-14 18:45:20,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {13068#true} assume true; {13068#true} is VALID [2018-11-14 18:45:20,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13068#true} {13068#true} #57#return; {13068#true} is VALID [2018-11-14 18:45:20,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {13068#true} call #t~ret4 := main(); {13068#true} is VALID [2018-11-14 18:45:20,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {13068#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13070#(= main_~i~0 0)} is VALID [2018-11-14 18:45:20,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {13070#(= main_~i~0 0)} assume true; {13070#(= main_~i~0 0)} is VALID [2018-11-14 18:45:20,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {13070#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13070#(= main_~i~0 0)} is VALID [2018-11-14 18:45:20,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {13070#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13070#(= main_~i~0 0)} is VALID [2018-11-14 18:45:20,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {13070#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:20,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {13071#(<= main_~i~0 1)} assume true; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:20,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {13071#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:20,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {13071#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:20,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {13071#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:20,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {13072#(<= main_~i~0 2)} assume true; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:20,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {13072#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:20,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {13072#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:20,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {13072#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:20,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {13073#(<= main_~i~0 3)} assume true; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:20,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {13073#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:20,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {13073#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:20,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {13073#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:20,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {13074#(<= main_~i~0 4)} assume true; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:20,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {13074#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:20,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {13074#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:20,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {13074#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:20,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {13075#(<= main_~i~0 5)} assume true; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:20,814 INFO L273 TraceCheckUtils]: 27: Hoare triple {13075#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:20,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {13075#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:20,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {13075#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:20,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {13076#(<= main_~i~0 6)} assume true; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:20,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {13076#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:20,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {13076#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:20,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {13076#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:20,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {13077#(<= main_~i~0 7)} assume true; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:20,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {13077#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:20,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {13077#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:20,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {13077#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:20,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {13078#(<= main_~i~0 8)} assume true; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:20,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {13078#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:20,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {13078#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:20,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {13078#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:20,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {13079#(<= main_~i~0 9)} assume true; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:20,822 INFO L273 TraceCheckUtils]: 43: Hoare triple {13079#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:20,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {13079#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:20,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {13079#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:20,824 INFO L273 TraceCheckUtils]: 46: Hoare triple {13080#(<= main_~i~0 10)} assume true; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:20,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {13080#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:20,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {13080#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:20,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {13080#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:20,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {13081#(<= main_~i~0 11)} assume true; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:20,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {13081#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:20,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {13081#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:20,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {13081#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:20,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {13082#(<= main_~i~0 12)} assume true; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:20,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {13082#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:20,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {13082#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:20,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {13082#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:20,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {13083#(<= main_~i~0 13)} assume true; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:20,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {13083#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:20,831 INFO L273 TraceCheckUtils]: 60: Hoare triple {13083#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:20,832 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:20,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {13084#(<= main_~i~0 14)} assume true; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:20,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:20,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:20,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:20,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {13085#(<= main_~i~0 15)} assume true; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:20,835 INFO L273 TraceCheckUtils]: 67: Hoare triple {13085#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:20,835 INFO L273 TraceCheckUtils]: 68: Hoare triple {13085#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:20,836 INFO L273 TraceCheckUtils]: 69: Hoare triple {13085#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:20,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {13086#(<= main_~i~0 16)} assume true; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:20,837 INFO L273 TraceCheckUtils]: 71: Hoare triple {13086#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:20,837 INFO L273 TraceCheckUtils]: 72: Hoare triple {13086#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:20,838 INFO L273 TraceCheckUtils]: 73: Hoare triple {13086#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:20,839 INFO L273 TraceCheckUtils]: 74: Hoare triple {13087#(<= main_~i~0 17)} assume true; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:20,839 INFO L273 TraceCheckUtils]: 75: Hoare triple {13087#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:20,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {13087#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:20,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {13087#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:20,841 INFO L273 TraceCheckUtils]: 78: Hoare triple {13088#(<= main_~i~0 18)} assume true; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:20,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {13088#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:20,842 INFO L273 TraceCheckUtils]: 80: Hoare triple {13088#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:20,843 INFO L273 TraceCheckUtils]: 81: Hoare triple {13088#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:20,843 INFO L273 TraceCheckUtils]: 82: Hoare triple {13089#(<= main_~i~0 19)} assume true; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:20,844 INFO L273 TraceCheckUtils]: 83: Hoare triple {13089#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:20,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {13089#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:20,845 INFO L273 TraceCheckUtils]: 85: Hoare triple {13089#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:20,845 INFO L273 TraceCheckUtils]: 86: Hoare triple {13090#(<= main_~i~0 20)} assume true; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:20,846 INFO L273 TraceCheckUtils]: 87: Hoare triple {13090#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:20,846 INFO L273 TraceCheckUtils]: 88: Hoare triple {13090#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:20,847 INFO L273 TraceCheckUtils]: 89: Hoare triple {13090#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:20,848 INFO L273 TraceCheckUtils]: 90: Hoare triple {13091#(<= main_~i~0 21)} assume true; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:20,848 INFO L273 TraceCheckUtils]: 91: Hoare triple {13091#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:20,849 INFO L273 TraceCheckUtils]: 92: Hoare triple {13091#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:20,849 INFO L273 TraceCheckUtils]: 93: Hoare triple {13091#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:20,850 INFO L273 TraceCheckUtils]: 94: Hoare triple {13092#(<= main_~i~0 22)} assume true; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:20,850 INFO L273 TraceCheckUtils]: 95: Hoare triple {13092#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:20,851 INFO L273 TraceCheckUtils]: 96: Hoare triple {13092#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:20,851 INFO L273 TraceCheckUtils]: 97: Hoare triple {13092#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:20,852 INFO L273 TraceCheckUtils]: 98: Hoare triple {13093#(<= main_~i~0 23)} assume true; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:20,852 INFO L273 TraceCheckUtils]: 99: Hoare triple {13093#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:20,853 INFO L273 TraceCheckUtils]: 100: Hoare triple {13093#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:20,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {13093#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {13094#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:20,854 INFO L273 TraceCheckUtils]: 102: Hoare triple {13094#(<= main_~i~0 24)} assume true; {13094#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:20,855 INFO L273 TraceCheckUtils]: 103: Hoare triple {13094#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13069#false} is VALID [2018-11-14 18:45:20,855 INFO L273 TraceCheckUtils]: 104: Hoare triple {13069#false} havoc ~x~0;~x~0 := 0; {13069#false} is VALID [2018-11-14 18:45:20,855 INFO L273 TraceCheckUtils]: 105: Hoare triple {13069#false} assume true; {13069#false} is VALID [2018-11-14 18:45:20,855 INFO L273 TraceCheckUtils]: 106: Hoare triple {13069#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13069#false} is VALID [2018-11-14 18:45:20,855 INFO L256 TraceCheckUtils]: 107: Hoare triple {13069#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13069#false} is VALID [2018-11-14 18:45:20,856 INFO L273 TraceCheckUtils]: 108: Hoare triple {13069#false} ~cond := #in~cond; {13069#false} is VALID [2018-11-14 18:45:20,856 INFO L273 TraceCheckUtils]: 109: Hoare triple {13069#false} assume ~cond == 0; {13069#false} is VALID [2018-11-14 18:45:20,856 INFO L273 TraceCheckUtils]: 110: Hoare triple {13069#false} assume !false; {13069#false} is VALID [2018-11-14 18:45:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:20,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:20,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:20,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:45:20,939 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 18:45:20,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:20,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:21,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {13068#true} call ULTIMATE.init(); {13068#true} is VALID [2018-11-14 18:45:21,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {13068#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13068#true} is VALID [2018-11-14 18:45:21,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {13068#true} assume true; {13068#true} is VALID [2018-11-14 18:45:21,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13068#true} {13068#true} #57#return; {13068#true} is VALID [2018-11-14 18:45:21,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {13068#true} call #t~ret4 := main(); {13068#true} is VALID [2018-11-14 18:45:21,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {13068#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13113#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:21,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {13113#(<= main_~i~0 0)} assume true; {13113#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:21,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {13113#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13113#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:21,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {13113#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13113#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:21,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {13113#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:21,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {13071#(<= main_~i~0 1)} assume true; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:21,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {13071#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:21,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {13071#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13071#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:21,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {13071#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:21,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {13072#(<= main_~i~0 2)} assume true; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:21,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {13072#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:21,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {13072#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13072#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:21,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {13072#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:21,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {13073#(<= main_~i~0 3)} assume true; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:21,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {13073#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:21,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {13073#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13073#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:21,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {13073#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:21,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {13074#(<= main_~i~0 4)} assume true; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:21,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {13074#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:21,184 INFO L273 TraceCheckUtils]: 24: Hoare triple {13074#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13074#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:21,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {13074#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:21,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {13075#(<= main_~i~0 5)} assume true; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:21,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {13075#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:21,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {13075#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13075#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:21,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {13075#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:21,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {13076#(<= main_~i~0 6)} assume true; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:21,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {13076#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:21,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {13076#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13076#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:21,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {13076#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:21,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {13077#(<= main_~i~0 7)} assume true; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:21,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {13077#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:21,190 INFO L273 TraceCheckUtils]: 36: Hoare triple {13077#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13077#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:21,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {13077#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:21,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {13078#(<= main_~i~0 8)} assume true; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:21,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {13078#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:21,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {13078#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13078#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:21,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {13078#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:21,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {13079#(<= main_~i~0 9)} assume true; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:21,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {13079#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:21,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {13079#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13079#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:21,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {13079#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:21,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {13080#(<= main_~i~0 10)} assume true; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:21,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {13080#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:21,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {13080#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13080#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:21,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {13080#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:21,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {13081#(<= main_~i~0 11)} assume true; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:21,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {13081#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:21,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {13081#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13081#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:21,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {13081#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:21,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {13082#(<= main_~i~0 12)} assume true; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:21,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {13082#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:21,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {13082#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13082#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:21,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {13082#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:21,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {13083#(<= main_~i~0 13)} assume true; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:21,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {13083#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:21,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {13083#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13083#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:21,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {13083#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:21,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {13084#(<= main_~i~0 14)} assume true; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:21,206 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:21,206 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13084#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:21,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:21,207 INFO L273 TraceCheckUtils]: 66: Hoare triple {13085#(<= main_~i~0 15)} assume true; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:21,208 INFO L273 TraceCheckUtils]: 67: Hoare triple {13085#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:21,208 INFO L273 TraceCheckUtils]: 68: Hoare triple {13085#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13085#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:21,209 INFO L273 TraceCheckUtils]: 69: Hoare triple {13085#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:21,210 INFO L273 TraceCheckUtils]: 70: Hoare triple {13086#(<= main_~i~0 16)} assume true; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:21,210 INFO L273 TraceCheckUtils]: 71: Hoare triple {13086#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:21,210 INFO L273 TraceCheckUtils]: 72: Hoare triple {13086#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13086#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:21,211 INFO L273 TraceCheckUtils]: 73: Hoare triple {13086#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:21,212 INFO L273 TraceCheckUtils]: 74: Hoare triple {13087#(<= main_~i~0 17)} assume true; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:21,212 INFO L273 TraceCheckUtils]: 75: Hoare triple {13087#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:21,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {13087#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13087#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:21,213 INFO L273 TraceCheckUtils]: 77: Hoare triple {13087#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:21,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {13088#(<= main_~i~0 18)} assume true; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:21,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {13088#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:21,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {13088#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13088#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:21,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {13088#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:21,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {13089#(<= main_~i~0 19)} assume true; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:21,216 INFO L273 TraceCheckUtils]: 83: Hoare triple {13089#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:21,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {13089#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13089#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:21,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {13089#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:21,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {13090#(<= main_~i~0 20)} assume true; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:21,219 INFO L273 TraceCheckUtils]: 87: Hoare triple {13090#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:21,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {13090#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13090#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:21,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {13090#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:21,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {13091#(<= main_~i~0 21)} assume true; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:21,221 INFO L273 TraceCheckUtils]: 91: Hoare triple {13091#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:21,221 INFO L273 TraceCheckUtils]: 92: Hoare triple {13091#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13091#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:21,222 INFO L273 TraceCheckUtils]: 93: Hoare triple {13091#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:21,222 INFO L273 TraceCheckUtils]: 94: Hoare triple {13092#(<= main_~i~0 22)} assume true; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:21,223 INFO L273 TraceCheckUtils]: 95: Hoare triple {13092#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:21,223 INFO L273 TraceCheckUtils]: 96: Hoare triple {13092#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13092#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:21,224 INFO L273 TraceCheckUtils]: 97: Hoare triple {13092#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:21,225 INFO L273 TraceCheckUtils]: 98: Hoare triple {13093#(<= main_~i~0 23)} assume true; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:21,225 INFO L273 TraceCheckUtils]: 99: Hoare triple {13093#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:21,225 INFO L273 TraceCheckUtils]: 100: Hoare triple {13093#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13093#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:21,226 INFO L273 TraceCheckUtils]: 101: Hoare triple {13093#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {13094#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:21,227 INFO L273 TraceCheckUtils]: 102: Hoare triple {13094#(<= main_~i~0 24)} assume true; {13094#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:21,227 INFO L273 TraceCheckUtils]: 103: Hoare triple {13094#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13069#false} is VALID [2018-11-14 18:45:21,227 INFO L273 TraceCheckUtils]: 104: Hoare triple {13069#false} havoc ~x~0;~x~0 := 0; {13069#false} is VALID [2018-11-14 18:45:21,228 INFO L273 TraceCheckUtils]: 105: Hoare triple {13069#false} assume true; {13069#false} is VALID [2018-11-14 18:45:21,228 INFO L273 TraceCheckUtils]: 106: Hoare triple {13069#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13069#false} is VALID [2018-11-14 18:45:21,228 INFO L256 TraceCheckUtils]: 107: Hoare triple {13069#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13069#false} is VALID [2018-11-14 18:45:21,228 INFO L273 TraceCheckUtils]: 108: Hoare triple {13069#false} ~cond := #in~cond; {13069#false} is VALID [2018-11-14 18:45:21,228 INFO L273 TraceCheckUtils]: 109: Hoare triple {13069#false} assume ~cond == 0; {13069#false} is VALID [2018-11-14 18:45:21,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {13069#false} assume !false; {13069#false} is VALID [2018-11-14 18:45:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:21,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:21,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 18:45:21,257 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-14 18:45:21,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:21,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:45:21,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:21,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:45:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:45:21,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:45:21,575 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand 28 states. [2018-11-14 18:45:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:22,627 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2018-11-14 18:45:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:45:22,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-14 18:45:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:45:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 162 transitions. [2018-11-14 18:45:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:45:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 162 transitions. [2018-11-14 18:45:22,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 162 transitions. [2018-11-14 18:45:23,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:23,613 INFO L225 Difference]: With dead ends: 134 [2018-11-14 18:45:23,614 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 18:45:23,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:45:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 18:45:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-14 18:45:23,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:23,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-14 18:45:23,692 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-14 18:45:23,692 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-14 18:45:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:23,695 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2018-11-14 18:45:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-14 18:45:23,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:23,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:23,695 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-14 18:45:23,696 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-14 18:45:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:23,697 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2018-11-14 18:45:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-14 18:45:23,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:23,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:23,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:23,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-14 18:45:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-11-14 18:45:23,699 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 111 [2018-11-14 18:45:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:23,700 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-11-14 18:45:23,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:45:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-14 18:45:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-14 18:45:23,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:23,701 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:23,701 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:23,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1431051544, now seen corresponding path program 25 times [2018-11-14 18:45:23,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:23,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:23,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:24,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-14 18:45:24,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-14 18:45:24,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:45:24,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #57#return; {13995#true} is VALID [2018-11-14 18:45:24,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret4 := main(); {13995#true} is VALID [2018-11-14 18:45:24,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {13997#(= main_~i~0 0)} is VALID [2018-11-14 18:45:24,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {13997#(= main_~i~0 0)} assume true; {13997#(= main_~i~0 0)} is VALID [2018-11-14 18:45:24,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {13997#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13997#(= main_~i~0 0)} is VALID [2018-11-14 18:45:24,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {13997#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13997#(= main_~i~0 0)} is VALID [2018-11-14 18:45:24,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {13997#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {13998#(<= main_~i~0 1)} assume true; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {13999#(<= main_~i~0 2)} assume true; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {13999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {13999#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {13999#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:24,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {14000#(<= main_~i~0 3)} assume true; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:24,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {14000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:24,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {14000#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:24,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {14000#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:24,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {14001#(<= main_~i~0 4)} assume true; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:24,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {14001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:24,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {14001#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:24,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {14001#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:24,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {14002#(<= main_~i~0 5)} assume true; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:24,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {14002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:24,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:24,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:24,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~0 6)} assume true; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:24,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:24,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {14003#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:24,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {14003#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:24,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {14004#(<= main_~i~0 7)} assume true; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:24,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {14004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:24,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {14004#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:24,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {14004#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:24,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {14005#(<= main_~i~0 8)} assume true; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:24,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {14005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:24,566 INFO L273 TraceCheckUtils]: 40: Hoare triple {14005#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:24,567 INFO L273 TraceCheckUtils]: 41: Hoare triple {14005#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:24,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {14006#(<= main_~i~0 9)} assume true; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:24,568 INFO L273 TraceCheckUtils]: 43: Hoare triple {14006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:24,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {14006#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:24,569 INFO L273 TraceCheckUtils]: 45: Hoare triple {14006#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:24,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#(<= main_~i~0 10)} assume true; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:24,570 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:24,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:24,571 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:24,572 INFO L273 TraceCheckUtils]: 50: Hoare triple {14008#(<= main_~i~0 11)} assume true; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:24,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {14008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:24,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {14008#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:24,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {14008#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:24,575 INFO L273 TraceCheckUtils]: 54: Hoare triple {14009#(<= main_~i~0 12)} assume true; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:24,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {14009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:24,576 INFO L273 TraceCheckUtils]: 56: Hoare triple {14009#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:24,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {14009#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:24,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {14010#(<= main_~i~0 13)} assume true; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:24,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {14010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:24,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {14010#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:24,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {14010#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:24,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {14011#(<= main_~i~0 14)} assume true; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:24,579 INFO L273 TraceCheckUtils]: 63: Hoare triple {14011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:24,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {14011#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:24,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {14011#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:24,581 INFO L273 TraceCheckUtils]: 66: Hoare triple {14012#(<= main_~i~0 15)} assume true; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:24,581 INFO L273 TraceCheckUtils]: 67: Hoare triple {14012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:24,582 INFO L273 TraceCheckUtils]: 68: Hoare triple {14012#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:24,582 INFO L273 TraceCheckUtils]: 69: Hoare triple {14012#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:24,583 INFO L273 TraceCheckUtils]: 70: Hoare triple {14013#(<= main_~i~0 16)} assume true; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:24,583 INFO L273 TraceCheckUtils]: 71: Hoare triple {14013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:24,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {14013#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:24,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {14013#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:24,585 INFO L273 TraceCheckUtils]: 74: Hoare triple {14014#(<= main_~i~0 17)} assume true; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:24,586 INFO L273 TraceCheckUtils]: 75: Hoare triple {14014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:24,586 INFO L273 TraceCheckUtils]: 76: Hoare triple {14014#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:24,587 INFO L273 TraceCheckUtils]: 77: Hoare triple {14014#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:24,587 INFO L273 TraceCheckUtils]: 78: Hoare triple {14015#(<= main_~i~0 18)} assume true; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:24,588 INFO L273 TraceCheckUtils]: 79: Hoare triple {14015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:24,588 INFO L273 TraceCheckUtils]: 80: Hoare triple {14015#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:24,589 INFO L273 TraceCheckUtils]: 81: Hoare triple {14015#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:24,590 INFO L273 TraceCheckUtils]: 82: Hoare triple {14016#(<= main_~i~0 19)} assume true; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:24,590 INFO L273 TraceCheckUtils]: 83: Hoare triple {14016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:24,591 INFO L273 TraceCheckUtils]: 84: Hoare triple {14016#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:24,591 INFO L273 TraceCheckUtils]: 85: Hoare triple {14016#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:24,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#(<= main_~i~0 20)} assume true; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:24,594 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:24,594 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:24,595 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:24,595 INFO L273 TraceCheckUtils]: 90: Hoare triple {14018#(<= main_~i~0 21)} assume true; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:24,596 INFO L273 TraceCheckUtils]: 91: Hoare triple {14018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:24,596 INFO L273 TraceCheckUtils]: 92: Hoare triple {14018#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:24,596 INFO L273 TraceCheckUtils]: 93: Hoare triple {14018#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:24,597 INFO L273 TraceCheckUtils]: 94: Hoare triple {14019#(<= main_~i~0 22)} assume true; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:24,597 INFO L273 TraceCheckUtils]: 95: Hoare triple {14019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:24,597 INFO L273 TraceCheckUtils]: 96: Hoare triple {14019#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:24,598 INFO L273 TraceCheckUtils]: 97: Hoare triple {14019#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:24,598 INFO L273 TraceCheckUtils]: 98: Hoare triple {14020#(<= main_~i~0 23)} assume true; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:24,598 INFO L273 TraceCheckUtils]: 99: Hoare triple {14020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:24,599 INFO L273 TraceCheckUtils]: 100: Hoare triple {14020#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:24,599 INFO L273 TraceCheckUtils]: 101: Hoare triple {14020#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:24,600 INFO L273 TraceCheckUtils]: 102: Hoare triple {14021#(<= main_~i~0 24)} assume true; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:24,600 INFO L273 TraceCheckUtils]: 103: Hoare triple {14021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:24,601 INFO L273 TraceCheckUtils]: 104: Hoare triple {14021#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:24,601 INFO L273 TraceCheckUtils]: 105: Hoare triple {14021#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {14022#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:24,602 INFO L273 TraceCheckUtils]: 106: Hoare triple {14022#(<= main_~i~0 25)} assume true; {14022#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:24,602 INFO L273 TraceCheckUtils]: 107: Hoare triple {14022#(<= main_~i~0 25)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:45:24,603 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-14 18:45:24,603 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:45:24,603 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13996#false} is VALID [2018-11-14 18:45:24,603 INFO L256 TraceCheckUtils]: 111: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13996#false} is VALID [2018-11-14 18:45:24,603 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-14 18:45:24,604 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume ~cond == 0; {13996#false} is VALID [2018-11-14 18:45:24,604 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-14 18:45:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:24,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:24,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:24,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:24,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:24,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {13995#true} call ULTIMATE.init(); {13995#true} is VALID [2018-11-14 18:45:24,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {13995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13995#true} is VALID [2018-11-14 18:45:24,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {13995#true} assume true; {13995#true} is VALID [2018-11-14 18:45:24,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13995#true} {13995#true} #57#return; {13995#true} is VALID [2018-11-14 18:45:24,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {13995#true} call #t~ret4 := main(); {13995#true} is VALID [2018-11-14 18:45:24,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {13995#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14041#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:24,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {14041#(<= main_~i~0 0)} assume true; {14041#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:24,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {14041#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14041#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:24,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {14041#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14041#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:24,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {14041#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {13998#(<= main_~i~0 1)} assume true; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13998#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:24,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {13999#(<= main_~i~0 2)} assume true; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {13999#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {13999#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {13999#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:24,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {13999#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:25,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {14000#(<= main_~i~0 3)} assume true; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:25,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {14000#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:25,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {14000#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14000#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:25,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {14000#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:25,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {14001#(<= main_~i~0 4)} assume true; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:25,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {14001#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:25,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {14001#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14001#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:25,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {14001#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:25,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {14002#(<= main_~i~0 5)} assume true; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:25,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {14002#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:25,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {14002#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14002#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:25,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {14002#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:25,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {14003#(<= main_~i~0 6)} assume true; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:25,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {14003#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:25,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {14003#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14003#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:25,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {14003#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:25,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {14004#(<= main_~i~0 7)} assume true; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:25,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {14004#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:25,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {14004#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14004#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:25,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {14004#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:25,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {14005#(<= main_~i~0 8)} assume true; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:25,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {14005#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:25,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {14005#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14005#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:25,155 INFO L273 TraceCheckUtils]: 41: Hoare triple {14005#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:25,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {14006#(<= main_~i~0 9)} assume true; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:25,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {14006#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:25,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {14006#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14006#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:25,156 INFO L273 TraceCheckUtils]: 45: Hoare triple {14006#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:25,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#(<= main_~i~0 10)} assume true; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:25,157 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:25,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14007#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:25,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:25,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {14008#(<= main_~i~0 11)} assume true; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:25,159 INFO L273 TraceCheckUtils]: 51: Hoare triple {14008#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:25,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {14008#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14008#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:25,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {14008#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:25,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {14009#(<= main_~i~0 12)} assume true; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:25,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {14009#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:25,162 INFO L273 TraceCheckUtils]: 56: Hoare triple {14009#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14009#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:25,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {14009#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:25,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {14010#(<= main_~i~0 13)} assume true; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:25,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {14010#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:25,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {14010#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14010#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:25,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {14010#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:25,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {14011#(<= main_~i~0 14)} assume true; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:25,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {14011#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:25,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {14011#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14011#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:25,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {14011#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:25,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {14012#(<= main_~i~0 15)} assume true; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:25,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {14012#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:25,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {14012#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14012#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:25,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {14012#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:25,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {14013#(<= main_~i~0 16)} assume true; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:25,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {14013#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:25,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {14013#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14013#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:25,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {14013#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:25,175 INFO L273 TraceCheckUtils]: 74: Hoare triple {14014#(<= main_~i~0 17)} assume true; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:25,176 INFO L273 TraceCheckUtils]: 75: Hoare triple {14014#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:25,176 INFO L273 TraceCheckUtils]: 76: Hoare triple {14014#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14014#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:25,176 INFO L273 TraceCheckUtils]: 77: Hoare triple {14014#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:25,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {14015#(<= main_~i~0 18)} assume true; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:25,177 INFO L273 TraceCheckUtils]: 79: Hoare triple {14015#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:25,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {14015#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14015#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:25,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {14015#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:25,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {14016#(<= main_~i~0 19)} assume true; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:25,178 INFO L273 TraceCheckUtils]: 83: Hoare triple {14016#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:25,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {14016#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14016#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:25,179 INFO L273 TraceCheckUtils]: 85: Hoare triple {14016#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:25,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {14017#(<= main_~i~0 20)} assume true; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:25,180 INFO L273 TraceCheckUtils]: 87: Hoare triple {14017#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:25,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {14017#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14017#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:25,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {14017#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:25,182 INFO L273 TraceCheckUtils]: 90: Hoare triple {14018#(<= main_~i~0 21)} assume true; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:25,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {14018#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:25,183 INFO L273 TraceCheckUtils]: 92: Hoare triple {14018#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14018#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:25,184 INFO L273 TraceCheckUtils]: 93: Hoare triple {14018#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:25,184 INFO L273 TraceCheckUtils]: 94: Hoare triple {14019#(<= main_~i~0 22)} assume true; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:25,185 INFO L273 TraceCheckUtils]: 95: Hoare triple {14019#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:25,185 INFO L273 TraceCheckUtils]: 96: Hoare triple {14019#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14019#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:25,186 INFO L273 TraceCheckUtils]: 97: Hoare triple {14019#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:25,186 INFO L273 TraceCheckUtils]: 98: Hoare triple {14020#(<= main_~i~0 23)} assume true; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:25,187 INFO L273 TraceCheckUtils]: 99: Hoare triple {14020#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:25,187 INFO L273 TraceCheckUtils]: 100: Hoare triple {14020#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14020#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:25,188 INFO L273 TraceCheckUtils]: 101: Hoare triple {14020#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:25,189 INFO L273 TraceCheckUtils]: 102: Hoare triple {14021#(<= main_~i~0 24)} assume true; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:25,189 INFO L273 TraceCheckUtils]: 103: Hoare triple {14021#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:25,190 INFO L273 TraceCheckUtils]: 104: Hoare triple {14021#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14021#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:25,190 INFO L273 TraceCheckUtils]: 105: Hoare triple {14021#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {14022#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:25,191 INFO L273 TraceCheckUtils]: 106: Hoare triple {14022#(<= main_~i~0 25)} assume true; {14022#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:25,191 INFO L273 TraceCheckUtils]: 107: Hoare triple {14022#(<= main_~i~0 25)} assume !(~i~0 < 100000); {13996#false} is VALID [2018-11-14 18:45:25,192 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#false} havoc ~x~0;~x~0 := 0; {13996#false} is VALID [2018-11-14 18:45:25,192 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#false} assume true; {13996#false} is VALID [2018-11-14 18:45:25,192 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13996#false} is VALID [2018-11-14 18:45:25,192 INFO L256 TraceCheckUtils]: 111: Hoare triple {13996#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {13996#false} is VALID [2018-11-14 18:45:25,192 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#false} ~cond := #in~cond; {13996#false} is VALID [2018-11-14 18:45:25,193 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#false} assume ~cond == 0; {13996#false} is VALID [2018-11-14 18:45:25,193 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#false} assume !false; {13996#false} is VALID [2018-11-14 18:45:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:25,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:25,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 18:45:25,224 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-14 18:45:25,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:25,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:45:25,329 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-14 18:45:25,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:45:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:45:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:45:25,330 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 29 states. [2018-11-14 18:45:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:25,715 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2018-11-14 18:45:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:45:25,715 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-14 18:45:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:45:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 167 transitions. [2018-11-14 18:45:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:45:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 167 transitions. [2018-11-14 18:45:25,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 167 transitions. [2018-11-14 18:45:25,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:25,857 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:45:25,857 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 18:45:25,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:45:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 18:45:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-14 18:45:25,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:25,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2018-11-14 18:45:25,897 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2018-11-14 18:45:25,897 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2018-11-14 18:45:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:25,899 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2018-11-14 18:45:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-14 18:45:25,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:25,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:25,899 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2018-11-14 18:45:25,900 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2018-11-14 18:45:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:25,902 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2018-11-14 18:45:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-14 18:45:25,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:25,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:25,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:25,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-14 18:45:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2018-11-14 18:45:25,905 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 115 [2018-11-14 18:45:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:25,905 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2018-11-14 18:45:25,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:45:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2018-11-14 18:45:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-14 18:45:25,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:25,906 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:25,906 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:25,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash 786090814, now seen corresponding path program 26 times [2018-11-14 18:45:25,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:25,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:26,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {14953#true} call ULTIMATE.init(); {14953#true} is VALID [2018-11-14 18:45:26,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {14953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14953#true} is VALID [2018-11-14 18:45:26,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {14953#true} assume true; {14953#true} is VALID [2018-11-14 18:45:26,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14953#true} {14953#true} #57#return; {14953#true} is VALID [2018-11-14 18:45:26,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {14953#true} call #t~ret4 := main(); {14953#true} is VALID [2018-11-14 18:45:26,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {14953#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {14955#(= main_~i~0 0)} is VALID [2018-11-14 18:45:26,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {14955#(= main_~i~0 0)} assume true; {14955#(= main_~i~0 0)} is VALID [2018-11-14 18:45:26,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {14955#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14955#(= main_~i~0 0)} is VALID [2018-11-14 18:45:26,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {14955#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14955#(= main_~i~0 0)} is VALID [2018-11-14 18:45:26,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {14955#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:26,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {14956#(<= main_~i~0 1)} assume true; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:26,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {14956#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:26,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {14956#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:26,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {14956#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:26,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {14957#(<= main_~i~0 2)} assume true; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:26,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {14957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:26,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {14957#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:26,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {14957#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:26,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {14958#(<= main_~i~0 3)} assume true; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:26,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {14958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:26,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {14958#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:26,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {14958#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:26,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#(<= main_~i~0 4)} assume true; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:26,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {14959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:26,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:26,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {14959#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:26,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {14960#(<= main_~i~0 5)} assume true; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:26,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {14960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:26,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {14960#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:26,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {14960#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:26,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {14961#(<= main_~i~0 6)} assume true; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:26,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {14961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:26,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {14961#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:26,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {14961#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:26,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {14962#(<= main_~i~0 7)} assume true; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:26,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {14962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:26,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {14962#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:26,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {14962#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:26,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {14963#(<= main_~i~0 8)} assume true; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:26,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {14963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:26,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {14963#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:26,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {14963#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:26,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {14964#(<= main_~i~0 9)} assume true; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:26,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {14964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:26,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {14964#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:26,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {14964#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:26,912 INFO L273 TraceCheckUtils]: 46: Hoare triple {14965#(<= main_~i~0 10)} assume true; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:26,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {14965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:26,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {14965#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:26,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {14965#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:26,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {14966#(<= main_~i~0 11)} assume true; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:26,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {14966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:26,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {14966#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:26,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {14966#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:26,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {14967#(<= main_~i~0 12)} assume true; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:26,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {14967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:26,929 INFO L273 TraceCheckUtils]: 56: Hoare triple {14967#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:26,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {14967#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:26,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {14968#(<= main_~i~0 13)} assume true; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:26,930 INFO L273 TraceCheckUtils]: 59: Hoare triple {14968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:26,930 INFO L273 TraceCheckUtils]: 60: Hoare triple {14968#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:26,931 INFO L273 TraceCheckUtils]: 61: Hoare triple {14968#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:26,931 INFO L273 TraceCheckUtils]: 62: Hoare triple {14969#(<= main_~i~0 14)} assume true; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:26,932 INFO L273 TraceCheckUtils]: 63: Hoare triple {14969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:26,932 INFO L273 TraceCheckUtils]: 64: Hoare triple {14969#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:26,933 INFO L273 TraceCheckUtils]: 65: Hoare triple {14969#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:26,933 INFO L273 TraceCheckUtils]: 66: Hoare triple {14970#(<= main_~i~0 15)} assume true; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:26,934 INFO L273 TraceCheckUtils]: 67: Hoare triple {14970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:26,934 INFO L273 TraceCheckUtils]: 68: Hoare triple {14970#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:26,935 INFO L273 TraceCheckUtils]: 69: Hoare triple {14970#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:26,936 INFO L273 TraceCheckUtils]: 70: Hoare triple {14971#(<= main_~i~0 16)} assume true; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:26,936 INFO L273 TraceCheckUtils]: 71: Hoare triple {14971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:26,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {14971#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:26,937 INFO L273 TraceCheckUtils]: 73: Hoare triple {14971#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:26,938 INFO L273 TraceCheckUtils]: 74: Hoare triple {14972#(<= main_~i~0 17)} assume true; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:26,938 INFO L273 TraceCheckUtils]: 75: Hoare triple {14972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:26,939 INFO L273 TraceCheckUtils]: 76: Hoare triple {14972#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:26,939 INFO L273 TraceCheckUtils]: 77: Hoare triple {14972#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:26,940 INFO L273 TraceCheckUtils]: 78: Hoare triple {14973#(<= main_~i~0 18)} assume true; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:26,940 INFO L273 TraceCheckUtils]: 79: Hoare triple {14973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:26,941 INFO L273 TraceCheckUtils]: 80: Hoare triple {14973#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:26,941 INFO L273 TraceCheckUtils]: 81: Hoare triple {14973#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:26,942 INFO L273 TraceCheckUtils]: 82: Hoare triple {14974#(<= main_~i~0 19)} assume true; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:26,942 INFO L273 TraceCheckUtils]: 83: Hoare triple {14974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:26,943 INFO L273 TraceCheckUtils]: 84: Hoare triple {14974#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:26,944 INFO L273 TraceCheckUtils]: 85: Hoare triple {14974#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:26,944 INFO L273 TraceCheckUtils]: 86: Hoare triple {14975#(<= main_~i~0 20)} assume true; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:26,944 INFO L273 TraceCheckUtils]: 87: Hoare triple {14975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:26,945 INFO L273 TraceCheckUtils]: 88: Hoare triple {14975#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:26,946 INFO L273 TraceCheckUtils]: 89: Hoare triple {14975#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:26,946 INFO L273 TraceCheckUtils]: 90: Hoare triple {14976#(<= main_~i~0 21)} assume true; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:26,947 INFO L273 TraceCheckUtils]: 91: Hoare triple {14976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:26,947 INFO L273 TraceCheckUtils]: 92: Hoare triple {14976#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:26,948 INFO L273 TraceCheckUtils]: 93: Hoare triple {14976#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:26,948 INFO L273 TraceCheckUtils]: 94: Hoare triple {14977#(<= main_~i~0 22)} assume true; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:26,949 INFO L273 TraceCheckUtils]: 95: Hoare triple {14977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:26,949 INFO L273 TraceCheckUtils]: 96: Hoare triple {14977#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:26,950 INFO L273 TraceCheckUtils]: 97: Hoare triple {14977#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:26,950 INFO L273 TraceCheckUtils]: 98: Hoare triple {14978#(<= main_~i~0 23)} assume true; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:26,951 INFO L273 TraceCheckUtils]: 99: Hoare triple {14978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:26,951 INFO L273 TraceCheckUtils]: 100: Hoare triple {14978#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:26,952 INFO L273 TraceCheckUtils]: 101: Hoare triple {14978#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:26,952 INFO L273 TraceCheckUtils]: 102: Hoare triple {14979#(<= main_~i~0 24)} assume true; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:26,953 INFO L273 TraceCheckUtils]: 103: Hoare triple {14979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:26,953 INFO L273 TraceCheckUtils]: 104: Hoare triple {14979#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:26,954 INFO L273 TraceCheckUtils]: 105: Hoare triple {14979#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:26,955 INFO L273 TraceCheckUtils]: 106: Hoare triple {14980#(<= main_~i~0 25)} assume true; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:26,955 INFO L273 TraceCheckUtils]: 107: Hoare triple {14980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:26,955 INFO L273 TraceCheckUtils]: 108: Hoare triple {14980#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:26,956 INFO L273 TraceCheckUtils]: 109: Hoare triple {14980#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {14981#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:26,957 INFO L273 TraceCheckUtils]: 110: Hoare triple {14981#(<= main_~i~0 26)} assume true; {14981#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:26,957 INFO L273 TraceCheckUtils]: 111: Hoare triple {14981#(<= main_~i~0 26)} assume !(~i~0 < 100000); {14954#false} is VALID [2018-11-14 18:45:26,957 INFO L273 TraceCheckUtils]: 112: Hoare triple {14954#false} havoc ~x~0;~x~0 := 0; {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L273 TraceCheckUtils]: 113: Hoare triple {14954#false} assume true; {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L273 TraceCheckUtils]: 114: Hoare triple {14954#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L256 TraceCheckUtils]: 115: Hoare triple {14954#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L273 TraceCheckUtils]: 116: Hoare triple {14954#false} ~cond := #in~cond; {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L273 TraceCheckUtils]: 117: Hoare triple {14954#false} assume ~cond == 0; {14954#false} is VALID [2018-11-14 18:45:26,958 INFO L273 TraceCheckUtils]: 118: Hoare triple {14954#false} assume !false; {14954#false} is VALID [2018-11-14 18:45:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:26,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:45:27,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:45:27,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:27,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:27,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {14953#true} call ULTIMATE.init(); {14953#true} is VALID [2018-11-14 18:45:27,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {14953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14953#true} is VALID [2018-11-14 18:45:27,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {14953#true} assume true; {14953#true} is VALID [2018-11-14 18:45:27,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14953#true} {14953#true} #57#return; {14953#true} is VALID [2018-11-14 18:45:27,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {14953#true} call #t~ret4 := main(); {14953#true} is VALID [2018-11-14 18:45:27,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {14953#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15000#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:27,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {15000#(<= main_~i~0 0)} assume true; {15000#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:27,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {15000#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15000#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:27,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {15000#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15000#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:27,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {15000#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:27,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {14956#(<= main_~i~0 1)} assume true; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:27,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {14956#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:27,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {14956#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14956#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:27,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {14956#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:27,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {14957#(<= main_~i~0 2)} assume true; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:27,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {14957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:27,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {14957#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14957#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:27,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {14957#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:27,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {14958#(<= main_~i~0 3)} assume true; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:27,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {14958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:27,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {14958#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14958#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:27,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {14958#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:27,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {14959#(<= main_~i~0 4)} assume true; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:27,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {14959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:27,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {14959#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14959#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:27,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {14959#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:27,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {14960#(<= main_~i~0 5)} assume true; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:27,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {14960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:27,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {14960#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14960#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:27,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {14960#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:27,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {14961#(<= main_~i~0 6)} assume true; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:27,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {14961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:27,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {14961#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14961#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:27,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {14961#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:27,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {14962#(<= main_~i~0 7)} assume true; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:27,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {14962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:27,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {14962#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14962#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:27,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {14962#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:27,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {14963#(<= main_~i~0 8)} assume true; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:27,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {14963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:27,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {14963#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14963#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:27,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {14963#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:27,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {14964#(<= main_~i~0 9)} assume true; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:27,353 INFO L273 TraceCheckUtils]: 43: Hoare triple {14964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:27,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {14964#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14964#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:27,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {14964#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:27,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {14965#(<= main_~i~0 10)} assume true; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:27,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {14965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:27,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {14965#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14965#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:27,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {14965#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:27,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {14966#(<= main_~i~0 11)} assume true; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:27,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {14966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:27,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {14966#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14966#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:27,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {14966#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:27,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {14967#(<= main_~i~0 12)} assume true; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:27,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {14967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:27,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {14967#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14967#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:27,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {14967#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:27,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {14968#(<= main_~i~0 13)} assume true; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:27,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {14968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:27,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {14968#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14968#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:27,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {14968#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:27,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {14969#(<= main_~i~0 14)} assume true; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:27,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {14969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:27,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {14969#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14969#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:27,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {14969#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:27,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {14970#(<= main_~i~0 15)} assume true; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:27,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {14970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:27,426 INFO L273 TraceCheckUtils]: 68: Hoare triple {14970#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14970#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:27,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {14970#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:27,427 INFO L273 TraceCheckUtils]: 70: Hoare triple {14971#(<= main_~i~0 16)} assume true; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:27,427 INFO L273 TraceCheckUtils]: 71: Hoare triple {14971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:27,428 INFO L273 TraceCheckUtils]: 72: Hoare triple {14971#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14971#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:27,428 INFO L273 TraceCheckUtils]: 73: Hoare triple {14971#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:27,429 INFO L273 TraceCheckUtils]: 74: Hoare triple {14972#(<= main_~i~0 17)} assume true; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:27,430 INFO L273 TraceCheckUtils]: 75: Hoare triple {14972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:27,430 INFO L273 TraceCheckUtils]: 76: Hoare triple {14972#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14972#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:27,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {14972#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:27,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {14973#(<= main_~i~0 18)} assume true; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:27,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {14973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:27,432 INFO L273 TraceCheckUtils]: 80: Hoare triple {14973#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14973#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:27,433 INFO L273 TraceCheckUtils]: 81: Hoare triple {14973#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:27,433 INFO L273 TraceCheckUtils]: 82: Hoare triple {14974#(<= main_~i~0 19)} assume true; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:27,434 INFO L273 TraceCheckUtils]: 83: Hoare triple {14974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:27,434 INFO L273 TraceCheckUtils]: 84: Hoare triple {14974#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14974#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:27,435 INFO L273 TraceCheckUtils]: 85: Hoare triple {14974#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:27,436 INFO L273 TraceCheckUtils]: 86: Hoare triple {14975#(<= main_~i~0 20)} assume true; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:27,436 INFO L273 TraceCheckUtils]: 87: Hoare triple {14975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:27,437 INFO L273 TraceCheckUtils]: 88: Hoare triple {14975#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14975#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:27,437 INFO L273 TraceCheckUtils]: 89: Hoare triple {14975#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:27,438 INFO L273 TraceCheckUtils]: 90: Hoare triple {14976#(<= main_~i~0 21)} assume true; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:27,438 INFO L273 TraceCheckUtils]: 91: Hoare triple {14976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:27,439 INFO L273 TraceCheckUtils]: 92: Hoare triple {14976#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14976#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:27,440 INFO L273 TraceCheckUtils]: 93: Hoare triple {14976#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:27,440 INFO L273 TraceCheckUtils]: 94: Hoare triple {14977#(<= main_~i~0 22)} assume true; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:27,441 INFO L273 TraceCheckUtils]: 95: Hoare triple {14977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:27,441 INFO L273 TraceCheckUtils]: 96: Hoare triple {14977#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14977#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:27,442 INFO L273 TraceCheckUtils]: 97: Hoare triple {14977#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:27,442 INFO L273 TraceCheckUtils]: 98: Hoare triple {14978#(<= main_~i~0 23)} assume true; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:27,443 INFO L273 TraceCheckUtils]: 99: Hoare triple {14978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:27,443 INFO L273 TraceCheckUtils]: 100: Hoare triple {14978#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14978#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:27,444 INFO L273 TraceCheckUtils]: 101: Hoare triple {14978#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:27,445 INFO L273 TraceCheckUtils]: 102: Hoare triple {14979#(<= main_~i~0 24)} assume true; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:27,445 INFO L273 TraceCheckUtils]: 103: Hoare triple {14979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:27,447 INFO L273 TraceCheckUtils]: 104: Hoare triple {14979#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14979#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:27,447 INFO L273 TraceCheckUtils]: 105: Hoare triple {14979#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:27,448 INFO L273 TraceCheckUtils]: 106: Hoare triple {14980#(<= main_~i~0 25)} assume true; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:27,448 INFO L273 TraceCheckUtils]: 107: Hoare triple {14980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:27,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {14980#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {14980#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:27,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {14980#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {14981#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:27,450 INFO L273 TraceCheckUtils]: 110: Hoare triple {14981#(<= main_~i~0 26)} assume true; {14981#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:27,451 INFO L273 TraceCheckUtils]: 111: Hoare triple {14981#(<= main_~i~0 26)} assume !(~i~0 < 100000); {14954#false} is VALID [2018-11-14 18:45:27,451 INFO L273 TraceCheckUtils]: 112: Hoare triple {14954#false} havoc ~x~0;~x~0 := 0; {14954#false} is VALID [2018-11-14 18:45:27,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {14954#false} assume true; {14954#false} is VALID [2018-11-14 18:45:27,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {14954#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14954#false} is VALID [2018-11-14 18:45:27,452 INFO L256 TraceCheckUtils]: 115: Hoare triple {14954#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {14954#false} is VALID [2018-11-14 18:45:27,452 INFO L273 TraceCheckUtils]: 116: Hoare triple {14954#false} ~cond := #in~cond; {14954#false} is VALID [2018-11-14 18:45:27,452 INFO L273 TraceCheckUtils]: 117: Hoare triple {14954#false} assume ~cond == 0; {14954#false} is VALID [2018-11-14 18:45:27,452 INFO L273 TraceCheckUtils]: 118: Hoare triple {14954#false} assume !false; {14954#false} is VALID [2018-11-14 18:45:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:27,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:27,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 18:45:27,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-14 18:45:27,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:27,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:45:27,618 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-14 18:45:27,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:45:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:45:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:45:27,620 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 30 states. [2018-11-14 18:45:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:28,013 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2018-11-14 18:45:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:45:28,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-14 18:45:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:45:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 172 transitions. [2018-11-14 18:45:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:45:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 172 transitions. [2018-11-14 18:45:28,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 172 transitions. [2018-11-14 18:45:28,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:28,167 INFO L225 Difference]: With dead ends: 142 [2018-11-14 18:45:28,167 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 18:45:28,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:45:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 18:45:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-11-14 18:45:28,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:28,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2018-11-14 18:45:28,194 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2018-11-14 18:45:28,194 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2018-11-14 18:45:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:28,196 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2018-11-14 18:45:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-14 18:45:28,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:28,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:28,197 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2018-11-14 18:45:28,197 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2018-11-14 18:45:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:28,199 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2018-11-14 18:45:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-14 18:45:28,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:28,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:28,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:28,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 18:45:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2018-11-14 18:45:28,202 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 119 [2018-11-14 18:45:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:28,202 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2018-11-14 18:45:28,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:45:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2018-11-14 18:45:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-14 18:45:28,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:28,204 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:28,204 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -100034412, now seen corresponding path program 27 times [2018-11-14 18:45:28,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:28,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:28,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {15942#true} call ULTIMATE.init(); {15942#true} is VALID [2018-11-14 18:45:28,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {15942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15942#true} is VALID [2018-11-14 18:45:28,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {15942#true} assume true; {15942#true} is VALID [2018-11-14 18:45:28,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15942#true} {15942#true} #57#return; {15942#true} is VALID [2018-11-14 18:45:28,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {15942#true} call #t~ret4 := main(); {15942#true} is VALID [2018-11-14 18:45:28,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {15942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15944#(= main_~i~0 0)} is VALID [2018-11-14 18:45:28,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {15944#(= main_~i~0 0)} assume true; {15944#(= main_~i~0 0)} is VALID [2018-11-14 18:45:28,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {15944#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15944#(= main_~i~0 0)} is VALID [2018-11-14 18:45:28,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {15944#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15944#(= main_~i~0 0)} is VALID [2018-11-14 18:45:28,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {15944#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:28,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {15945#(<= main_~i~0 1)} assume true; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:28,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {15945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:28,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {15945#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:28,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {15945#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:28,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {15946#(<= main_~i~0 2)} assume true; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:28,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {15946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:28,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {15946#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:28,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {15946#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:28,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {15947#(<= main_~i~0 3)} assume true; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:28,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {15947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:28,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {15947#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:28,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {15947#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:28,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {15948#(<= main_~i~0 4)} assume true; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:28,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {15948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:28,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {15948#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:28,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {15948#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:28,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {15949#(<= main_~i~0 5)} assume true; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:28,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {15949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:28,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:28,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:28,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 6)} assume true; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:28,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:28,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {15950#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:28,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {15950#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:28,731 INFO L273 TraceCheckUtils]: 34: Hoare triple {15951#(<= main_~i~0 7)} assume true; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:28,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {15951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:28,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {15951#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:28,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {15951#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:28,733 INFO L273 TraceCheckUtils]: 38: Hoare triple {15952#(<= main_~i~0 8)} assume true; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:28,734 INFO L273 TraceCheckUtils]: 39: Hoare triple {15952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:28,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {15952#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:28,735 INFO L273 TraceCheckUtils]: 41: Hoare triple {15952#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:28,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {15953#(<= main_~i~0 9)} assume true; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:28,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {15953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:28,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {15953#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:28,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {15953#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:28,738 INFO L273 TraceCheckUtils]: 46: Hoare triple {15954#(<= main_~i~0 10)} assume true; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:28,738 INFO L273 TraceCheckUtils]: 47: Hoare triple {15954#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:28,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {15954#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:28,740 INFO L273 TraceCheckUtils]: 49: Hoare triple {15954#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:28,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {15955#(<= main_~i~0 11)} assume true; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:28,741 INFO L273 TraceCheckUtils]: 51: Hoare triple {15955#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:28,741 INFO L273 TraceCheckUtils]: 52: Hoare triple {15955#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:28,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {15955#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:28,742 INFO L273 TraceCheckUtils]: 54: Hoare triple {15956#(<= main_~i~0 12)} assume true; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:28,743 INFO L273 TraceCheckUtils]: 55: Hoare triple {15956#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:28,743 INFO L273 TraceCheckUtils]: 56: Hoare triple {15956#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:28,744 INFO L273 TraceCheckUtils]: 57: Hoare triple {15956#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:28,744 INFO L273 TraceCheckUtils]: 58: Hoare triple {15957#(<= main_~i~0 13)} assume true; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:28,745 INFO L273 TraceCheckUtils]: 59: Hoare triple {15957#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:28,745 INFO L273 TraceCheckUtils]: 60: Hoare triple {15957#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:28,746 INFO L273 TraceCheckUtils]: 61: Hoare triple {15957#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:28,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {15958#(<= main_~i~0 14)} assume true; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:28,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {15958#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:28,748 INFO L273 TraceCheckUtils]: 64: Hoare triple {15958#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:28,748 INFO L273 TraceCheckUtils]: 65: Hoare triple {15958#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:28,749 INFO L273 TraceCheckUtils]: 66: Hoare triple {15959#(<= main_~i~0 15)} assume true; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:28,749 INFO L273 TraceCheckUtils]: 67: Hoare triple {15959#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:28,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {15959#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:28,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {15959#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:28,751 INFO L273 TraceCheckUtils]: 70: Hoare triple {15960#(<= main_~i~0 16)} assume true; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:28,752 INFO L273 TraceCheckUtils]: 71: Hoare triple {15960#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:28,752 INFO L273 TraceCheckUtils]: 72: Hoare triple {15960#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:28,753 INFO L273 TraceCheckUtils]: 73: Hoare triple {15960#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:28,753 INFO L273 TraceCheckUtils]: 74: Hoare triple {15961#(<= main_~i~0 17)} assume true; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:28,754 INFO L273 TraceCheckUtils]: 75: Hoare triple {15961#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:28,754 INFO L273 TraceCheckUtils]: 76: Hoare triple {15961#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:28,755 INFO L273 TraceCheckUtils]: 77: Hoare triple {15961#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:28,756 INFO L273 TraceCheckUtils]: 78: Hoare triple {15962#(<= main_~i~0 18)} assume true; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:28,756 INFO L273 TraceCheckUtils]: 79: Hoare triple {15962#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:28,757 INFO L273 TraceCheckUtils]: 80: Hoare triple {15962#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:28,757 INFO L273 TraceCheckUtils]: 81: Hoare triple {15962#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:28,758 INFO L273 TraceCheckUtils]: 82: Hoare triple {15963#(<= main_~i~0 19)} assume true; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:28,758 INFO L273 TraceCheckUtils]: 83: Hoare triple {15963#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:28,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {15963#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:28,759 INFO L273 TraceCheckUtils]: 85: Hoare triple {15963#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:28,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {15964#(<= main_~i~0 20)} assume true; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:28,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {15964#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:28,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {15964#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:28,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:28,762 INFO L273 TraceCheckUtils]: 90: Hoare triple {15965#(<= main_~i~0 21)} assume true; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:28,763 INFO L273 TraceCheckUtils]: 91: Hoare triple {15965#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:28,763 INFO L273 TraceCheckUtils]: 92: Hoare triple {15965#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:28,764 INFO L273 TraceCheckUtils]: 93: Hoare triple {15965#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:28,764 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#(<= main_~i~0 22)} assume true; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:28,765 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:28,765 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:28,766 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:28,767 INFO L273 TraceCheckUtils]: 98: Hoare triple {15967#(<= main_~i~0 23)} assume true; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:28,767 INFO L273 TraceCheckUtils]: 99: Hoare triple {15967#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:28,768 INFO L273 TraceCheckUtils]: 100: Hoare triple {15967#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:28,768 INFO L273 TraceCheckUtils]: 101: Hoare triple {15967#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:28,769 INFO L273 TraceCheckUtils]: 102: Hoare triple {15968#(<= main_~i~0 24)} assume true; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:28,769 INFO L273 TraceCheckUtils]: 103: Hoare triple {15968#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:28,770 INFO L273 TraceCheckUtils]: 104: Hoare triple {15968#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:28,771 INFO L273 TraceCheckUtils]: 105: Hoare triple {15968#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:28,771 INFO L273 TraceCheckUtils]: 106: Hoare triple {15969#(<= main_~i~0 25)} assume true; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:28,772 INFO L273 TraceCheckUtils]: 107: Hoare triple {15969#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:28,772 INFO L273 TraceCheckUtils]: 108: Hoare triple {15969#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:28,773 INFO L273 TraceCheckUtils]: 109: Hoare triple {15969#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:28,773 INFO L273 TraceCheckUtils]: 110: Hoare triple {15970#(<= main_~i~0 26)} assume true; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:28,774 INFO L273 TraceCheckUtils]: 111: Hoare triple {15970#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:28,774 INFO L273 TraceCheckUtils]: 112: Hoare triple {15970#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:28,775 INFO L273 TraceCheckUtils]: 113: Hoare triple {15970#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {15971#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:28,776 INFO L273 TraceCheckUtils]: 114: Hoare triple {15971#(<= main_~i~0 27)} assume true; {15971#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:28,776 INFO L273 TraceCheckUtils]: 115: Hoare triple {15971#(<= main_~i~0 27)} assume !(~i~0 < 100000); {15943#false} is VALID [2018-11-14 18:45:28,776 INFO L273 TraceCheckUtils]: 116: Hoare triple {15943#false} havoc ~x~0;~x~0 := 0; {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L273 TraceCheckUtils]: 117: Hoare triple {15943#false} assume true; {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L273 TraceCheckUtils]: 118: Hoare triple {15943#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L256 TraceCheckUtils]: 119: Hoare triple {15943#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L273 TraceCheckUtils]: 120: Hoare triple {15943#false} ~cond := #in~cond; {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L273 TraceCheckUtils]: 121: Hoare triple {15943#false} assume ~cond == 0; {15943#false} is VALID [2018-11-14 18:45:28,777 INFO L273 TraceCheckUtils]: 122: Hoare triple {15943#false} assume !false; {15943#false} is VALID [2018-11-14 18:45:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:28,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:28,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:28,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:45:28,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 18:45:28,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:28,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:29,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {15942#true} call ULTIMATE.init(); {15942#true} is VALID [2018-11-14 18:45:29,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {15942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15942#true} is VALID [2018-11-14 18:45:29,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {15942#true} assume true; {15942#true} is VALID [2018-11-14 18:45:29,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15942#true} {15942#true} #57#return; {15942#true} is VALID [2018-11-14 18:45:29,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {15942#true} call #t~ret4 := main(); {15942#true} is VALID [2018-11-14 18:45:29,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {15942#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {15990#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:29,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {15990#(<= main_~i~0 0)} assume true; {15990#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:29,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {15990#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15990#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:29,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {15990#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15990#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:29,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {15990#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:29,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {15945#(<= main_~i~0 1)} assume true; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:29,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {15945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:29,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {15945#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15945#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:29,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {15945#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:29,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {15946#(<= main_~i~0 2)} assume true; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:29,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {15946#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:29,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {15946#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15946#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:29,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {15946#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:29,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {15947#(<= main_~i~0 3)} assume true; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:29,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {15947#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:29,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {15947#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15947#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:29,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {15947#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:29,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {15948#(<= main_~i~0 4)} assume true; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:29,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {15948#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:29,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {15948#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15948#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:29,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {15948#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:29,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {15949#(<= main_~i~0 5)} assume true; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:29,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {15949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:29,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {15949#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15949#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:29,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {15949#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:29,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {15950#(<= main_~i~0 6)} assume true; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:29,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {15950#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:29,137 INFO L273 TraceCheckUtils]: 32: Hoare triple {15950#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15950#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:29,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {15950#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:29,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {15951#(<= main_~i~0 7)} assume true; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:29,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {15951#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:29,139 INFO L273 TraceCheckUtils]: 36: Hoare triple {15951#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15951#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:29,140 INFO L273 TraceCheckUtils]: 37: Hoare triple {15951#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:29,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {15952#(<= main_~i~0 8)} assume true; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:29,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {15952#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:29,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {15952#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15952#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:29,142 INFO L273 TraceCheckUtils]: 41: Hoare triple {15952#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:29,142 INFO L273 TraceCheckUtils]: 42: Hoare triple {15953#(<= main_~i~0 9)} assume true; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:29,143 INFO L273 TraceCheckUtils]: 43: Hoare triple {15953#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:29,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {15953#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15953#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:29,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {15953#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:29,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {15954#(<= main_~i~0 10)} assume true; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:29,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {15954#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:29,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {15954#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15954#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:29,146 INFO L273 TraceCheckUtils]: 49: Hoare triple {15954#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:29,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {15955#(<= main_~i~0 11)} assume true; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:29,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {15955#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:29,148 INFO L273 TraceCheckUtils]: 52: Hoare triple {15955#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15955#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:29,148 INFO L273 TraceCheckUtils]: 53: Hoare triple {15955#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:29,149 INFO L273 TraceCheckUtils]: 54: Hoare triple {15956#(<= main_~i~0 12)} assume true; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:29,149 INFO L273 TraceCheckUtils]: 55: Hoare triple {15956#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:29,150 INFO L273 TraceCheckUtils]: 56: Hoare triple {15956#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15956#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:29,151 INFO L273 TraceCheckUtils]: 57: Hoare triple {15956#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:29,151 INFO L273 TraceCheckUtils]: 58: Hoare triple {15957#(<= main_~i~0 13)} assume true; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:29,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {15957#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:29,152 INFO L273 TraceCheckUtils]: 60: Hoare triple {15957#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15957#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:29,153 INFO L273 TraceCheckUtils]: 61: Hoare triple {15957#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:29,153 INFO L273 TraceCheckUtils]: 62: Hoare triple {15958#(<= main_~i~0 14)} assume true; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:29,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {15958#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:29,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {15958#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15958#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:29,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {15958#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:29,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {15959#(<= main_~i~0 15)} assume true; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:29,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {15959#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:29,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {15959#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15959#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:29,157 INFO L273 TraceCheckUtils]: 69: Hoare triple {15959#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:29,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {15960#(<= main_~i~0 16)} assume true; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:29,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {15960#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:29,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {15960#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15960#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:29,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {15960#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:29,160 INFO L273 TraceCheckUtils]: 74: Hoare triple {15961#(<= main_~i~0 17)} assume true; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:29,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {15961#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:29,161 INFO L273 TraceCheckUtils]: 76: Hoare triple {15961#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15961#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:29,162 INFO L273 TraceCheckUtils]: 77: Hoare triple {15961#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:29,162 INFO L273 TraceCheckUtils]: 78: Hoare triple {15962#(<= main_~i~0 18)} assume true; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:29,163 INFO L273 TraceCheckUtils]: 79: Hoare triple {15962#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:29,163 INFO L273 TraceCheckUtils]: 80: Hoare triple {15962#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15962#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:29,164 INFO L273 TraceCheckUtils]: 81: Hoare triple {15962#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:29,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {15963#(<= main_~i~0 19)} assume true; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:29,165 INFO L273 TraceCheckUtils]: 83: Hoare triple {15963#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:29,165 INFO L273 TraceCheckUtils]: 84: Hoare triple {15963#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15963#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:29,166 INFO L273 TraceCheckUtils]: 85: Hoare triple {15963#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:29,167 INFO L273 TraceCheckUtils]: 86: Hoare triple {15964#(<= main_~i~0 20)} assume true; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:29,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {15964#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:29,168 INFO L273 TraceCheckUtils]: 88: Hoare triple {15964#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15964#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:29,169 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:29,169 INFO L273 TraceCheckUtils]: 90: Hoare triple {15965#(<= main_~i~0 21)} assume true; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:29,170 INFO L273 TraceCheckUtils]: 91: Hoare triple {15965#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:29,170 INFO L273 TraceCheckUtils]: 92: Hoare triple {15965#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15965#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:29,171 INFO L273 TraceCheckUtils]: 93: Hoare triple {15965#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:29,171 INFO L273 TraceCheckUtils]: 94: Hoare triple {15966#(<= main_~i~0 22)} assume true; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:29,171 INFO L273 TraceCheckUtils]: 95: Hoare triple {15966#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:29,172 INFO L273 TraceCheckUtils]: 96: Hoare triple {15966#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15966#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:29,172 INFO L273 TraceCheckUtils]: 97: Hoare triple {15966#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:29,172 INFO L273 TraceCheckUtils]: 98: Hoare triple {15967#(<= main_~i~0 23)} assume true; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:29,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {15967#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:29,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {15967#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15967#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:29,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {15967#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:29,175 INFO L273 TraceCheckUtils]: 102: Hoare triple {15968#(<= main_~i~0 24)} assume true; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:29,175 INFO L273 TraceCheckUtils]: 103: Hoare triple {15968#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:29,176 INFO L273 TraceCheckUtils]: 104: Hoare triple {15968#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15968#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:29,176 INFO L273 TraceCheckUtils]: 105: Hoare triple {15968#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:29,177 INFO L273 TraceCheckUtils]: 106: Hoare triple {15969#(<= main_~i~0 25)} assume true; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:29,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {15969#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:29,178 INFO L273 TraceCheckUtils]: 108: Hoare triple {15969#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15969#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:29,179 INFO L273 TraceCheckUtils]: 109: Hoare triple {15969#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:29,179 INFO L273 TraceCheckUtils]: 110: Hoare triple {15970#(<= main_~i~0 26)} assume true; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:29,180 INFO L273 TraceCheckUtils]: 111: Hoare triple {15970#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:29,180 INFO L273 TraceCheckUtils]: 112: Hoare triple {15970#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {15970#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:29,181 INFO L273 TraceCheckUtils]: 113: Hoare triple {15970#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {15971#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:29,181 INFO L273 TraceCheckUtils]: 114: Hoare triple {15971#(<= main_~i~0 27)} assume true; {15971#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:29,182 INFO L273 TraceCheckUtils]: 115: Hoare triple {15971#(<= main_~i~0 27)} assume !(~i~0 < 100000); {15943#false} is VALID [2018-11-14 18:45:29,182 INFO L273 TraceCheckUtils]: 116: Hoare triple {15943#false} havoc ~x~0;~x~0 := 0; {15943#false} is VALID [2018-11-14 18:45:29,182 INFO L273 TraceCheckUtils]: 117: Hoare triple {15943#false} assume true; {15943#false} is VALID [2018-11-14 18:45:29,182 INFO L273 TraceCheckUtils]: 118: Hoare triple {15943#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15943#false} is VALID [2018-11-14 18:45:29,183 INFO L256 TraceCheckUtils]: 119: Hoare triple {15943#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {15943#false} is VALID [2018-11-14 18:45:29,183 INFO L273 TraceCheckUtils]: 120: Hoare triple {15943#false} ~cond := #in~cond; {15943#false} is VALID [2018-11-14 18:45:29,183 INFO L273 TraceCheckUtils]: 121: Hoare triple {15943#false} assume ~cond == 0; {15943#false} is VALID [2018-11-14 18:45:29,183 INFO L273 TraceCheckUtils]: 122: Hoare triple {15943#false} assume !false; {15943#false} is VALID [2018-11-14 18:45:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 18:45:29,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-14 18:45:29,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:29,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:45:29,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:29,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:45:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:45:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:45:29,349 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 31 states. [2018-11-14 18:45:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:30,216 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2018-11-14 18:45:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:45:30,216 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-14 18:45:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:45:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 177 transitions. [2018-11-14 18:45:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:45:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 177 transitions. [2018-11-14 18:45:30,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 177 transitions. [2018-11-14 18:45:30,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:30,379 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:45:30,379 INFO L226 Difference]: Without dead ends: 134 [2018-11-14 18:45:30,380 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:45:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-14 18:45:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-14 18:45:30,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:30,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 132 states. [2018-11-14 18:45:30,415 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 132 states. [2018-11-14 18:45:30,415 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 132 states. [2018-11-14 18:45:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:30,417 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-14 18:45:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-14 18:45:30,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:30,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:30,418 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 134 states. [2018-11-14 18:45:30,418 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 134 states. [2018-11-14 18:45:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:30,421 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-14 18:45:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-14 18:45:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:30,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:30,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-14 18:45:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-11-14 18:45:30,423 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 123 [2018-11-14 18:45:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:30,423 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-14 18:45:30,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:45:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2018-11-14 18:45:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-14 18:45:30,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:30,424 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:30,425 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:30,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash -876229910, now seen corresponding path program 28 times [2018-11-14 18:45:30,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:30,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:30,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:30,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {16962#true} call ULTIMATE.init(); {16962#true} is VALID [2018-11-14 18:45:30,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {16962#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16962#true} is VALID [2018-11-14 18:45:30,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {16962#true} assume true; {16962#true} is VALID [2018-11-14 18:45:30,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16962#true} {16962#true} #57#return; {16962#true} is VALID [2018-11-14 18:45:30,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {16962#true} call #t~ret4 := main(); {16962#true} is VALID [2018-11-14 18:45:30,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {16962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {16964#(= main_~i~0 0)} is VALID [2018-11-14 18:45:30,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {16964#(= main_~i~0 0)} assume true; {16964#(= main_~i~0 0)} is VALID [2018-11-14 18:45:30,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {16964#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16964#(= main_~i~0 0)} is VALID [2018-11-14 18:45:30,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {16964#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16964#(= main_~i~0 0)} is VALID [2018-11-14 18:45:30,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {16964#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:30,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {16965#(<= main_~i~0 1)} assume true; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:30,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {16965#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:30,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {16965#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:30,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {16965#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:30,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {16966#(<= main_~i~0 2)} assume true; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:30,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {16966#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:30,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {16966#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:30,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {16966#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:30,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {16967#(<= main_~i~0 3)} assume true; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:30,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {16967#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:30,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {16967#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:30,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {16967#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:30,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {16968#(<= main_~i~0 4)} assume true; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:30,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {16968#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:30,976 INFO L273 TraceCheckUtils]: 24: Hoare triple {16968#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:30,977 INFO L273 TraceCheckUtils]: 25: Hoare triple {16968#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:30,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {16969#(<= main_~i~0 5)} assume true; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:30,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {16969#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:30,978 INFO L273 TraceCheckUtils]: 28: Hoare triple {16969#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:30,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {16969#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:30,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {16970#(<= main_~i~0 6)} assume true; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:30,980 INFO L273 TraceCheckUtils]: 31: Hoare triple {16970#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:30,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {16970#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:30,981 INFO L273 TraceCheckUtils]: 33: Hoare triple {16970#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:30,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {16971#(<= main_~i~0 7)} assume true; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:30,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {16971#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:30,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {16971#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:30,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {16971#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:30,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {16972#(<= main_~i~0 8)} assume true; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:30,984 INFO L273 TraceCheckUtils]: 39: Hoare triple {16972#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:30,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {16972#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:30,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {16972#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:30,986 INFO L273 TraceCheckUtils]: 42: Hoare triple {16973#(<= main_~i~0 9)} assume true; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:30,987 INFO L273 TraceCheckUtils]: 43: Hoare triple {16973#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:30,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {16973#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:30,988 INFO L273 TraceCheckUtils]: 45: Hoare triple {16973#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:30,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {16974#(<= main_~i~0 10)} assume true; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:30,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {16974#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:30,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {16974#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:30,990 INFO L273 TraceCheckUtils]: 49: Hoare triple {16974#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:30,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {16975#(<= main_~i~0 11)} assume true; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:30,991 INFO L273 TraceCheckUtils]: 51: Hoare triple {16975#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:30,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {16975#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:30,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {16975#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:30,992 INFO L273 TraceCheckUtils]: 54: Hoare triple {16976#(<= main_~i~0 12)} assume true; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:30,993 INFO L273 TraceCheckUtils]: 55: Hoare triple {16976#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:30,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {16976#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:30,994 INFO L273 TraceCheckUtils]: 57: Hoare triple {16976#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:30,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {16977#(<= main_~i~0 13)} assume true; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:30,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {16977#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:30,995 INFO L273 TraceCheckUtils]: 60: Hoare triple {16977#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:30,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {16977#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:30,997 INFO L273 TraceCheckUtils]: 62: Hoare triple {16978#(<= main_~i~0 14)} assume true; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:30,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {16978#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:30,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {16978#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:30,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {16978#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:30,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {16979#(<= main_~i~0 15)} assume true; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:30,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {16979#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {16979#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {16979#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {16980#(<= main_~i~0 16)} assume true; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {16980#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {16980#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {16980#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {16981#(<= main_~i~0 17)} assume true; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {16981#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {16981#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {16981#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {16982#(<= main_~i~0 18)} assume true; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,006 INFO L273 TraceCheckUtils]: 79: Hoare triple {16982#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,007 INFO L273 TraceCheckUtils]: 80: Hoare triple {16982#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {16982#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {16983#(<= main_~i~0 19)} assume true; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {16983#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,009 INFO L273 TraceCheckUtils]: 84: Hoare triple {16983#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,009 INFO L273 TraceCheckUtils]: 85: Hoare triple {16983#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,010 INFO L273 TraceCheckUtils]: 86: Hoare triple {16984#(<= main_~i~0 20)} assume true; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,010 INFO L273 TraceCheckUtils]: 87: Hoare triple {16984#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,011 INFO L273 TraceCheckUtils]: 88: Hoare triple {16984#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,012 INFO L273 TraceCheckUtils]: 89: Hoare triple {16984#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,012 INFO L273 TraceCheckUtils]: 90: Hoare triple {16985#(<= main_~i~0 21)} assume true; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,013 INFO L273 TraceCheckUtils]: 91: Hoare triple {16985#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,013 INFO L273 TraceCheckUtils]: 92: Hoare triple {16985#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,014 INFO L273 TraceCheckUtils]: 93: Hoare triple {16985#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,014 INFO L273 TraceCheckUtils]: 94: Hoare triple {16986#(<= main_~i~0 22)} assume true; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,015 INFO L273 TraceCheckUtils]: 95: Hoare triple {16986#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,015 INFO L273 TraceCheckUtils]: 96: Hoare triple {16986#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,016 INFO L273 TraceCheckUtils]: 97: Hoare triple {16986#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,017 INFO L273 TraceCheckUtils]: 98: Hoare triple {16987#(<= main_~i~0 23)} assume true; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,017 INFO L273 TraceCheckUtils]: 99: Hoare triple {16987#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,018 INFO L273 TraceCheckUtils]: 100: Hoare triple {16987#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,018 INFO L273 TraceCheckUtils]: 101: Hoare triple {16987#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,019 INFO L273 TraceCheckUtils]: 102: Hoare triple {16988#(<= main_~i~0 24)} assume true; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,019 INFO L273 TraceCheckUtils]: 103: Hoare triple {16988#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,020 INFO L273 TraceCheckUtils]: 104: Hoare triple {16988#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,021 INFO L273 TraceCheckUtils]: 105: Hoare triple {16988#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,021 INFO L273 TraceCheckUtils]: 106: Hoare triple {16989#(<= main_~i~0 25)} assume true; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,022 INFO L273 TraceCheckUtils]: 107: Hoare triple {16989#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,022 INFO L273 TraceCheckUtils]: 108: Hoare triple {16989#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,023 INFO L273 TraceCheckUtils]: 109: Hoare triple {16989#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,023 INFO L273 TraceCheckUtils]: 110: Hoare triple {16990#(<= main_~i~0 26)} assume true; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,024 INFO L273 TraceCheckUtils]: 111: Hoare triple {16990#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,025 INFO L273 TraceCheckUtils]: 112: Hoare triple {16990#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {16990#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,026 INFO L273 TraceCheckUtils]: 114: Hoare triple {16991#(<= main_~i~0 27)} assume true; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,027 INFO L273 TraceCheckUtils]: 115: Hoare triple {16991#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,027 INFO L273 TraceCheckUtils]: 116: Hoare triple {16991#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,028 INFO L273 TraceCheckUtils]: 117: Hoare triple {16991#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {16992#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:31,029 INFO L273 TraceCheckUtils]: 118: Hoare triple {16992#(<= main_~i~0 28)} assume true; {16992#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:31,029 INFO L273 TraceCheckUtils]: 119: Hoare triple {16992#(<= main_~i~0 28)} assume !(~i~0 < 100000); {16963#false} is VALID [2018-11-14 18:45:31,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {16963#false} havoc ~x~0;~x~0 := 0; {16963#false} is VALID [2018-11-14 18:45:31,030 INFO L273 TraceCheckUtils]: 121: Hoare triple {16963#false} assume true; {16963#false} is VALID [2018-11-14 18:45:31,030 INFO L273 TraceCheckUtils]: 122: Hoare triple {16963#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {16963#false} is VALID [2018-11-14 18:45:31,030 INFO L256 TraceCheckUtils]: 123: Hoare triple {16963#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {16963#false} is VALID [2018-11-14 18:45:31,031 INFO L273 TraceCheckUtils]: 124: Hoare triple {16963#false} ~cond := #in~cond; {16963#false} is VALID [2018-11-14 18:45:31,031 INFO L273 TraceCheckUtils]: 125: Hoare triple {16963#false} assume ~cond == 0; {16963#false} is VALID [2018-11-14 18:45:31,031 INFO L273 TraceCheckUtils]: 126: Hoare triple {16963#false} assume !false; {16963#false} is VALID [2018-11-14 18:45:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:31,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:31,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:31,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:45:31,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:45:31,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:31,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:31,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {16962#true} call ULTIMATE.init(); {16962#true} is VALID [2018-11-14 18:45:31,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {16962#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16962#true} is VALID [2018-11-14 18:45:31,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {16962#true} assume true; {16962#true} is VALID [2018-11-14 18:45:31,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16962#true} {16962#true} #57#return; {16962#true} is VALID [2018-11-14 18:45:31,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {16962#true} call #t~ret4 := main(); {16962#true} is VALID [2018-11-14 18:45:31,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {16962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {17011#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:31,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {17011#(<= main_~i~0 0)} assume true; {17011#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:31,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {17011#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {17011#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:31,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {17011#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {17011#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:31,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {17011#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:31,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {16965#(<= main_~i~0 1)} assume true; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:31,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {16965#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:31,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {16965#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16965#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:31,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {16965#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:31,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {16966#(<= main_~i~0 2)} assume true; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:31,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {16966#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:31,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {16966#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16966#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:31,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {16966#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:31,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {16967#(<= main_~i~0 3)} assume true; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:31,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {16967#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:31,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {16967#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16967#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:31,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {16967#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:31,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {16968#(<= main_~i~0 4)} assume true; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:31,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {16968#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:31,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {16968#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16968#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:31,450 INFO L273 TraceCheckUtils]: 25: Hoare triple {16968#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:31,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {16969#(<= main_~i~0 5)} assume true; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:31,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {16969#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:31,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {16969#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16969#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:31,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {16969#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:31,453 INFO L273 TraceCheckUtils]: 30: Hoare triple {16970#(<= main_~i~0 6)} assume true; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:31,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {16970#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:31,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {16970#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16970#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:31,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {16970#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:31,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {16971#(<= main_~i~0 7)} assume true; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:31,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {16971#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:31,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {16971#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16971#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:31,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {16971#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:31,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {16972#(<= main_~i~0 8)} assume true; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:31,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {16972#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:31,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {16972#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16972#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:31,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {16972#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:31,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {16973#(<= main_~i~0 9)} assume true; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:31,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {16973#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:31,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {16973#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16973#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:31,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {16973#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:31,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {16974#(<= main_~i~0 10)} assume true; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:31,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {16974#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:31,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {16974#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16974#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:31,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {16974#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:31,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {16975#(<= main_~i~0 11)} assume true; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:31,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {16975#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:31,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {16975#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16975#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:31,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {16975#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:31,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {16976#(<= main_~i~0 12)} assume true; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:31,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {16976#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:31,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {16976#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16976#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:31,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {16976#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:31,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {16977#(<= main_~i~0 13)} assume true; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:31,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {16977#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:31,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {16977#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16977#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:31,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {16977#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:31,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {16978#(<= main_~i~0 14)} assume true; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:31,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {16978#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:31,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {16978#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16978#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:31,472 INFO L273 TraceCheckUtils]: 65: Hoare triple {16978#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {16979#(<= main_~i~0 15)} assume true; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {16979#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {16979#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16979#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:31,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {16979#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {16980#(<= main_~i~0 16)} assume true; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {16980#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {16980#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16980#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:31,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {16980#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {16981#(<= main_~i~0 17)} assume true; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {16981#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {16981#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16981#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:31,478 INFO L273 TraceCheckUtils]: 77: Hoare triple {16981#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {16982#(<= main_~i~0 18)} assume true; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {16982#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {16982#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16982#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:31,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {16982#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {16983#(<= main_~i~0 19)} assume true; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {16983#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {16983#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16983#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:31,482 INFO L273 TraceCheckUtils]: 85: Hoare triple {16983#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {16984#(<= main_~i~0 20)} assume true; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {16984#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,484 INFO L273 TraceCheckUtils]: 88: Hoare triple {16984#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16984#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:31,484 INFO L273 TraceCheckUtils]: 89: Hoare triple {16984#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,485 INFO L273 TraceCheckUtils]: 90: Hoare triple {16985#(<= main_~i~0 21)} assume true; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,485 INFO L273 TraceCheckUtils]: 91: Hoare triple {16985#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,486 INFO L273 TraceCheckUtils]: 92: Hoare triple {16985#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16985#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:31,486 INFO L273 TraceCheckUtils]: 93: Hoare triple {16985#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,487 INFO L273 TraceCheckUtils]: 94: Hoare triple {16986#(<= main_~i~0 22)} assume true; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {16986#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,488 INFO L273 TraceCheckUtils]: 96: Hoare triple {16986#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16986#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:31,488 INFO L273 TraceCheckUtils]: 97: Hoare triple {16986#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,489 INFO L273 TraceCheckUtils]: 98: Hoare triple {16987#(<= main_~i~0 23)} assume true; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {16987#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,490 INFO L273 TraceCheckUtils]: 100: Hoare triple {16987#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16987#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:31,491 INFO L273 TraceCheckUtils]: 101: Hoare triple {16987#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,491 INFO L273 TraceCheckUtils]: 102: Hoare triple {16988#(<= main_~i~0 24)} assume true; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,491 INFO L273 TraceCheckUtils]: 103: Hoare triple {16988#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,492 INFO L273 TraceCheckUtils]: 104: Hoare triple {16988#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16988#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:31,493 INFO L273 TraceCheckUtils]: 105: Hoare triple {16988#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,493 INFO L273 TraceCheckUtils]: 106: Hoare triple {16989#(<= main_~i~0 25)} assume true; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,494 INFO L273 TraceCheckUtils]: 107: Hoare triple {16989#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,494 INFO L273 TraceCheckUtils]: 108: Hoare triple {16989#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16989#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:31,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {16989#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,495 INFO L273 TraceCheckUtils]: 110: Hoare triple {16990#(<= main_~i~0 26)} assume true; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,496 INFO L273 TraceCheckUtils]: 111: Hoare triple {16990#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,514 INFO L273 TraceCheckUtils]: 112: Hoare triple {16990#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16990#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:31,527 INFO L273 TraceCheckUtils]: 113: Hoare triple {16990#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,535 INFO L273 TraceCheckUtils]: 114: Hoare triple {16991#(<= main_~i~0 27)} assume true; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,543 INFO L273 TraceCheckUtils]: 115: Hoare triple {16991#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,543 INFO L273 TraceCheckUtils]: 116: Hoare triple {16991#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {16991#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:31,544 INFO L273 TraceCheckUtils]: 117: Hoare triple {16991#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {16992#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:31,544 INFO L273 TraceCheckUtils]: 118: Hoare triple {16992#(<= main_~i~0 28)} assume true; {16992#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 119: Hoare triple {16992#(<= main_~i~0 28)} assume !(~i~0 < 100000); {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 120: Hoare triple {16963#false} havoc ~x~0;~x~0 := 0; {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 121: Hoare triple {16963#false} assume true; {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 122: Hoare triple {16963#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L256 TraceCheckUtils]: 123: Hoare triple {16963#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 124: Hoare triple {16963#false} ~cond := #in~cond; {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 125: Hoare triple {16963#false} assume ~cond == 0; {16963#false} is VALID [2018-11-14 18:45:31,549 INFO L273 TraceCheckUtils]: 126: Hoare triple {16963#false} assume !false; {16963#false} is VALID [2018-11-14 18:45:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:31,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 18:45:31,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-14 18:45:31,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:31,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:45:31,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:31,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:45:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:45:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:45:31,695 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 32 states. [2018-11-14 18:45:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:32,537 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2018-11-14 18:45:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:45:32,538 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-14 18:45:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:45:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2018-11-14 18:45:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:45:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 182 transitions. [2018-11-14 18:45:32,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 182 transitions. [2018-11-14 18:45:32,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:32,775 INFO L225 Difference]: With dead ends: 150 [2018-11-14 18:45:32,775 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 18:45:32,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:45:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 18:45:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-14 18:45:32,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:32,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-14 18:45:32,803 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-14 18:45:32,803 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-14 18:45:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:32,806 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-11-14 18:45:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-14 18:45:32,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:32,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:32,807 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-14 18:45:32,807 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-14 18:45:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:32,809 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-11-14 18:45:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-14 18:45:32,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:32,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:32,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:32,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-14 18:45:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2018-11-14 18:45:32,812 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 127 [2018-11-14 18:45:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:32,813 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2018-11-14 18:45:32,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:45:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2018-11-14 18:45:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-14 18:45:32,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:32,814 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:32,814 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:32,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash 617931328, now seen corresponding path program 29 times [2018-11-14 18:45:32,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:32,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:32,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:33,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {18013#true} call ULTIMATE.init(); {18013#true} is VALID [2018-11-14 18:45:33,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {18013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18013#true} is VALID [2018-11-14 18:45:33,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {18013#true} assume true; {18013#true} is VALID [2018-11-14 18:45:33,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18013#true} {18013#true} #57#return; {18013#true} is VALID [2018-11-14 18:45:33,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {18013#true} call #t~ret4 := main(); {18013#true} is VALID [2018-11-14 18:45:33,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {18013#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18015#(= main_~i~0 0)} is VALID [2018-11-14 18:45:33,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {18015#(= main_~i~0 0)} assume true; {18015#(= main_~i~0 0)} is VALID [2018-11-14 18:45:33,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {18015#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18015#(= main_~i~0 0)} is VALID [2018-11-14 18:45:33,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {18015#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18015#(= main_~i~0 0)} is VALID [2018-11-14 18:45:33,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {18015#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:33,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {18016#(<= main_~i~0 1)} assume true; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:33,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {18016#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:33,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {18016#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:33,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {18016#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:33,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {18017#(<= main_~i~0 2)} assume true; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:33,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {18017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:33,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {18017#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:33,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {18017#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:33,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {18018#(<= main_~i~0 3)} assume true; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:33,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {18018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:33,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {18018#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:33,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {18018#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:33,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {18019#(<= main_~i~0 4)} assume true; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:33,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {18019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:33,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {18019#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:33,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {18019#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:33,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {18020#(<= main_~i~0 5)} assume true; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:33,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {18020#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:33,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {18020#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:33,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {18020#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:33,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {18021#(<= main_~i~0 6)} assume true; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:33,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {18021#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:33,378 INFO L273 TraceCheckUtils]: 32: Hoare triple {18021#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:33,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {18021#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:33,379 INFO L273 TraceCheckUtils]: 34: Hoare triple {18022#(<= main_~i~0 7)} assume true; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:33,379 INFO L273 TraceCheckUtils]: 35: Hoare triple {18022#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:33,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {18022#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:33,381 INFO L273 TraceCheckUtils]: 37: Hoare triple {18022#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:33,381 INFO L273 TraceCheckUtils]: 38: Hoare triple {18023#(<= main_~i~0 8)} assume true; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:33,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {18023#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:33,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {18023#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:33,383 INFO L273 TraceCheckUtils]: 41: Hoare triple {18023#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:33,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {18024#(<= main_~i~0 9)} assume true; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:33,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {18024#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:33,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {18024#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:33,385 INFO L273 TraceCheckUtils]: 45: Hoare triple {18024#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:33,386 INFO L273 TraceCheckUtils]: 46: Hoare triple {18025#(<= main_~i~0 10)} assume true; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:33,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {18025#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:33,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {18025#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:33,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {18025#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:33,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {18026#(<= main_~i~0 11)} assume true; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:33,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {18026#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:33,389 INFO L273 TraceCheckUtils]: 52: Hoare triple {18026#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:33,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {18026#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:33,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {18027#(<= main_~i~0 12)} assume true; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:33,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {18027#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:33,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {18027#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:33,392 INFO L273 TraceCheckUtils]: 57: Hoare triple {18027#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:33,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {18028#(<= main_~i~0 13)} assume true; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:33,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {18028#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:33,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {18028#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:33,394 INFO L273 TraceCheckUtils]: 61: Hoare triple {18028#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:33,394 INFO L273 TraceCheckUtils]: 62: Hoare triple {18029#(<= main_~i~0 14)} assume true; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:33,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {18029#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:33,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {18029#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:33,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {18029#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:33,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {18030#(<= main_~i~0 15)} assume true; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:33,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {18030#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:33,397 INFO L273 TraceCheckUtils]: 68: Hoare triple {18030#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:33,398 INFO L273 TraceCheckUtils]: 69: Hoare triple {18030#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:33,399 INFO L273 TraceCheckUtils]: 70: Hoare triple {18031#(<= main_~i~0 16)} assume true; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:33,399 INFO L273 TraceCheckUtils]: 71: Hoare triple {18031#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:33,400 INFO L273 TraceCheckUtils]: 72: Hoare triple {18031#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:33,400 INFO L273 TraceCheckUtils]: 73: Hoare triple {18031#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:33,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {18032#(<= main_~i~0 17)} assume true; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:33,401 INFO L273 TraceCheckUtils]: 75: Hoare triple {18032#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:33,402 INFO L273 TraceCheckUtils]: 76: Hoare triple {18032#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:33,402 INFO L273 TraceCheckUtils]: 77: Hoare triple {18032#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:33,403 INFO L273 TraceCheckUtils]: 78: Hoare triple {18033#(<= main_~i~0 18)} assume true; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:33,403 INFO L273 TraceCheckUtils]: 79: Hoare triple {18033#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:33,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {18033#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:33,405 INFO L273 TraceCheckUtils]: 81: Hoare triple {18033#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:33,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {18034#(<= main_~i~0 19)} assume true; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:33,406 INFO L273 TraceCheckUtils]: 83: Hoare triple {18034#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:33,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {18034#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:33,407 INFO L273 TraceCheckUtils]: 85: Hoare triple {18034#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:33,407 INFO L273 TraceCheckUtils]: 86: Hoare triple {18035#(<= main_~i~0 20)} assume true; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:33,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {18035#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:33,408 INFO L273 TraceCheckUtils]: 88: Hoare triple {18035#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:33,409 INFO L273 TraceCheckUtils]: 89: Hoare triple {18035#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:33,410 INFO L273 TraceCheckUtils]: 90: Hoare triple {18036#(<= main_~i~0 21)} assume true; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:33,410 INFO L273 TraceCheckUtils]: 91: Hoare triple {18036#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:33,411 INFO L273 TraceCheckUtils]: 92: Hoare triple {18036#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:33,411 INFO L273 TraceCheckUtils]: 93: Hoare triple {18036#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:33,412 INFO L273 TraceCheckUtils]: 94: Hoare triple {18037#(<= main_~i~0 22)} assume true; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:33,412 INFO L273 TraceCheckUtils]: 95: Hoare triple {18037#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:33,413 INFO L273 TraceCheckUtils]: 96: Hoare triple {18037#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:33,413 INFO L273 TraceCheckUtils]: 97: Hoare triple {18037#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:33,414 INFO L273 TraceCheckUtils]: 98: Hoare triple {18038#(<= main_~i~0 23)} assume true; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:33,414 INFO L273 TraceCheckUtils]: 99: Hoare triple {18038#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:33,415 INFO L273 TraceCheckUtils]: 100: Hoare triple {18038#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:33,416 INFO L273 TraceCheckUtils]: 101: Hoare triple {18038#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:33,416 INFO L273 TraceCheckUtils]: 102: Hoare triple {18039#(<= main_~i~0 24)} assume true; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:33,417 INFO L273 TraceCheckUtils]: 103: Hoare triple {18039#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:33,417 INFO L273 TraceCheckUtils]: 104: Hoare triple {18039#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:33,418 INFO L273 TraceCheckUtils]: 105: Hoare triple {18039#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:33,418 INFO L273 TraceCheckUtils]: 106: Hoare triple {18040#(<= main_~i~0 25)} assume true; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:33,419 INFO L273 TraceCheckUtils]: 107: Hoare triple {18040#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:33,419 INFO L273 TraceCheckUtils]: 108: Hoare triple {18040#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:33,420 INFO L273 TraceCheckUtils]: 109: Hoare triple {18040#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:33,420 INFO L273 TraceCheckUtils]: 110: Hoare triple {18041#(<= main_~i~0 26)} assume true; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:33,421 INFO L273 TraceCheckUtils]: 111: Hoare triple {18041#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:33,421 INFO L273 TraceCheckUtils]: 112: Hoare triple {18041#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:33,422 INFO L273 TraceCheckUtils]: 113: Hoare triple {18041#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:33,423 INFO L273 TraceCheckUtils]: 114: Hoare triple {18042#(<= main_~i~0 27)} assume true; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:33,423 INFO L273 TraceCheckUtils]: 115: Hoare triple {18042#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:33,442 INFO L273 TraceCheckUtils]: 116: Hoare triple {18042#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:33,454 INFO L273 TraceCheckUtils]: 117: Hoare triple {18042#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:33,454 INFO L273 TraceCheckUtils]: 118: Hoare triple {18043#(<= main_~i~0 28)} assume true; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:33,455 INFO L273 TraceCheckUtils]: 119: Hoare triple {18043#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:33,455 INFO L273 TraceCheckUtils]: 120: Hoare triple {18043#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:33,455 INFO L273 TraceCheckUtils]: 121: Hoare triple {18043#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {18044#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:33,456 INFO L273 TraceCheckUtils]: 122: Hoare triple {18044#(<= main_~i~0 29)} assume true; {18044#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:33,456 INFO L273 TraceCheckUtils]: 123: Hoare triple {18044#(<= main_~i~0 29)} assume !(~i~0 < 100000); {18014#false} is VALID [2018-11-14 18:45:33,456 INFO L273 TraceCheckUtils]: 124: Hoare triple {18014#false} havoc ~x~0;~x~0 := 0; {18014#false} is VALID [2018-11-14 18:45:33,456 INFO L273 TraceCheckUtils]: 125: Hoare triple {18014#false} assume true; {18014#false} is VALID [2018-11-14 18:45:33,457 INFO L273 TraceCheckUtils]: 126: Hoare triple {18014#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {18014#false} is VALID [2018-11-14 18:45:33,457 INFO L256 TraceCheckUtils]: 127: Hoare triple {18014#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {18014#false} is VALID [2018-11-14 18:45:33,457 INFO L273 TraceCheckUtils]: 128: Hoare triple {18014#false} ~cond := #in~cond; {18014#false} is VALID [2018-11-14 18:45:33,457 INFO L273 TraceCheckUtils]: 129: Hoare triple {18014#false} assume ~cond == 0; {18014#false} is VALID [2018-11-14 18:45:33,457 INFO L273 TraceCheckUtils]: 130: Hoare triple {18014#false} assume !false; {18014#false} is VALID [2018-11-14 18:45:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:33,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:33,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:45:33,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 18:45:33,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:33,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:34,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {18013#true} call ULTIMATE.init(); {18013#true} is VALID [2018-11-14 18:45:34,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {18013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18013#true} is VALID [2018-11-14 18:45:34,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {18013#true} assume true; {18013#true} is VALID [2018-11-14 18:45:34,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18013#true} {18013#true} #57#return; {18013#true} is VALID [2018-11-14 18:45:34,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {18013#true} call #t~ret4 := main(); {18013#true} is VALID [2018-11-14 18:45:34,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {18013#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {18063#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:34,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {18063#(<= main_~i~0 0)} assume true; {18063#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:34,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {18063#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18063#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:34,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {18063#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18063#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:34,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {18063#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:34,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {18016#(<= main_~i~0 1)} assume true; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:34,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {18016#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:34,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {18016#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18016#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:34,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {18016#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:34,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {18017#(<= main_~i~0 2)} assume true; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:34,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {18017#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:34,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {18017#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18017#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:34,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {18017#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:34,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {18018#(<= main_~i~0 3)} assume true; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:34,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {18018#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:34,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {18018#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18018#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:34,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {18018#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:34,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {18019#(<= main_~i~0 4)} assume true; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:34,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {18019#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:34,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {18019#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18019#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:34,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {18019#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:34,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {18020#(<= main_~i~0 5)} assume true; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:34,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {18020#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:34,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {18020#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18020#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:34,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {18020#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:34,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {18021#(<= main_~i~0 6)} assume true; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:34,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {18021#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:34,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {18021#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18021#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:34,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {18021#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:34,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {18022#(<= main_~i~0 7)} assume true; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:34,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {18022#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:34,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {18022#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18022#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:34,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {18022#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:34,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {18023#(<= main_~i~0 8)} assume true; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:34,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {18023#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:34,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {18023#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18023#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:34,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {18023#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:34,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {18024#(<= main_~i~0 9)} assume true; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:34,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {18024#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:34,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {18024#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18024#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:34,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {18024#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:34,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {18025#(<= main_~i~0 10)} assume true; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:34,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {18025#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:34,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {18025#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18025#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:34,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {18025#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:34,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {18026#(<= main_~i~0 11)} assume true; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:34,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {18026#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:34,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {18026#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18026#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:34,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {18026#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:34,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {18027#(<= main_~i~0 12)} assume true; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:34,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {18027#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:34,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {18027#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18027#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:34,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {18027#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:34,810 INFO L273 TraceCheckUtils]: 58: Hoare triple {18028#(<= main_~i~0 13)} assume true; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:34,810 INFO L273 TraceCheckUtils]: 59: Hoare triple {18028#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:34,811 INFO L273 TraceCheckUtils]: 60: Hoare triple {18028#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18028#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:34,811 INFO L273 TraceCheckUtils]: 61: Hoare triple {18028#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:34,812 INFO L273 TraceCheckUtils]: 62: Hoare triple {18029#(<= main_~i~0 14)} assume true; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:34,812 INFO L273 TraceCheckUtils]: 63: Hoare triple {18029#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:34,813 INFO L273 TraceCheckUtils]: 64: Hoare triple {18029#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18029#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:34,813 INFO L273 TraceCheckUtils]: 65: Hoare triple {18029#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:34,814 INFO L273 TraceCheckUtils]: 66: Hoare triple {18030#(<= main_~i~0 15)} assume true; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:34,814 INFO L273 TraceCheckUtils]: 67: Hoare triple {18030#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:34,815 INFO L273 TraceCheckUtils]: 68: Hoare triple {18030#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18030#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:34,815 INFO L273 TraceCheckUtils]: 69: Hoare triple {18030#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:34,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {18031#(<= main_~i~0 16)} assume true; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:34,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {18031#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:34,817 INFO L273 TraceCheckUtils]: 72: Hoare triple {18031#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18031#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:34,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {18031#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:34,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {18032#(<= main_~i~0 17)} assume true; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:34,818 INFO L273 TraceCheckUtils]: 75: Hoare triple {18032#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:34,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {18032#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18032#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:34,820 INFO L273 TraceCheckUtils]: 77: Hoare triple {18032#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:34,820 INFO L273 TraceCheckUtils]: 78: Hoare triple {18033#(<= main_~i~0 18)} assume true; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:34,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {18033#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:34,821 INFO L273 TraceCheckUtils]: 80: Hoare triple {18033#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18033#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:34,822 INFO L273 TraceCheckUtils]: 81: Hoare triple {18033#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:34,822 INFO L273 TraceCheckUtils]: 82: Hoare triple {18034#(<= main_~i~0 19)} assume true; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:34,823 INFO L273 TraceCheckUtils]: 83: Hoare triple {18034#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:34,823 INFO L273 TraceCheckUtils]: 84: Hoare triple {18034#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18034#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:34,824 INFO L273 TraceCheckUtils]: 85: Hoare triple {18034#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:34,824 INFO L273 TraceCheckUtils]: 86: Hoare triple {18035#(<= main_~i~0 20)} assume true; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:34,825 INFO L273 TraceCheckUtils]: 87: Hoare triple {18035#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:34,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {18035#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18035#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:34,826 INFO L273 TraceCheckUtils]: 89: Hoare triple {18035#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:34,826 INFO L273 TraceCheckUtils]: 90: Hoare triple {18036#(<= main_~i~0 21)} assume true; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:34,827 INFO L273 TraceCheckUtils]: 91: Hoare triple {18036#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:34,827 INFO L273 TraceCheckUtils]: 92: Hoare triple {18036#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18036#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:34,828 INFO L273 TraceCheckUtils]: 93: Hoare triple {18036#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:34,828 INFO L273 TraceCheckUtils]: 94: Hoare triple {18037#(<= main_~i~0 22)} assume true; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:34,829 INFO L273 TraceCheckUtils]: 95: Hoare triple {18037#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:34,829 INFO L273 TraceCheckUtils]: 96: Hoare triple {18037#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18037#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:34,830 INFO L273 TraceCheckUtils]: 97: Hoare triple {18037#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:34,830 INFO L273 TraceCheckUtils]: 98: Hoare triple {18038#(<= main_~i~0 23)} assume true; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:34,831 INFO L273 TraceCheckUtils]: 99: Hoare triple {18038#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:34,831 INFO L273 TraceCheckUtils]: 100: Hoare triple {18038#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18038#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:34,834 INFO L273 TraceCheckUtils]: 101: Hoare triple {18038#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:34,834 INFO L273 TraceCheckUtils]: 102: Hoare triple {18039#(<= main_~i~0 24)} assume true; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:34,834 INFO L273 TraceCheckUtils]: 103: Hoare triple {18039#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:34,835 INFO L273 TraceCheckUtils]: 104: Hoare triple {18039#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18039#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:34,835 INFO L273 TraceCheckUtils]: 105: Hoare triple {18039#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:34,835 INFO L273 TraceCheckUtils]: 106: Hoare triple {18040#(<= main_~i~0 25)} assume true; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:34,836 INFO L273 TraceCheckUtils]: 107: Hoare triple {18040#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:34,836 INFO L273 TraceCheckUtils]: 108: Hoare triple {18040#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18040#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:34,836 INFO L273 TraceCheckUtils]: 109: Hoare triple {18040#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:34,837 INFO L273 TraceCheckUtils]: 110: Hoare triple {18041#(<= main_~i~0 26)} assume true; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:34,837 INFO L273 TraceCheckUtils]: 111: Hoare triple {18041#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:34,837 INFO L273 TraceCheckUtils]: 112: Hoare triple {18041#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18041#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:34,838 INFO L273 TraceCheckUtils]: 113: Hoare triple {18041#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:34,838 INFO L273 TraceCheckUtils]: 114: Hoare triple {18042#(<= main_~i~0 27)} assume true; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:34,839 INFO L273 TraceCheckUtils]: 115: Hoare triple {18042#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:34,839 INFO L273 TraceCheckUtils]: 116: Hoare triple {18042#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18042#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:34,840 INFO L273 TraceCheckUtils]: 117: Hoare triple {18042#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:34,840 INFO L273 TraceCheckUtils]: 118: Hoare triple {18043#(<= main_~i~0 28)} assume true; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:34,841 INFO L273 TraceCheckUtils]: 119: Hoare triple {18043#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:34,841 INFO L273 TraceCheckUtils]: 120: Hoare triple {18043#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {18043#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:34,842 INFO L273 TraceCheckUtils]: 121: Hoare triple {18043#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {18044#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:34,842 INFO L273 TraceCheckUtils]: 122: Hoare triple {18044#(<= main_~i~0 29)} assume true; {18044#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:34,843 INFO L273 TraceCheckUtils]: 123: Hoare triple {18044#(<= main_~i~0 29)} assume !(~i~0 < 100000); {18014#false} is VALID [2018-11-14 18:45:34,843 INFO L273 TraceCheckUtils]: 124: Hoare triple {18014#false} havoc ~x~0;~x~0 := 0; {18014#false} is VALID [2018-11-14 18:45:34,843 INFO L273 TraceCheckUtils]: 125: Hoare triple {18014#false} assume true; {18014#false} is VALID [2018-11-14 18:45:34,844 INFO L273 TraceCheckUtils]: 126: Hoare triple {18014#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {18014#false} is VALID [2018-11-14 18:45:34,844 INFO L256 TraceCheckUtils]: 127: Hoare triple {18014#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {18014#false} is VALID [2018-11-14 18:45:34,844 INFO L273 TraceCheckUtils]: 128: Hoare triple {18014#false} ~cond := #in~cond; {18014#false} is VALID [2018-11-14 18:45:34,844 INFO L273 TraceCheckUtils]: 129: Hoare triple {18014#false} assume ~cond == 0; {18014#false} is VALID [2018-11-14 18:45:34,844 INFO L273 TraceCheckUtils]: 130: Hoare triple {18014#false} assume !false; {18014#false} is VALID [2018-11-14 18:45:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 18:45:34,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-14 18:45:34,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:34,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 18:45:34,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-14 18:45:34,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 18:45:34,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 18:45:34,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:45:34,992 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand 33 states. [2018-11-14 18:45:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:35,703 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2018-11-14 18:45:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:45:35,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-14 18:45:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:45:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-14 18:45:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:45:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-14 18:45:35,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 187 transitions. [2018-11-14 18:45:35,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:35,871 INFO L225 Difference]: With dead ends: 154 [2018-11-14 18:45:35,872 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:45:35,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:45:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:45:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-14 18:45:35,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:35,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-14 18:45:35,902 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-14 18:45:35,902 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-14 18:45:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:35,904 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-11-14 18:45:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-14 18:45:35,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:35,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:35,904 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-14 18:45:35,904 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-14 18:45:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:35,906 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-11-14 18:45:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-14 18:45:35,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:35,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:35,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:35,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 18:45:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2018-11-14 18:45:35,909 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 131 [2018-11-14 18:45:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:35,909 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2018-11-14 18:45:35,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 18:45:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2018-11-14 18:45:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-14 18:45:35,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:35,910 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:35,910 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:35,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1489215850, now seen corresponding path program 30 times [2018-11-14 18:45:35,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:35,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:35,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:37,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {19095#true} call ULTIMATE.init(); {19095#true} is VALID [2018-11-14 18:45:37,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {19095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19095#true} is VALID [2018-11-14 18:45:37,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {19095#true} assume true; {19095#true} is VALID [2018-11-14 18:45:37,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19095#true} {19095#true} #57#return; {19095#true} is VALID [2018-11-14 18:45:37,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {19095#true} call #t~ret4 := main(); {19095#true} is VALID [2018-11-14 18:45:37,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {19095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19097#(= main_~i~0 0)} is VALID [2018-11-14 18:45:37,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {19097#(= main_~i~0 0)} assume true; {19097#(= main_~i~0 0)} is VALID [2018-11-14 18:45:37,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {19097#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19097#(= main_~i~0 0)} is VALID [2018-11-14 18:45:37,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {19097#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19097#(= main_~i~0 0)} is VALID [2018-11-14 18:45:37,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {19097#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {19098#(<= main_~i~0 1)} assume true; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {19098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {19098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {19098#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {19099#(<= main_~i~0 2)} assume true; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {19099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {19099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {19099#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {19100#(<= main_~i~0 3)} assume true; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {19100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {19100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {19100#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {19101#(<= main_~i~0 4)} assume true; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {19101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {19101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {19101#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {19102#(<= main_~i~0 5)} assume true; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {19102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {19102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {19102#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {19103#(<= main_~i~0 6)} assume true; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {19103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {19103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {19103#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {19104#(<= main_~i~0 7)} assume true; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {19104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,372 INFO L273 TraceCheckUtils]: 36: Hoare triple {19104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {19104#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {19105#(<= main_~i~0 8)} assume true; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,374 INFO L273 TraceCheckUtils]: 39: Hoare triple {19105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {19105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {19105#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {19106#(<= main_~i~0 9)} assume true; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,376 INFO L273 TraceCheckUtils]: 43: Hoare triple {19106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {19106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,377 INFO L273 TraceCheckUtils]: 45: Hoare triple {19106#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {19107#(<= main_~i~0 10)} assume true; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {19107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,379 INFO L273 TraceCheckUtils]: 48: Hoare triple {19107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {19107#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,380 INFO L273 TraceCheckUtils]: 50: Hoare triple {19108#(<= main_~i~0 11)} assume true; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {19108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {19108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,382 INFO L273 TraceCheckUtils]: 53: Hoare triple {19108#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:37,382 INFO L273 TraceCheckUtils]: 54: Hoare triple {19109#(<= main_~i~0 12)} assume true; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:37,383 INFO L273 TraceCheckUtils]: 55: Hoare triple {19109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:37,383 INFO L273 TraceCheckUtils]: 56: Hoare triple {19109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:37,384 INFO L273 TraceCheckUtils]: 57: Hoare triple {19109#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:37,385 INFO L273 TraceCheckUtils]: 58: Hoare triple {19110#(<= main_~i~0 13)} assume true; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:37,385 INFO L273 TraceCheckUtils]: 59: Hoare triple {19110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:37,386 INFO L273 TraceCheckUtils]: 60: Hoare triple {19110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:37,386 INFO L273 TraceCheckUtils]: 61: Hoare triple {19110#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:37,387 INFO L273 TraceCheckUtils]: 62: Hoare triple {19111#(<= main_~i~0 14)} assume true; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:37,387 INFO L273 TraceCheckUtils]: 63: Hoare triple {19111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:37,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {19111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:37,388 INFO L273 TraceCheckUtils]: 65: Hoare triple {19111#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:37,389 INFO L273 TraceCheckUtils]: 66: Hoare triple {19112#(<= main_~i~0 15)} assume true; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:37,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {19112#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:37,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {19112#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:37,391 INFO L273 TraceCheckUtils]: 69: Hoare triple {19112#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:37,391 INFO L273 TraceCheckUtils]: 70: Hoare triple {19113#(<= main_~i~0 16)} assume true; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:37,392 INFO L273 TraceCheckUtils]: 71: Hoare triple {19113#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:37,392 INFO L273 TraceCheckUtils]: 72: Hoare triple {19113#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:37,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {19113#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:37,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {19114#(<= main_~i~0 17)} assume true; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:37,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {19114#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:37,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {19114#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:37,395 INFO L273 TraceCheckUtils]: 77: Hoare triple {19114#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:37,396 INFO L273 TraceCheckUtils]: 78: Hoare triple {19115#(<= main_~i~0 18)} assume true; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:37,396 INFO L273 TraceCheckUtils]: 79: Hoare triple {19115#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:37,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {19115#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:37,397 INFO L273 TraceCheckUtils]: 81: Hoare triple {19115#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:37,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {19116#(<= main_~i~0 19)} assume true; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:37,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {19116#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:37,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {19116#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:37,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {19116#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:37,400 INFO L273 TraceCheckUtils]: 86: Hoare triple {19117#(<= main_~i~0 20)} assume true; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:37,400 INFO L273 TraceCheckUtils]: 87: Hoare triple {19117#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:37,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {19117#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:37,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {19117#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:37,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {19118#(<= main_~i~0 21)} assume true; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:37,403 INFO L273 TraceCheckUtils]: 91: Hoare triple {19118#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:37,403 INFO L273 TraceCheckUtils]: 92: Hoare triple {19118#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:37,404 INFO L273 TraceCheckUtils]: 93: Hoare triple {19118#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:37,404 INFO L273 TraceCheckUtils]: 94: Hoare triple {19119#(<= main_~i~0 22)} assume true; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:37,405 INFO L273 TraceCheckUtils]: 95: Hoare triple {19119#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:37,405 INFO L273 TraceCheckUtils]: 96: Hoare triple {19119#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:37,406 INFO L273 TraceCheckUtils]: 97: Hoare triple {19119#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:37,407 INFO L273 TraceCheckUtils]: 98: Hoare triple {19120#(<= main_~i~0 23)} assume true; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:37,407 INFO L273 TraceCheckUtils]: 99: Hoare triple {19120#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:37,408 INFO L273 TraceCheckUtils]: 100: Hoare triple {19120#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:37,408 INFO L273 TraceCheckUtils]: 101: Hoare triple {19120#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:37,409 INFO L273 TraceCheckUtils]: 102: Hoare triple {19121#(<= main_~i~0 24)} assume true; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:37,409 INFO L273 TraceCheckUtils]: 103: Hoare triple {19121#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:37,410 INFO L273 TraceCheckUtils]: 104: Hoare triple {19121#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:37,410 INFO L273 TraceCheckUtils]: 105: Hoare triple {19121#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:37,411 INFO L273 TraceCheckUtils]: 106: Hoare triple {19122#(<= main_~i~0 25)} assume true; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:37,411 INFO L273 TraceCheckUtils]: 107: Hoare triple {19122#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:37,412 INFO L273 TraceCheckUtils]: 108: Hoare triple {19122#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:37,413 INFO L273 TraceCheckUtils]: 109: Hoare triple {19122#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:37,413 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#(<= main_~i~0 26)} assume true; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:37,414 INFO L273 TraceCheckUtils]: 111: Hoare triple {19123#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:37,414 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:37,415 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:37,415 INFO L273 TraceCheckUtils]: 114: Hoare triple {19124#(<= main_~i~0 27)} assume true; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:37,416 INFO L273 TraceCheckUtils]: 115: Hoare triple {19124#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:37,416 INFO L273 TraceCheckUtils]: 116: Hoare triple {19124#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:37,417 INFO L273 TraceCheckUtils]: 117: Hoare triple {19124#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:37,418 INFO L273 TraceCheckUtils]: 118: Hoare triple {19125#(<= main_~i~0 28)} assume true; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:37,418 INFO L273 TraceCheckUtils]: 119: Hoare triple {19125#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:37,419 INFO L273 TraceCheckUtils]: 120: Hoare triple {19125#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:37,419 INFO L273 TraceCheckUtils]: 121: Hoare triple {19125#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:37,420 INFO L273 TraceCheckUtils]: 122: Hoare triple {19126#(<= main_~i~0 29)} assume true; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:37,420 INFO L273 TraceCheckUtils]: 123: Hoare triple {19126#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:37,421 INFO L273 TraceCheckUtils]: 124: Hoare triple {19126#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:37,422 INFO L273 TraceCheckUtils]: 125: Hoare triple {19126#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {19127#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:37,422 INFO L273 TraceCheckUtils]: 126: Hoare triple {19127#(<= main_~i~0 30)} assume true; {19127#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:37,423 INFO L273 TraceCheckUtils]: 127: Hoare triple {19127#(<= main_~i~0 30)} assume !(~i~0 < 100000); {19096#false} is VALID [2018-11-14 18:45:37,423 INFO L273 TraceCheckUtils]: 128: Hoare triple {19096#false} havoc ~x~0;~x~0 := 0; {19096#false} is VALID [2018-11-14 18:45:37,423 INFO L273 TraceCheckUtils]: 129: Hoare triple {19096#false} assume true; {19096#false} is VALID [2018-11-14 18:45:37,423 INFO L273 TraceCheckUtils]: 130: Hoare triple {19096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {19096#false} is VALID [2018-11-14 18:45:37,423 INFO L256 TraceCheckUtils]: 131: Hoare triple {19096#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {19096#false} is VALID [2018-11-14 18:45:37,424 INFO L273 TraceCheckUtils]: 132: Hoare triple {19096#false} ~cond := #in~cond; {19096#false} is VALID [2018-11-14 18:45:37,424 INFO L273 TraceCheckUtils]: 133: Hoare triple {19096#false} assume ~cond == 0; {19096#false} is VALID [2018-11-14 18:45:37,424 INFO L273 TraceCheckUtils]: 134: Hoare triple {19096#false} assume !false; {19096#false} is VALID [2018-11-14 18:45:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:37,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:37,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:37,445 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:45:37,534 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-14 18:45:37,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:37,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {19095#true} call ULTIMATE.init(); {19095#true} is VALID [2018-11-14 18:45:37,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {19095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19095#true} is VALID [2018-11-14 18:45:37,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {19095#true} assume true; {19095#true} is VALID [2018-11-14 18:45:37,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19095#true} {19095#true} #57#return; {19095#true} is VALID [2018-11-14 18:45:37,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {19095#true} call #t~ret4 := main(); {19095#true} is VALID [2018-11-14 18:45:37,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {19095#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {19146#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:37,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {19146#(<= main_~i~0 0)} assume true; {19146#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:37,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {19146#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19146#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:37,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {19146#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19146#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:37,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {19146#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {19098#(<= main_~i~0 1)} assume true; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {19098#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {19098#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19098#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:37,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {19098#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {19099#(<= main_~i~0 2)} assume true; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {19099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {19099#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19099#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:37,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {19099#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {19100#(<= main_~i~0 3)} assume true; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {19100#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {19100#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19100#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:37,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {19100#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {19101#(<= main_~i~0 4)} assume true; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {19101#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {19101#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19101#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:37,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {19101#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {19102#(<= main_~i~0 5)} assume true; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {19102#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {19102#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19102#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:37,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {19102#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {19103#(<= main_~i~0 6)} assume true; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {19103#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {19103#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19103#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:37,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {19103#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {19104#(<= main_~i~0 7)} assume true; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {19104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {19104#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19104#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:37,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {19104#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {19105#(<= main_~i~0 8)} assume true; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {19105#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {19105#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19105#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:37,992 INFO L273 TraceCheckUtils]: 41: Hoare triple {19105#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {19106#(<= main_~i~0 9)} assume true; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {19106#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {19106#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19106#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:37,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {19106#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {19107#(<= main_~i~0 10)} assume true; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {19107#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {19107#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19107#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:37,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {19107#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {19108#(<= main_~i~0 11)} assume true; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {19108#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {19108#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19108#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:37,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {19108#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:37,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {19109#(<= main_~i~0 12)} assume true; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:38,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {19109#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:38,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {19109#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19109#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:38,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {19109#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:38,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {19110#(<= main_~i~0 13)} assume true; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:38,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {19110#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:38,002 INFO L273 TraceCheckUtils]: 60: Hoare triple {19110#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19110#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:38,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {19110#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:38,003 INFO L273 TraceCheckUtils]: 62: Hoare triple {19111#(<= main_~i~0 14)} assume true; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:38,004 INFO L273 TraceCheckUtils]: 63: Hoare triple {19111#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:38,004 INFO L273 TraceCheckUtils]: 64: Hoare triple {19111#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19111#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:38,005 INFO L273 TraceCheckUtils]: 65: Hoare triple {19111#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:38,005 INFO L273 TraceCheckUtils]: 66: Hoare triple {19112#(<= main_~i~0 15)} assume true; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:38,006 INFO L273 TraceCheckUtils]: 67: Hoare triple {19112#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:38,006 INFO L273 TraceCheckUtils]: 68: Hoare triple {19112#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19112#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:38,007 INFO L273 TraceCheckUtils]: 69: Hoare triple {19112#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:38,007 INFO L273 TraceCheckUtils]: 70: Hoare triple {19113#(<= main_~i~0 16)} assume true; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:38,008 INFO L273 TraceCheckUtils]: 71: Hoare triple {19113#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:38,008 INFO L273 TraceCheckUtils]: 72: Hoare triple {19113#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19113#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:38,009 INFO L273 TraceCheckUtils]: 73: Hoare triple {19113#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:38,009 INFO L273 TraceCheckUtils]: 74: Hoare triple {19114#(<= main_~i~0 17)} assume true; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:38,010 INFO L273 TraceCheckUtils]: 75: Hoare triple {19114#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:38,010 INFO L273 TraceCheckUtils]: 76: Hoare triple {19114#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19114#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:38,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {19114#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:38,012 INFO L273 TraceCheckUtils]: 78: Hoare triple {19115#(<= main_~i~0 18)} assume true; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:38,012 INFO L273 TraceCheckUtils]: 79: Hoare triple {19115#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:38,012 INFO L273 TraceCheckUtils]: 80: Hoare triple {19115#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19115#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:38,013 INFO L273 TraceCheckUtils]: 81: Hoare triple {19115#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:38,014 INFO L273 TraceCheckUtils]: 82: Hoare triple {19116#(<= main_~i~0 19)} assume true; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:38,014 INFO L273 TraceCheckUtils]: 83: Hoare triple {19116#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:38,015 INFO L273 TraceCheckUtils]: 84: Hoare triple {19116#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19116#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:38,015 INFO L273 TraceCheckUtils]: 85: Hoare triple {19116#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:38,016 INFO L273 TraceCheckUtils]: 86: Hoare triple {19117#(<= main_~i~0 20)} assume true; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:38,016 INFO L273 TraceCheckUtils]: 87: Hoare triple {19117#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:38,017 INFO L273 TraceCheckUtils]: 88: Hoare triple {19117#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19117#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:38,017 INFO L273 TraceCheckUtils]: 89: Hoare triple {19117#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:38,018 INFO L273 TraceCheckUtils]: 90: Hoare triple {19118#(<= main_~i~0 21)} assume true; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:38,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {19118#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:38,019 INFO L273 TraceCheckUtils]: 92: Hoare triple {19118#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19118#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:38,019 INFO L273 TraceCheckUtils]: 93: Hoare triple {19118#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:38,020 INFO L273 TraceCheckUtils]: 94: Hoare triple {19119#(<= main_~i~0 22)} assume true; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:38,020 INFO L273 TraceCheckUtils]: 95: Hoare triple {19119#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:38,021 INFO L273 TraceCheckUtils]: 96: Hoare triple {19119#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19119#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:38,021 INFO L273 TraceCheckUtils]: 97: Hoare triple {19119#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:38,022 INFO L273 TraceCheckUtils]: 98: Hoare triple {19120#(<= main_~i~0 23)} assume true; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:38,022 INFO L273 TraceCheckUtils]: 99: Hoare triple {19120#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:38,023 INFO L273 TraceCheckUtils]: 100: Hoare triple {19120#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19120#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:38,023 INFO L273 TraceCheckUtils]: 101: Hoare triple {19120#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:38,024 INFO L273 TraceCheckUtils]: 102: Hoare triple {19121#(<= main_~i~0 24)} assume true; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:38,024 INFO L273 TraceCheckUtils]: 103: Hoare triple {19121#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:38,025 INFO L273 TraceCheckUtils]: 104: Hoare triple {19121#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19121#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:38,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {19121#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:38,026 INFO L273 TraceCheckUtils]: 106: Hoare triple {19122#(<= main_~i~0 25)} assume true; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:38,026 INFO L273 TraceCheckUtils]: 107: Hoare triple {19122#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:38,027 INFO L273 TraceCheckUtils]: 108: Hoare triple {19122#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19122#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:38,028 INFO L273 TraceCheckUtils]: 109: Hoare triple {19122#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:38,028 INFO L273 TraceCheckUtils]: 110: Hoare triple {19123#(<= main_~i~0 26)} assume true; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:38,029 INFO L273 TraceCheckUtils]: 111: Hoare triple {19123#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:38,029 INFO L273 TraceCheckUtils]: 112: Hoare triple {19123#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19123#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:38,030 INFO L273 TraceCheckUtils]: 113: Hoare triple {19123#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:38,030 INFO L273 TraceCheckUtils]: 114: Hoare triple {19124#(<= main_~i~0 27)} assume true; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:38,031 INFO L273 TraceCheckUtils]: 115: Hoare triple {19124#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:38,031 INFO L273 TraceCheckUtils]: 116: Hoare triple {19124#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19124#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:38,032 INFO L273 TraceCheckUtils]: 117: Hoare triple {19124#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:38,032 INFO L273 TraceCheckUtils]: 118: Hoare triple {19125#(<= main_~i~0 28)} assume true; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:38,033 INFO L273 TraceCheckUtils]: 119: Hoare triple {19125#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:38,033 INFO L273 TraceCheckUtils]: 120: Hoare triple {19125#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19125#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:38,034 INFO L273 TraceCheckUtils]: 121: Hoare triple {19125#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:38,034 INFO L273 TraceCheckUtils]: 122: Hoare triple {19126#(<= main_~i~0 29)} assume true; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:38,035 INFO L273 TraceCheckUtils]: 123: Hoare triple {19126#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:38,035 INFO L273 TraceCheckUtils]: 124: Hoare triple {19126#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {19126#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:38,036 INFO L273 TraceCheckUtils]: 125: Hoare triple {19126#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {19127#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:38,036 INFO L273 TraceCheckUtils]: 126: Hoare triple {19127#(<= main_~i~0 30)} assume true; {19127#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:38,037 INFO L273 TraceCheckUtils]: 127: Hoare triple {19127#(<= main_~i~0 30)} assume !(~i~0 < 100000); {19096#false} is VALID [2018-11-14 18:45:38,037 INFO L273 TraceCheckUtils]: 128: Hoare triple {19096#false} havoc ~x~0;~x~0 := 0; {19096#false} is VALID [2018-11-14 18:45:38,037 INFO L273 TraceCheckUtils]: 129: Hoare triple {19096#false} assume true; {19096#false} is VALID [2018-11-14 18:45:38,037 INFO L273 TraceCheckUtils]: 130: Hoare triple {19096#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {19096#false} is VALID [2018-11-14 18:45:38,038 INFO L256 TraceCheckUtils]: 131: Hoare triple {19096#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {19096#false} is VALID [2018-11-14 18:45:38,038 INFO L273 TraceCheckUtils]: 132: Hoare triple {19096#false} ~cond := #in~cond; {19096#false} is VALID [2018-11-14 18:45:38,038 INFO L273 TraceCheckUtils]: 133: Hoare triple {19096#false} assume ~cond == 0; {19096#false} is VALID [2018-11-14 18:45:38,038 INFO L273 TraceCheckUtils]: 134: Hoare triple {19096#false} assume !false; {19096#false} is VALID [2018-11-14 18:45:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:38,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:38,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 18:45:38,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-14 18:45:38,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:38,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:45:38,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:38,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:45:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:45:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:45:38,194 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand 34 states. [2018-11-14 18:45:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:38,956 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-11-14 18:45:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:45:38,957 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-14 18:45:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:45:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 192 transitions. [2018-11-14 18:45:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:45:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 192 transitions. [2018-11-14 18:45:38,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 192 transitions. [2018-11-14 18:45:39,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:39,427 INFO L225 Difference]: With dead ends: 158 [2018-11-14 18:45:39,428 INFO L226 Difference]: Without dead ends: 146 [2018-11-14 18:45:39,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:45:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-14 18:45:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-14 18:45:39,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:39,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-14 18:45:39,500 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-14 18:45:39,500 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-14 18:45:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:39,503 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-11-14 18:45:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-14 18:45:39,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:39,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:39,503 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-14 18:45:39,504 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-14 18:45:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:39,505 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-11-14 18:45:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-14 18:45:39,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:39,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:39,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:39,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-14 18:45:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2018-11-14 18:45:39,509 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 135 [2018-11-14 18:45:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:39,509 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2018-11-14 18:45:39,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:45:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2018-11-14 18:45:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-14 18:45:39,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:39,510 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:39,510 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:39,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1984020460, now seen corresponding path program 31 times [2018-11-14 18:45:39,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:39,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:39,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:40,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {20208#true} call ULTIMATE.init(); {20208#true} is VALID [2018-11-14 18:45:40,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {20208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20208#true} is VALID [2018-11-14 18:45:40,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {20208#true} assume true; {20208#true} is VALID [2018-11-14 18:45:40,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20208#true} {20208#true} #57#return; {20208#true} is VALID [2018-11-14 18:45:40,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {20208#true} call #t~ret4 := main(); {20208#true} is VALID [2018-11-14 18:45:40,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {20208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20210#(= main_~i~0 0)} is VALID [2018-11-14 18:45:40,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {20210#(= main_~i~0 0)} assume true; {20210#(= main_~i~0 0)} is VALID [2018-11-14 18:45:40,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {20210#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20210#(= main_~i~0 0)} is VALID [2018-11-14 18:45:40,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {20210#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20210#(= main_~i~0 0)} is VALID [2018-11-14 18:45:40,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {20210#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {20211#(<= main_~i~0 1)} assume true; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {20211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {20211#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {20211#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {20212#(<= main_~i~0 2)} assume true; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {20212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {20212#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {20212#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {20213#(<= main_~i~0 3)} assume true; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {20213#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {20213#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {20213#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {20214#(<= main_~i~0 4)} assume true; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {20214#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {20214#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {20214#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {20215#(<= main_~i~0 5)} assume true; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {20215#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {20215#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {20215#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {20216#(<= main_~i~0 6)} assume true; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {20216#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {20216#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {20216#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {20217#(<= main_~i~0 7)} assume true; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {20217#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {20217#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {20217#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {20218#(<= main_~i~0 8)} assume true; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {20218#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {20218#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {20218#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {20219#(<= main_~i~0 9)} assume true; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {20219#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {20219#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {20219#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {20220#(<= main_~i~0 10)} assume true; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {20220#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {20220#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {20220#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {20221#(<= main_~i~0 11)} assume true; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,148 INFO L273 TraceCheckUtils]: 51: Hoare triple {20221#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {20221#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {20221#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {20222#(<= main_~i~0 12)} assume true; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,150 INFO L273 TraceCheckUtils]: 55: Hoare triple {20222#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,151 INFO L273 TraceCheckUtils]: 56: Hoare triple {20222#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,151 INFO L273 TraceCheckUtils]: 57: Hoare triple {20222#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {20223#(<= main_~i~0 13)} assume true; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {20223#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,153 INFO L273 TraceCheckUtils]: 60: Hoare triple {20223#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,153 INFO L273 TraceCheckUtils]: 61: Hoare triple {20223#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {20224#(<= main_~i~0 14)} assume true; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {20224#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,155 INFO L273 TraceCheckUtils]: 64: Hoare triple {20224#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {20224#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {20225#(<= main_~i~0 15)} assume true; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {20225#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,157 INFO L273 TraceCheckUtils]: 68: Hoare triple {20225#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,158 INFO L273 TraceCheckUtils]: 69: Hoare triple {20225#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {20226#(<= main_~i~0 16)} assume true; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {20226#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {20226#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,160 INFO L273 TraceCheckUtils]: 73: Hoare triple {20226#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,160 INFO L273 TraceCheckUtils]: 74: Hoare triple {20227#(<= main_~i~0 17)} assume true; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {20227#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,161 INFO L273 TraceCheckUtils]: 76: Hoare triple {20227#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,162 INFO L273 TraceCheckUtils]: 77: Hoare triple {20227#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,162 INFO L273 TraceCheckUtils]: 78: Hoare triple {20228#(<= main_~i~0 18)} assume true; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,163 INFO L273 TraceCheckUtils]: 79: Hoare triple {20228#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,163 INFO L273 TraceCheckUtils]: 80: Hoare triple {20228#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,164 INFO L273 TraceCheckUtils]: 81: Hoare triple {20228#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {20229#(<= main_~i~0 19)} assume true; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,165 INFO L273 TraceCheckUtils]: 83: Hoare triple {20229#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,165 INFO L273 TraceCheckUtils]: 84: Hoare triple {20229#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,166 INFO L273 TraceCheckUtils]: 85: Hoare triple {20229#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,166 INFO L273 TraceCheckUtils]: 86: Hoare triple {20230#(<= main_~i~0 20)} assume true; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,167 INFO L273 TraceCheckUtils]: 87: Hoare triple {20230#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,167 INFO L273 TraceCheckUtils]: 88: Hoare triple {20230#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,168 INFO L273 TraceCheckUtils]: 89: Hoare triple {20230#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {20231#(<= main_~i~0 21)} assume true; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,169 INFO L273 TraceCheckUtils]: 91: Hoare triple {20231#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,169 INFO L273 TraceCheckUtils]: 92: Hoare triple {20231#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,170 INFO L273 TraceCheckUtils]: 93: Hoare triple {20231#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,170 INFO L273 TraceCheckUtils]: 94: Hoare triple {20232#(<= main_~i~0 22)} assume true; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,171 INFO L273 TraceCheckUtils]: 95: Hoare triple {20232#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,171 INFO L273 TraceCheckUtils]: 96: Hoare triple {20232#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,172 INFO L273 TraceCheckUtils]: 97: Hoare triple {20232#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,172 INFO L273 TraceCheckUtils]: 98: Hoare triple {20233#(<= main_~i~0 23)} assume true; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {20233#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {20233#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {20233#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,174 INFO L273 TraceCheckUtils]: 102: Hoare triple {20234#(<= main_~i~0 24)} assume true; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,175 INFO L273 TraceCheckUtils]: 103: Hoare triple {20234#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,175 INFO L273 TraceCheckUtils]: 104: Hoare triple {20234#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,176 INFO L273 TraceCheckUtils]: 105: Hoare triple {20234#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,177 INFO L273 TraceCheckUtils]: 106: Hoare triple {20235#(<= main_~i~0 25)} assume true; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {20235#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,177 INFO L273 TraceCheckUtils]: 108: Hoare triple {20235#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,178 INFO L273 TraceCheckUtils]: 109: Hoare triple {20235#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,179 INFO L273 TraceCheckUtils]: 110: Hoare triple {20236#(<= main_~i~0 26)} assume true; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,179 INFO L273 TraceCheckUtils]: 111: Hoare triple {20236#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,179 INFO L273 TraceCheckUtils]: 112: Hoare triple {20236#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,180 INFO L273 TraceCheckUtils]: 113: Hoare triple {20236#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,181 INFO L273 TraceCheckUtils]: 114: Hoare triple {20237#(<= main_~i~0 27)} assume true; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,181 INFO L273 TraceCheckUtils]: 115: Hoare triple {20237#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,182 INFO L273 TraceCheckUtils]: 116: Hoare triple {20237#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,182 INFO L273 TraceCheckUtils]: 117: Hoare triple {20237#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,183 INFO L273 TraceCheckUtils]: 118: Hoare triple {20238#(<= main_~i~0 28)} assume true; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,183 INFO L273 TraceCheckUtils]: 119: Hoare triple {20238#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,184 INFO L273 TraceCheckUtils]: 120: Hoare triple {20238#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,184 INFO L273 TraceCheckUtils]: 121: Hoare triple {20238#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,185 INFO L273 TraceCheckUtils]: 122: Hoare triple {20239#(<= main_~i~0 29)} assume true; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,185 INFO L273 TraceCheckUtils]: 123: Hoare triple {20239#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,186 INFO L273 TraceCheckUtils]: 124: Hoare triple {20239#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,186 INFO L273 TraceCheckUtils]: 125: Hoare triple {20239#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,187 INFO L273 TraceCheckUtils]: 126: Hoare triple {20240#(<= main_~i~0 30)} assume true; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,187 INFO L273 TraceCheckUtils]: 127: Hoare triple {20240#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,188 INFO L273 TraceCheckUtils]: 128: Hoare triple {20240#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,188 INFO L273 TraceCheckUtils]: 129: Hoare triple {20240#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {20241#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:40,189 INFO L273 TraceCheckUtils]: 130: Hoare triple {20241#(<= main_~i~0 31)} assume true; {20241#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:40,189 INFO L273 TraceCheckUtils]: 131: Hoare triple {20241#(<= main_~i~0 31)} assume !(~i~0 < 100000); {20209#false} is VALID [2018-11-14 18:45:40,190 INFO L273 TraceCheckUtils]: 132: Hoare triple {20209#false} havoc ~x~0;~x~0 := 0; {20209#false} is VALID [2018-11-14 18:45:40,190 INFO L273 TraceCheckUtils]: 133: Hoare triple {20209#false} assume true; {20209#false} is VALID [2018-11-14 18:45:40,190 INFO L273 TraceCheckUtils]: 134: Hoare triple {20209#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {20209#false} is VALID [2018-11-14 18:45:40,190 INFO L256 TraceCheckUtils]: 135: Hoare triple {20209#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {20209#false} is VALID [2018-11-14 18:45:40,190 INFO L273 TraceCheckUtils]: 136: Hoare triple {20209#false} ~cond := #in~cond; {20209#false} is VALID [2018-11-14 18:45:40,191 INFO L273 TraceCheckUtils]: 137: Hoare triple {20209#false} assume ~cond == 0; {20209#false} is VALID [2018-11-14 18:45:40,191 INFO L273 TraceCheckUtils]: 138: Hoare triple {20209#false} assume !false; {20209#false} is VALID [2018-11-14 18:45:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:40,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:40,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:40,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:40,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {20208#true} call ULTIMATE.init(); {20208#true} is VALID [2018-11-14 18:45:40,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {20208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20208#true} is VALID [2018-11-14 18:45:40,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {20208#true} assume true; {20208#true} is VALID [2018-11-14 18:45:40,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20208#true} {20208#true} #57#return; {20208#true} is VALID [2018-11-14 18:45:40,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {20208#true} call #t~ret4 := main(); {20208#true} is VALID [2018-11-14 18:45:40,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {20208#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {20260#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:40,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {20260#(<= main_~i~0 0)} assume true; {20260#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:40,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {20260#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20260#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:40,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {20260#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20260#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:40,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {20260#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {20211#(<= main_~i~0 1)} assume true; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {20211#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {20211#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20211#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:40,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {20211#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {20212#(<= main_~i~0 2)} assume true; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {20212#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {20212#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20212#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:40,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {20212#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {20213#(<= main_~i~0 3)} assume true; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {20213#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {20213#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20213#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:40,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {20213#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {20214#(<= main_~i~0 4)} assume true; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {20214#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {20214#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20214#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:40,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {20214#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {20215#(<= main_~i~0 5)} assume true; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {20215#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {20215#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20215#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:40,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {20215#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {20216#(<= main_~i~0 6)} assume true; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {20216#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {20216#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20216#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:40,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {20216#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {20217#(<= main_~i~0 7)} assume true; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {20217#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {20217#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20217#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:40,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {20217#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {20218#(<= main_~i~0 8)} assume true; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {20218#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {20218#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20218#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:40,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {20218#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {20219#(<= main_~i~0 9)} assume true; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {20219#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {20219#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20219#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:40,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {20219#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {20220#(<= main_~i~0 10)} assume true; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {20220#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {20220#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20220#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:40,553 INFO L273 TraceCheckUtils]: 49: Hoare triple {20220#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {20221#(<= main_~i~0 11)} assume true; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,554 INFO L273 TraceCheckUtils]: 51: Hoare triple {20221#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {20221#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20221#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:40,555 INFO L273 TraceCheckUtils]: 53: Hoare triple {20221#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {20222#(<= main_~i~0 12)} assume true; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,556 INFO L273 TraceCheckUtils]: 55: Hoare triple {20222#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {20222#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20222#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:40,557 INFO L273 TraceCheckUtils]: 57: Hoare triple {20222#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {20223#(<= main_~i~0 13)} assume true; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {20223#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,559 INFO L273 TraceCheckUtils]: 60: Hoare triple {20223#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20223#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:40,559 INFO L273 TraceCheckUtils]: 61: Hoare triple {20223#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,560 INFO L273 TraceCheckUtils]: 62: Hoare triple {20224#(<= main_~i~0 14)} assume true; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,560 INFO L273 TraceCheckUtils]: 63: Hoare triple {20224#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {20224#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20224#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:40,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {20224#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,562 INFO L273 TraceCheckUtils]: 66: Hoare triple {20225#(<= main_~i~0 15)} assume true; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,562 INFO L273 TraceCheckUtils]: 67: Hoare triple {20225#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,563 INFO L273 TraceCheckUtils]: 68: Hoare triple {20225#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20225#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:40,563 INFO L273 TraceCheckUtils]: 69: Hoare triple {20225#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,564 INFO L273 TraceCheckUtils]: 70: Hoare triple {20226#(<= main_~i~0 16)} assume true; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,564 INFO L273 TraceCheckUtils]: 71: Hoare triple {20226#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,565 INFO L273 TraceCheckUtils]: 72: Hoare triple {20226#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20226#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:40,565 INFO L273 TraceCheckUtils]: 73: Hoare triple {20226#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,566 INFO L273 TraceCheckUtils]: 74: Hoare triple {20227#(<= main_~i~0 17)} assume true; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,566 INFO L273 TraceCheckUtils]: 75: Hoare triple {20227#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,567 INFO L273 TraceCheckUtils]: 76: Hoare triple {20227#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20227#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:40,568 INFO L273 TraceCheckUtils]: 77: Hoare triple {20227#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,568 INFO L273 TraceCheckUtils]: 78: Hoare triple {20228#(<= main_~i~0 18)} assume true; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,568 INFO L273 TraceCheckUtils]: 79: Hoare triple {20228#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,569 INFO L273 TraceCheckUtils]: 80: Hoare triple {20228#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20228#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:40,570 INFO L273 TraceCheckUtils]: 81: Hoare triple {20228#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,570 INFO L273 TraceCheckUtils]: 82: Hoare triple {20229#(<= main_~i~0 19)} assume true; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,571 INFO L273 TraceCheckUtils]: 83: Hoare triple {20229#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,571 INFO L273 TraceCheckUtils]: 84: Hoare triple {20229#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20229#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:40,572 INFO L273 TraceCheckUtils]: 85: Hoare triple {20229#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,572 INFO L273 TraceCheckUtils]: 86: Hoare triple {20230#(<= main_~i~0 20)} assume true; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,573 INFO L273 TraceCheckUtils]: 87: Hoare triple {20230#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,573 INFO L273 TraceCheckUtils]: 88: Hoare triple {20230#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20230#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:40,574 INFO L273 TraceCheckUtils]: 89: Hoare triple {20230#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,574 INFO L273 TraceCheckUtils]: 90: Hoare triple {20231#(<= main_~i~0 21)} assume true; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,575 INFO L273 TraceCheckUtils]: 91: Hoare triple {20231#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,575 INFO L273 TraceCheckUtils]: 92: Hoare triple {20231#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20231#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:40,576 INFO L273 TraceCheckUtils]: 93: Hoare triple {20231#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,576 INFO L273 TraceCheckUtils]: 94: Hoare triple {20232#(<= main_~i~0 22)} assume true; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {20232#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,577 INFO L273 TraceCheckUtils]: 96: Hoare triple {20232#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20232#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:40,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {20232#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,578 INFO L273 TraceCheckUtils]: 98: Hoare triple {20233#(<= main_~i~0 23)} assume true; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,579 INFO L273 TraceCheckUtils]: 99: Hoare triple {20233#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,579 INFO L273 TraceCheckUtils]: 100: Hoare triple {20233#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20233#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:40,580 INFO L273 TraceCheckUtils]: 101: Hoare triple {20233#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,580 INFO L273 TraceCheckUtils]: 102: Hoare triple {20234#(<= main_~i~0 24)} assume true; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,581 INFO L273 TraceCheckUtils]: 103: Hoare triple {20234#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,581 INFO L273 TraceCheckUtils]: 104: Hoare triple {20234#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20234#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:40,582 INFO L273 TraceCheckUtils]: 105: Hoare triple {20234#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,582 INFO L273 TraceCheckUtils]: 106: Hoare triple {20235#(<= main_~i~0 25)} assume true; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,583 INFO L273 TraceCheckUtils]: 107: Hoare triple {20235#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,583 INFO L273 TraceCheckUtils]: 108: Hoare triple {20235#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20235#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:40,584 INFO L273 TraceCheckUtils]: 109: Hoare triple {20235#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,585 INFO L273 TraceCheckUtils]: 110: Hoare triple {20236#(<= main_~i~0 26)} assume true; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,585 INFO L273 TraceCheckUtils]: 111: Hoare triple {20236#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,585 INFO L273 TraceCheckUtils]: 112: Hoare triple {20236#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20236#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:40,586 INFO L273 TraceCheckUtils]: 113: Hoare triple {20236#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,587 INFO L273 TraceCheckUtils]: 114: Hoare triple {20237#(<= main_~i~0 27)} assume true; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,587 INFO L273 TraceCheckUtils]: 115: Hoare triple {20237#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,587 INFO L273 TraceCheckUtils]: 116: Hoare triple {20237#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20237#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:40,588 INFO L273 TraceCheckUtils]: 117: Hoare triple {20237#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,589 INFO L273 TraceCheckUtils]: 118: Hoare triple {20238#(<= main_~i~0 28)} assume true; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,589 INFO L273 TraceCheckUtils]: 119: Hoare triple {20238#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,590 INFO L273 TraceCheckUtils]: 120: Hoare triple {20238#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20238#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:40,590 INFO L273 TraceCheckUtils]: 121: Hoare triple {20238#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,591 INFO L273 TraceCheckUtils]: 122: Hoare triple {20239#(<= main_~i~0 29)} assume true; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,591 INFO L273 TraceCheckUtils]: 123: Hoare triple {20239#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,592 INFO L273 TraceCheckUtils]: 124: Hoare triple {20239#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20239#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:40,592 INFO L273 TraceCheckUtils]: 125: Hoare triple {20239#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,593 INFO L273 TraceCheckUtils]: 126: Hoare triple {20240#(<= main_~i~0 30)} assume true; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,593 INFO L273 TraceCheckUtils]: 127: Hoare triple {20240#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,594 INFO L273 TraceCheckUtils]: 128: Hoare triple {20240#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {20240#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:40,594 INFO L273 TraceCheckUtils]: 129: Hoare triple {20240#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {20241#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:40,595 INFO L273 TraceCheckUtils]: 130: Hoare triple {20241#(<= main_~i~0 31)} assume true; {20241#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:40,595 INFO L273 TraceCheckUtils]: 131: Hoare triple {20241#(<= main_~i~0 31)} assume !(~i~0 < 100000); {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L273 TraceCheckUtils]: 132: Hoare triple {20209#false} havoc ~x~0;~x~0 := 0; {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L273 TraceCheckUtils]: 133: Hoare triple {20209#false} assume true; {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L273 TraceCheckUtils]: 134: Hoare triple {20209#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L256 TraceCheckUtils]: 135: Hoare triple {20209#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L273 TraceCheckUtils]: 136: Hoare triple {20209#false} ~cond := #in~cond; {20209#false} is VALID [2018-11-14 18:45:40,596 INFO L273 TraceCheckUtils]: 137: Hoare triple {20209#false} assume ~cond == 0; {20209#false} is VALID [2018-11-14 18:45:40,597 INFO L273 TraceCheckUtils]: 138: Hoare triple {20209#false} assume !false; {20209#false} is VALID [2018-11-14 18:45:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:40,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:40,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-14 18:45:40,631 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-14 18:45:40,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:40,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 18:45:40,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:40,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 18:45:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 18:45:40,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:45:40,787 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand 35 states. [2018-11-14 18:45:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:41,315 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2018-11-14 18:45:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:45:41,315 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-14 18:45:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:45:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 197 transitions. [2018-11-14 18:45:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:45:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 197 transitions. [2018-11-14 18:45:41,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 197 transitions. [2018-11-14 18:45:41,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:41,494 INFO L225 Difference]: With dead ends: 162 [2018-11-14 18:45:41,494 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 18:45:41,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:45:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 18:45:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-14 18:45:41,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:41,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2018-11-14 18:45:41,816 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2018-11-14 18:45:41,816 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2018-11-14 18:45:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:41,818 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2018-11-14 18:45:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2018-11-14 18:45:41,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:41,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:41,819 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2018-11-14 18:45:41,819 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2018-11-14 18:45:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:41,821 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2018-11-14 18:45:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2018-11-14 18:45:41,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:41,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:41,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:41,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-14 18:45:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2018-11-14 18:45:41,823 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 139 [2018-11-14 18:45:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:41,823 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2018-11-14 18:45:41,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 18:45:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2018-11-14 18:45:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-14 18:45:41,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:41,824 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:41,824 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:41,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1771403710, now seen corresponding path program 32 times [2018-11-14 18:45:41,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:41,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:41,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:41,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:41,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:42,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {21352#true} call ULTIMATE.init(); {21352#true} is VALID [2018-11-14 18:45:42,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {21352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21352#true} is VALID [2018-11-14 18:45:42,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {21352#true} assume true; {21352#true} is VALID [2018-11-14 18:45:42,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21352#true} {21352#true} #57#return; {21352#true} is VALID [2018-11-14 18:45:42,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {21352#true} call #t~ret4 := main(); {21352#true} is VALID [2018-11-14 18:45:42,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {21352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21354#(= main_~i~0 0)} is VALID [2018-11-14 18:45:42,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {21354#(= main_~i~0 0)} assume true; {21354#(= main_~i~0 0)} is VALID [2018-11-14 18:45:42,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {21354#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21354#(= main_~i~0 0)} is VALID [2018-11-14 18:45:42,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {21354#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21354#(= main_~i~0 0)} is VALID [2018-11-14 18:45:42,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {21354#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:42,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {21355#(<= main_~i~0 1)} assume true; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:42,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {21355#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:42,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {21355#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:42,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {21355#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:42,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {21356#(<= main_~i~0 2)} assume true; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:42,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {21356#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:42,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {21356#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:42,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {21356#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:42,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {21357#(<= main_~i~0 3)} assume true; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:42,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {21357#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:42,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {21357#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:42,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {21357#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:42,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {21358#(<= main_~i~0 4)} assume true; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:42,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {21358#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:42,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {21358#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:42,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {21358#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:42,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {21359#(<= main_~i~0 5)} assume true; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:42,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {21359#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:42,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {21359#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:42,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {21359#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:42,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {21360#(<= main_~i~0 6)} assume true; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:42,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {21360#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:42,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {21360#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:42,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {21360#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:42,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {21361#(<= main_~i~0 7)} assume true; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:42,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {21361#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:42,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {21361#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:42,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {21361#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:42,512 INFO L273 TraceCheckUtils]: 38: Hoare triple {21362#(<= main_~i~0 8)} assume true; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:42,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {21362#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:42,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {21362#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:42,514 INFO L273 TraceCheckUtils]: 41: Hoare triple {21362#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:42,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {21363#(<= main_~i~0 9)} assume true; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:42,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {21363#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:42,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {21363#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:42,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {21363#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:42,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {21364#(<= main_~i~0 10)} assume true; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:42,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {21364#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:42,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {21364#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:42,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {21364#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:42,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {21365#(<= main_~i~0 11)} assume true; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:42,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {21365#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:42,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {21365#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:42,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {21365#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:42,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {21366#(<= main_~i~0 12)} assume true; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:42,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {21366#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:42,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {21366#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:42,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {21366#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:42,523 INFO L273 TraceCheckUtils]: 58: Hoare triple {21367#(<= main_~i~0 13)} assume true; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:42,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {21367#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:42,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {21367#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:42,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {21367#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:42,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {21368#(<= main_~i~0 14)} assume true; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:42,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {21368#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:42,526 INFO L273 TraceCheckUtils]: 64: Hoare triple {21368#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:42,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {21368#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:42,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {21369#(<= main_~i~0 15)} assume true; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:42,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {21369#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:42,528 INFO L273 TraceCheckUtils]: 68: Hoare triple {21369#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:42,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {21369#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:42,530 INFO L273 TraceCheckUtils]: 70: Hoare triple {21370#(<= main_~i~0 16)} assume true; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:42,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {21370#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:42,531 INFO L273 TraceCheckUtils]: 72: Hoare triple {21370#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:42,531 INFO L273 TraceCheckUtils]: 73: Hoare triple {21370#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:42,532 INFO L273 TraceCheckUtils]: 74: Hoare triple {21371#(<= main_~i~0 17)} assume true; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:42,532 INFO L273 TraceCheckUtils]: 75: Hoare triple {21371#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:42,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {21371#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:42,533 INFO L273 TraceCheckUtils]: 77: Hoare triple {21371#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:42,534 INFO L273 TraceCheckUtils]: 78: Hoare triple {21372#(<= main_~i~0 18)} assume true; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:42,534 INFO L273 TraceCheckUtils]: 79: Hoare triple {21372#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:42,535 INFO L273 TraceCheckUtils]: 80: Hoare triple {21372#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:42,536 INFO L273 TraceCheckUtils]: 81: Hoare triple {21372#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:42,536 INFO L273 TraceCheckUtils]: 82: Hoare triple {21373#(<= main_~i~0 19)} assume true; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:42,537 INFO L273 TraceCheckUtils]: 83: Hoare triple {21373#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:42,537 INFO L273 TraceCheckUtils]: 84: Hoare triple {21373#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:42,538 INFO L273 TraceCheckUtils]: 85: Hoare triple {21373#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:42,538 INFO L273 TraceCheckUtils]: 86: Hoare triple {21374#(<= main_~i~0 20)} assume true; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:42,539 INFO L273 TraceCheckUtils]: 87: Hoare triple {21374#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:42,539 INFO L273 TraceCheckUtils]: 88: Hoare triple {21374#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:42,540 INFO L273 TraceCheckUtils]: 89: Hoare triple {21374#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:42,540 INFO L273 TraceCheckUtils]: 90: Hoare triple {21375#(<= main_~i~0 21)} assume true; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:42,541 INFO L273 TraceCheckUtils]: 91: Hoare triple {21375#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:42,541 INFO L273 TraceCheckUtils]: 92: Hoare triple {21375#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:42,542 INFO L273 TraceCheckUtils]: 93: Hoare triple {21375#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:42,543 INFO L273 TraceCheckUtils]: 94: Hoare triple {21376#(<= main_~i~0 22)} assume true; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:42,543 INFO L273 TraceCheckUtils]: 95: Hoare triple {21376#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:42,544 INFO L273 TraceCheckUtils]: 96: Hoare triple {21376#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:42,544 INFO L273 TraceCheckUtils]: 97: Hoare triple {21376#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:42,545 INFO L273 TraceCheckUtils]: 98: Hoare triple {21377#(<= main_~i~0 23)} assume true; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:42,545 INFO L273 TraceCheckUtils]: 99: Hoare triple {21377#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:42,546 INFO L273 TraceCheckUtils]: 100: Hoare triple {21377#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:42,547 INFO L273 TraceCheckUtils]: 101: Hoare triple {21377#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:42,547 INFO L273 TraceCheckUtils]: 102: Hoare triple {21378#(<= main_~i~0 24)} assume true; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:42,548 INFO L273 TraceCheckUtils]: 103: Hoare triple {21378#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:42,548 INFO L273 TraceCheckUtils]: 104: Hoare triple {21378#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:42,549 INFO L273 TraceCheckUtils]: 105: Hoare triple {21378#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:42,549 INFO L273 TraceCheckUtils]: 106: Hoare triple {21379#(<= main_~i~0 25)} assume true; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:42,550 INFO L273 TraceCheckUtils]: 107: Hoare triple {21379#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:42,550 INFO L273 TraceCheckUtils]: 108: Hoare triple {21379#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:42,551 INFO L273 TraceCheckUtils]: 109: Hoare triple {21379#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:42,551 INFO L273 TraceCheckUtils]: 110: Hoare triple {21380#(<= main_~i~0 26)} assume true; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:42,552 INFO L273 TraceCheckUtils]: 111: Hoare triple {21380#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:42,552 INFO L273 TraceCheckUtils]: 112: Hoare triple {21380#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:42,553 INFO L273 TraceCheckUtils]: 113: Hoare triple {21380#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:42,554 INFO L273 TraceCheckUtils]: 114: Hoare triple {21381#(<= main_~i~0 27)} assume true; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:42,554 INFO L273 TraceCheckUtils]: 115: Hoare triple {21381#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:42,555 INFO L273 TraceCheckUtils]: 116: Hoare triple {21381#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:42,555 INFO L273 TraceCheckUtils]: 117: Hoare triple {21381#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:42,556 INFO L273 TraceCheckUtils]: 118: Hoare triple {21382#(<= main_~i~0 28)} assume true; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:42,556 INFO L273 TraceCheckUtils]: 119: Hoare triple {21382#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:42,557 INFO L273 TraceCheckUtils]: 120: Hoare triple {21382#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:42,558 INFO L273 TraceCheckUtils]: 121: Hoare triple {21382#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:42,558 INFO L273 TraceCheckUtils]: 122: Hoare triple {21383#(<= main_~i~0 29)} assume true; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:42,559 INFO L273 TraceCheckUtils]: 123: Hoare triple {21383#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:42,559 INFO L273 TraceCheckUtils]: 124: Hoare triple {21383#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:42,560 INFO L273 TraceCheckUtils]: 125: Hoare triple {21383#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:42,560 INFO L273 TraceCheckUtils]: 126: Hoare triple {21384#(<= main_~i~0 30)} assume true; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:42,561 INFO L273 TraceCheckUtils]: 127: Hoare triple {21384#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:42,561 INFO L273 TraceCheckUtils]: 128: Hoare triple {21384#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:42,562 INFO L273 TraceCheckUtils]: 129: Hoare triple {21384#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:42,563 INFO L273 TraceCheckUtils]: 130: Hoare triple {21385#(<= main_~i~0 31)} assume true; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:42,563 INFO L273 TraceCheckUtils]: 131: Hoare triple {21385#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:42,563 INFO L273 TraceCheckUtils]: 132: Hoare triple {21385#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:42,564 INFO L273 TraceCheckUtils]: 133: Hoare triple {21385#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {21386#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:42,565 INFO L273 TraceCheckUtils]: 134: Hoare triple {21386#(<= main_~i~0 32)} assume true; {21386#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:42,565 INFO L273 TraceCheckUtils]: 135: Hoare triple {21386#(<= main_~i~0 32)} assume !(~i~0 < 100000); {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L273 TraceCheckUtils]: 136: Hoare triple {21353#false} havoc ~x~0;~x~0 := 0; {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L273 TraceCheckUtils]: 137: Hoare triple {21353#false} assume true; {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L273 TraceCheckUtils]: 138: Hoare triple {21353#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L256 TraceCheckUtils]: 139: Hoare triple {21353#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L273 TraceCheckUtils]: 140: Hoare triple {21353#false} ~cond := #in~cond; {21353#false} is VALID [2018-11-14 18:45:42,566 INFO L273 TraceCheckUtils]: 141: Hoare triple {21353#false} assume ~cond == 0; {21353#false} is VALID [2018-11-14 18:45:42,567 INFO L273 TraceCheckUtils]: 142: Hoare triple {21353#false} assume !false; {21353#false} is VALID [2018-11-14 18:45:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:42,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:42,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:45:42,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:45:42,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:42,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:43,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {21352#true} call ULTIMATE.init(); {21352#true} is VALID [2018-11-14 18:45:43,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {21352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21352#true} is VALID [2018-11-14 18:45:43,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {21352#true} assume true; {21352#true} is VALID [2018-11-14 18:45:43,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21352#true} {21352#true} #57#return; {21352#true} is VALID [2018-11-14 18:45:43,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {21352#true} call #t~ret4 := main(); {21352#true} is VALID [2018-11-14 18:45:43,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {21352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {21405#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:43,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {21405#(<= main_~i~0 0)} assume true; {21405#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:43,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {21405#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21405#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:43,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {21405#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21405#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:43,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {21405#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:43,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {21355#(<= main_~i~0 1)} assume true; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:43,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {21355#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:43,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {21355#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21355#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:43,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {21355#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:43,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {21356#(<= main_~i~0 2)} assume true; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:43,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {21356#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:43,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {21356#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21356#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:43,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {21356#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:43,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {21357#(<= main_~i~0 3)} assume true; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:43,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {21357#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:43,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {21357#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21357#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:43,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {21357#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:43,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {21358#(<= main_~i~0 4)} assume true; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:43,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {21358#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:43,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {21358#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21358#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:43,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {21358#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:43,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {21359#(<= main_~i~0 5)} assume true; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:43,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {21359#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:43,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {21359#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21359#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:43,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {21359#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:43,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {21360#(<= main_~i~0 6)} assume true; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:43,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {21360#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:43,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {21360#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21360#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:43,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {21360#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:43,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {21361#(<= main_~i~0 7)} assume true; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:43,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {21361#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:43,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {21361#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21361#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:43,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {21361#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:43,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {21362#(<= main_~i~0 8)} assume true; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:43,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {21362#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:43,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {21362#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21362#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:43,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {21362#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:43,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {21363#(<= main_~i~0 9)} assume true; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:43,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {21363#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:43,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {21363#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21363#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:43,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {21363#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:43,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {21364#(<= main_~i~0 10)} assume true; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:43,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {21364#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:43,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {21364#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21364#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:43,167 INFO L273 TraceCheckUtils]: 49: Hoare triple {21364#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:43,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {21365#(<= main_~i~0 11)} assume true; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:43,168 INFO L273 TraceCheckUtils]: 51: Hoare triple {21365#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:43,169 INFO L273 TraceCheckUtils]: 52: Hoare triple {21365#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21365#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:43,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {21365#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:43,170 INFO L273 TraceCheckUtils]: 54: Hoare triple {21366#(<= main_~i~0 12)} assume true; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:43,170 INFO L273 TraceCheckUtils]: 55: Hoare triple {21366#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:43,171 INFO L273 TraceCheckUtils]: 56: Hoare triple {21366#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21366#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:43,172 INFO L273 TraceCheckUtils]: 57: Hoare triple {21366#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:43,172 INFO L273 TraceCheckUtils]: 58: Hoare triple {21367#(<= main_~i~0 13)} assume true; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:43,173 INFO L273 TraceCheckUtils]: 59: Hoare triple {21367#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:43,173 INFO L273 TraceCheckUtils]: 60: Hoare triple {21367#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21367#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:43,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {21367#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:43,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {21368#(<= main_~i~0 14)} assume true; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:43,175 INFO L273 TraceCheckUtils]: 63: Hoare triple {21368#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:43,175 INFO L273 TraceCheckUtils]: 64: Hoare triple {21368#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21368#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:43,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {21368#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:43,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {21369#(<= main_~i~0 15)} assume true; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:43,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {21369#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:43,178 INFO L273 TraceCheckUtils]: 68: Hoare triple {21369#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21369#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:43,178 INFO L273 TraceCheckUtils]: 69: Hoare triple {21369#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:43,179 INFO L273 TraceCheckUtils]: 70: Hoare triple {21370#(<= main_~i~0 16)} assume true; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:43,179 INFO L273 TraceCheckUtils]: 71: Hoare triple {21370#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:43,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {21370#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21370#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:43,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {21370#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:43,181 INFO L273 TraceCheckUtils]: 74: Hoare triple {21371#(<= main_~i~0 17)} assume true; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:43,181 INFO L273 TraceCheckUtils]: 75: Hoare triple {21371#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:43,182 INFO L273 TraceCheckUtils]: 76: Hoare triple {21371#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21371#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:43,183 INFO L273 TraceCheckUtils]: 77: Hoare triple {21371#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:43,183 INFO L273 TraceCheckUtils]: 78: Hoare triple {21372#(<= main_~i~0 18)} assume true; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:43,184 INFO L273 TraceCheckUtils]: 79: Hoare triple {21372#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:43,184 INFO L273 TraceCheckUtils]: 80: Hoare triple {21372#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21372#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:43,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {21372#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:43,185 INFO L273 TraceCheckUtils]: 82: Hoare triple {21373#(<= main_~i~0 19)} assume true; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:43,186 INFO L273 TraceCheckUtils]: 83: Hoare triple {21373#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:43,186 INFO L273 TraceCheckUtils]: 84: Hoare triple {21373#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21373#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:43,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {21373#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:43,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {21374#(<= main_~i~0 20)} assume true; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:43,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {21374#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:43,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {21374#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21374#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:43,189 INFO L273 TraceCheckUtils]: 89: Hoare triple {21374#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:43,190 INFO L273 TraceCheckUtils]: 90: Hoare triple {21375#(<= main_~i~0 21)} assume true; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:43,190 INFO L273 TraceCheckUtils]: 91: Hoare triple {21375#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:43,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {21375#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21375#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:43,192 INFO L273 TraceCheckUtils]: 93: Hoare triple {21375#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:43,192 INFO L273 TraceCheckUtils]: 94: Hoare triple {21376#(<= main_~i~0 22)} assume true; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:43,193 INFO L273 TraceCheckUtils]: 95: Hoare triple {21376#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:43,193 INFO L273 TraceCheckUtils]: 96: Hoare triple {21376#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21376#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:43,194 INFO L273 TraceCheckUtils]: 97: Hoare triple {21376#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:43,194 INFO L273 TraceCheckUtils]: 98: Hoare triple {21377#(<= main_~i~0 23)} assume true; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:43,195 INFO L273 TraceCheckUtils]: 99: Hoare triple {21377#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:43,195 INFO L273 TraceCheckUtils]: 100: Hoare triple {21377#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21377#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:43,196 INFO L273 TraceCheckUtils]: 101: Hoare triple {21377#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:43,196 INFO L273 TraceCheckUtils]: 102: Hoare triple {21378#(<= main_~i~0 24)} assume true; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:43,197 INFO L273 TraceCheckUtils]: 103: Hoare triple {21378#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:43,197 INFO L273 TraceCheckUtils]: 104: Hoare triple {21378#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21378#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:43,198 INFO L273 TraceCheckUtils]: 105: Hoare triple {21378#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:43,199 INFO L273 TraceCheckUtils]: 106: Hoare triple {21379#(<= main_~i~0 25)} assume true; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:43,199 INFO L273 TraceCheckUtils]: 107: Hoare triple {21379#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:43,200 INFO L273 TraceCheckUtils]: 108: Hoare triple {21379#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21379#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:43,200 INFO L273 TraceCheckUtils]: 109: Hoare triple {21379#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:43,201 INFO L273 TraceCheckUtils]: 110: Hoare triple {21380#(<= main_~i~0 26)} assume true; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:43,201 INFO L273 TraceCheckUtils]: 111: Hoare triple {21380#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:43,202 INFO L273 TraceCheckUtils]: 112: Hoare triple {21380#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21380#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:43,203 INFO L273 TraceCheckUtils]: 113: Hoare triple {21380#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:43,203 INFO L273 TraceCheckUtils]: 114: Hoare triple {21381#(<= main_~i~0 27)} assume true; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:43,204 INFO L273 TraceCheckUtils]: 115: Hoare triple {21381#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:43,204 INFO L273 TraceCheckUtils]: 116: Hoare triple {21381#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21381#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:43,205 INFO L273 TraceCheckUtils]: 117: Hoare triple {21381#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:43,205 INFO L273 TraceCheckUtils]: 118: Hoare triple {21382#(<= main_~i~0 28)} assume true; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:43,206 INFO L273 TraceCheckUtils]: 119: Hoare triple {21382#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:43,206 INFO L273 TraceCheckUtils]: 120: Hoare triple {21382#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21382#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:43,207 INFO L273 TraceCheckUtils]: 121: Hoare triple {21382#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:43,208 INFO L273 TraceCheckUtils]: 122: Hoare triple {21383#(<= main_~i~0 29)} assume true; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:43,208 INFO L273 TraceCheckUtils]: 123: Hoare triple {21383#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:43,209 INFO L273 TraceCheckUtils]: 124: Hoare triple {21383#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21383#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:43,209 INFO L273 TraceCheckUtils]: 125: Hoare triple {21383#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:43,210 INFO L273 TraceCheckUtils]: 126: Hoare triple {21384#(<= main_~i~0 30)} assume true; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:43,210 INFO L273 TraceCheckUtils]: 127: Hoare triple {21384#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:43,211 INFO L273 TraceCheckUtils]: 128: Hoare triple {21384#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21384#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:43,211 INFO L273 TraceCheckUtils]: 129: Hoare triple {21384#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:43,212 INFO L273 TraceCheckUtils]: 130: Hoare triple {21385#(<= main_~i~0 31)} assume true; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:43,212 INFO L273 TraceCheckUtils]: 131: Hoare triple {21385#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:43,213 INFO L273 TraceCheckUtils]: 132: Hoare triple {21385#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {21385#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:43,214 INFO L273 TraceCheckUtils]: 133: Hoare triple {21385#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {21386#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:43,214 INFO L273 TraceCheckUtils]: 134: Hoare triple {21386#(<= main_~i~0 32)} assume true; {21386#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:43,215 INFO L273 TraceCheckUtils]: 135: Hoare triple {21386#(<= main_~i~0 32)} assume !(~i~0 < 100000); {21353#false} is VALID [2018-11-14 18:45:43,215 INFO L273 TraceCheckUtils]: 136: Hoare triple {21353#false} havoc ~x~0;~x~0 := 0; {21353#false} is VALID [2018-11-14 18:45:43,215 INFO L273 TraceCheckUtils]: 137: Hoare triple {21353#false} assume true; {21353#false} is VALID [2018-11-14 18:45:43,215 INFO L273 TraceCheckUtils]: 138: Hoare triple {21353#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {21353#false} is VALID [2018-11-14 18:45:43,216 INFO L256 TraceCheckUtils]: 139: Hoare triple {21353#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {21353#false} is VALID [2018-11-14 18:45:43,216 INFO L273 TraceCheckUtils]: 140: Hoare triple {21353#false} ~cond := #in~cond; {21353#false} is VALID [2018-11-14 18:45:43,216 INFO L273 TraceCheckUtils]: 141: Hoare triple {21353#false} assume ~cond == 0; {21353#false} is VALID [2018-11-14 18:45:43,216 INFO L273 TraceCheckUtils]: 142: Hoare triple {21353#false} assume !false; {21353#false} is VALID [2018-11-14 18:45:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:43,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-14 18:45:43,251 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-14 18:45:43,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:43,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 18:45:43,384 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-14 18:45:43,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 18:45:43,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 18:45:43,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:45:43,386 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand 36 states. [2018-11-14 18:45:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:43,884 INFO L93 Difference]: Finished difference Result 166 states and 202 transitions. [2018-11-14 18:45:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:45:43,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-14 18:45:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:45:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 202 transitions. [2018-11-14 18:45:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:45:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 202 transitions. [2018-11-14 18:45:43,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 202 transitions. [2018-11-14 18:45:44,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:44,070 INFO L225 Difference]: With dead ends: 166 [2018-11-14 18:45:44,071 INFO L226 Difference]: Without dead ends: 154 [2018-11-14 18:45:44,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:45:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-14 18:45:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-11-14 18:45:44,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:44,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 152 states. [2018-11-14 18:45:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 152 states. [2018-11-14 18:45:44,101 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 152 states. [2018-11-14 18:45:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:44,103 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-11-14 18:45:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-14 18:45:44,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:44,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:44,103 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 154 states. [2018-11-14 18:45:44,103 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 154 states. [2018-11-14 18:45:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:44,106 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-11-14 18:45:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-14 18:45:44,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:44,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:44,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:44,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 18:45:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2018-11-14 18:45:44,110 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 143 [2018-11-14 18:45:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:44,110 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2018-11-14 18:45:44,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 18:45:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2018-11-14 18:45:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-14 18:45:44,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:44,111 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:44,112 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:44,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1299984792, now seen corresponding path program 33 times [2018-11-14 18:45:44,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:44,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:44,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:44,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {22527#true} call ULTIMATE.init(); {22527#true} is VALID [2018-11-14 18:45:44,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {22527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22527#true} is VALID [2018-11-14 18:45:44,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {22527#true} assume true; {22527#true} is VALID [2018-11-14 18:45:44,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22527#true} {22527#true} #57#return; {22527#true} is VALID [2018-11-14 18:45:44,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {22527#true} call #t~ret4 := main(); {22527#true} is VALID [2018-11-14 18:45:44,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {22527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22529#(= main_~i~0 0)} is VALID [2018-11-14 18:45:44,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {22529#(= main_~i~0 0)} assume true; {22529#(= main_~i~0 0)} is VALID [2018-11-14 18:45:44,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {22529#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22529#(= main_~i~0 0)} is VALID [2018-11-14 18:45:44,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {22529#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22529#(= main_~i~0 0)} is VALID [2018-11-14 18:45:44,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {22529#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:44,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {22530#(<= main_~i~0 1)} assume true; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:44,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {22530#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:44,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {22530#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:44,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {22530#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:44,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {22531#(<= main_~i~0 2)} assume true; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:44,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {22531#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:44,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {22531#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:44,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {22531#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:44,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {22532#(<= main_~i~0 3)} assume true; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:44,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {22532#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:44,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {22532#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:44,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {22532#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:44,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {22533#(<= main_~i~0 4)} assume true; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:44,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {22533#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:44,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {22533#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:44,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {22533#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:44,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {22534#(<= main_~i~0 5)} assume true; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:44,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {22534#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:44,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {22534#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:44,978 INFO L273 TraceCheckUtils]: 29: Hoare triple {22534#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:44,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {22535#(<= main_~i~0 6)} assume true; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:44,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {22535#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:44,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {22535#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:44,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {22535#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:44,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {22536#(<= main_~i~0 7)} assume true; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:44,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {22536#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:44,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {22536#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:44,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {22536#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:44,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {22537#(<= main_~i~0 8)} assume true; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:44,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {22537#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:44,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {22537#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:44,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {22537#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:44,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {22538#(<= main_~i~0 9)} assume true; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:44,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {22538#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:44,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {22538#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:44,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {22538#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:44,987 INFO L273 TraceCheckUtils]: 46: Hoare triple {22539#(<= main_~i~0 10)} assume true; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:44,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {22539#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:44,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {22539#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:44,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {22539#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:44,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {22540#(<= main_~i~0 11)} assume true; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:44,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {22540#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:44,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {22540#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:44,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {22540#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:44,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {22541#(<= main_~i~0 12)} assume true; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:44,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {22541#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:44,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {22541#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:44,993 INFO L273 TraceCheckUtils]: 57: Hoare triple {22541#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:44,993 INFO L273 TraceCheckUtils]: 58: Hoare triple {22542#(<= main_~i~0 13)} assume true; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:44,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {22542#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:44,994 INFO L273 TraceCheckUtils]: 60: Hoare triple {22542#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:44,995 INFO L273 TraceCheckUtils]: 61: Hoare triple {22542#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:44,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {22543#(<= main_~i~0 14)} assume true; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:44,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {22543#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:44,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {22543#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:44,997 INFO L273 TraceCheckUtils]: 65: Hoare triple {22543#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:44,998 INFO L273 TraceCheckUtils]: 66: Hoare triple {22544#(<= main_~i~0 15)} assume true; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:44,998 INFO L273 TraceCheckUtils]: 67: Hoare triple {22544#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:44,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {22544#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:44,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {22544#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,000 INFO L273 TraceCheckUtils]: 70: Hoare triple {22545#(<= main_~i~0 16)} assume true; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,000 INFO L273 TraceCheckUtils]: 71: Hoare triple {22545#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {22545#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,002 INFO L273 TraceCheckUtils]: 73: Hoare triple {22545#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,002 INFO L273 TraceCheckUtils]: 74: Hoare triple {22546#(<= main_~i~0 17)} assume true; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,003 INFO L273 TraceCheckUtils]: 75: Hoare triple {22546#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,003 INFO L273 TraceCheckUtils]: 76: Hoare triple {22546#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,004 INFO L273 TraceCheckUtils]: 77: Hoare triple {22546#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,004 INFO L273 TraceCheckUtils]: 78: Hoare triple {22547#(<= main_~i~0 18)} assume true; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,005 INFO L273 TraceCheckUtils]: 79: Hoare triple {22547#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,005 INFO L273 TraceCheckUtils]: 80: Hoare triple {22547#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,006 INFO L273 TraceCheckUtils]: 81: Hoare triple {22547#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,007 INFO L273 TraceCheckUtils]: 82: Hoare triple {22548#(<= main_~i~0 19)} assume true; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,007 INFO L273 TraceCheckUtils]: 83: Hoare triple {22548#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,008 INFO L273 TraceCheckUtils]: 84: Hoare triple {22548#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,008 INFO L273 TraceCheckUtils]: 85: Hoare triple {22548#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,009 INFO L273 TraceCheckUtils]: 86: Hoare triple {22549#(<= main_~i~0 20)} assume true; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,009 INFO L273 TraceCheckUtils]: 87: Hoare triple {22549#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,010 INFO L273 TraceCheckUtils]: 88: Hoare triple {22549#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,011 INFO L273 TraceCheckUtils]: 89: Hoare triple {22549#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,011 INFO L273 TraceCheckUtils]: 90: Hoare triple {22550#(<= main_~i~0 21)} assume true; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,012 INFO L273 TraceCheckUtils]: 91: Hoare triple {22550#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,012 INFO L273 TraceCheckUtils]: 92: Hoare triple {22550#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,013 INFO L273 TraceCheckUtils]: 93: Hoare triple {22550#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,013 INFO L273 TraceCheckUtils]: 94: Hoare triple {22551#(<= main_~i~0 22)} assume true; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,014 INFO L273 TraceCheckUtils]: 95: Hoare triple {22551#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,014 INFO L273 TraceCheckUtils]: 96: Hoare triple {22551#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,015 INFO L273 TraceCheckUtils]: 97: Hoare triple {22551#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,015 INFO L273 TraceCheckUtils]: 98: Hoare triple {22552#(<= main_~i~0 23)} assume true; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,016 INFO L273 TraceCheckUtils]: 99: Hoare triple {22552#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,016 INFO L273 TraceCheckUtils]: 100: Hoare triple {22552#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,017 INFO L273 TraceCheckUtils]: 101: Hoare triple {22552#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,018 INFO L273 TraceCheckUtils]: 102: Hoare triple {22553#(<= main_~i~0 24)} assume true; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,018 INFO L273 TraceCheckUtils]: 103: Hoare triple {22553#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,019 INFO L273 TraceCheckUtils]: 104: Hoare triple {22553#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,019 INFO L273 TraceCheckUtils]: 105: Hoare triple {22553#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,020 INFO L273 TraceCheckUtils]: 106: Hoare triple {22554#(<= main_~i~0 25)} assume true; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,020 INFO L273 TraceCheckUtils]: 107: Hoare triple {22554#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,021 INFO L273 TraceCheckUtils]: 108: Hoare triple {22554#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,022 INFO L273 TraceCheckUtils]: 109: Hoare triple {22554#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,022 INFO L273 TraceCheckUtils]: 110: Hoare triple {22555#(<= main_~i~0 26)} assume true; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,023 INFO L273 TraceCheckUtils]: 111: Hoare triple {22555#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,023 INFO L273 TraceCheckUtils]: 112: Hoare triple {22555#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,024 INFO L273 TraceCheckUtils]: 113: Hoare triple {22555#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,024 INFO L273 TraceCheckUtils]: 114: Hoare triple {22556#(<= main_~i~0 27)} assume true; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,025 INFO L273 TraceCheckUtils]: 115: Hoare triple {22556#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,025 INFO L273 TraceCheckUtils]: 116: Hoare triple {22556#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,026 INFO L273 TraceCheckUtils]: 117: Hoare triple {22556#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,026 INFO L273 TraceCheckUtils]: 118: Hoare triple {22557#(<= main_~i~0 28)} assume true; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,027 INFO L273 TraceCheckUtils]: 119: Hoare triple {22557#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,027 INFO L273 TraceCheckUtils]: 120: Hoare triple {22557#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {22557#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,029 INFO L273 TraceCheckUtils]: 122: Hoare triple {22558#(<= main_~i~0 29)} assume true; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,029 INFO L273 TraceCheckUtils]: 123: Hoare triple {22558#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,030 INFO L273 TraceCheckUtils]: 124: Hoare triple {22558#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,030 INFO L273 TraceCheckUtils]: 125: Hoare triple {22558#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,031 INFO L273 TraceCheckUtils]: 126: Hoare triple {22559#(<= main_~i~0 30)} assume true; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,031 INFO L273 TraceCheckUtils]: 127: Hoare triple {22559#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,032 INFO L273 TraceCheckUtils]: 128: Hoare triple {22559#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,032 INFO L273 TraceCheckUtils]: 129: Hoare triple {22559#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,033 INFO L273 TraceCheckUtils]: 130: Hoare triple {22560#(<= main_~i~0 31)} assume true; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,033 INFO L273 TraceCheckUtils]: 131: Hoare triple {22560#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,034 INFO L273 TraceCheckUtils]: 132: Hoare triple {22560#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,035 INFO L273 TraceCheckUtils]: 133: Hoare triple {22560#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,035 INFO L273 TraceCheckUtils]: 134: Hoare triple {22561#(<= main_~i~0 32)} assume true; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,036 INFO L273 TraceCheckUtils]: 135: Hoare triple {22561#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,036 INFO L273 TraceCheckUtils]: 136: Hoare triple {22561#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,037 INFO L273 TraceCheckUtils]: 137: Hoare triple {22561#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {22562#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:45,037 INFO L273 TraceCheckUtils]: 138: Hoare triple {22562#(<= main_~i~0 33)} assume true; {22562#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:45,038 INFO L273 TraceCheckUtils]: 139: Hoare triple {22562#(<= main_~i~0 33)} assume !(~i~0 < 100000); {22528#false} is VALID [2018-11-14 18:45:45,038 INFO L273 TraceCheckUtils]: 140: Hoare triple {22528#false} havoc ~x~0;~x~0 := 0; {22528#false} is VALID [2018-11-14 18:45:45,038 INFO L273 TraceCheckUtils]: 141: Hoare triple {22528#false} assume true; {22528#false} is VALID [2018-11-14 18:45:45,039 INFO L273 TraceCheckUtils]: 142: Hoare triple {22528#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {22528#false} is VALID [2018-11-14 18:45:45,039 INFO L256 TraceCheckUtils]: 143: Hoare triple {22528#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {22528#false} is VALID [2018-11-14 18:45:45,039 INFO L273 TraceCheckUtils]: 144: Hoare triple {22528#false} ~cond := #in~cond; {22528#false} is VALID [2018-11-14 18:45:45,039 INFO L273 TraceCheckUtils]: 145: Hoare triple {22528#false} assume ~cond == 0; {22528#false} is VALID [2018-11-14 18:45:45,039 INFO L273 TraceCheckUtils]: 146: Hoare triple {22528#false} assume !false; {22528#false} is VALID [2018-11-14 18:45:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:45,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:45,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:45:45,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:45:45,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-14 18:45:45,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:45,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {22527#true} call ULTIMATE.init(); {22527#true} is VALID [2018-11-14 18:45:45,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {22527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22527#true} is VALID [2018-11-14 18:45:45,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {22527#true} assume true; {22527#true} is VALID [2018-11-14 18:45:45,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22527#true} {22527#true} #57#return; {22527#true} is VALID [2018-11-14 18:45:45,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {22527#true} call #t~ret4 := main(); {22527#true} is VALID [2018-11-14 18:45:45,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {22527#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {22581#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:45,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {22581#(<= main_~i~0 0)} assume true; {22581#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:45,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {22581#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22581#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:45,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {22581#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22581#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:45,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {22581#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:45,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {22530#(<= main_~i~0 1)} assume true; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:45,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {22530#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:45,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {22530#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22530#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:45,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {22530#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:45,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {22531#(<= main_~i~0 2)} assume true; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:45,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {22531#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:45,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {22531#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22531#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:45,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {22531#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:45,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {22532#(<= main_~i~0 3)} assume true; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:45,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {22532#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:45,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {22532#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22532#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:45,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {22532#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:45,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {22533#(<= main_~i~0 4)} assume true; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:45,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {22533#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:45,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {22533#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22533#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:45,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {22533#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:45,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {22534#(<= main_~i~0 5)} assume true; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:45,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {22534#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:45,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {22534#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22534#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:45,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {22534#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:45,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {22535#(<= main_~i~0 6)} assume true; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:45,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {22535#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:45,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {22535#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22535#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:45,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {22535#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:45,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {22536#(<= main_~i~0 7)} assume true; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:45,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {22536#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:45,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {22536#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22536#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:45,517 INFO L273 TraceCheckUtils]: 37: Hoare triple {22536#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:45,517 INFO L273 TraceCheckUtils]: 38: Hoare triple {22537#(<= main_~i~0 8)} assume true; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:45,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {22537#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:45,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {22537#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22537#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:45,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {22537#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:45,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {22538#(<= main_~i~0 9)} assume true; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:45,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {22538#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:45,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {22538#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22538#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:45,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {22538#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:45,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {22539#(<= main_~i~0 10)} assume true; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:45,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {22539#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:45,523 INFO L273 TraceCheckUtils]: 48: Hoare triple {22539#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22539#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:45,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {22539#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:45,524 INFO L273 TraceCheckUtils]: 50: Hoare triple {22540#(<= main_~i~0 11)} assume true; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:45,525 INFO L273 TraceCheckUtils]: 51: Hoare triple {22540#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:45,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {22540#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22540#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:45,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {22540#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:45,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {22541#(<= main_~i~0 12)} assume true; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:45,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {22541#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:45,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {22541#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22541#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:45,528 INFO L273 TraceCheckUtils]: 57: Hoare triple {22541#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:45,529 INFO L273 TraceCheckUtils]: 58: Hoare triple {22542#(<= main_~i~0 13)} assume true; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:45,529 INFO L273 TraceCheckUtils]: 59: Hoare triple {22542#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:45,529 INFO L273 TraceCheckUtils]: 60: Hoare triple {22542#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22542#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:45,530 INFO L273 TraceCheckUtils]: 61: Hoare triple {22542#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:45,531 INFO L273 TraceCheckUtils]: 62: Hoare triple {22543#(<= main_~i~0 14)} assume true; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:45,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {22543#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:45,532 INFO L273 TraceCheckUtils]: 64: Hoare triple {22543#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22543#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:45,532 INFO L273 TraceCheckUtils]: 65: Hoare triple {22543#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:45,533 INFO L273 TraceCheckUtils]: 66: Hoare triple {22544#(<= main_~i~0 15)} assume true; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:45,533 INFO L273 TraceCheckUtils]: 67: Hoare triple {22544#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:45,534 INFO L273 TraceCheckUtils]: 68: Hoare triple {22544#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22544#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:45,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {22544#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,535 INFO L273 TraceCheckUtils]: 70: Hoare triple {22545#(<= main_~i~0 16)} assume true; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,536 INFO L273 TraceCheckUtils]: 71: Hoare triple {22545#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,536 INFO L273 TraceCheckUtils]: 72: Hoare triple {22545#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22545#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:45,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {22545#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,537 INFO L273 TraceCheckUtils]: 74: Hoare triple {22546#(<= main_~i~0 17)} assume true; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,538 INFO L273 TraceCheckUtils]: 75: Hoare triple {22546#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,538 INFO L273 TraceCheckUtils]: 76: Hoare triple {22546#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22546#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:45,539 INFO L273 TraceCheckUtils]: 77: Hoare triple {22546#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {22547#(<= main_~i~0 18)} assume true; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,540 INFO L273 TraceCheckUtils]: 79: Hoare triple {22547#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,541 INFO L273 TraceCheckUtils]: 80: Hoare triple {22547#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22547#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:45,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {22547#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,542 INFO L273 TraceCheckUtils]: 82: Hoare triple {22548#(<= main_~i~0 19)} assume true; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,542 INFO L273 TraceCheckUtils]: 83: Hoare triple {22548#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {22548#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22548#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:45,543 INFO L273 TraceCheckUtils]: 85: Hoare triple {22548#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,544 INFO L273 TraceCheckUtils]: 86: Hoare triple {22549#(<= main_~i~0 20)} assume true; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,544 INFO L273 TraceCheckUtils]: 87: Hoare triple {22549#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,545 INFO L273 TraceCheckUtils]: 88: Hoare triple {22549#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22549#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:45,546 INFO L273 TraceCheckUtils]: 89: Hoare triple {22549#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,546 INFO L273 TraceCheckUtils]: 90: Hoare triple {22550#(<= main_~i~0 21)} assume true; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,547 INFO L273 TraceCheckUtils]: 91: Hoare triple {22550#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,547 INFO L273 TraceCheckUtils]: 92: Hoare triple {22550#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22550#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:45,548 INFO L273 TraceCheckUtils]: 93: Hoare triple {22550#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,548 INFO L273 TraceCheckUtils]: 94: Hoare triple {22551#(<= main_~i~0 22)} assume true; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,549 INFO L273 TraceCheckUtils]: 95: Hoare triple {22551#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,549 INFO L273 TraceCheckUtils]: 96: Hoare triple {22551#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22551#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:45,550 INFO L273 TraceCheckUtils]: 97: Hoare triple {22551#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,551 INFO L273 TraceCheckUtils]: 98: Hoare triple {22552#(<= main_~i~0 23)} assume true; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,551 INFO L273 TraceCheckUtils]: 99: Hoare triple {22552#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,552 INFO L273 TraceCheckUtils]: 100: Hoare triple {22552#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22552#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:45,552 INFO L273 TraceCheckUtils]: 101: Hoare triple {22552#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,553 INFO L273 TraceCheckUtils]: 102: Hoare triple {22553#(<= main_~i~0 24)} assume true; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,553 INFO L273 TraceCheckUtils]: 103: Hoare triple {22553#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,554 INFO L273 TraceCheckUtils]: 104: Hoare triple {22553#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22553#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:45,555 INFO L273 TraceCheckUtils]: 105: Hoare triple {22553#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,555 INFO L273 TraceCheckUtils]: 106: Hoare triple {22554#(<= main_~i~0 25)} assume true; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,556 INFO L273 TraceCheckUtils]: 107: Hoare triple {22554#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,556 INFO L273 TraceCheckUtils]: 108: Hoare triple {22554#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22554#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:45,557 INFO L273 TraceCheckUtils]: 109: Hoare triple {22554#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,557 INFO L273 TraceCheckUtils]: 110: Hoare triple {22555#(<= main_~i~0 26)} assume true; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,558 INFO L273 TraceCheckUtils]: 111: Hoare triple {22555#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,558 INFO L273 TraceCheckUtils]: 112: Hoare triple {22555#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22555#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:45,559 INFO L273 TraceCheckUtils]: 113: Hoare triple {22555#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,560 INFO L273 TraceCheckUtils]: 114: Hoare triple {22556#(<= main_~i~0 27)} assume true; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,560 INFO L273 TraceCheckUtils]: 115: Hoare triple {22556#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,560 INFO L273 TraceCheckUtils]: 116: Hoare triple {22556#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22556#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:45,561 INFO L273 TraceCheckUtils]: 117: Hoare triple {22556#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,562 INFO L273 TraceCheckUtils]: 118: Hoare triple {22557#(<= main_~i~0 28)} assume true; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,562 INFO L273 TraceCheckUtils]: 119: Hoare triple {22557#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,563 INFO L273 TraceCheckUtils]: 120: Hoare triple {22557#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22557#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:45,563 INFO L273 TraceCheckUtils]: 121: Hoare triple {22557#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,564 INFO L273 TraceCheckUtils]: 122: Hoare triple {22558#(<= main_~i~0 29)} assume true; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,564 INFO L273 TraceCheckUtils]: 123: Hoare triple {22558#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,565 INFO L273 TraceCheckUtils]: 124: Hoare triple {22558#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22558#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:45,566 INFO L273 TraceCheckUtils]: 125: Hoare triple {22558#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,566 INFO L273 TraceCheckUtils]: 126: Hoare triple {22559#(<= main_~i~0 30)} assume true; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,567 INFO L273 TraceCheckUtils]: 127: Hoare triple {22559#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,567 INFO L273 TraceCheckUtils]: 128: Hoare triple {22559#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22559#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:45,568 INFO L273 TraceCheckUtils]: 129: Hoare triple {22559#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,568 INFO L273 TraceCheckUtils]: 130: Hoare triple {22560#(<= main_~i~0 31)} assume true; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,569 INFO L273 TraceCheckUtils]: 131: Hoare triple {22560#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,569 INFO L273 TraceCheckUtils]: 132: Hoare triple {22560#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22560#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:45,570 INFO L273 TraceCheckUtils]: 133: Hoare triple {22560#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,571 INFO L273 TraceCheckUtils]: 134: Hoare triple {22561#(<= main_~i~0 32)} assume true; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,571 INFO L273 TraceCheckUtils]: 135: Hoare triple {22561#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,572 INFO L273 TraceCheckUtils]: 136: Hoare triple {22561#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {22561#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:45,572 INFO L273 TraceCheckUtils]: 137: Hoare triple {22561#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {22562#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:45,573 INFO L273 TraceCheckUtils]: 138: Hoare triple {22562#(<= main_~i~0 33)} assume true; {22562#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:45,574 INFO L273 TraceCheckUtils]: 139: Hoare triple {22562#(<= main_~i~0 33)} assume !(~i~0 < 100000); {22528#false} is VALID [2018-11-14 18:45:45,574 INFO L273 TraceCheckUtils]: 140: Hoare triple {22528#false} havoc ~x~0;~x~0 := 0; {22528#false} is VALID [2018-11-14 18:45:45,574 INFO L273 TraceCheckUtils]: 141: Hoare triple {22528#false} assume true; {22528#false} is VALID [2018-11-14 18:45:45,574 INFO L273 TraceCheckUtils]: 142: Hoare triple {22528#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {22528#false} is VALID [2018-11-14 18:45:45,574 INFO L256 TraceCheckUtils]: 143: Hoare triple {22528#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {22528#false} is VALID [2018-11-14 18:45:45,575 INFO L273 TraceCheckUtils]: 144: Hoare triple {22528#false} ~cond := #in~cond; {22528#false} is VALID [2018-11-14 18:45:45,575 INFO L273 TraceCheckUtils]: 145: Hoare triple {22528#false} assume ~cond == 0; {22528#false} is VALID [2018-11-14 18:45:45,575 INFO L273 TraceCheckUtils]: 146: Hoare triple {22528#false} assume !false; {22528#false} is VALID [2018-11-14 18:45:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:45,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:45,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-14 18:45:45,611 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-14 18:45:45,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:45,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 18:45:45,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:45,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 18:45:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 18:45:45,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:45:45,788 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand 37 states. [2018-11-14 18:45:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:46,522 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2018-11-14 18:45:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 18:45:46,522 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-14 18:45:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:45:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 207 transitions. [2018-11-14 18:45:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:45:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 207 transitions. [2018-11-14 18:45:46,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 207 transitions. [2018-11-14 18:45:46,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:46,712 INFO L225 Difference]: With dead ends: 170 [2018-11-14 18:45:46,712 INFO L226 Difference]: Without dead ends: 158 [2018-11-14 18:45:46,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:45:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-14 18:45:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-14 18:45:46,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:46,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 156 states. [2018-11-14 18:45:46,777 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 156 states. [2018-11-14 18:45:46,777 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 156 states. [2018-11-14 18:45:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:46,780 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2018-11-14 18:45:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2018-11-14 18:45:46,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:46,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:46,780 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 158 states. [2018-11-14 18:45:46,780 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 158 states. [2018-11-14 18:45:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:46,782 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2018-11-14 18:45:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2018-11-14 18:45:46,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:46,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:46,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:46,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-14 18:45:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2018-11-14 18:45:46,786 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 147 [2018-11-14 18:45:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:46,786 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2018-11-14 18:45:46,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 18:45:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2018-11-14 18:45:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-14 18:45:46,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:46,787 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:46,787 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:46,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2105785874, now seen corresponding path program 34 times [2018-11-14 18:45:46,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:46,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:46,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:47,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {23733#true} call ULTIMATE.init(); {23733#true} is VALID [2018-11-14 18:45:47,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {23733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23733#true} is VALID [2018-11-14 18:45:47,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {23733#true} assume true; {23733#true} is VALID [2018-11-14 18:45:47,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23733#true} {23733#true} #57#return; {23733#true} is VALID [2018-11-14 18:45:47,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {23733#true} call #t~ret4 := main(); {23733#true} is VALID [2018-11-14 18:45:47,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {23733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23735#(= main_~i~0 0)} is VALID [2018-11-14 18:45:47,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {23735#(= main_~i~0 0)} assume true; {23735#(= main_~i~0 0)} is VALID [2018-11-14 18:45:47,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {23735#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23735#(= main_~i~0 0)} is VALID [2018-11-14 18:45:47,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {23735#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23735#(= main_~i~0 0)} is VALID [2018-11-14 18:45:47,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {23735#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:47,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {23736#(<= main_~i~0 1)} assume true; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:47,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {23736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:47,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {23736#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:47,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {23736#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:47,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {23737#(<= main_~i~0 2)} assume true; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:47,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {23737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:47,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {23737#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:47,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {23737#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:47,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {23738#(<= main_~i~0 3)} assume true; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:47,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {23738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:47,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:47,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {23738#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:47,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {23739#(<= main_~i~0 4)} assume true; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:47,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {23739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:47,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {23739#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:47,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {23739#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:47,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {23740#(<= main_~i~0 5)} assume true; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:47,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {23740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:47,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {23740#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:47,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {23740#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:47,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {23741#(<= main_~i~0 6)} assume true; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:47,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {23741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:47,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {23741#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:47,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {23741#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:47,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {23742#(<= main_~i~0 7)} assume true; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:47,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {23742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:47,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {23742#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:47,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {23742#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:47,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {23743#(<= main_~i~0 8)} assume true; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:47,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {23743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:47,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {23743#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:47,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {23743#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:47,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {23744#(<= main_~i~0 9)} assume true; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:47,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {23744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:47,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {23744#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:47,982 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:47,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {23745#(<= main_~i~0 10)} assume true; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:47,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {23745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:47,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {23745#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:47,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {23745#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:47,986 INFO L273 TraceCheckUtils]: 50: Hoare triple {23746#(<= main_~i~0 11)} assume true; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:47,988 INFO L273 TraceCheckUtils]: 51: Hoare triple {23746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:47,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {23746#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:47,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {23746#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:47,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {23747#(<= main_~i~0 12)} assume true; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:47,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {23747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:47,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {23747#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:47,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {23747#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:47,995 INFO L273 TraceCheckUtils]: 58: Hoare triple {23748#(<= main_~i~0 13)} assume true; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:47,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {23748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:47,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {23748#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:47,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {23748#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:47,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {23749#(<= main_~i~0 14)} assume true; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:47,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {23749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:47,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {23749#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:47,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {23749#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:47,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {23750#(<= main_~i~0 15)} assume true; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,001 INFO L273 TraceCheckUtils]: 67: Hoare triple {23750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,001 INFO L273 TraceCheckUtils]: 68: Hoare triple {23750#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {23750#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {23751#(<= main_~i~0 16)} assume true; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,005 INFO L273 TraceCheckUtils]: 71: Hoare triple {23751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,005 INFO L273 TraceCheckUtils]: 72: Hoare triple {23751#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,008 INFO L273 TraceCheckUtils]: 73: Hoare triple {23751#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,008 INFO L273 TraceCheckUtils]: 74: Hoare triple {23752#(<= main_~i~0 17)} assume true; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,010 INFO L273 TraceCheckUtils]: 75: Hoare triple {23752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,010 INFO L273 TraceCheckUtils]: 76: Hoare triple {23752#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {23752#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,012 INFO L273 TraceCheckUtils]: 78: Hoare triple {23753#(<= main_~i~0 18)} assume true; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,014 INFO L273 TraceCheckUtils]: 79: Hoare triple {23753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {23753#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,016 INFO L273 TraceCheckUtils]: 81: Hoare triple {23753#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,016 INFO L273 TraceCheckUtils]: 82: Hoare triple {23754#(<= main_~i~0 19)} assume true; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,019 INFO L273 TraceCheckUtils]: 83: Hoare triple {23754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,019 INFO L273 TraceCheckUtils]: 84: Hoare triple {23754#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,019 INFO L273 TraceCheckUtils]: 85: Hoare triple {23754#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,020 INFO L273 TraceCheckUtils]: 86: Hoare triple {23755#(<= main_~i~0 20)} assume true; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,020 INFO L273 TraceCheckUtils]: 87: Hoare triple {23755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,020 INFO L273 TraceCheckUtils]: 88: Hoare triple {23755#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,021 INFO L273 TraceCheckUtils]: 89: Hoare triple {23755#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,021 INFO L273 TraceCheckUtils]: 90: Hoare triple {23756#(<= main_~i~0 21)} assume true; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,021 INFO L273 TraceCheckUtils]: 91: Hoare triple {23756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,022 INFO L273 TraceCheckUtils]: 92: Hoare triple {23756#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,022 INFO L273 TraceCheckUtils]: 93: Hoare triple {23756#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,023 INFO L273 TraceCheckUtils]: 94: Hoare triple {23757#(<= main_~i~0 22)} assume true; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,023 INFO L273 TraceCheckUtils]: 95: Hoare triple {23757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,024 INFO L273 TraceCheckUtils]: 96: Hoare triple {23757#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,025 INFO L273 TraceCheckUtils]: 97: Hoare triple {23757#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,025 INFO L273 TraceCheckUtils]: 98: Hoare triple {23758#(<= main_~i~0 23)} assume true; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,026 INFO L273 TraceCheckUtils]: 99: Hoare triple {23758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,026 INFO L273 TraceCheckUtils]: 100: Hoare triple {23758#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,027 INFO L273 TraceCheckUtils]: 101: Hoare triple {23758#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,027 INFO L273 TraceCheckUtils]: 102: Hoare triple {23759#(<= main_~i~0 24)} assume true; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,028 INFO L273 TraceCheckUtils]: 103: Hoare triple {23759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,031 INFO L273 TraceCheckUtils]: 104: Hoare triple {23759#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,031 INFO L273 TraceCheckUtils]: 105: Hoare triple {23759#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,033 INFO L273 TraceCheckUtils]: 106: Hoare triple {23760#(<= main_~i~0 25)} assume true; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,033 INFO L273 TraceCheckUtils]: 107: Hoare triple {23760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,035 INFO L273 TraceCheckUtils]: 108: Hoare triple {23760#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,035 INFO L273 TraceCheckUtils]: 109: Hoare triple {23760#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,035 INFO L273 TraceCheckUtils]: 110: Hoare triple {23761#(<= main_~i~0 26)} assume true; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {23761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,036 INFO L273 TraceCheckUtils]: 112: Hoare triple {23761#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,036 INFO L273 TraceCheckUtils]: 113: Hoare triple {23761#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,037 INFO L273 TraceCheckUtils]: 114: Hoare triple {23762#(<= main_~i~0 27)} assume true; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,037 INFO L273 TraceCheckUtils]: 115: Hoare triple {23762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,038 INFO L273 TraceCheckUtils]: 116: Hoare triple {23762#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,038 INFO L273 TraceCheckUtils]: 117: Hoare triple {23762#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,038 INFO L273 TraceCheckUtils]: 118: Hoare triple {23763#(<= main_~i~0 28)} assume true; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,039 INFO L273 TraceCheckUtils]: 119: Hoare triple {23763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,039 INFO L273 TraceCheckUtils]: 120: Hoare triple {23763#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,040 INFO L273 TraceCheckUtils]: 121: Hoare triple {23763#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,040 INFO L273 TraceCheckUtils]: 122: Hoare triple {23764#(<= main_~i~0 29)} assume true; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,041 INFO L273 TraceCheckUtils]: 123: Hoare triple {23764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,041 INFO L273 TraceCheckUtils]: 124: Hoare triple {23764#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,055 INFO L273 TraceCheckUtils]: 125: Hoare triple {23764#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,067 INFO L273 TraceCheckUtils]: 126: Hoare triple {23765#(<= main_~i~0 30)} assume true; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,072 INFO L273 TraceCheckUtils]: 127: Hoare triple {23765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,081 INFO L273 TraceCheckUtils]: 128: Hoare triple {23765#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,093 INFO L273 TraceCheckUtils]: 129: Hoare triple {23765#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,095 INFO L273 TraceCheckUtils]: 130: Hoare triple {23766#(<= main_~i~0 31)} assume true; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,097 INFO L273 TraceCheckUtils]: 131: Hoare triple {23766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,097 INFO L273 TraceCheckUtils]: 132: Hoare triple {23766#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,099 INFO L273 TraceCheckUtils]: 133: Hoare triple {23766#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,099 INFO L273 TraceCheckUtils]: 134: Hoare triple {23767#(<= main_~i~0 32)} assume true; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,103 INFO L273 TraceCheckUtils]: 135: Hoare triple {23767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,103 INFO L273 TraceCheckUtils]: 136: Hoare triple {23767#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,105 INFO L273 TraceCheckUtils]: 137: Hoare triple {23767#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,105 INFO L273 TraceCheckUtils]: 138: Hoare triple {23768#(<= main_~i~0 33)} assume true; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,107 INFO L273 TraceCheckUtils]: 139: Hoare triple {23768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,107 INFO L273 TraceCheckUtils]: 140: Hoare triple {23768#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,109 INFO L273 TraceCheckUtils]: 141: Hoare triple {23768#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {23769#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:48,109 INFO L273 TraceCheckUtils]: 142: Hoare triple {23769#(<= main_~i~0 34)} assume true; {23769#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:48,111 INFO L273 TraceCheckUtils]: 143: Hoare triple {23769#(<= main_~i~0 34)} assume !(~i~0 < 100000); {23734#false} is VALID [2018-11-14 18:45:48,111 INFO L273 TraceCheckUtils]: 144: Hoare triple {23734#false} havoc ~x~0;~x~0 := 0; {23734#false} is VALID [2018-11-14 18:45:48,111 INFO L273 TraceCheckUtils]: 145: Hoare triple {23734#false} assume true; {23734#false} is VALID [2018-11-14 18:45:48,111 INFO L273 TraceCheckUtils]: 146: Hoare triple {23734#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {23734#false} is VALID [2018-11-14 18:45:48,111 INFO L256 TraceCheckUtils]: 147: Hoare triple {23734#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {23734#false} is VALID [2018-11-14 18:45:48,111 INFO L273 TraceCheckUtils]: 148: Hoare triple {23734#false} ~cond := #in~cond; {23734#false} is VALID [2018-11-14 18:45:48,112 INFO L273 TraceCheckUtils]: 149: Hoare triple {23734#false} assume ~cond == 0; {23734#false} is VALID [2018-11-14 18:45:48,112 INFO L273 TraceCheckUtils]: 150: Hoare triple {23734#false} assume !false; {23734#false} is VALID [2018-11-14 18:45:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:48,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:48,127 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-14 18:45:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:45:48,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:45:48,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:48,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:48,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {23733#true} call ULTIMATE.init(); {23733#true} is VALID [2018-11-14 18:45:48,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {23733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23733#true} is VALID [2018-11-14 18:45:48,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {23733#true} assume true; {23733#true} is VALID [2018-11-14 18:45:48,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23733#true} {23733#true} #57#return; {23733#true} is VALID [2018-11-14 18:45:48,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {23733#true} call #t~ret4 := main(); {23733#true} is VALID [2018-11-14 18:45:48,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {23733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {23788#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:48,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {23788#(<= main_~i~0 0)} assume true; {23788#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:48,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {23788#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23788#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:48,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {23788#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23788#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:48,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {23788#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:48,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {23736#(<= main_~i~0 1)} assume true; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:48,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {23736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:48,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {23736#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23736#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:48,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {23736#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:48,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {23737#(<= main_~i~0 2)} assume true; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:48,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {23737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:48,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {23737#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23737#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:48,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {23737#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:48,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {23738#(<= main_~i~0 3)} assume true; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:48,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {23738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:48,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23738#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:48,677 INFO L273 TraceCheckUtils]: 21: Hoare triple {23738#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:48,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {23739#(<= main_~i~0 4)} assume true; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:48,678 INFO L273 TraceCheckUtils]: 23: Hoare triple {23739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:48,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {23739#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23739#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:48,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {23739#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:48,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {23740#(<= main_~i~0 5)} assume true; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:48,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {23740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:48,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {23740#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23740#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:48,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {23740#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:48,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {23741#(<= main_~i~0 6)} assume true; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:48,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {23741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:48,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {23741#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23741#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:48,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {23741#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:48,684 INFO L273 TraceCheckUtils]: 34: Hoare triple {23742#(<= main_~i~0 7)} assume true; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:48,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {23742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:48,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {23742#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23742#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:48,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {23742#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:48,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {23743#(<= main_~i~0 8)} assume true; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:48,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {23743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:48,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {23743#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23743#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:48,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {23743#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:48,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {23744#(<= main_~i~0 9)} assume true; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:48,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {23744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:48,690 INFO L273 TraceCheckUtils]: 44: Hoare triple {23744#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23744#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:48,690 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:48,691 INFO L273 TraceCheckUtils]: 46: Hoare triple {23745#(<= main_~i~0 10)} assume true; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:48,691 INFO L273 TraceCheckUtils]: 47: Hoare triple {23745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:48,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {23745#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23745#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:48,692 INFO L273 TraceCheckUtils]: 49: Hoare triple {23745#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:48,693 INFO L273 TraceCheckUtils]: 50: Hoare triple {23746#(<= main_~i~0 11)} assume true; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:48,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {23746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:48,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {23746#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23746#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:48,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {23746#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:48,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {23747#(<= main_~i~0 12)} assume true; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:48,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {23747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:48,696 INFO L273 TraceCheckUtils]: 56: Hoare triple {23747#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23747#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:48,697 INFO L273 TraceCheckUtils]: 57: Hoare triple {23747#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:48,697 INFO L273 TraceCheckUtils]: 58: Hoare triple {23748#(<= main_~i~0 13)} assume true; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:48,698 INFO L273 TraceCheckUtils]: 59: Hoare triple {23748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:48,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {23748#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23748#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:48,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {23748#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:48,699 INFO L273 TraceCheckUtils]: 62: Hoare triple {23749#(<= main_~i~0 14)} assume true; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:48,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {23749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:48,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {23749#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23749#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:48,701 INFO L273 TraceCheckUtils]: 65: Hoare triple {23749#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,702 INFO L273 TraceCheckUtils]: 66: Hoare triple {23750#(<= main_~i~0 15)} assume true; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,702 INFO L273 TraceCheckUtils]: 67: Hoare triple {23750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,703 INFO L273 TraceCheckUtils]: 68: Hoare triple {23750#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23750#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:48,703 INFO L273 TraceCheckUtils]: 69: Hoare triple {23750#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,704 INFO L273 TraceCheckUtils]: 70: Hoare triple {23751#(<= main_~i~0 16)} assume true; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,704 INFO L273 TraceCheckUtils]: 71: Hoare triple {23751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {23751#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23751#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:48,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {23751#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {23752#(<= main_~i~0 17)} assume true; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {23752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,707 INFO L273 TraceCheckUtils]: 76: Hoare triple {23752#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23752#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:48,708 INFO L273 TraceCheckUtils]: 77: Hoare triple {23752#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {23753#(<= main_~i~0 18)} assume true; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,709 INFO L273 TraceCheckUtils]: 79: Hoare triple {23753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,709 INFO L273 TraceCheckUtils]: 80: Hoare triple {23753#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23753#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:48,710 INFO L273 TraceCheckUtils]: 81: Hoare triple {23753#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {23754#(<= main_~i~0 19)} assume true; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,711 INFO L273 TraceCheckUtils]: 83: Hoare triple {23754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,712 INFO L273 TraceCheckUtils]: 84: Hoare triple {23754#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23754#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:48,712 INFO L273 TraceCheckUtils]: 85: Hoare triple {23754#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,713 INFO L273 TraceCheckUtils]: 86: Hoare triple {23755#(<= main_~i~0 20)} assume true; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,713 INFO L273 TraceCheckUtils]: 87: Hoare triple {23755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,714 INFO L273 TraceCheckUtils]: 88: Hoare triple {23755#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23755#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:48,715 INFO L273 TraceCheckUtils]: 89: Hoare triple {23755#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,715 INFO L273 TraceCheckUtils]: 90: Hoare triple {23756#(<= main_~i~0 21)} assume true; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,716 INFO L273 TraceCheckUtils]: 91: Hoare triple {23756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,716 INFO L273 TraceCheckUtils]: 92: Hoare triple {23756#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23756#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:48,717 INFO L273 TraceCheckUtils]: 93: Hoare triple {23756#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,717 INFO L273 TraceCheckUtils]: 94: Hoare triple {23757#(<= main_~i~0 22)} assume true; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,718 INFO L273 TraceCheckUtils]: 95: Hoare triple {23757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,718 INFO L273 TraceCheckUtils]: 96: Hoare triple {23757#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23757#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:48,719 INFO L273 TraceCheckUtils]: 97: Hoare triple {23757#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,719 INFO L273 TraceCheckUtils]: 98: Hoare triple {23758#(<= main_~i~0 23)} assume true; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,720 INFO L273 TraceCheckUtils]: 99: Hoare triple {23758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,720 INFO L273 TraceCheckUtils]: 100: Hoare triple {23758#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23758#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:48,721 INFO L273 TraceCheckUtils]: 101: Hoare triple {23758#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,722 INFO L273 TraceCheckUtils]: 102: Hoare triple {23759#(<= main_~i~0 24)} assume true; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {23759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,723 INFO L273 TraceCheckUtils]: 104: Hoare triple {23759#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23759#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:48,723 INFO L273 TraceCheckUtils]: 105: Hoare triple {23759#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {23760#(<= main_~i~0 25)} assume true; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {23760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,725 INFO L273 TraceCheckUtils]: 108: Hoare triple {23760#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23760#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:48,726 INFO L273 TraceCheckUtils]: 109: Hoare triple {23760#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,726 INFO L273 TraceCheckUtils]: 110: Hoare triple {23761#(<= main_~i~0 26)} assume true; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,727 INFO L273 TraceCheckUtils]: 111: Hoare triple {23761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,727 INFO L273 TraceCheckUtils]: 112: Hoare triple {23761#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23761#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:48,728 INFO L273 TraceCheckUtils]: 113: Hoare triple {23761#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,728 INFO L273 TraceCheckUtils]: 114: Hoare triple {23762#(<= main_~i~0 27)} assume true; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,729 INFO L273 TraceCheckUtils]: 115: Hoare triple {23762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,729 INFO L273 TraceCheckUtils]: 116: Hoare triple {23762#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23762#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:48,730 INFO L273 TraceCheckUtils]: 117: Hoare triple {23762#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,730 INFO L273 TraceCheckUtils]: 118: Hoare triple {23763#(<= main_~i~0 28)} assume true; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,731 INFO L273 TraceCheckUtils]: 119: Hoare triple {23763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,731 INFO L273 TraceCheckUtils]: 120: Hoare triple {23763#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23763#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:48,732 INFO L273 TraceCheckUtils]: 121: Hoare triple {23763#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,733 INFO L273 TraceCheckUtils]: 122: Hoare triple {23764#(<= main_~i~0 29)} assume true; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,733 INFO L273 TraceCheckUtils]: 123: Hoare triple {23764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,734 INFO L273 TraceCheckUtils]: 124: Hoare triple {23764#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23764#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:48,734 INFO L273 TraceCheckUtils]: 125: Hoare triple {23764#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,735 INFO L273 TraceCheckUtils]: 126: Hoare triple {23765#(<= main_~i~0 30)} assume true; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,735 INFO L273 TraceCheckUtils]: 127: Hoare triple {23765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,736 INFO L273 TraceCheckUtils]: 128: Hoare triple {23765#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23765#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:48,737 INFO L273 TraceCheckUtils]: 129: Hoare triple {23765#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,737 INFO L273 TraceCheckUtils]: 130: Hoare triple {23766#(<= main_~i~0 31)} assume true; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,738 INFO L273 TraceCheckUtils]: 131: Hoare triple {23766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,738 INFO L273 TraceCheckUtils]: 132: Hoare triple {23766#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23766#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:48,739 INFO L273 TraceCheckUtils]: 133: Hoare triple {23766#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,739 INFO L273 TraceCheckUtils]: 134: Hoare triple {23767#(<= main_~i~0 32)} assume true; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,740 INFO L273 TraceCheckUtils]: 135: Hoare triple {23767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,740 INFO L273 TraceCheckUtils]: 136: Hoare triple {23767#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23767#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:48,741 INFO L273 TraceCheckUtils]: 137: Hoare triple {23767#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,742 INFO L273 TraceCheckUtils]: 138: Hoare triple {23768#(<= main_~i~0 33)} assume true; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,742 INFO L273 TraceCheckUtils]: 139: Hoare triple {23768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,743 INFO L273 TraceCheckUtils]: 140: Hoare triple {23768#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {23768#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:48,743 INFO L273 TraceCheckUtils]: 141: Hoare triple {23768#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {23769#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:48,744 INFO L273 TraceCheckUtils]: 142: Hoare triple {23769#(<= main_~i~0 34)} assume true; {23769#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:48,744 INFO L273 TraceCheckUtils]: 143: Hoare triple {23769#(<= main_~i~0 34)} assume !(~i~0 < 100000); {23734#false} is VALID [2018-11-14 18:45:48,745 INFO L273 TraceCheckUtils]: 144: Hoare triple {23734#false} havoc ~x~0;~x~0 := 0; {23734#false} is VALID [2018-11-14 18:45:48,745 INFO L273 TraceCheckUtils]: 145: Hoare triple {23734#false} assume true; {23734#false} is VALID [2018-11-14 18:45:48,745 INFO L273 TraceCheckUtils]: 146: Hoare triple {23734#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {23734#false} is VALID [2018-11-14 18:45:48,745 INFO L256 TraceCheckUtils]: 147: Hoare triple {23734#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {23734#false} is VALID [2018-11-14 18:45:48,745 INFO L273 TraceCheckUtils]: 148: Hoare triple {23734#false} ~cond := #in~cond; {23734#false} is VALID [2018-11-14 18:45:48,746 INFO L273 TraceCheckUtils]: 149: Hoare triple {23734#false} assume ~cond == 0; {23734#false} is VALID [2018-11-14 18:45:48,746 INFO L273 TraceCheckUtils]: 150: Hoare triple {23734#false} assume !false; {23734#false} is VALID [2018-11-14 18:45:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:48,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-14 18:45:48,783 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-14 18:45:48,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:48,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 18:45:48,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:48,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 18:45:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 18:45:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:45:48,932 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand 38 states. [2018-11-14 18:45:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:49,606 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-14 18:45:49,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 18:45:49,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-14 18:45:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:45:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 212 transitions. [2018-11-14 18:45:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:45:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 212 transitions. [2018-11-14 18:45:49,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 212 transitions. [2018-11-14 18:45:49,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:49,792 INFO L225 Difference]: With dead ends: 174 [2018-11-14 18:45:49,792 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 18:45:49,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:45:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 18:45:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-14 18:45:49,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:49,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-14 18:45:49,818 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-14 18:45:49,818 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-14 18:45:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:49,820 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-14 18:45:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-14 18:45:49,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:49,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:49,821 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-14 18:45:49,821 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-14 18:45:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:49,824 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-14 18:45:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-14 18:45:49,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:49,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:49,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:49,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-14 18:45:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 196 transitions. [2018-11-14 18:45:49,827 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 196 transitions. Word has length 151 [2018-11-14 18:45:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:49,828 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 196 transitions. [2018-11-14 18:45:49,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 18:45:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2018-11-14 18:45:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-14 18:45:49,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:49,829 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:49,829 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:49,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash 498087748, now seen corresponding path program 35 times [2018-11-14 18:45:49,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:49,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:49,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:50,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {24970#true} call ULTIMATE.init(); {24970#true} is VALID [2018-11-14 18:45:50,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {24970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24970#true} is VALID [2018-11-14 18:45:50,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {24970#true} assume true; {24970#true} is VALID [2018-11-14 18:45:50,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24970#true} {24970#true} #57#return; {24970#true} is VALID [2018-11-14 18:45:50,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {24970#true} call #t~ret4 := main(); {24970#true} is VALID [2018-11-14 18:45:50,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {24970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {24972#(= main_~i~0 0)} is VALID [2018-11-14 18:45:50,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {24972#(= main_~i~0 0)} assume true; {24972#(= main_~i~0 0)} is VALID [2018-11-14 18:45:50,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {24972#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24972#(= main_~i~0 0)} is VALID [2018-11-14 18:45:50,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {24972#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24972#(= main_~i~0 0)} is VALID [2018-11-14 18:45:50,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {24972#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:50,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {24973#(<= main_~i~0 1)} assume true; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:50,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {24973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:50,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:50,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:50,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~0 2)} assume true; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:50,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:50,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {24974#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:50,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {24974#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:50,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {24975#(<= main_~i~0 3)} assume true; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:50,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {24975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:50,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {24975#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:50,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {24975#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:50,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {24976#(<= main_~i~0 4)} assume true; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:50,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {24976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:50,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {24976#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:50,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {24976#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:50,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {24977#(<= main_~i~0 5)} assume true; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:50,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {24977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:50,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {24977#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:50,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {24977#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:50,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {24978#(<= main_~i~0 6)} assume true; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:50,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {24978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:50,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {24978#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:50,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {24978#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:50,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {24979#(<= main_~i~0 7)} assume true; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:50,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {24979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:50,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {24979#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:50,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {24979#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:50,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {24980#(<= main_~i~0 8)} assume true; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:50,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {24980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:50,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {24980#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:50,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {24980#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:50,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {24981#(<= main_~i~0 9)} assume true; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:50,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {24981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:50,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {24981#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:50,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {24981#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:50,674 INFO L273 TraceCheckUtils]: 46: Hoare triple {24982#(<= main_~i~0 10)} assume true; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:50,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {24982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:50,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {24982#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:50,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {24982#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:50,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {24983#(<= main_~i~0 11)} assume true; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:50,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {24983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:50,677 INFO L273 TraceCheckUtils]: 52: Hoare triple {24983#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:50,677 INFO L273 TraceCheckUtils]: 53: Hoare triple {24983#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:50,678 INFO L273 TraceCheckUtils]: 54: Hoare triple {24984#(<= main_~i~0 12)} assume true; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:50,678 INFO L273 TraceCheckUtils]: 55: Hoare triple {24984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:50,679 INFO L273 TraceCheckUtils]: 56: Hoare triple {24984#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:50,680 INFO L273 TraceCheckUtils]: 57: Hoare triple {24984#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:50,680 INFO L273 TraceCheckUtils]: 58: Hoare triple {24985#(<= main_~i~0 13)} assume true; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:50,681 INFO L273 TraceCheckUtils]: 59: Hoare triple {24985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:50,681 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:50,682 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:50,682 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~0 14)} assume true; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:50,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:50,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {24986#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:50,684 INFO L273 TraceCheckUtils]: 65: Hoare triple {24986#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:50,684 INFO L273 TraceCheckUtils]: 66: Hoare triple {24987#(<= main_~i~0 15)} assume true; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:50,685 INFO L273 TraceCheckUtils]: 67: Hoare triple {24987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:50,685 INFO L273 TraceCheckUtils]: 68: Hoare triple {24987#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:50,686 INFO L273 TraceCheckUtils]: 69: Hoare triple {24987#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:50,686 INFO L273 TraceCheckUtils]: 70: Hoare triple {24988#(<= main_~i~0 16)} assume true; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:50,687 INFO L273 TraceCheckUtils]: 71: Hoare triple {24988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:50,687 INFO L273 TraceCheckUtils]: 72: Hoare triple {24988#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:50,688 INFO L273 TraceCheckUtils]: 73: Hoare triple {24988#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:50,688 INFO L273 TraceCheckUtils]: 74: Hoare triple {24989#(<= main_~i~0 17)} assume true; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:50,689 INFO L273 TraceCheckUtils]: 75: Hoare triple {24989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:50,689 INFO L273 TraceCheckUtils]: 76: Hoare triple {24989#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:50,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {24989#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:50,690 INFO L273 TraceCheckUtils]: 78: Hoare triple {24990#(<= main_~i~0 18)} assume true; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:50,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {24990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:50,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {24990#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:50,692 INFO L273 TraceCheckUtils]: 81: Hoare triple {24990#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:50,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {24991#(<= main_~i~0 19)} assume true; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:50,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {24991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:50,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {24991#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:50,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {24991#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:50,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {24992#(<= main_~i~0 20)} assume true; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:50,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {24992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:50,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {24992#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:50,696 INFO L273 TraceCheckUtils]: 89: Hoare triple {24992#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:50,697 INFO L273 TraceCheckUtils]: 90: Hoare triple {24993#(<= main_~i~0 21)} assume true; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:50,697 INFO L273 TraceCheckUtils]: 91: Hoare triple {24993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:50,697 INFO L273 TraceCheckUtils]: 92: Hoare triple {24993#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:50,698 INFO L273 TraceCheckUtils]: 93: Hoare triple {24993#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:50,699 INFO L273 TraceCheckUtils]: 94: Hoare triple {24994#(<= main_~i~0 22)} assume true; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:50,699 INFO L273 TraceCheckUtils]: 95: Hoare triple {24994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:50,699 INFO L273 TraceCheckUtils]: 96: Hoare triple {24994#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:50,700 INFO L273 TraceCheckUtils]: 97: Hoare triple {24994#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:50,701 INFO L273 TraceCheckUtils]: 98: Hoare triple {24995#(<= main_~i~0 23)} assume true; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:50,701 INFO L273 TraceCheckUtils]: 99: Hoare triple {24995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:50,702 INFO L273 TraceCheckUtils]: 100: Hoare triple {24995#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:50,702 INFO L273 TraceCheckUtils]: 101: Hoare triple {24995#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:50,703 INFO L273 TraceCheckUtils]: 102: Hoare triple {24996#(<= main_~i~0 24)} assume true; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:50,703 INFO L273 TraceCheckUtils]: 103: Hoare triple {24996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:50,704 INFO L273 TraceCheckUtils]: 104: Hoare triple {24996#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:50,704 INFO L273 TraceCheckUtils]: 105: Hoare triple {24996#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:50,705 INFO L273 TraceCheckUtils]: 106: Hoare triple {24997#(<= main_~i~0 25)} assume true; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:50,705 INFO L273 TraceCheckUtils]: 107: Hoare triple {24997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:50,706 INFO L273 TraceCheckUtils]: 108: Hoare triple {24997#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:50,706 INFO L273 TraceCheckUtils]: 109: Hoare triple {24997#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:50,707 INFO L273 TraceCheckUtils]: 110: Hoare triple {24998#(<= main_~i~0 26)} assume true; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:50,707 INFO L273 TraceCheckUtils]: 111: Hoare triple {24998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:50,708 INFO L273 TraceCheckUtils]: 112: Hoare triple {24998#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:50,708 INFO L273 TraceCheckUtils]: 113: Hoare triple {24998#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:50,709 INFO L273 TraceCheckUtils]: 114: Hoare triple {24999#(<= main_~i~0 27)} assume true; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:50,709 INFO L273 TraceCheckUtils]: 115: Hoare triple {24999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:50,710 INFO L273 TraceCheckUtils]: 116: Hoare triple {24999#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:50,710 INFO L273 TraceCheckUtils]: 117: Hoare triple {24999#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:50,711 INFO L273 TraceCheckUtils]: 118: Hoare triple {25000#(<= main_~i~0 28)} assume true; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:50,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {25000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:50,712 INFO L273 TraceCheckUtils]: 120: Hoare triple {25000#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:50,712 INFO L273 TraceCheckUtils]: 121: Hoare triple {25000#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:50,713 INFO L273 TraceCheckUtils]: 122: Hoare triple {25001#(<= main_~i~0 29)} assume true; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:50,713 INFO L273 TraceCheckUtils]: 123: Hoare triple {25001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:50,714 INFO L273 TraceCheckUtils]: 124: Hoare triple {25001#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:50,715 INFO L273 TraceCheckUtils]: 125: Hoare triple {25001#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:50,715 INFO L273 TraceCheckUtils]: 126: Hoare triple {25002#(<= main_~i~0 30)} assume true; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:50,715 INFO L273 TraceCheckUtils]: 127: Hoare triple {25002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:50,716 INFO L273 TraceCheckUtils]: 128: Hoare triple {25002#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:50,717 INFO L273 TraceCheckUtils]: 129: Hoare triple {25002#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:50,717 INFO L273 TraceCheckUtils]: 130: Hoare triple {25003#(<= main_~i~0 31)} assume true; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:50,718 INFO L273 TraceCheckUtils]: 131: Hoare triple {25003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:50,718 INFO L273 TraceCheckUtils]: 132: Hoare triple {25003#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:50,719 INFO L273 TraceCheckUtils]: 133: Hoare triple {25003#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:50,719 INFO L273 TraceCheckUtils]: 134: Hoare triple {25004#(<= main_~i~0 32)} assume true; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:50,720 INFO L273 TraceCheckUtils]: 135: Hoare triple {25004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:50,720 INFO L273 TraceCheckUtils]: 136: Hoare triple {25004#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:50,721 INFO L273 TraceCheckUtils]: 137: Hoare triple {25004#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:50,721 INFO L273 TraceCheckUtils]: 138: Hoare triple {25005#(<= main_~i~0 33)} assume true; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:50,722 INFO L273 TraceCheckUtils]: 139: Hoare triple {25005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:50,722 INFO L273 TraceCheckUtils]: 140: Hoare triple {25005#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:50,723 INFO L273 TraceCheckUtils]: 141: Hoare triple {25005#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:50,723 INFO L273 TraceCheckUtils]: 142: Hoare triple {25006#(<= main_~i~0 34)} assume true; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:50,724 INFO L273 TraceCheckUtils]: 143: Hoare triple {25006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:50,724 INFO L273 TraceCheckUtils]: 144: Hoare triple {25006#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:50,725 INFO L273 TraceCheckUtils]: 145: Hoare triple {25006#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {25007#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:50,725 INFO L273 TraceCheckUtils]: 146: Hoare triple {25007#(<= main_~i~0 35)} assume true; {25007#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:50,726 INFO L273 TraceCheckUtils]: 147: Hoare triple {25007#(<= main_~i~0 35)} assume !(~i~0 < 100000); {24971#false} is VALID [2018-11-14 18:45:50,726 INFO L273 TraceCheckUtils]: 148: Hoare triple {24971#false} havoc ~x~0;~x~0 := 0; {24971#false} is VALID [2018-11-14 18:45:50,726 INFO L273 TraceCheckUtils]: 149: Hoare triple {24971#false} assume true; {24971#false} is VALID [2018-11-14 18:45:50,726 INFO L273 TraceCheckUtils]: 150: Hoare triple {24971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {24971#false} is VALID [2018-11-14 18:45:50,727 INFO L256 TraceCheckUtils]: 151: Hoare triple {24971#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {24971#false} is VALID [2018-11-14 18:45:50,727 INFO L273 TraceCheckUtils]: 152: Hoare triple {24971#false} ~cond := #in~cond; {24971#false} is VALID [2018-11-14 18:45:50,727 INFO L273 TraceCheckUtils]: 153: Hoare triple {24971#false} assume ~cond == 0; {24971#false} is VALID [2018-11-14 18:45:50,727 INFO L273 TraceCheckUtils]: 154: Hoare triple {24971#false} assume !false; {24971#false} is VALID [2018-11-14 18:45:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:50,743 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-14 18:45:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:45:50,839 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-14 18:45:50,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:50,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:51,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {24970#true} call ULTIMATE.init(); {24970#true} is VALID [2018-11-14 18:45:51,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {24970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24970#true} is VALID [2018-11-14 18:45:51,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {24970#true} assume true; {24970#true} is VALID [2018-11-14 18:45:51,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24970#true} {24970#true} #57#return; {24970#true} is VALID [2018-11-14 18:45:51,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {24970#true} call #t~ret4 := main(); {24970#true} is VALID [2018-11-14 18:45:51,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {24970#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {25026#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:51,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {25026#(<= main_~i~0 0)} assume true; {25026#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:51,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {25026#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25026#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:51,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {25026#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25026#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:51,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {25026#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:51,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {24973#(<= main_~i~0 1)} assume true; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:51,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {24973#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:51,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24973#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:51,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:51,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~0 2)} assume true; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:51,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:51,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {24974#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24974#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:51,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {24974#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:51,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {24975#(<= main_~i~0 3)} assume true; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:51,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {24975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:51,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {24975#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24975#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:51,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {24975#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:51,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {24976#(<= main_~i~0 4)} assume true; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:51,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {24976#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:51,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {24976#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24976#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:51,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {24976#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:51,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {24977#(<= main_~i~0 5)} assume true; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:51,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {24977#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:51,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {24977#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24977#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:51,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {24977#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:51,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {24978#(<= main_~i~0 6)} assume true; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:51,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {24978#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:51,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {24978#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24978#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:51,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {24978#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:51,623 INFO L273 TraceCheckUtils]: 34: Hoare triple {24979#(<= main_~i~0 7)} assume true; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:51,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {24979#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:51,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {24979#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24979#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:51,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {24979#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:51,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {24980#(<= main_~i~0 8)} assume true; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:51,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {24980#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:51,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {24980#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24980#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:51,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {24980#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:51,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {24981#(<= main_~i~0 9)} assume true; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:51,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {24981#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:51,628 INFO L273 TraceCheckUtils]: 44: Hoare triple {24981#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24981#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:51,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {24981#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:51,630 INFO L273 TraceCheckUtils]: 46: Hoare triple {24982#(<= main_~i~0 10)} assume true; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:51,630 INFO L273 TraceCheckUtils]: 47: Hoare triple {24982#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:51,630 INFO L273 TraceCheckUtils]: 48: Hoare triple {24982#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24982#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:51,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {24982#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:51,632 INFO L273 TraceCheckUtils]: 50: Hoare triple {24983#(<= main_~i~0 11)} assume true; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:51,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {24983#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:51,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {24983#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24983#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:51,633 INFO L273 TraceCheckUtils]: 53: Hoare triple {24983#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:51,634 INFO L273 TraceCheckUtils]: 54: Hoare triple {24984#(<= main_~i~0 12)} assume true; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:51,634 INFO L273 TraceCheckUtils]: 55: Hoare triple {24984#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:51,635 INFO L273 TraceCheckUtils]: 56: Hoare triple {24984#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24984#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:51,635 INFO L273 TraceCheckUtils]: 57: Hoare triple {24984#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:51,636 INFO L273 TraceCheckUtils]: 58: Hoare triple {24985#(<= main_~i~0 13)} assume true; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:51,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {24985#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:51,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {24985#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24985#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:51,637 INFO L273 TraceCheckUtils]: 61: Hoare triple {24985#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:51,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {24986#(<= main_~i~0 14)} assume true; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:51,638 INFO L273 TraceCheckUtils]: 63: Hoare triple {24986#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:51,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {24986#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24986#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:51,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {24986#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:51,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {24987#(<= main_~i~0 15)} assume true; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:51,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {24987#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:51,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {24987#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24987#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:51,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {24987#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:51,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {24988#(<= main_~i~0 16)} assume true; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:51,643 INFO L273 TraceCheckUtils]: 71: Hoare triple {24988#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:51,643 INFO L273 TraceCheckUtils]: 72: Hoare triple {24988#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24988#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:51,644 INFO L273 TraceCheckUtils]: 73: Hoare triple {24988#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:51,644 INFO L273 TraceCheckUtils]: 74: Hoare triple {24989#(<= main_~i~0 17)} assume true; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:51,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {24989#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:51,645 INFO L273 TraceCheckUtils]: 76: Hoare triple {24989#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24989#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:51,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {24989#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:51,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {24990#(<= main_~i~0 18)} assume true; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:51,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {24990#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:51,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {24990#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24990#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:51,648 INFO L273 TraceCheckUtils]: 81: Hoare triple {24990#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:51,648 INFO L273 TraceCheckUtils]: 82: Hoare triple {24991#(<= main_~i~0 19)} assume true; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:51,649 INFO L273 TraceCheckUtils]: 83: Hoare triple {24991#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:51,649 INFO L273 TraceCheckUtils]: 84: Hoare triple {24991#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24991#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:51,650 INFO L273 TraceCheckUtils]: 85: Hoare triple {24991#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:51,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {24992#(<= main_~i~0 20)} assume true; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:51,651 INFO L273 TraceCheckUtils]: 87: Hoare triple {24992#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:51,651 INFO L273 TraceCheckUtils]: 88: Hoare triple {24992#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24992#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:51,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {24992#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:51,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {24993#(<= main_~i~0 21)} assume true; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:51,653 INFO L273 TraceCheckUtils]: 91: Hoare triple {24993#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:51,653 INFO L273 TraceCheckUtils]: 92: Hoare triple {24993#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24993#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:51,654 INFO L273 TraceCheckUtils]: 93: Hoare triple {24993#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:51,655 INFO L273 TraceCheckUtils]: 94: Hoare triple {24994#(<= main_~i~0 22)} assume true; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:51,655 INFO L273 TraceCheckUtils]: 95: Hoare triple {24994#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:51,655 INFO L273 TraceCheckUtils]: 96: Hoare triple {24994#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24994#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:51,656 INFO L273 TraceCheckUtils]: 97: Hoare triple {24994#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:51,657 INFO L273 TraceCheckUtils]: 98: Hoare triple {24995#(<= main_~i~0 23)} assume true; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:51,657 INFO L273 TraceCheckUtils]: 99: Hoare triple {24995#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:51,658 INFO L273 TraceCheckUtils]: 100: Hoare triple {24995#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24995#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:51,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {24995#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:51,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {24996#(<= main_~i~0 24)} assume true; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:51,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {24996#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:51,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {24996#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24996#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:51,660 INFO L273 TraceCheckUtils]: 105: Hoare triple {24996#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:51,661 INFO L273 TraceCheckUtils]: 106: Hoare triple {24997#(<= main_~i~0 25)} assume true; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:51,661 INFO L273 TraceCheckUtils]: 107: Hoare triple {24997#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:51,662 INFO L273 TraceCheckUtils]: 108: Hoare triple {24997#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24997#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:51,662 INFO L273 TraceCheckUtils]: 109: Hoare triple {24997#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:51,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {24998#(<= main_~i~0 26)} assume true; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:51,663 INFO L273 TraceCheckUtils]: 111: Hoare triple {24998#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:51,664 INFO L273 TraceCheckUtils]: 112: Hoare triple {24998#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24998#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:51,664 INFO L273 TraceCheckUtils]: 113: Hoare triple {24998#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:51,665 INFO L273 TraceCheckUtils]: 114: Hoare triple {24999#(<= main_~i~0 27)} assume true; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:51,665 INFO L273 TraceCheckUtils]: 115: Hoare triple {24999#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:51,666 INFO L273 TraceCheckUtils]: 116: Hoare triple {24999#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {24999#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:51,666 INFO L273 TraceCheckUtils]: 117: Hoare triple {24999#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:51,667 INFO L273 TraceCheckUtils]: 118: Hoare triple {25000#(<= main_~i~0 28)} assume true; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:51,667 INFO L273 TraceCheckUtils]: 119: Hoare triple {25000#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:51,668 INFO L273 TraceCheckUtils]: 120: Hoare triple {25000#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25000#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:51,668 INFO L273 TraceCheckUtils]: 121: Hoare triple {25000#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:51,669 INFO L273 TraceCheckUtils]: 122: Hoare triple {25001#(<= main_~i~0 29)} assume true; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:51,669 INFO L273 TraceCheckUtils]: 123: Hoare triple {25001#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:51,670 INFO L273 TraceCheckUtils]: 124: Hoare triple {25001#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25001#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:51,670 INFO L273 TraceCheckUtils]: 125: Hoare triple {25001#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:51,671 INFO L273 TraceCheckUtils]: 126: Hoare triple {25002#(<= main_~i~0 30)} assume true; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:51,671 INFO L273 TraceCheckUtils]: 127: Hoare triple {25002#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:51,672 INFO L273 TraceCheckUtils]: 128: Hoare triple {25002#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25002#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:51,673 INFO L273 TraceCheckUtils]: 129: Hoare triple {25002#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:51,673 INFO L273 TraceCheckUtils]: 130: Hoare triple {25003#(<= main_~i~0 31)} assume true; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:51,673 INFO L273 TraceCheckUtils]: 131: Hoare triple {25003#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:51,674 INFO L273 TraceCheckUtils]: 132: Hoare triple {25003#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25003#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:51,675 INFO L273 TraceCheckUtils]: 133: Hoare triple {25003#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:51,675 INFO L273 TraceCheckUtils]: 134: Hoare triple {25004#(<= main_~i~0 32)} assume true; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:51,676 INFO L273 TraceCheckUtils]: 135: Hoare triple {25004#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:51,676 INFO L273 TraceCheckUtils]: 136: Hoare triple {25004#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25004#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:51,677 INFO L273 TraceCheckUtils]: 137: Hoare triple {25004#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:51,677 INFO L273 TraceCheckUtils]: 138: Hoare triple {25005#(<= main_~i~0 33)} assume true; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:51,678 INFO L273 TraceCheckUtils]: 139: Hoare triple {25005#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:51,678 INFO L273 TraceCheckUtils]: 140: Hoare triple {25005#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25005#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:51,679 INFO L273 TraceCheckUtils]: 141: Hoare triple {25005#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:51,679 INFO L273 TraceCheckUtils]: 142: Hoare triple {25006#(<= main_~i~0 34)} assume true; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:51,680 INFO L273 TraceCheckUtils]: 143: Hoare triple {25006#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:51,680 INFO L273 TraceCheckUtils]: 144: Hoare triple {25006#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {25006#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:51,681 INFO L273 TraceCheckUtils]: 145: Hoare triple {25006#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {25007#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:51,681 INFO L273 TraceCheckUtils]: 146: Hoare triple {25007#(<= main_~i~0 35)} assume true; {25007#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:51,682 INFO L273 TraceCheckUtils]: 147: Hoare triple {25007#(<= main_~i~0 35)} assume !(~i~0 < 100000); {24971#false} is VALID [2018-11-14 18:45:51,682 INFO L273 TraceCheckUtils]: 148: Hoare triple {24971#false} havoc ~x~0;~x~0 := 0; {24971#false} is VALID [2018-11-14 18:45:51,682 INFO L273 TraceCheckUtils]: 149: Hoare triple {24971#false} assume true; {24971#false} is VALID [2018-11-14 18:45:51,683 INFO L273 TraceCheckUtils]: 150: Hoare triple {24971#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {24971#false} is VALID [2018-11-14 18:45:51,683 INFO L256 TraceCheckUtils]: 151: Hoare triple {24971#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {24971#false} is VALID [2018-11-14 18:45:51,683 INFO L273 TraceCheckUtils]: 152: Hoare triple {24971#false} ~cond := #in~cond; {24971#false} is VALID [2018-11-14 18:45:51,683 INFO L273 TraceCheckUtils]: 153: Hoare triple {24971#false} assume ~cond == 0; {24971#false} is VALID [2018-11-14 18:45:51,683 INFO L273 TraceCheckUtils]: 154: Hoare triple {24971#false} assume !false; {24971#false} is VALID [2018-11-14 18:45:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-14 18:45:51,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-14 18:45:51,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:51,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-14 18:45:51,863 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-14 18:45:51,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-14 18:45:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-14 18:45:51,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 18:45:51,865 INFO L87 Difference]: Start difference. First operand 160 states and 196 transitions. Second operand 39 states. [2018-11-14 18:45:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:52,657 INFO L93 Difference]: Finished difference Result 178 states and 217 transitions. [2018-11-14 18:45:52,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 18:45:52,657 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-14 18:45:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:45:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 217 transitions. [2018-11-14 18:45:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 18:45:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 217 transitions. [2018-11-14 18:45:52,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 217 transitions. [2018-11-14 18:45:52,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:52,846 INFO L225 Difference]: With dead ends: 178 [2018-11-14 18:45:52,846 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 18:45:52,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 18:45:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 18:45:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-14 18:45:52,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:52,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-14 18:45:52,923 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-14 18:45:52,923 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-14 18:45:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:52,925 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2018-11-14 18:45:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2018-11-14 18:45:52,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:52,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:52,926 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-14 18:45:52,926 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-14 18:45:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:52,928 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2018-11-14 18:45:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2018-11-14 18:45:52,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:52,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:52,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:52,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 18:45:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2018-11-14 18:45:52,931 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 155 [2018-11-14 18:45:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:52,931 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2018-11-14 18:45:52,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-14 18:45:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2018-11-14 18:45:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-14 18:45:52,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:52,932 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:52,933 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:52,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1755156890, now seen corresponding path program 36 times [2018-11-14 18:45:52,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:52,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:52,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:53,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {26238#true} call ULTIMATE.init(); {26238#true} is VALID [2018-11-14 18:45:53,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {26238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26238#true} is VALID [2018-11-14 18:45:53,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {26238#true} assume true; {26238#true} is VALID [2018-11-14 18:45:53,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26238#true} {26238#true} #57#return; {26238#true} is VALID [2018-11-14 18:45:53,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {26238#true} call #t~ret4 := main(); {26238#true} is VALID [2018-11-14 18:45:53,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {26238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26240#(= main_~i~0 0)} is VALID [2018-11-14 18:45:53,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {26240#(= main_~i~0 0)} assume true; {26240#(= main_~i~0 0)} is VALID [2018-11-14 18:45:53,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {26240#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26240#(= main_~i~0 0)} is VALID [2018-11-14 18:45:53,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {26240#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26240#(= main_~i~0 0)} is VALID [2018-11-14 18:45:53,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {26240#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:53,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#(<= main_~i~0 1)} assume true; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:53,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:53,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:53,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:53,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {26242#(<= main_~i~0 2)} assume true; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:53,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {26242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:53,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {26242#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:53,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {26242#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:53,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {26243#(<= main_~i~0 3)} assume true; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:53,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {26243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:53,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {26243#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:53,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {26243#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:53,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {26244#(<= main_~i~0 4)} assume true; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:53,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {26244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:53,841 INFO L273 TraceCheckUtils]: 24: Hoare triple {26244#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:53,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {26244#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:53,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {26245#(<= main_~i~0 5)} assume true; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:53,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {26245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:53,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {26245#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:53,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {26245#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:53,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {26246#(<= main_~i~0 6)} assume true; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:53,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {26246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:53,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {26246#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:53,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {26246#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:53,847 INFO L273 TraceCheckUtils]: 34: Hoare triple {26247#(<= main_~i~0 7)} assume true; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:53,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {26247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:53,848 INFO L273 TraceCheckUtils]: 36: Hoare triple {26247#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:53,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {26247#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:53,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {26248#(<= main_~i~0 8)} assume true; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:53,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {26248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:53,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {26248#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:53,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {26248#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:53,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {26249#(<= main_~i~0 9)} assume true; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:53,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {26249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:53,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {26249#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:53,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {26249#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:53,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {26250#(<= main_~i~0 10)} assume true; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:53,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {26250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:53,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {26250#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:53,855 INFO L273 TraceCheckUtils]: 49: Hoare triple {26250#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:53,855 INFO L273 TraceCheckUtils]: 50: Hoare triple {26251#(<= main_~i~0 11)} assume true; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:53,856 INFO L273 TraceCheckUtils]: 51: Hoare triple {26251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:53,856 INFO L273 TraceCheckUtils]: 52: Hoare triple {26251#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:53,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {26251#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:53,858 INFO L273 TraceCheckUtils]: 54: Hoare triple {26252#(<= main_~i~0 12)} assume true; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:53,858 INFO L273 TraceCheckUtils]: 55: Hoare triple {26252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:53,859 INFO L273 TraceCheckUtils]: 56: Hoare triple {26252#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:53,859 INFO L273 TraceCheckUtils]: 57: Hoare triple {26252#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:53,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {26253#(<= main_~i~0 13)} assume true; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:53,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {26253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:53,861 INFO L273 TraceCheckUtils]: 60: Hoare triple {26253#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:53,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {26253#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:53,862 INFO L273 TraceCheckUtils]: 62: Hoare triple {26254#(<= main_~i~0 14)} assume true; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:53,862 INFO L273 TraceCheckUtils]: 63: Hoare triple {26254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:53,863 INFO L273 TraceCheckUtils]: 64: Hoare triple {26254#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:53,864 INFO L273 TraceCheckUtils]: 65: Hoare triple {26254#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:53,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {26255#(<= main_~i~0 15)} assume true; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:53,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {26255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:53,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {26255#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:53,866 INFO L273 TraceCheckUtils]: 69: Hoare triple {26255#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:53,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {26256#(<= main_~i~0 16)} assume true; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:53,867 INFO L273 TraceCheckUtils]: 71: Hoare triple {26256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:53,867 INFO L273 TraceCheckUtils]: 72: Hoare triple {26256#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:53,868 INFO L273 TraceCheckUtils]: 73: Hoare triple {26256#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:53,869 INFO L273 TraceCheckUtils]: 74: Hoare triple {26257#(<= main_~i~0 17)} assume true; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:53,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {26257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:53,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {26257#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:53,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {26257#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:53,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {26258#(<= main_~i~0 18)} assume true; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:53,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {26258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:53,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {26258#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:53,873 INFO L273 TraceCheckUtils]: 81: Hoare triple {26258#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:53,873 INFO L273 TraceCheckUtils]: 82: Hoare triple {26259#(<= main_~i~0 19)} assume true; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:53,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {26259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:53,874 INFO L273 TraceCheckUtils]: 84: Hoare triple {26259#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:53,875 INFO L273 TraceCheckUtils]: 85: Hoare triple {26259#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:53,875 INFO L273 TraceCheckUtils]: 86: Hoare triple {26260#(<= main_~i~0 20)} assume true; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:53,876 INFO L273 TraceCheckUtils]: 87: Hoare triple {26260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:53,876 INFO L273 TraceCheckUtils]: 88: Hoare triple {26260#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:53,877 INFO L273 TraceCheckUtils]: 89: Hoare triple {26260#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:53,877 INFO L273 TraceCheckUtils]: 90: Hoare triple {26261#(<= main_~i~0 21)} assume true; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:53,878 INFO L273 TraceCheckUtils]: 91: Hoare triple {26261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:53,878 INFO L273 TraceCheckUtils]: 92: Hoare triple {26261#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:53,879 INFO L273 TraceCheckUtils]: 93: Hoare triple {26261#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:53,880 INFO L273 TraceCheckUtils]: 94: Hoare triple {26262#(<= main_~i~0 22)} assume true; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:53,880 INFO L273 TraceCheckUtils]: 95: Hoare triple {26262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:53,881 INFO L273 TraceCheckUtils]: 96: Hoare triple {26262#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:53,881 INFO L273 TraceCheckUtils]: 97: Hoare triple {26262#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:53,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {26263#(<= main_~i~0 23)} assume true; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:53,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {26263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:53,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {26263#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:53,884 INFO L273 TraceCheckUtils]: 101: Hoare triple {26263#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:53,884 INFO L273 TraceCheckUtils]: 102: Hoare triple {26264#(<= main_~i~0 24)} assume true; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:53,885 INFO L273 TraceCheckUtils]: 103: Hoare triple {26264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:53,885 INFO L273 TraceCheckUtils]: 104: Hoare triple {26264#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:53,886 INFO L273 TraceCheckUtils]: 105: Hoare triple {26264#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:53,886 INFO L273 TraceCheckUtils]: 106: Hoare triple {26265#(<= main_~i~0 25)} assume true; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:53,887 INFO L273 TraceCheckUtils]: 107: Hoare triple {26265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:53,887 INFO L273 TraceCheckUtils]: 108: Hoare triple {26265#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:53,888 INFO L273 TraceCheckUtils]: 109: Hoare triple {26265#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:53,888 INFO L273 TraceCheckUtils]: 110: Hoare triple {26266#(<= main_~i~0 26)} assume true; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:53,889 INFO L273 TraceCheckUtils]: 111: Hoare triple {26266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:53,889 INFO L273 TraceCheckUtils]: 112: Hoare triple {26266#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:53,890 INFO L273 TraceCheckUtils]: 113: Hoare triple {26266#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:53,891 INFO L273 TraceCheckUtils]: 114: Hoare triple {26267#(<= main_~i~0 27)} assume true; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:53,891 INFO L273 TraceCheckUtils]: 115: Hoare triple {26267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:53,892 INFO L273 TraceCheckUtils]: 116: Hoare triple {26267#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:53,892 INFO L273 TraceCheckUtils]: 117: Hoare triple {26267#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:53,893 INFO L273 TraceCheckUtils]: 118: Hoare triple {26268#(<= main_~i~0 28)} assume true; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:53,893 INFO L273 TraceCheckUtils]: 119: Hoare triple {26268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:53,894 INFO L273 TraceCheckUtils]: 120: Hoare triple {26268#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:53,895 INFO L273 TraceCheckUtils]: 121: Hoare triple {26268#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:53,895 INFO L273 TraceCheckUtils]: 122: Hoare triple {26269#(<= main_~i~0 29)} assume true; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:53,896 INFO L273 TraceCheckUtils]: 123: Hoare triple {26269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:53,896 INFO L273 TraceCheckUtils]: 124: Hoare triple {26269#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:53,897 INFO L273 TraceCheckUtils]: 125: Hoare triple {26269#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:53,897 INFO L273 TraceCheckUtils]: 126: Hoare triple {26270#(<= main_~i~0 30)} assume true; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:53,898 INFO L273 TraceCheckUtils]: 127: Hoare triple {26270#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:53,898 INFO L273 TraceCheckUtils]: 128: Hoare triple {26270#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:53,899 INFO L273 TraceCheckUtils]: 129: Hoare triple {26270#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:53,900 INFO L273 TraceCheckUtils]: 130: Hoare triple {26271#(<= main_~i~0 31)} assume true; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:53,900 INFO L273 TraceCheckUtils]: 131: Hoare triple {26271#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:53,901 INFO L273 TraceCheckUtils]: 132: Hoare triple {26271#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:53,901 INFO L273 TraceCheckUtils]: 133: Hoare triple {26271#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:53,902 INFO L273 TraceCheckUtils]: 134: Hoare triple {26272#(<= main_~i~0 32)} assume true; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:53,902 INFO L273 TraceCheckUtils]: 135: Hoare triple {26272#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:53,903 INFO L273 TraceCheckUtils]: 136: Hoare triple {26272#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:53,903 INFO L273 TraceCheckUtils]: 137: Hoare triple {26272#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:53,904 INFO L273 TraceCheckUtils]: 138: Hoare triple {26273#(<= main_~i~0 33)} assume true; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:53,904 INFO L273 TraceCheckUtils]: 139: Hoare triple {26273#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:53,905 INFO L273 TraceCheckUtils]: 140: Hoare triple {26273#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:53,906 INFO L273 TraceCheckUtils]: 141: Hoare triple {26273#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:53,906 INFO L273 TraceCheckUtils]: 142: Hoare triple {26274#(<= main_~i~0 34)} assume true; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:53,907 INFO L273 TraceCheckUtils]: 143: Hoare triple {26274#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:53,907 INFO L273 TraceCheckUtils]: 144: Hoare triple {26274#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:53,908 INFO L273 TraceCheckUtils]: 145: Hoare triple {26274#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:53,908 INFO L273 TraceCheckUtils]: 146: Hoare triple {26275#(<= main_~i~0 35)} assume true; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:53,909 INFO L273 TraceCheckUtils]: 147: Hoare triple {26275#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:53,909 INFO L273 TraceCheckUtils]: 148: Hoare triple {26275#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:53,910 INFO L273 TraceCheckUtils]: 149: Hoare triple {26275#(<= main_~i~0 35)} ~i~0 := ~i~0 + 1; {26276#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:53,911 INFO L273 TraceCheckUtils]: 150: Hoare triple {26276#(<= main_~i~0 36)} assume true; {26276#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:53,911 INFO L273 TraceCheckUtils]: 151: Hoare triple {26276#(<= main_~i~0 36)} assume !(~i~0 < 100000); {26239#false} is VALID [2018-11-14 18:45:53,911 INFO L273 TraceCheckUtils]: 152: Hoare triple {26239#false} havoc ~x~0;~x~0 := 0; {26239#false} is VALID [2018-11-14 18:45:53,912 INFO L273 TraceCheckUtils]: 153: Hoare triple {26239#false} assume true; {26239#false} is VALID [2018-11-14 18:45:53,912 INFO L273 TraceCheckUtils]: 154: Hoare triple {26239#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {26239#false} is VALID [2018-11-14 18:45:53,912 INFO L256 TraceCheckUtils]: 155: Hoare triple {26239#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {26239#false} is VALID [2018-11-14 18:45:53,912 INFO L273 TraceCheckUtils]: 156: Hoare triple {26239#false} ~cond := #in~cond; {26239#false} is VALID [2018-11-14 18:45:53,912 INFO L273 TraceCheckUtils]: 157: Hoare triple {26239#false} assume ~cond == 0; {26239#false} is VALID [2018-11-14 18:45:53,913 INFO L273 TraceCheckUtils]: 158: Hoare triple {26239#false} assume !false; {26239#false} is VALID [2018-11-14 18:45:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:53,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:53,929 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-14 18:45:53,937 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:45:54,041 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-14 18:45:54,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:45:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:54,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:54,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {26238#true} call ULTIMATE.init(); {26238#true} is VALID [2018-11-14 18:45:54,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {26238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26238#true} is VALID [2018-11-14 18:45:54,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {26238#true} assume true; {26238#true} is VALID [2018-11-14 18:45:54,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26238#true} {26238#true} #57#return; {26238#true} is VALID [2018-11-14 18:45:54,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {26238#true} call #t~ret4 := main(); {26238#true} is VALID [2018-11-14 18:45:54,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {26238#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {26295#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:54,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {26295#(<= main_~i~0 0)} assume true; {26295#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:54,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {26295#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26295#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:54,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {26295#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26295#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:54,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {26295#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:54,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#(<= main_~i~0 1)} assume true; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:54,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:54,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26241#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:54,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:54,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {26242#(<= main_~i~0 2)} assume true; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:54,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {26242#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:54,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {26242#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26242#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:54,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {26242#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:54,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {26243#(<= main_~i~0 3)} assume true; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:54,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {26243#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:54,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {26243#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26243#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:54,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {26243#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:54,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {26244#(<= main_~i~0 4)} assume true; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:54,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {26244#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:54,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {26244#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26244#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:54,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {26244#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:54,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {26245#(<= main_~i~0 5)} assume true; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:54,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {26245#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:54,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {26245#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26245#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:54,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {26245#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:54,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {26246#(<= main_~i~0 6)} assume true; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:54,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {26246#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:54,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {26246#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26246#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:54,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {26246#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:54,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {26247#(<= main_~i~0 7)} assume true; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:54,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {26247#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:54,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {26247#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26247#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:54,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {26247#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:54,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {26248#(<= main_~i~0 8)} assume true; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:54,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {26248#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:54,362 INFO L273 TraceCheckUtils]: 40: Hoare triple {26248#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26248#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:54,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {26248#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:54,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {26249#(<= main_~i~0 9)} assume true; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:54,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {26249#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:54,364 INFO L273 TraceCheckUtils]: 44: Hoare triple {26249#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26249#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:54,364 INFO L273 TraceCheckUtils]: 45: Hoare triple {26249#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:54,365 INFO L273 TraceCheckUtils]: 46: Hoare triple {26250#(<= main_~i~0 10)} assume true; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:54,365 INFO L273 TraceCheckUtils]: 47: Hoare triple {26250#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:54,366 INFO L273 TraceCheckUtils]: 48: Hoare triple {26250#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26250#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:54,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {26250#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:54,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {26251#(<= main_~i~0 11)} assume true; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:54,367 INFO L273 TraceCheckUtils]: 51: Hoare triple {26251#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:54,368 INFO L273 TraceCheckUtils]: 52: Hoare triple {26251#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26251#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:54,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {26251#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:54,369 INFO L273 TraceCheckUtils]: 54: Hoare triple {26252#(<= main_~i~0 12)} assume true; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:54,370 INFO L273 TraceCheckUtils]: 55: Hoare triple {26252#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:54,370 INFO L273 TraceCheckUtils]: 56: Hoare triple {26252#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26252#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:54,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {26252#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:54,371 INFO L273 TraceCheckUtils]: 58: Hoare triple {26253#(<= main_~i~0 13)} assume true; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:54,372 INFO L273 TraceCheckUtils]: 59: Hoare triple {26253#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:54,372 INFO L273 TraceCheckUtils]: 60: Hoare triple {26253#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26253#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:54,373 INFO L273 TraceCheckUtils]: 61: Hoare triple {26253#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:54,373 INFO L273 TraceCheckUtils]: 62: Hoare triple {26254#(<= main_~i~0 14)} assume true; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:54,374 INFO L273 TraceCheckUtils]: 63: Hoare triple {26254#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:54,374 INFO L273 TraceCheckUtils]: 64: Hoare triple {26254#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26254#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:54,375 INFO L273 TraceCheckUtils]: 65: Hoare triple {26254#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:54,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {26255#(<= main_~i~0 15)} assume true; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:54,376 INFO L273 TraceCheckUtils]: 67: Hoare triple {26255#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:54,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {26255#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26255#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:54,377 INFO L273 TraceCheckUtils]: 69: Hoare triple {26255#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:54,377 INFO L273 TraceCheckUtils]: 70: Hoare triple {26256#(<= main_~i~0 16)} assume true; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:54,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {26256#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:54,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {26256#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26256#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:54,379 INFO L273 TraceCheckUtils]: 73: Hoare triple {26256#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:54,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {26257#(<= main_~i~0 17)} assume true; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:54,380 INFO L273 TraceCheckUtils]: 75: Hoare triple {26257#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:54,380 INFO L273 TraceCheckUtils]: 76: Hoare triple {26257#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26257#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:54,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {26257#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:54,381 INFO L273 TraceCheckUtils]: 78: Hoare triple {26258#(<= main_~i~0 18)} assume true; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:54,382 INFO L273 TraceCheckUtils]: 79: Hoare triple {26258#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:54,382 INFO L273 TraceCheckUtils]: 80: Hoare triple {26258#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26258#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:54,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {26258#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:54,383 INFO L273 TraceCheckUtils]: 82: Hoare triple {26259#(<= main_~i~0 19)} assume true; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:54,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {26259#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:54,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {26259#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26259#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:54,385 INFO L273 TraceCheckUtils]: 85: Hoare triple {26259#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:54,385 INFO L273 TraceCheckUtils]: 86: Hoare triple {26260#(<= main_~i~0 20)} assume true; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:54,386 INFO L273 TraceCheckUtils]: 87: Hoare triple {26260#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:54,386 INFO L273 TraceCheckUtils]: 88: Hoare triple {26260#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26260#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:54,387 INFO L273 TraceCheckUtils]: 89: Hoare triple {26260#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:54,388 INFO L273 TraceCheckUtils]: 90: Hoare triple {26261#(<= main_~i~0 21)} assume true; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:54,388 INFO L273 TraceCheckUtils]: 91: Hoare triple {26261#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:54,388 INFO L273 TraceCheckUtils]: 92: Hoare triple {26261#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26261#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:54,389 INFO L273 TraceCheckUtils]: 93: Hoare triple {26261#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:54,390 INFO L273 TraceCheckUtils]: 94: Hoare triple {26262#(<= main_~i~0 22)} assume true; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:54,400 INFO L273 TraceCheckUtils]: 95: Hoare triple {26262#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:54,401 INFO L273 TraceCheckUtils]: 96: Hoare triple {26262#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26262#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:54,401 INFO L273 TraceCheckUtils]: 97: Hoare triple {26262#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:54,402 INFO L273 TraceCheckUtils]: 98: Hoare triple {26263#(<= main_~i~0 23)} assume true; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:54,402 INFO L273 TraceCheckUtils]: 99: Hoare triple {26263#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:54,402 INFO L273 TraceCheckUtils]: 100: Hoare triple {26263#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26263#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:54,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {26263#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:54,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {26264#(<= main_~i~0 24)} assume true; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:54,403 INFO L273 TraceCheckUtils]: 103: Hoare triple {26264#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:54,404 INFO L273 TraceCheckUtils]: 104: Hoare triple {26264#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26264#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:54,405 INFO L273 TraceCheckUtils]: 105: Hoare triple {26264#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:54,405 INFO L273 TraceCheckUtils]: 106: Hoare triple {26265#(<= main_~i~0 25)} assume true; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:54,406 INFO L273 TraceCheckUtils]: 107: Hoare triple {26265#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:54,406 INFO L273 TraceCheckUtils]: 108: Hoare triple {26265#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26265#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:54,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {26265#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:54,407 INFO L273 TraceCheckUtils]: 110: Hoare triple {26266#(<= main_~i~0 26)} assume true; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:54,408 INFO L273 TraceCheckUtils]: 111: Hoare triple {26266#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:54,408 INFO L273 TraceCheckUtils]: 112: Hoare triple {26266#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26266#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:54,409 INFO L273 TraceCheckUtils]: 113: Hoare triple {26266#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:54,409 INFO L273 TraceCheckUtils]: 114: Hoare triple {26267#(<= main_~i~0 27)} assume true; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:54,410 INFO L273 TraceCheckUtils]: 115: Hoare triple {26267#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:54,410 INFO L273 TraceCheckUtils]: 116: Hoare triple {26267#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26267#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:54,411 INFO L273 TraceCheckUtils]: 117: Hoare triple {26267#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:54,411 INFO L273 TraceCheckUtils]: 118: Hoare triple {26268#(<= main_~i~0 28)} assume true; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:54,412 INFO L273 TraceCheckUtils]: 119: Hoare triple {26268#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:54,412 INFO L273 TraceCheckUtils]: 120: Hoare triple {26268#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26268#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:54,413 INFO L273 TraceCheckUtils]: 121: Hoare triple {26268#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:54,413 INFO L273 TraceCheckUtils]: 122: Hoare triple {26269#(<= main_~i~0 29)} assume true; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:54,414 INFO L273 TraceCheckUtils]: 123: Hoare triple {26269#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:54,414 INFO L273 TraceCheckUtils]: 124: Hoare triple {26269#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26269#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:54,415 INFO L273 TraceCheckUtils]: 125: Hoare triple {26269#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:54,415 INFO L273 TraceCheckUtils]: 126: Hoare triple {26270#(<= main_~i~0 30)} assume true; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:54,416 INFO L273 TraceCheckUtils]: 127: Hoare triple {26270#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:54,416 INFO L273 TraceCheckUtils]: 128: Hoare triple {26270#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26270#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:54,417 INFO L273 TraceCheckUtils]: 129: Hoare triple {26270#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:54,417 INFO L273 TraceCheckUtils]: 130: Hoare triple {26271#(<= main_~i~0 31)} assume true; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:54,418 INFO L273 TraceCheckUtils]: 131: Hoare triple {26271#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:54,418 INFO L273 TraceCheckUtils]: 132: Hoare triple {26271#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26271#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:54,419 INFO L273 TraceCheckUtils]: 133: Hoare triple {26271#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:54,419 INFO L273 TraceCheckUtils]: 134: Hoare triple {26272#(<= main_~i~0 32)} assume true; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:54,420 INFO L273 TraceCheckUtils]: 135: Hoare triple {26272#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:54,420 INFO L273 TraceCheckUtils]: 136: Hoare triple {26272#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26272#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:54,421 INFO L273 TraceCheckUtils]: 137: Hoare triple {26272#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:54,421 INFO L273 TraceCheckUtils]: 138: Hoare triple {26273#(<= main_~i~0 33)} assume true; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:54,422 INFO L273 TraceCheckUtils]: 139: Hoare triple {26273#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:54,422 INFO L273 TraceCheckUtils]: 140: Hoare triple {26273#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26273#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:54,423 INFO L273 TraceCheckUtils]: 141: Hoare triple {26273#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:54,424 INFO L273 TraceCheckUtils]: 142: Hoare triple {26274#(<= main_~i~0 34)} assume true; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:54,424 INFO L273 TraceCheckUtils]: 143: Hoare triple {26274#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:54,424 INFO L273 TraceCheckUtils]: 144: Hoare triple {26274#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26274#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:54,425 INFO L273 TraceCheckUtils]: 145: Hoare triple {26274#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:54,426 INFO L273 TraceCheckUtils]: 146: Hoare triple {26275#(<= main_~i~0 35)} assume true; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:54,426 INFO L273 TraceCheckUtils]: 147: Hoare triple {26275#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:54,426 INFO L273 TraceCheckUtils]: 148: Hoare triple {26275#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {26275#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:54,427 INFO L273 TraceCheckUtils]: 149: Hoare triple {26275#(<= main_~i~0 35)} ~i~0 := ~i~0 + 1; {26276#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:54,428 INFO L273 TraceCheckUtils]: 150: Hoare triple {26276#(<= main_~i~0 36)} assume true; {26276#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:54,428 INFO L273 TraceCheckUtils]: 151: Hoare triple {26276#(<= main_~i~0 36)} assume !(~i~0 < 100000); {26239#false} is VALID [2018-11-14 18:45:54,428 INFO L273 TraceCheckUtils]: 152: Hoare triple {26239#false} havoc ~x~0;~x~0 := 0; {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L273 TraceCheckUtils]: 153: Hoare triple {26239#false} assume true; {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L273 TraceCheckUtils]: 154: Hoare triple {26239#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L256 TraceCheckUtils]: 155: Hoare triple {26239#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L273 TraceCheckUtils]: 156: Hoare triple {26239#false} ~cond := #in~cond; {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L273 TraceCheckUtils]: 157: Hoare triple {26239#false} assume ~cond == 0; {26239#false} is VALID [2018-11-14 18:45:54,429 INFO L273 TraceCheckUtils]: 158: Hoare triple {26239#false} assume !false; {26239#false} is VALID [2018-11-14 18:45:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:54,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:54,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-14 18:45:54,466 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-14 18:45:54,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:54,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-14 18:45:54,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:54,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-14 18:45:54,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-14 18:45:54,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 18:45:54,611 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 40 states. [2018-11-14 18:45:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:55,448 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions. [2018-11-14 18:45:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-14 18:45:55,448 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-14 18:45:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:45:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 222 transitions. [2018-11-14 18:45:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:45:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 222 transitions. [2018-11-14 18:45:55,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 222 transitions. [2018-11-14 18:45:55,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:55,651 INFO L225 Difference]: With dead ends: 182 [2018-11-14 18:45:55,651 INFO L226 Difference]: Without dead ends: 170 [2018-11-14 18:45:55,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 18:45:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-14 18:45:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-11-14 18:45:55,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:55,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 168 states. [2018-11-14 18:45:55,678 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 168 states. [2018-11-14 18:45:55,678 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 168 states. [2018-11-14 18:45:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:55,680 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2018-11-14 18:45:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-14 18:45:55,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:55,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:55,681 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 170 states. [2018-11-14 18:45:55,681 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 170 states. [2018-11-14 18:45:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:55,683 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2018-11-14 18:45:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-14 18:45:55,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:55,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:55,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:55,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-14 18:45:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2018-11-14 18:45:55,686 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 159 [2018-11-14 18:45:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:55,686 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2018-11-14 18:45:55,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-14 18:45:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-14 18:45:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-14 18:45:55,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:55,687 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:55,687 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:55,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1846137072, now seen corresponding path program 37 times [2018-11-14 18:45:55,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:55,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:55,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:55,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:45:55,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:57,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {27537#true} call ULTIMATE.init(); {27537#true} is VALID [2018-11-14 18:45:57,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {27537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27537#true} is VALID [2018-11-14 18:45:57,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {27537#true} assume true; {27537#true} is VALID [2018-11-14 18:45:57,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27537#true} {27537#true} #57#return; {27537#true} is VALID [2018-11-14 18:45:57,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {27537#true} call #t~ret4 := main(); {27537#true} is VALID [2018-11-14 18:45:57,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {27537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27539#(= main_~i~0 0)} is VALID [2018-11-14 18:45:57,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {27539#(= main_~i~0 0)} assume true; {27539#(= main_~i~0 0)} is VALID [2018-11-14 18:45:57,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {27539#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27539#(= main_~i~0 0)} is VALID [2018-11-14 18:45:57,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {27539#(= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27539#(= main_~i~0 0)} is VALID [2018-11-14 18:45:57,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {27539#(= main_~i~0 0)} ~i~0 := ~i~0 + 1; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {27540#(<= main_~i~0 1)} assume true; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {27540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {27540#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {27540#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {27541#(<= main_~i~0 2)} assume true; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {27541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {27541#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,038 INFO L273 TraceCheckUtils]: 17: Hoare triple {27541#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {27542#(<= main_~i~0 3)} assume true; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {27542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {27542#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {27542#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {27543#(<= main_~i~0 4)} assume true; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {27543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {27543#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {27543#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {27544#(<= main_~i~0 5)} assume true; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {27544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {27544#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {27544#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {27545#(<= main_~i~0 6)} assume true; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {27545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {27545#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {27545#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {27546#(<= main_~i~0 7)} assume true; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,048 INFO L273 TraceCheckUtils]: 35: Hoare triple {27546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {27546#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {27546#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {27547#(<= main_~i~0 8)} assume true; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,050 INFO L273 TraceCheckUtils]: 39: Hoare triple {27547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {27547#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {27547#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {27548#(<= main_~i~0 9)} assume true; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {27548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {27548#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {27548#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {27549#(<= main_~i~0 10)} assume true; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {27549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {27549#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {27549#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {27550#(<= main_~i~0 11)} assume true; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {27550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,057 INFO L273 TraceCheckUtils]: 52: Hoare triple {27550#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {27550#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {27551#(<= main_~i~0 12)} assume true; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,059 INFO L273 TraceCheckUtils]: 55: Hoare triple {27551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {27551#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,060 INFO L273 TraceCheckUtils]: 57: Hoare triple {27551#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,061 INFO L273 TraceCheckUtils]: 58: Hoare triple {27552#(<= main_~i~0 13)} assume true; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,061 INFO L273 TraceCheckUtils]: 59: Hoare triple {27552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {27552#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,062 INFO L273 TraceCheckUtils]: 61: Hoare triple {27552#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,063 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#(<= main_~i~0 14)} assume true; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,063 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,064 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,064 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,065 INFO L273 TraceCheckUtils]: 66: Hoare triple {27554#(<= main_~i~0 15)} assume true; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,065 INFO L273 TraceCheckUtils]: 67: Hoare triple {27554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,066 INFO L273 TraceCheckUtils]: 68: Hoare triple {27554#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,067 INFO L273 TraceCheckUtils]: 69: Hoare triple {27554#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {27555#(<= main_~i~0 16)} assume true; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,068 INFO L273 TraceCheckUtils]: 71: Hoare triple {27555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,068 INFO L273 TraceCheckUtils]: 72: Hoare triple {27555#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,069 INFO L273 TraceCheckUtils]: 73: Hoare triple {27555#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,069 INFO L273 TraceCheckUtils]: 74: Hoare triple {27556#(<= main_~i~0 17)} assume true; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,070 INFO L273 TraceCheckUtils]: 75: Hoare triple {27556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,070 INFO L273 TraceCheckUtils]: 76: Hoare triple {27556#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,071 INFO L273 TraceCheckUtils]: 77: Hoare triple {27556#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,071 INFO L273 TraceCheckUtils]: 78: Hoare triple {27557#(<= main_~i~0 18)} assume true; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,072 INFO L273 TraceCheckUtils]: 79: Hoare triple {27557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {27557#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,073 INFO L273 TraceCheckUtils]: 81: Hoare triple {27557#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,074 INFO L273 TraceCheckUtils]: 82: Hoare triple {27558#(<= main_~i~0 19)} assume true; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,074 INFO L273 TraceCheckUtils]: 83: Hoare triple {27558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {27558#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,075 INFO L273 TraceCheckUtils]: 85: Hoare triple {27558#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,076 INFO L273 TraceCheckUtils]: 86: Hoare triple {27559#(<= main_~i~0 20)} assume true; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,076 INFO L273 TraceCheckUtils]: 87: Hoare triple {27559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,077 INFO L273 TraceCheckUtils]: 88: Hoare triple {27559#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {27559#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {27560#(<= main_~i~0 21)} assume true; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {27560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {27560#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {27560#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {27561#(<= main_~i~0 22)} assume true; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,081 INFO L273 TraceCheckUtils]: 95: Hoare triple {27561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,081 INFO L273 TraceCheckUtils]: 96: Hoare triple {27561#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {27561#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {27562#(<= main_~i~0 23)} assume true; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,083 INFO L273 TraceCheckUtils]: 99: Hoare triple {27562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,083 INFO L273 TraceCheckUtils]: 100: Hoare triple {27562#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,084 INFO L273 TraceCheckUtils]: 101: Hoare triple {27562#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,085 INFO L273 TraceCheckUtils]: 102: Hoare triple {27563#(<= main_~i~0 24)} assume true; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,085 INFO L273 TraceCheckUtils]: 103: Hoare triple {27563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,086 INFO L273 TraceCheckUtils]: 104: Hoare triple {27563#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,086 INFO L273 TraceCheckUtils]: 105: Hoare triple {27563#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,087 INFO L273 TraceCheckUtils]: 106: Hoare triple {27564#(<= main_~i~0 25)} assume true; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,087 INFO L273 TraceCheckUtils]: 107: Hoare triple {27564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,088 INFO L273 TraceCheckUtils]: 108: Hoare triple {27564#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,089 INFO L273 TraceCheckUtils]: 109: Hoare triple {27564#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,089 INFO L273 TraceCheckUtils]: 110: Hoare triple {27565#(<= main_~i~0 26)} assume true; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,090 INFO L273 TraceCheckUtils]: 111: Hoare triple {27565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,090 INFO L273 TraceCheckUtils]: 112: Hoare triple {27565#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,091 INFO L273 TraceCheckUtils]: 113: Hoare triple {27565#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,091 INFO L273 TraceCheckUtils]: 114: Hoare triple {27566#(<= main_~i~0 27)} assume true; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,092 INFO L273 TraceCheckUtils]: 115: Hoare triple {27566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,092 INFO L273 TraceCheckUtils]: 116: Hoare triple {27566#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,093 INFO L273 TraceCheckUtils]: 117: Hoare triple {27566#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,093 INFO L273 TraceCheckUtils]: 118: Hoare triple {27567#(<= main_~i~0 28)} assume true; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,094 INFO L273 TraceCheckUtils]: 119: Hoare triple {27567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,094 INFO L273 TraceCheckUtils]: 120: Hoare triple {27567#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,095 INFO L273 TraceCheckUtils]: 121: Hoare triple {27567#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,096 INFO L273 TraceCheckUtils]: 122: Hoare triple {27568#(<= main_~i~0 29)} assume true; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,096 INFO L273 TraceCheckUtils]: 123: Hoare triple {27568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,097 INFO L273 TraceCheckUtils]: 124: Hoare triple {27568#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,097 INFO L273 TraceCheckUtils]: 125: Hoare triple {27568#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,098 INFO L273 TraceCheckUtils]: 126: Hoare triple {27569#(<= main_~i~0 30)} assume true; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,098 INFO L273 TraceCheckUtils]: 127: Hoare triple {27569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,099 INFO L273 TraceCheckUtils]: 128: Hoare triple {27569#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,100 INFO L273 TraceCheckUtils]: 129: Hoare triple {27569#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,100 INFO L273 TraceCheckUtils]: 130: Hoare triple {27570#(<= main_~i~0 31)} assume true; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,101 INFO L273 TraceCheckUtils]: 131: Hoare triple {27570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,101 INFO L273 TraceCheckUtils]: 132: Hoare triple {27570#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,102 INFO L273 TraceCheckUtils]: 133: Hoare triple {27570#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,102 INFO L273 TraceCheckUtils]: 134: Hoare triple {27571#(<= main_~i~0 32)} assume true; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,103 INFO L273 TraceCheckUtils]: 135: Hoare triple {27571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,103 INFO L273 TraceCheckUtils]: 136: Hoare triple {27571#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,104 INFO L273 TraceCheckUtils]: 137: Hoare triple {27571#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,104 INFO L273 TraceCheckUtils]: 138: Hoare triple {27572#(<= main_~i~0 33)} assume true; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,105 INFO L273 TraceCheckUtils]: 139: Hoare triple {27572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,105 INFO L273 TraceCheckUtils]: 140: Hoare triple {27572#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,106 INFO L273 TraceCheckUtils]: 141: Hoare triple {27572#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,107 INFO L273 TraceCheckUtils]: 142: Hoare triple {27573#(<= main_~i~0 34)} assume true; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,107 INFO L273 TraceCheckUtils]: 143: Hoare triple {27573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,108 INFO L273 TraceCheckUtils]: 144: Hoare triple {27573#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,108 INFO L273 TraceCheckUtils]: 145: Hoare triple {27573#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,109 INFO L273 TraceCheckUtils]: 146: Hoare triple {27574#(<= main_~i~0 35)} assume true; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,109 INFO L273 TraceCheckUtils]: 147: Hoare triple {27574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,110 INFO L273 TraceCheckUtils]: 148: Hoare triple {27574#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,111 INFO L273 TraceCheckUtils]: 149: Hoare triple {27574#(<= main_~i~0 35)} ~i~0 := ~i~0 + 1; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,111 INFO L273 TraceCheckUtils]: 150: Hoare triple {27575#(<= main_~i~0 36)} assume true; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,111 INFO L273 TraceCheckUtils]: 151: Hoare triple {27575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,112 INFO L273 TraceCheckUtils]: 152: Hoare triple {27575#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,113 INFO L273 TraceCheckUtils]: 153: Hoare triple {27575#(<= main_~i~0 36)} ~i~0 := ~i~0 + 1; {27576#(<= main_~i~0 37)} is VALID [2018-11-14 18:45:57,113 INFO L273 TraceCheckUtils]: 154: Hoare triple {27576#(<= main_~i~0 37)} assume true; {27576#(<= main_~i~0 37)} is VALID [2018-11-14 18:45:57,114 INFO L273 TraceCheckUtils]: 155: Hoare triple {27576#(<= main_~i~0 37)} assume !(~i~0 < 100000); {27538#false} is VALID [2018-11-14 18:45:57,114 INFO L273 TraceCheckUtils]: 156: Hoare triple {27538#false} havoc ~x~0;~x~0 := 0; {27538#false} is VALID [2018-11-14 18:45:57,114 INFO L273 TraceCheckUtils]: 157: Hoare triple {27538#false} assume true; {27538#false} is VALID [2018-11-14 18:45:57,114 INFO L273 TraceCheckUtils]: 158: Hoare triple {27538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {27538#false} is VALID [2018-11-14 18:45:57,115 INFO L256 TraceCheckUtils]: 159: Hoare triple {27538#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {27538#false} is VALID [2018-11-14 18:45:57,115 INFO L273 TraceCheckUtils]: 160: Hoare triple {27538#false} ~cond := #in~cond; {27538#false} is VALID [2018-11-14 18:45:57,115 INFO L273 TraceCheckUtils]: 161: Hoare triple {27538#false} assume ~cond == 0; {27538#false} is VALID [2018-11-14 18:45:57,115 INFO L273 TraceCheckUtils]: 162: Hoare triple {27538#false} assume !false; {27538#false} is VALID [2018-11-14 18:45:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:57,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:45:57,132 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-14 18:45:57,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:45:57,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:45:57,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {27537#true} call ULTIMATE.init(); {27537#true} is VALID [2018-11-14 18:45:57,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {27537#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27537#true} is VALID [2018-11-14 18:45:57,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {27537#true} assume true; {27537#true} is VALID [2018-11-14 18:45:57,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27537#true} {27537#true} #57#return; {27537#true} is VALID [2018-11-14 18:45:57,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {27537#true} call #t~ret4 := main(); {27537#true} is VALID [2018-11-14 18:45:57,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {27537#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~min~0 := 0;~i~0 := 0; {27595#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:57,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {27595#(<= main_~i~0 0)} assume true; {27595#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:57,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {27595#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27595#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:57,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {27595#(<= main_~i~0 0)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27595#(<= main_~i~0 0)} is VALID [2018-11-14 18:45:57,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {27595#(<= main_~i~0 0)} ~i~0 := ~i~0 + 1; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {27540#(<= main_~i~0 1)} assume true; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {27540#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {27540#(<= main_~i~0 1)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27540#(<= main_~i~0 1)} is VALID [2018-11-14 18:45:57,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {27540#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {27541#(<= main_~i~0 2)} assume true; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {27541#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {27541#(<= main_~i~0 2)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27541#(<= main_~i~0 2)} is VALID [2018-11-14 18:45:57,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {27541#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {27542#(<= main_~i~0 3)} assume true; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {27542#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {27542#(<= main_~i~0 3)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27542#(<= main_~i~0 3)} is VALID [2018-11-14 18:45:57,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {27542#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {27543#(<= main_~i~0 4)} assume true; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {27543#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {27543#(<= main_~i~0 4)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27543#(<= main_~i~0 4)} is VALID [2018-11-14 18:45:57,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {27543#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {27544#(<= main_~i~0 5)} assume true; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {27544#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {27544#(<= main_~i~0 5)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27544#(<= main_~i~0 5)} is VALID [2018-11-14 18:45:57,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {27544#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {27545#(<= main_~i~0 6)} assume true; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {27545#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {27545#(<= main_~i~0 6)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27545#(<= main_~i~0 6)} is VALID [2018-11-14 18:45:57,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {27545#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {27546#(<= main_~i~0 7)} assume true; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {27546#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {27546#(<= main_~i~0 7)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27546#(<= main_~i~0 7)} is VALID [2018-11-14 18:45:57,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {27546#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {27547#(<= main_~i~0 8)} assume true; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {27547#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {27547#(<= main_~i~0 8)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27547#(<= main_~i~0 8)} is VALID [2018-11-14 18:45:57,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {27547#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {27548#(<= main_~i~0 9)} assume true; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {27548#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {27548#(<= main_~i~0 9)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27548#(<= main_~i~0 9)} is VALID [2018-11-14 18:45:57,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {27548#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {27549#(<= main_~i~0 10)} assume true; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {27549#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {27549#(<= main_~i~0 10)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27549#(<= main_~i~0 10)} is VALID [2018-11-14 18:45:57,699 INFO L273 TraceCheckUtils]: 49: Hoare triple {27549#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {27550#(<= main_~i~0 11)} assume true; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,700 INFO L273 TraceCheckUtils]: 51: Hoare triple {27550#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {27550#(<= main_~i~0 11)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27550#(<= main_~i~0 11)} is VALID [2018-11-14 18:45:57,701 INFO L273 TraceCheckUtils]: 53: Hoare triple {27550#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {27551#(<= main_~i~0 12)} assume true; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,702 INFO L273 TraceCheckUtils]: 55: Hoare triple {27551#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,702 INFO L273 TraceCheckUtils]: 56: Hoare triple {27551#(<= main_~i~0 12)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27551#(<= main_~i~0 12)} is VALID [2018-11-14 18:45:57,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {27551#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,703 INFO L273 TraceCheckUtils]: 58: Hoare triple {27552#(<= main_~i~0 13)} assume true; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {27552#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {27552#(<= main_~i~0 13)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27552#(<= main_~i~0 13)} is VALID [2018-11-14 18:45:57,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {27552#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,706 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#(<= main_~i~0 14)} assume true; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,706 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#(<= main_~i~0 14)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27553#(<= main_~i~0 14)} is VALID [2018-11-14 18:45:57,707 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {27554#(<= main_~i~0 15)} assume true; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {27554#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {27554#(<= main_~i~0 15)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27554#(<= main_~i~0 15)} is VALID [2018-11-14 18:45:57,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {27554#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,710 INFO L273 TraceCheckUtils]: 70: Hoare triple {27555#(<= main_~i~0 16)} assume true; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,710 INFO L273 TraceCheckUtils]: 71: Hoare triple {27555#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,711 INFO L273 TraceCheckUtils]: 72: Hoare triple {27555#(<= main_~i~0 16)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27555#(<= main_~i~0 16)} is VALID [2018-11-14 18:45:57,712 INFO L273 TraceCheckUtils]: 73: Hoare triple {27555#(<= main_~i~0 16)} ~i~0 := ~i~0 + 1; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,712 INFO L273 TraceCheckUtils]: 74: Hoare triple {27556#(<= main_~i~0 17)} assume true; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {27556#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,713 INFO L273 TraceCheckUtils]: 76: Hoare triple {27556#(<= main_~i~0 17)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27556#(<= main_~i~0 17)} is VALID [2018-11-14 18:45:57,714 INFO L273 TraceCheckUtils]: 77: Hoare triple {27556#(<= main_~i~0 17)} ~i~0 := ~i~0 + 1; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,714 INFO L273 TraceCheckUtils]: 78: Hoare triple {27557#(<= main_~i~0 18)} assume true; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,715 INFO L273 TraceCheckUtils]: 79: Hoare triple {27557#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,715 INFO L273 TraceCheckUtils]: 80: Hoare triple {27557#(<= main_~i~0 18)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27557#(<= main_~i~0 18)} is VALID [2018-11-14 18:45:57,716 INFO L273 TraceCheckUtils]: 81: Hoare triple {27557#(<= main_~i~0 18)} ~i~0 := ~i~0 + 1; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,717 INFO L273 TraceCheckUtils]: 82: Hoare triple {27558#(<= main_~i~0 19)} assume true; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,717 INFO L273 TraceCheckUtils]: 83: Hoare triple {27558#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,718 INFO L273 TraceCheckUtils]: 84: Hoare triple {27558#(<= main_~i~0 19)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27558#(<= main_~i~0 19)} is VALID [2018-11-14 18:45:57,718 INFO L273 TraceCheckUtils]: 85: Hoare triple {27558#(<= main_~i~0 19)} ~i~0 := ~i~0 + 1; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,719 INFO L273 TraceCheckUtils]: 86: Hoare triple {27559#(<= main_~i~0 20)} assume true; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,719 INFO L273 TraceCheckUtils]: 87: Hoare triple {27559#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {27559#(<= main_~i~0 20)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27559#(<= main_~i~0 20)} is VALID [2018-11-14 18:45:57,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {27559#(<= main_~i~0 20)} ~i~0 := ~i~0 + 1; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,721 INFO L273 TraceCheckUtils]: 90: Hoare triple {27560#(<= main_~i~0 21)} assume true; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,721 INFO L273 TraceCheckUtils]: 91: Hoare triple {27560#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,722 INFO L273 TraceCheckUtils]: 92: Hoare triple {27560#(<= main_~i~0 21)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27560#(<= main_~i~0 21)} is VALID [2018-11-14 18:45:57,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {27560#(<= main_~i~0 21)} ~i~0 := ~i~0 + 1; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {27561#(<= main_~i~0 22)} assume true; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,724 INFO L273 TraceCheckUtils]: 95: Hoare triple {27561#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,724 INFO L273 TraceCheckUtils]: 96: Hoare triple {27561#(<= main_~i~0 22)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27561#(<= main_~i~0 22)} is VALID [2018-11-14 18:45:57,725 INFO L273 TraceCheckUtils]: 97: Hoare triple {27561#(<= main_~i~0 22)} ~i~0 := ~i~0 + 1; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {27562#(<= main_~i~0 23)} assume true; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,726 INFO L273 TraceCheckUtils]: 99: Hoare triple {27562#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,726 INFO L273 TraceCheckUtils]: 100: Hoare triple {27562#(<= main_~i~0 23)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27562#(<= main_~i~0 23)} is VALID [2018-11-14 18:45:57,727 INFO L273 TraceCheckUtils]: 101: Hoare triple {27562#(<= main_~i~0 23)} ~i~0 := ~i~0 + 1; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,728 INFO L273 TraceCheckUtils]: 102: Hoare triple {27563#(<= main_~i~0 24)} assume true; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,728 INFO L273 TraceCheckUtils]: 103: Hoare triple {27563#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,729 INFO L273 TraceCheckUtils]: 104: Hoare triple {27563#(<= main_~i~0 24)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27563#(<= main_~i~0 24)} is VALID [2018-11-14 18:45:57,729 INFO L273 TraceCheckUtils]: 105: Hoare triple {27563#(<= main_~i~0 24)} ~i~0 := ~i~0 + 1; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,730 INFO L273 TraceCheckUtils]: 106: Hoare triple {27564#(<= main_~i~0 25)} assume true; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,730 INFO L273 TraceCheckUtils]: 107: Hoare triple {27564#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,731 INFO L273 TraceCheckUtils]: 108: Hoare triple {27564#(<= main_~i~0 25)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27564#(<= main_~i~0 25)} is VALID [2018-11-14 18:45:57,731 INFO L273 TraceCheckUtils]: 109: Hoare triple {27564#(<= main_~i~0 25)} ~i~0 := ~i~0 + 1; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,732 INFO L273 TraceCheckUtils]: 110: Hoare triple {27565#(<= main_~i~0 26)} assume true; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,732 INFO L273 TraceCheckUtils]: 111: Hoare triple {27565#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,733 INFO L273 TraceCheckUtils]: 112: Hoare triple {27565#(<= main_~i~0 26)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27565#(<= main_~i~0 26)} is VALID [2018-11-14 18:45:57,734 INFO L273 TraceCheckUtils]: 113: Hoare triple {27565#(<= main_~i~0 26)} ~i~0 := ~i~0 + 1; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,734 INFO L273 TraceCheckUtils]: 114: Hoare triple {27566#(<= main_~i~0 27)} assume true; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,735 INFO L273 TraceCheckUtils]: 115: Hoare triple {27566#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,735 INFO L273 TraceCheckUtils]: 116: Hoare triple {27566#(<= main_~i~0 27)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27566#(<= main_~i~0 27)} is VALID [2018-11-14 18:45:57,736 INFO L273 TraceCheckUtils]: 117: Hoare triple {27566#(<= main_~i~0 27)} ~i~0 := ~i~0 + 1; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,736 INFO L273 TraceCheckUtils]: 118: Hoare triple {27567#(<= main_~i~0 28)} assume true; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,737 INFO L273 TraceCheckUtils]: 119: Hoare triple {27567#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,737 INFO L273 TraceCheckUtils]: 120: Hoare triple {27567#(<= main_~i~0 28)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27567#(<= main_~i~0 28)} is VALID [2018-11-14 18:45:57,738 INFO L273 TraceCheckUtils]: 121: Hoare triple {27567#(<= main_~i~0 28)} ~i~0 := ~i~0 + 1; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,739 INFO L273 TraceCheckUtils]: 122: Hoare triple {27568#(<= main_~i~0 29)} assume true; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,739 INFO L273 TraceCheckUtils]: 123: Hoare triple {27568#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,740 INFO L273 TraceCheckUtils]: 124: Hoare triple {27568#(<= main_~i~0 29)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27568#(<= main_~i~0 29)} is VALID [2018-11-14 18:45:57,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {27568#(<= main_~i~0 29)} ~i~0 := ~i~0 + 1; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,741 INFO L273 TraceCheckUtils]: 126: Hoare triple {27569#(<= main_~i~0 30)} assume true; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,741 INFO L273 TraceCheckUtils]: 127: Hoare triple {27569#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,742 INFO L273 TraceCheckUtils]: 128: Hoare triple {27569#(<= main_~i~0 30)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27569#(<= main_~i~0 30)} is VALID [2018-11-14 18:45:57,742 INFO L273 TraceCheckUtils]: 129: Hoare triple {27569#(<= main_~i~0 30)} ~i~0 := ~i~0 + 1; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,743 INFO L273 TraceCheckUtils]: 130: Hoare triple {27570#(<= main_~i~0 31)} assume true; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,743 INFO L273 TraceCheckUtils]: 131: Hoare triple {27570#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,744 INFO L273 TraceCheckUtils]: 132: Hoare triple {27570#(<= main_~i~0 31)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27570#(<= main_~i~0 31)} is VALID [2018-11-14 18:45:57,745 INFO L273 TraceCheckUtils]: 133: Hoare triple {27570#(<= main_~i~0 31)} ~i~0 := ~i~0 + 1; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,745 INFO L273 TraceCheckUtils]: 134: Hoare triple {27571#(<= main_~i~0 32)} assume true; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,746 INFO L273 TraceCheckUtils]: 135: Hoare triple {27571#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,746 INFO L273 TraceCheckUtils]: 136: Hoare triple {27571#(<= main_~i~0 32)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27571#(<= main_~i~0 32)} is VALID [2018-11-14 18:45:57,747 INFO L273 TraceCheckUtils]: 137: Hoare triple {27571#(<= main_~i~0 32)} ~i~0 := ~i~0 + 1; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,747 INFO L273 TraceCheckUtils]: 138: Hoare triple {27572#(<= main_~i~0 33)} assume true; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,748 INFO L273 TraceCheckUtils]: 139: Hoare triple {27572#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,748 INFO L273 TraceCheckUtils]: 140: Hoare triple {27572#(<= main_~i~0 33)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27572#(<= main_~i~0 33)} is VALID [2018-11-14 18:45:57,749 INFO L273 TraceCheckUtils]: 141: Hoare triple {27572#(<= main_~i~0 33)} ~i~0 := ~i~0 + 1; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,750 INFO L273 TraceCheckUtils]: 142: Hoare triple {27573#(<= main_~i~0 34)} assume true; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,750 INFO L273 TraceCheckUtils]: 143: Hoare triple {27573#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,751 INFO L273 TraceCheckUtils]: 144: Hoare triple {27573#(<= main_~i~0 34)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27573#(<= main_~i~0 34)} is VALID [2018-11-14 18:45:57,751 INFO L273 TraceCheckUtils]: 145: Hoare triple {27573#(<= main_~i~0 34)} ~i~0 := ~i~0 + 1; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,752 INFO L273 TraceCheckUtils]: 146: Hoare triple {27574#(<= main_~i~0 35)} assume true; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,752 INFO L273 TraceCheckUtils]: 147: Hoare triple {27574#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,753 INFO L273 TraceCheckUtils]: 148: Hoare triple {27574#(<= main_~i~0 35)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27574#(<= main_~i~0 35)} is VALID [2018-11-14 18:45:57,753 INFO L273 TraceCheckUtils]: 149: Hoare triple {27574#(<= main_~i~0 35)} ~i~0 := ~i~0 + 1; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,754 INFO L273 TraceCheckUtils]: 150: Hoare triple {27575#(<= main_~i~0 36)} assume true; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,754 INFO L273 TraceCheckUtils]: 151: Hoare triple {27575#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,755 INFO L273 TraceCheckUtils]: 152: Hoare triple {27575#(<= main_~i~0 36)} assume #t~mem0 < ~min~0;havoc #t~mem0;call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~min~0 := #t~mem1;havoc #t~mem1; {27575#(<= main_~i~0 36)} is VALID [2018-11-14 18:45:57,756 INFO L273 TraceCheckUtils]: 153: Hoare triple {27575#(<= main_~i~0 36)} ~i~0 := ~i~0 + 1; {27576#(<= main_~i~0 37)} is VALID [2018-11-14 18:45:57,756 INFO L273 TraceCheckUtils]: 154: Hoare triple {27576#(<= main_~i~0 37)} assume true; {27576#(<= main_~i~0 37)} is VALID [2018-11-14 18:45:57,757 INFO L273 TraceCheckUtils]: 155: Hoare triple {27576#(<= main_~i~0 37)} assume !(~i~0 < 100000); {27538#false} is VALID [2018-11-14 18:45:57,757 INFO L273 TraceCheckUtils]: 156: Hoare triple {27538#false} havoc ~x~0;~x~0 := 0; {27538#false} is VALID [2018-11-14 18:45:57,757 INFO L273 TraceCheckUtils]: 157: Hoare triple {27538#false} assume true; {27538#false} is VALID [2018-11-14 18:45:57,757 INFO L273 TraceCheckUtils]: 158: Hoare triple {27538#false} assume !!(~x~0 < 100000);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {27538#false} is VALID [2018-11-14 18:45:57,758 INFO L256 TraceCheckUtils]: 159: Hoare triple {27538#false} call __VERIFIER_assert((if #t~mem3 >= ~min~0 then 1 else 0)); {27538#false} is VALID [2018-11-14 18:45:57,758 INFO L273 TraceCheckUtils]: 160: Hoare triple {27538#false} ~cond := #in~cond; {27538#false} is VALID [2018-11-14 18:45:57,758 INFO L273 TraceCheckUtils]: 161: Hoare triple {27538#false} assume ~cond == 0; {27538#false} is VALID [2018-11-14 18:45:57,758 INFO L273 TraceCheckUtils]: 162: Hoare triple {27538#false} assume !false; {27538#false} is VALID [2018-11-14 18:45:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:45:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:45:57,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-14 18:45:57,796 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-14 18:45:57,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:45:57,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-14 18:45:57,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:45:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-14 18:45:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-14 18:45:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 18:45:57,950 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand 41 states. [2018-11-14 18:45:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:59,213 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2018-11-14 18:45:59,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-14 18:45:59,213 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-14 18:45:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:45:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:45:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 227 transitions. [2018-11-14 18:45:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:45:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 227 transitions. [2018-11-14 18:45:59,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 227 transitions. [2018-11-14 18:45:59,418 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-14 18:45:59,422 INFO L225 Difference]: With dead ends: 186 [2018-11-14 18:45:59,422 INFO L226 Difference]: Without dead ends: 174 [2018-11-14 18:45:59,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 18:45:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-14 18:45:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-14 18:45:59,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:45:59,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2018-11-14 18:45:59,458 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2018-11-14 18:45:59,458 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2018-11-14 18:45:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:59,462 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-14 18:45:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2018-11-14 18:45:59,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:59,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:59,463 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2018-11-14 18:45:59,463 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2018-11-14 18:45:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:45:59,465 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-14 18:45:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2018-11-14 18:45:59,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:45:59,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:45:59,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:45:59,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:45:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-14 18:45:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 211 transitions. [2018-11-14 18:45:59,468 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 211 transitions. Word has length 163 [2018-11-14 18:45:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:45:59,468 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 211 transitions. [2018-11-14 18:45:59,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-14 18:45:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 211 transitions. [2018-11-14 18:45:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-14 18:45:59,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:45:59,469 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:45:59,469 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:45:59,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:45:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1509586246, now seen corresponding path program 38 times [2018-11-14 18:45:59,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:45:59,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:45:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:59,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:45:59,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:45:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat