java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:15:10,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:15:10,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:15:10,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:15:10,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:15:10,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:15:10,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:15:10,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:15:10,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:15:10,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:15:10,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:15:10,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:15:10,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:15:10,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:15:10,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:15:10,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:15:10,436 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:15:10,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:15:10,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:15:10,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:15:10,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:15:10,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:15:10,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:15:10,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:15:10,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:15:10,450 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:15:10,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:15:10,452 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:15:10,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:15:10,453 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:15:10,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:15:10,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:15:10,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:15:10,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:15:10,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:15:10,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:15:10,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:15:10,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:15:10,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:15:10,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:15:10,505 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:15:10,508 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:15:10,509 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:15:10,510 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:15:10,511 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl [2019-05-15 10:15:10,511 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl' [2019-05-15 10:15:10,549 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:15:10,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:15:10,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:15:10,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:15:10,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:15:10,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:15:10,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:15:10,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:15:10,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:15:10,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:15:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:15:10,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:15:11,264 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:15:11,265 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:15:11,267 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:11 BoogieIcfgContainer [2019-05-15 10:15:11,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:15:11,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:15:11,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:15:11,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:15:11,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/2) ... [2019-05-15 10:15:11,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24231774 and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:15:11, skipping insertion in model container [2019-05-15 10:15:11,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:11" (2/2) ... [2019-05-15 10:15:11,275 INFO L109 eAbstractionObserver]: Analyzing ICFG array.i_3.bpl [2019-05-15 10:15:11,285 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:15:11,293 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:15:11,309 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:15:11,338 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:15:11,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:15:11,339 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:15:11,339 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:15:11,339 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:15:11,340 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:15:11,340 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:15:11,340 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:15:11,340 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:15:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-05-15 10:15:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-05-15 10:15:11,368 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:11,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:11,372 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2092793945, now seen corresponding path program 1 times [2019-05-15 10:15:11,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:15:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:11,712 INFO L273 TraceCheckUtils]: 0: Hoare triple {32#true} havoc main_#res; {32#true} is VALID [2019-05-15 10:15:11,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5; {32#true} is VALID [2019-05-15 10:15:11,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} main_~SIZE~5 := 1; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,718 INFO L273 TraceCheckUtils]: 3: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~j~5; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,723 INFO L273 TraceCheckUtils]: 4: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~k~5; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~array~5; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~menor~5; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} main_~menor~5 := main_#t~nondet0; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_#t~nondet0; {43#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:11,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#(= ULTIMATE.start_main_~SIZE~5 1)} main_~j~5 := 0; {68#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:11,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {33#false} is VALID [2019-05-15 10:15:11,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} __VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0); {33#false} is VALID [2019-05-15 10:15:11,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} havoc __VERIFIER_assert_~cond; {33#false} is VALID [2019-05-15 10:15:11,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33#false} is VALID [2019-05-15 10:15:11,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume __VERIFIER_assert_~cond == 0; {33#false} is VALID [2019-05-15 10:15:11,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2019-05-15 10:15:11,738 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2019-05-15 10:15:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:11,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:11,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-05-15 10:15:11,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-05-15 10:15:11,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:11,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:15:11,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:11,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:15:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:15:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:11,939 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2019-05-15 10:15:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:12,267 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:15:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:15:12,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-05-15 10:15:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2019-05-15 10:15:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:15:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2019-05-15 10:15:12,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2019-05-15 10:15:12,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:12,487 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:15:12,488 INFO L226 Difference]: Without dead ends: 35 [2019-05-15 10:15:12,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:15:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-05-15 10:15:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-05-15 10:15:12,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:12,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2019-05-15 10:15:12,518 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2019-05-15 10:15:12,519 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2019-05-15 10:15:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:12,524 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:15:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:15:12,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:12,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:12,525 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2019-05-15 10:15:12,525 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2019-05-15 10:15:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:12,529 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:15:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:15:12,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:12,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:12,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:12,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:15:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-15 10:15:12,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 18 [2019-05-15 10:15:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:12,541 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-05-15 10:15:12,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:15:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:15:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-05-15 10:15:12,546 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:12,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:12,547 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 628818439, now seen corresponding path program 1 times [2019-05-15 10:15:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:12,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-15 10:15:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:12,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:12,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-05-15 10:15:12,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:15:12,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:15:12,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:15:12,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-05-15 10:15:12,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:15:12,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~array~5_8, |ULTIMATE.start_main_#t~nondet2|]. (and (= ULTIMATE.start_main_~j~5 0) (= (store v_ULTIMATE.start_main_~array~5_8 (mod ULTIMATE.start_main_~j~5 4294967296) |ULTIMATE.start_main_#t~nondet2|) ULTIMATE.start_main_~array~5)) [2019-05-15 10:15:12,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= ULTIMATE.start_main_~j~5 0) [2019-05-15 10:15:13,261 INFO L273 TraceCheckUtils]: 0: Hoare triple {222#true} havoc main_#res; {222#true} is VALID [2019-05-15 10:15:13,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5; {222#true} is VALID [2019-05-15 10:15:13,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} main_~SIZE~5 := 1; {222#true} is VALID [2019-05-15 10:15:13,262 INFO L273 TraceCheckUtils]: 3: Hoare triple {222#true} havoc main_~j~5; {222#true} is VALID [2019-05-15 10:15:13,262 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} havoc main_~k~5; {222#true} is VALID [2019-05-15 10:15:13,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} havoc main_~array~5; {222#true} is VALID [2019-05-15 10:15:13,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} havoc main_~menor~5; {222#true} is VALID [2019-05-15 10:15:13,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#true} assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {222#true} is VALID [2019-05-15 10:15:13,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#true} main_~menor~5 := main_#t~nondet0; {222#true} is VALID [2019-05-15 10:15:13,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#true} havoc main_#t~nondet0; {222#true} is VALID [2019-05-15 10:15:13,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#true} main_~j~5 := 0; {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2]; {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} havoc main_#t~nondet2; {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5; {257#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-05-15 10:15:13,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {257#(= ULTIMATE.start_main_~j~5 0)} main_~menor~5 := main_~array~5[main_~j~5 % 4294967296]; {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-05-15 10:15:13,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} main_#t~post1 := main_~j~5; {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-05-15 10:15:13,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} main_~j~5 := main_#t~post1 + 1; {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-05-15 10:15:13,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} havoc main_#t~post1; {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-05-15 10:15:13,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-05-15 10:15:13,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {276#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} __VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0); {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:13,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} havoc __VERIFIER_assert_~cond; {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:13,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {292#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {299#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2019-05-15 10:15:13,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {299#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume __VERIFIER_assert_~cond == 0; {223#false} is VALID [2019-05-15 10:15:13,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {223#false} assume !false; {223#false} is VALID [2019-05-15 10:15:13,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {223#false} assume !false; {223#false} is VALID [2019-05-15 10:15:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:15:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-15 10:15:13,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-05-15 10:15:13,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:13,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:15:13,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:13,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:15:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:15:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:15:13,432 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 6 states. [2019-05-15 10:15:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:13,943 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:15:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:15:13,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-05-15 10:15:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2019-05-15 10:15:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2019-05-15 10:15:13,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2019-05-15 10:15:14,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,035 INFO L225 Difference]: With dead ends: 43 [2019-05-15 10:15:14,035 INFO L226 Difference]: Without dead ends: 39 [2019-05-15 10:15:14,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:15:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-05-15 10:15:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-05-15 10:15:14,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:14,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2019-05-15 10:15:14,040 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2019-05-15 10:15:14,041 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2019-05-15 10:15:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,043 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:15:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:15:14,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,045 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2019-05-15 10:15:14,045 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2019-05-15 10:15:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,048 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:15:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:15:14,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:14,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:15:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-15 10:15:14,052 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 27 [2019-05-15 10:15:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:14,053 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-05-15 10:15:14,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:15:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:15:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-05-15 10:15:14,054 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:14,054 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:14,055 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 222921753, now seen corresponding path program 2 times [2019-05-15 10:15:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:14,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:15:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:14,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:14,599 INFO L273 TraceCheckUtils]: 0: Hoare triple {472#true} havoc main_#res; {472#true} is VALID [2019-05-15 10:15:14,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#true} havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5; {472#true} is VALID [2019-05-15 10:15:14,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {472#true} main_~SIZE~5 := 1; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,602 INFO L273 TraceCheckUtils]: 3: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~j~5; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,603 INFO L273 TraceCheckUtils]: 4: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~k~5; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~array~5; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_~menor~5; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} main_~menor~5 := main_#t~nondet0; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} havoc main_#t~nondet0; {483#(= ULTIMATE.start_main_~SIZE~5 1)} is VALID [2019-05-15 10:15:14,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {483#(= ULTIMATE.start_main_~SIZE~5 1)} main_~j~5 := 0; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2]; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} havoc main_#t~nondet2; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} main_~menor~5 := main_~array~5[main_~j~5 % 4294967296]; {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {508#(and (= ULTIMATE.start_main_~j~5 0) (= ULTIMATE.start_main_~SIZE~5 1))} main_#t~post1 := main_~j~5; {530#(and (= |ULTIMATE.start_main_#t~post1| 0) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {530#(and (= |ULTIMATE.start_main_#t~post1| 0) (= ULTIMATE.start_main_~SIZE~5 1))} main_~j~5 := main_#t~post1 + 1; {534#(and (= ULTIMATE.start_main_~j~5 1) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {534#(and (= ULTIMATE.start_main_~j~5 1) (= ULTIMATE.start_main_~SIZE~5 1))} havoc main_#t~post1; {534#(and (= ULTIMATE.start_main_~j~5 1) (= ULTIMATE.start_main_~SIZE~5 1))} is VALID [2019-05-15 10:15:14,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {534#(and (= ULTIMATE.start_main_~j~5 1) (= ULTIMATE.start_main_~SIZE~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {473#false} is VALID [2019-05-15 10:15:14,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {473#false} assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; {473#false} is VALID [2019-05-15 10:15:14,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {473#false} main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2]; {473#false} is VALID [2019-05-15 10:15:14,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {473#false} havoc main_#t~nondet2; {473#false} is VALID [2019-05-15 10:15:14,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {473#false} assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5; {473#false} is VALID [2019-05-15 10:15:14,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {473#false} main_~menor~5 := main_~array~5[main_~j~5 % 4294967296]; {473#false} is VALID [2019-05-15 10:15:14,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {473#false} main_#t~post1 := main_~j~5; {473#false} is VALID [2019-05-15 10:15:14,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {473#false} main_~j~5 := main_#t~post1 + 1; {473#false} is VALID [2019-05-15 10:15:14,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {473#false} havoc main_#t~post1; {473#false} is VALID [2019-05-15 10:15:14,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {473#false} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {473#false} is VALID [2019-05-15 10:15:14,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {473#false} __VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0); {473#false} is VALID [2019-05-15 10:15:14,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {473#false} havoc __VERIFIER_assert_~cond; {473#false} is VALID [2019-05-15 10:15:14,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {473#false} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {473#false} is VALID [2019-05-15 10:15:14,631 INFO L273 TraceCheckUtils]: 33: Hoare triple {473#false} assume __VERIFIER_assert_~cond == 0; {473#false} is VALID [2019-05-15 10:15:14,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {473#false} assume !false; {473#false} is VALID [2019-05-15 10:15:14,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {473#false} assume !false; {473#false} is VALID [2019-05-15 10:15:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:14,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:15:14,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-15 10:15:14,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-05-15 10:15:14,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:14,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:15:14,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:15:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:15:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:15:14,718 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 6 states. [2019-05-15 10:15:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,877 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-05-15 10:15:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:15:14,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-05-15 10:15:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-05-15 10:15:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:15:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-05-15 10:15:14,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2019-05-15 10:15:14,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,917 INFO L225 Difference]: With dead ends: 21 [2019-05-15 10:15:14,917 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:15:14,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:15:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:15:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:15:14,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:14,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:14,919 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:14,919 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:14,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,920 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:14,920 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,920 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:14,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:14,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:15:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:15:14,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-05-15 10:15:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:14,921 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:15:14,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:15:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:14,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,926 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:15:14 BoogieIcfgContainer [2019-05-15 10:15:14,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:15:14,927 INFO L168 Benchmark]: Toolchain (without parser) took 4376.81 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 111.0 MB in the beginning and 126.6 MB in the end (delta: -15.6 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:14,928 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 133.7 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:14,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 133.7 MB. Free memory was 111.0 MB in the beginning and 109.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:14,930 INFO L168 Benchmark]: Boogie Preprocessor took 25.70 ms. Allocated memory is still 133.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:14,931 INFO L168 Benchmark]: RCFGBuilder took 647.95 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 93.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:14,932 INFO L168 Benchmark]: TraceAbstraction took 3657.53 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 126.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:14,936 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 133.7 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 133.7 MB. Free memory was 111.0 MB in the beginning and 109.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.70 ms. Allocated memory is still 133.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 647.95 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 93.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3657.53 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 126.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 43 SDslu, 119 SDs, 0 SdLazy, 89 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 6212 SizeOfPredicates, 13 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...