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/real-life/MarkovChains/DoyenHenzingerRaskin-Fig1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:07:03,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:07:03,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:07:03,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:07:03,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:07:03,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:07:03,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:07:03,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:07:03,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:07:03,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:07:03,624 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:07:03,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:07:03,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:07:03,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:07:03,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:07:03,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:07:03,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:07:03,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:07:03,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:07:03,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:07:03,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:07:03,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:07:03,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:07:03,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:07:03,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:07:03,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:07:03,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:07:03,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:07:03,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:07:03,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:07:03,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:07:03,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:07:03,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:07:03,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:07:03,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:07:03,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:07:03,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:07:03,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:07:03,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:07:03,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:07:03,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:07:03,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:07:03,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:07:03,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:07:03,715 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:07:03,716 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:07:03,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/MarkovChains/DoyenHenzingerRaskin-Fig1.bpl [2019-08-05 10:07:03,718 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/MarkovChains/DoyenHenzingerRaskin-Fig1.bpl' [2019-08-05 10:07:03,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:07:03,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:07:03,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:03,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:07:03,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:07:03,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,792 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:07:03,792 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:07:03,792 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:07:03,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:03,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:07:03,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:07:03,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:07:03,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/1) ... [2019-08-05 10:07:03,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:07:03,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:07:03,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:07:03,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:07:03,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (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 10:07:03,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:07:03,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:07:03,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:07:04,363 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:07:04,364 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:07:04,365 INFO L202 PluginConnector]: Adding new model DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:04 BoogieIcfgContainer [2019-08-05 10:07:04,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:07:04,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:07:04,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:07:04,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:07:04,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:03" (1/2) ... [2019-08-05 10:07:04,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593bc09 and model type DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:07:04, skipping insertion in model container [2019-08-05 10:07:04,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:04" (2/2) ... [2019-08-05 10:07:04,375 INFO L109 eAbstractionObserver]: Analyzing ICFG DoyenHenzingerRaskin-Fig1.bpl [2019-08-05 10:07:04,389 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:07:04,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:07:04,415 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:07:04,437 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:07:04,438 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:07:04,438 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:07:04,438 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:07:04,438 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:07:04,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:07:04,439 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:07:04,439 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:07:04,439 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:07:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:07:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:07:04,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:04,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:07:04,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-08-05 10:07:04,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:04,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:07:04,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:04,678 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 10:07:04,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:04,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:04,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:04,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:04,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:04,700 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:07:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:04,756 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:07:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:04,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:07:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:04,769 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:07:04,769 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:07:04,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:07:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-08-05 10:07:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:07:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:07:04,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-08-05 10:07:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:04,802 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:07:04,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:07:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:07:04,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:04,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:07:04,804 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 29952, now seen corresponding path program 1 times [2019-08-05 10:07:04,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:04,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:04,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:04,953 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:07:04,954 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 10:07:04,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:04,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:04,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:04,957 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 3 states. [2019-08-05 10:07:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:05,027 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:07:05,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:05,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:07:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:05,029 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:07:05,029 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:07:05,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:07:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 10:07:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:07:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:07:05,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 3 [2019-08-05 10:07:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:05,034 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:07:05,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:07:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:07:05,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:05,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:07:05,035 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 928551, now seen corresponding path program 1 times [2019-08-05 10:07:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:05,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:07:05,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:05,087 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 10:07:05,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:05,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:05,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:05,089 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-08-05 10:07:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:05,129 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:07:05,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:05,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:07:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:05,130 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:07:05,130 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:07:05,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:07:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:07:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:07:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:07:05,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2019-08-05 10:07:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:05,134 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:07:05,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:07:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:07:05,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:05,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:07:05,136 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28785612, now seen corresponding path program 1 times [2019-08-05 10:07:05,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:05,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:07:05,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:05,585 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:07:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:05,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:07:05,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:05,590 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 4 states. [2019-08-05 10:07:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:05,698 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:07:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:05,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:07:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:05,699 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:07:05,699 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:07:05,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:07:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2019-08-05 10:07:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:07:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:07:05,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2019-08-05 10:07:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:05,708 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:07:05,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:07:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:07:05,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:05,712 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:07:05,713 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash 892354009, now seen corresponding path program 1 times [2019-08-05 10:07:05,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:05,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:07:05,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:05,873 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 10:07:05,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:05,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:07:05,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:05,875 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-08-05 10:07:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:05,951 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:07:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:05,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:07:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:05,953 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:07:05,954 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:07:05,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:07:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 10:07:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:07:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:07:05,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2019-08-05 10:07:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:05,957 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:07:05,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:07:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:07:05,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:05,958 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:07:05,959 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1893170542, now seen corresponding path program 1 times [2019-08-05 10:07:05,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:05,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:07:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:06,128 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:07:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:06,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:06,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:07:06,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:06,155 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-08-05 10:07:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:06,187 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:07:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:06,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:07:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:06,190 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:07:06,190 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:07:06,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:07:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:07:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:07:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:07:06,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2019-08-05 10:07:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:06,194 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:07:06,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:07:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:07:06,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:06,195 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1] [2019-08-05 10:07:06,195 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1441254811, now seen corresponding path program 2 times [2019-08-05 10:07:06,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:06,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:07:06,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:06,481 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-08-05 10:07:06,912 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-08-05 10:07:06,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:07,108 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-08-05 10:07:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:07,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:07,113 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-08-05 10:07:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:07,433 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:07:07,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:07,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:07:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:07,435 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:07:07,436 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:07:07,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:07:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 10:07:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:07:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:07:07,440 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 8 [2019-08-05 10:07:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:07,440 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:07:07,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:07:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:07:07,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:07,441 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-08-05 10:07:07,442 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:07,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1729226144, now seen corresponding path program 2 times [2019-08-05 10:07:07,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:07,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:07:07,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:07,820 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 10:07:08,076 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-08-05 10:07:08,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:08,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:08,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:08,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:08,203 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-08-05 10:07:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:08,325 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:07:08,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:08,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:07:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:08,326 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:07:08,326 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:07:08,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:07:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2019-08-05 10:07:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:07:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:07:08,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:07:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:08,329 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:07:08,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:07:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:07:08,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:08,330 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2019-08-05 10:07:08,331 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2066402873, now seen corresponding path program 2 times [2019-08-05 10:07:08,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:08,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:07:08,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:08,605 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-08-05 10:07:08,741 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-08-05 10:07:08,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:08,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:08,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:08,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:08,824 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-08-05 10:07:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:08,897 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:07:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:08,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:07:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:08,899 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:07:08,899 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:07:08,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:07:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:07:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:07:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:07:08,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-05 10:07:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:08,903 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:07:08,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:07:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:07:08,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:08,904 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2019-08-05 10:07:08,905 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash -441224498, now seen corresponding path program 3 times [2019-08-05 10:07:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:08,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:07:08,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:09,177 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-08-05 10:07:09,294 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-08-05 10:07:09,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:09,420 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-08-05 10:07:09,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:09,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:09,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:09,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:09,494 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-08-05 10:07:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:09,690 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:07:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:09,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:07:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:09,692 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:07:09,692 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:07:09,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:07:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:07:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:07:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:07:09,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-08-05 10:07:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:09,694 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:07:09,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:07:09,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:07:09,699 INFO L202 PluginConnector]: Adding new model DoyenHenzingerRaskin-Fig1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:07:09 BoogieIcfgContainer [2019-08-05 10:07:09,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:07:09,701 INFO L168 Benchmark]: Toolchain (without parser) took 5940.97 ms. Allocated memory was 132.6 MB in the beginning and 239.6 MB in the end (delta: 107.0 MB). Free memory was 110.2 MB in the beginning and 165.7 MB in the end (delta: -55.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,702 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.10 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.52 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,703 INFO L168 Benchmark]: Boogie Preprocessor took 27.70 ms. Allocated memory is still 132.6 MB. Free memory was 108.2 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,704 INFO L168 Benchmark]: RCFGBuilder took 541.94 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 92.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,705 INFO L168 Benchmark]: TraceAbstraction took 5332.87 ms. Allocated memory was 132.6 MB in the beginning and 239.6 MB in the end (delta: 107.0 MB). Free memory was 92.2 MB in the beginning and 165.7 MB in the end (delta: -73.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:09,709 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 1.10 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.52 ms. Allocated memory is still 132.6 MB. Free memory was 110.0 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.70 ms. Allocated memory is still 132.6 MB. Free memory was 108.2 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.94 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 92.4 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5332.87 ms. Allocated memory was 132.6 MB in the beginning and 239.6 MB in the end (delta: 107.0 MB). Free memory was 92.2 MB in the beginning and 165.7 MB in the end (delta: -73.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 3 error locations. SAFE Result, 5.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 30 SDslu, 37 SDs, 0 SdLazy, 170 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=7, 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, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 14561 SizeOfPredicates, 59 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 0/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...