java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/dangerInvariants/loop2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:43,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:43,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:43,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:43,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:43,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:43,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:43,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:43,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:43,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:43,601 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:43,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:43,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:43,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:43,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:43,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:43,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:43,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:43,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:43,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:43,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:43,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:43,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:43,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:43,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:43,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:43,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:43,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:43,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:43,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:43,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:43,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:43,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:43,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:43,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:43,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:43,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:43,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:43,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:43,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:43,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:43,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:43,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:43,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:43,695 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:43,696 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:43,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/dangerInvariants/loop2.bpl [2019-08-05 11:16:43,698 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/dangerInvariants/loop2.bpl' [2019-08-05 11:16:43,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:43,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:43,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:43,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:43,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:43,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,768 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:43,769 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:43,769 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:43,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:43,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:43,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:43,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:43,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/1) ... [2019-08-05 11:16:43,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:43,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:43,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:43,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:43,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (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-08-05 11:16:43,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:43,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:43,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:44,105 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:44,106 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:16:44,107 INFO L202 PluginConnector]: Adding new model loop2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:44 BoogieIcfgContainer [2019-08-05 11:16:44,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:44,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:44,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:44,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:44,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:43" (1/2) ... [2019-08-05 11:16:44,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5469cf and model type loop2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:44, skipping insertion in model container [2019-08-05 11:16:44,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:44" (2/2) ... [2019-08-05 11:16:44,120 INFO L109 eAbstractionObserver]: Analyzing ICFG loop2.bpl [2019-08-05 11:16:44,131 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:44,140 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:16:44,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:16:44,197 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:44,199 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:44,199 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:44,199 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:44,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:44,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:44,200 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:44,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:44,200 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:16:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:44,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:44,247 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:16:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:44,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:44,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:44,439 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 11:16:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,552 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:16:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:44,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:16:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,586 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:16:44,587 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:16:44,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-08-05 11:16:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:16:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:16:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:16:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:16:44,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:16:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,662 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:16:44,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:16:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:16:44,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,665 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:16:44,665 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,666 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:16:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:16:44,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:44,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:44,743 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:16:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,816 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:16:44,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:44,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:16:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,819 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:16:44,819 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:16:44,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:16:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:16:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:16:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:16:44,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:16:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,823 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:16:44,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:16:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:16:44,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,824 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:16:44,824 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:16:44,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:44,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:44,926 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:16:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,959 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:16:44,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:44,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:16:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,961 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:16:44,961 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:16:44,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:16:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:16:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:16:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:16:44,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:16:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,966 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:16:44,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:16:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:44,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,968 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:16:44,969 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:16:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:16:45,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:45,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:45,296 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 11:16:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:45,334 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:16:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:16:45,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 11:16:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:45,336 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:16:45,336 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:16:45,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:16:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:16:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:16:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:16:45,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:16:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:45,340 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:16:45,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:16:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:16:45,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:45,342 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:16:45,342 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:16:45,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:45,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:45,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:45,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:45,468 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 11:16:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:45,557 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:16:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:45,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 11:16:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:45,563 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:45,563 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:45,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:16:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:16:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:16:45,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:16:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:45,569 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:16:45,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:16:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:45,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:45,571 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 11:16:45,573 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 11:16:45,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:45,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:16:45,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:45,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:45,840 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2019-08-05 11:16:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:45,896 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:16:45,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:16:45,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:16:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:45,898 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:16:45,898 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:16:45,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:16:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:16:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:16:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:16:45,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:16:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:45,903 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:16:45,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:16:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:16:45,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:45,904 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 11:16:45,905 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:45,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 11:16:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:45,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:16:45,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:46,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:46,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:46,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:46,115 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-08-05 11:16:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,295 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:16:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:46,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-08-05 11:16:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,296 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:46,296 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:46,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:16:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:16:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:16:46,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:16:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,301 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:16:46,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:16:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:16:46,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,303 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 11:16:46,303 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 11:16:46,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:46,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:46,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:46,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:46,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:46,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:46,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:46,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:46,595 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-08-05 11:16:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,648 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:16:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:16:46,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-08-05 11:16:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,650 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:16:46,650 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:16:46,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:16:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:16:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:16:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:16:46,654 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:16:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,655 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:16:46,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:16:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:16:46,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,656 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 11:16:46,656 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 11:16:46,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:46,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:16:46,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:46,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:46,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:46,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:46,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:46,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:46,913 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-08-05 11:16:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,967 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:16:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:46,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 11:16:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,969 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:16:46,969 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:16:46,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:16:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:16:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:16:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:16:46,974 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:16:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,974 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:16:46,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:16:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:16:46,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,976 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 11:16:46,976 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 11:16:46,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:16:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:16:47,016 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:16:47,036 INFO L202 PluginConnector]: Adding new model loop2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:47 BoogieIcfgContainer [2019-08-05 11:16:47,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:47,042 INFO L168 Benchmark]: Toolchain (without parser) took 3304.39 ms. Allocated memory was 138.4 MB in the beginning and 175.6 MB in the end (delta: 37.2 MB). Free memory was 108.9 MB in the beginning and 58.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,044 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.01 ms. Allocated memory is still 138.4 MB. Free memory was 108.7 MB in the beginning and 106.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,047 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 138.4 MB. Free memory was 106.9 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,047 INFO L168 Benchmark]: RCFGBuilder took 311.14 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 96.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,051 INFO L168 Benchmark]: TraceAbstraction took 2925.14 ms. Allocated memory was 138.4 MB in the beginning and 175.6 MB in the end (delta: 37.2 MB). Free memory was 96.6 MB in the beginning and 58.5 MB in the end (delta: 38.1 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:47,058 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 110.0 MB in the beginning and 109.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.01 ms. Allocated memory is still 138.4 MB. Free memory was 108.7 MB in the beginning and 106.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.38 ms. Allocated memory is still 138.4 MB. Free memory was 106.9 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.14 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 96.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2925.14 ms. Allocated memory was 138.4 MB in the beginning and 175.6 MB in the end (delta: 37.2 MB). Free memory was 96.6 MB in the beginning and 58.5 MB in the end (delta: 38.1 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: assertion can be violated assertion can be violated We found a FailurePath: [L8] x := 0; VAL [x=0] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=1] [L11] assert x != 10; VAL [x=1] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=2] [L11] assert x != 10; VAL [x=2] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=3] [L11] assert x != 10; VAL [x=3] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=4] [L11] assert x != 10; VAL [x=4] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=5] [L11] assert x != 10; VAL [x=5] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=6] [L11] assert x != 10; VAL [x=6] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=7] [L11] assert x != 10; VAL [x=7] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=8] [L11] assert x != 10; VAL [x=8] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=9] [L11] assert x != 10; VAL [x=9] [L9] COND TRUE x < 20 [L10] x := x + 1; VAL [x=10] [L11] assert x != 10; VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.8s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 45 SDslu, 0 SDs, 0 SdLazy, 147 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=9, 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, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 3420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...