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/PricedTimedAutomata/handwritten/pcatest1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:06,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:06,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:06,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:06,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:06,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:06,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:06,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:06,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:06,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:06,723 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:06,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:06,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:06,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:06,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:06,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:06,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:06,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:06,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:06,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:06,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:06,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:06,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:06,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:06,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:06,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:06,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:06,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:06,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:06,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:06,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:06,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:06,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:06,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:06,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:06,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:06,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:06,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:06,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:06,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:06,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:06,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:06,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:06,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:06,796 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:06,796 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:06,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/handwritten/pcatest1.bpl [2019-08-05 10:13:06,797 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/handwritten/pcatest1.bpl' [2019-08-05 10:13:06,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:06,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:06,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:06,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:06,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:06,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,881 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:06,881 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:06,881 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:06,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:06,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:06,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:06,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:06,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/1) ... [2019-08-05 10:13:06,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:06,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:06,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:06,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:06,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (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:13:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:13:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_x [2019-08-05 10:13:06,991 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:13:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:13:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:13:07,641 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:07,641 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:13:07,643 INFO L202 PluginConnector]: Adding new model pcatest1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:07 BoogieIcfgContainer [2019-08-05 10:13:07,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:07,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:07,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:07,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:07,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:06" (1/2) ... [2019-08-05 10:13:07,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@817c505 and model type pcatest1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:07, skipping insertion in model container [2019-08-05 10:13:07,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pcatest1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:07" (2/2) ... [2019-08-05 10:13:07,651 INFO L109 eAbstractionObserver]: Analyzing ICFG pcatest1.bpl [2019-08-05 10:13:07,661 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:07,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:13:07,683 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:13:07,709 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:07,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:07,710 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:07,710 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:07,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:07,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:07,711 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:07,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:07,711 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-08-05 10:13:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:13:07,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:13:07,738 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 10:13:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,874 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:13:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:13:07,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:07,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:07,893 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-08-05 10:13:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,940 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2019-08-05 10:13:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:07,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:13:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,953 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:13:07,954 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:13:07,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:13:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:13:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:13:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:13:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-08-05 10:13:07,991 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 2 [2019-08-05 10:13:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,992 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-08-05 10:13:07,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-08-05 10:13:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:13:07,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:13:07,993 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 32513161, now seen corresponding path program 1 times [2019-08-05 10:13:07,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,234 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:13:08,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:08,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:08,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:08,238 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 5 states. [2019-08-05 10:13:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,604 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2019-08-05 10:13:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:08,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:13:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,610 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:13:08,610 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:13:08,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:13:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-08-05 10:13:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:13:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2019-08-05 10:13:08,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 5 [2019-08-05 10:13:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,621 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2019-08-05 10:13:08,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2019-08-05 10:13:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:13:08,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1007964679, now seen corresponding path program 1 times [2019-08-05 10:13:08,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,672 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:13:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:08,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:08,676 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand 3 states. [2019-08-05 10:13:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,748 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-08-05 10:13:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:08,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:13:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,749 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:13:08,750 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:13:08,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:13:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:13:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-08-05 10:13:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:13:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2019-08-05 10:13:08,759 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 6 [2019-08-05 10:13:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,759 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-08-05 10:13:08,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2019-08-05 10:13:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:08,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,760 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,761 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 590829277, now seen corresponding path program 1 times [2019-08-05 10:13:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:08,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:08,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:08,812 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 3 states. [2019-08-05 10:13:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,870 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-08-05 10:13:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 10:13:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,872 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:13:08,873 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:13:08,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 1 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:13:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:13:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-08-05 10:13:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:13:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2019-08-05 10:13:08,880 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 12 [2019-08-05 10:13:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,880 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2019-08-05 10:13:08,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2019-08-05 10:13:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:08,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,882 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,882 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash -600790147, now seen corresponding path program 1 times [2019-08-05 10:13:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:08,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:08,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:08,972 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 3 states. [2019-08-05 10:13:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,018 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-08-05 10:13:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:09,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 10:13:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,021 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:13:09,022 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:13:09,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 1 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:13:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:13:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-08-05 10:13:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:13:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2019-08-05 10:13:09,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 13 [2019-08-05 10:13:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,030 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2019-08-05 10:13:09,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2019-08-05 10:13:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:09,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,032 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1135895091, now seen corresponding path program 1 times [2019-08-05 10:13:09,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:09,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:09,272 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 7 states. [2019-08-05 10:13:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,569 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2019-08-05 10:13:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:09,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,571 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:13:09,572 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:13:09,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:13:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2019-08-05 10:13:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:13:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2019-08-05 10:13:09,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 13 [2019-08-05 10:13:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,587 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2019-08-05 10:13:09,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2019-08-05 10:13:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:13:09,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,590 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,590 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 53517278, now seen corresponding path program 1 times [2019-08-05 10:13:09,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:09,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:09,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:09,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:09,680 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand 3 states. [2019-08-05 10:13:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,798 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-08-05 10:13:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:09,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:13:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,802 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:13:09,802 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:13:09,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:13:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:13:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:13:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:13:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 10:13:09,812 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 14 [2019-08-05 10:13:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,814 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 10:13:09,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 10:13:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:13:09,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,815 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,815 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1996539630, now seen corresponding path program 1 times [2019-08-05 10:13:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:13:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:09,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:09,893 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2019-08-05 10:13:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,937 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-08-05 10:13:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:09,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:13:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,939 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:13:09,939 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:13:09,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 1 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:13:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:13:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-08-05 10:13:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:13:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2019-08-05 10:13:09,945 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2019-08-05 10:13:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,945 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2019-08-05 10:13:09,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2019-08-05 10:13:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:13:09,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,947 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,947 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1763181437, now seen corresponding path program 1 times [2019-08-05 10:13:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:10,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:10,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:13:10,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:13:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:13:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:10,345 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 12 states. [2019-08-05 10:13:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:10,685 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-08-05 10:13:10,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:10,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-05 10:13:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:10,686 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:13:10,686 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:13:10,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:13:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:13:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:13:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-08-05 10:13:10,693 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 26 [2019-08-05 10:13:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:10,693 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-08-05 10:13:10,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:13:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-08-05 10:13:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:13:10,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:10,694 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:10,695 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash -240258697, now seen corresponding path program 1 times [2019-08-05 10:13:10,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:10,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:13:10,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:11,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:13:11,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:13:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:13:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:11,101 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 13 states. [2019-08-05 10:13:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,013 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-08-05 10:13:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:12,014 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-08-05 10:13:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,016 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:13:12,016 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:13:12,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:13:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:13:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:13:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-08-05 10:13:12,023 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 34 [2019-08-05 10:13:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,023 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-08-05 10:13:12,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:13:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-08-05 10:13:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:13:12,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,025 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:12,025 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash -855412536, now seen corresponding path program 2 times [2019-08-05 10:13:12,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:12,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:13:12,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:13:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:13:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:12,572 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 13 states. [2019-08-05 10:13:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,000 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:13:13,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:13,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-08-05 10:13:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,002 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:13:13,003 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:13:13,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:13:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2019-08-05 10:13:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:13:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-08-05 10:13:13,009 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 35 [2019-08-05 10:13:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,010 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-08-05 10:13:13,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:13:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-08-05 10:13:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:13:13,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,012 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:13,012 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1443010271, now seen corresponding path program 2 times [2019-08-05 10:13:13,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:13:13,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:13:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:13:13,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:13,420 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 14 states. [2019-08-05 10:13:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,737 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:13:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:13,744 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-08-05 10:13:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,745 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:13:13,745 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:13:13,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:13:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-05 10:13:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:13:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-08-05 10:13:13,751 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 42 [2019-08-05 10:13:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,751 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-08-05 10:13:13,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:13:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-08-05 10:13:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:13:13,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,754 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:13,754 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1641404331, now seen corresponding path program 3 times [2019-08-05 10:13:13,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,296 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2019-08-05 10:13:14,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:14,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:14,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:13:14,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:13:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:13:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:14,468 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 19 states. [2019-08-05 10:13:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:15,082 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:13:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:13:15,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-08-05 10:13:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:15,085 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:13:15,085 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:13:15,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:13:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-05 10:13:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:13:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-08-05 10:13:15,090 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 55 [2019-08-05 10:13:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:15,091 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-08-05 10:13:15,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-08-05 10:13:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:13:15,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:15,093 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:13:15,094 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1246221495, now seen corresponding path program 4 times [2019-08-05 10:13:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:15,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:13:15,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:15,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,506 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:15,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:16,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:16,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:13:16,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:13:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:13:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:16,173 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 20 states. [2019-08-05 10:13:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:16,753 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-08-05 10:13:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:13:16,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-08-05 10:13:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:16,755 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:13:16,756 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:13:16,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:13:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 131. [2019-08-05 10:13:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:13:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2019-08-05 10:13:16,762 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 63 [2019-08-05 10:13:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:16,762 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2019-08-05 10:13:16,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:13:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2019-08-05 10:13:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:13:16,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:16,764 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:16,764 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1975488202, now seen corresponding path program 5 times [2019-08-05 10:13:16,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:16,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:13:16,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:16,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:17,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:17,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:13:17,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:13:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:13:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:17,182 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 20 states. [2019-08-05 10:13:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:17,725 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2019-08-05 10:13:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:13:17,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2019-08-05 10:13:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:17,728 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:13:17,728 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:13:17,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:13:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2019-08-05 10:13:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:13:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2019-08-05 10:13:17,734 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 64 [2019-08-05 10:13:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2019-08-05 10:13:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:13:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2019-08-05 10:13:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:13:17,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:17,735 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:13:17,736 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1595821837, now seen corresponding path program 6 times [2019-08-05 10:13:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:17,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:13:17,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:17,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,115 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:18,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:18,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:18,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:18,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:18,551 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 21 states. [2019-08-05 10:13:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:19,109 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2019-08-05 10:13:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:19,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-08-05 10:13:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:19,113 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:13:19,113 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:13:19,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:13:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 156. [2019-08-05 10:13:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:13:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2019-08-05 10:13:19,117 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 71 [2019-08-05 10:13:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:19,118 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2019-08-05 10:13:19,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2019-08-05 10:13:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:13:19,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:19,119 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-08-05 10:13:19,120 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash -996104765, now seen corresponding path program 7 times [2019-08-05 10:13:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:19,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:13:19,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:19,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,709 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-08-05 10:13:19,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:19,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:19,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:19,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:19,963 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 26 states. [2019-08-05 10:13:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,095 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2019-08-05 10:13:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:13:21,096 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2019-08-05 10:13:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,097 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:13:21,098 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:13:21,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=416, Invalid=1476, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:13:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:13:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2019-08-05 10:13:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:13:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2019-08-05 10:13:21,102 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 84 [2019-08-05 10:13:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,103 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2019-08-05 10:13:21,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:13:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2019-08-05 10:13:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:13:21,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,104 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:21,104 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 633952951, now seen corresponding path program 8 times [2019-08-05 10:13:21,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,522 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 9 [2019-08-05 10:13:21,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:22,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:22,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:22,181 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 27 states. [2019-08-05 10:13:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,008 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2019-08-05 10:13:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:23,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 92 [2019-08-05 10:13:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,011 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:13:23,012 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:13:23,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:13:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:13:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2019-08-05 10:13:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:13:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2019-08-05 10:13:23,017 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 92 [2019-08-05 10:13:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,017 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2019-08-05 10:13:23,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2019-08-05 10:13:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:13:23,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,020 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-08-05 10:13:23,020 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 475344776, now seen corresponding path program 9 times [2019-08-05 10:13:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:23,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:23,395 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:23,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:23,801 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 9 [2019-08-05 10:13:23,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:23,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:23,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:24,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:24,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:24,339 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 27 states. [2019-08-05 10:13:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,184 INFO L93 Difference]: Finished difference Result 235 states and 249 transitions. [2019-08-05 10:13:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:13:25,184 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 10:13:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,186 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:13:25,186 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:13:25,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=491, Invalid=1861, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:13:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:13:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 187. [2019-08-05 10:13:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:13:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2019-08-05 10:13:25,193 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 93 [2019-08-05 10:13:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,193 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2019-08-05 10:13:25,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2019-08-05 10:13:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:13:25,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,195 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:25,195 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1245998495, now seen corresponding path program 10 times [2019-08-05 10:13:25,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,846 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:13:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:26,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:26,306 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand 28 states. [2019-08-05 10:13:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,179 INFO L93 Difference]: Finished difference Result 235 states and 249 transitions. [2019-08-05 10:13:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:13:27,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2019-08-05 10:13:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,182 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:13:27,182 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:13:27,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=510, Invalid=2040, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:13:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:13:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2019-08-05 10:13:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:13:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2019-08-05 10:13:27,188 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 100 [2019-08-05 10:13:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,188 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2019-08-05 10:13:27,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2019-08-05 10:13:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:13:27,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,190 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:27,190 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash 334038805, now seen corresponding path program 11 times [2019-08-05 10:13:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:27,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:13:27,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:13:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:13:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:27,945 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 33 states. [2019-08-05 10:13:28,759 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:13:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,365 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2019-08-05 10:13:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:29,366 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 113 [2019-08-05 10:13:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,368 INFO L225 Difference]: With dead ends: 247 [2019-08-05 10:13:29,368 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:13:29,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=706, Invalid=2716, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:13:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:13:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-08-05 10:13:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:13:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2019-08-05 10:13:29,374 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 113 [2019-08-05 10:13:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,374 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2019-08-05 10:13:29,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:13:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2019-08-05 10:13:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:13:29,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,376 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:29,376 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash 420235785, now seen corresponding path program 12 times [2019-08-05 10:13:29,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,242 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-08-05 10:13:30,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:30,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:30,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:30,576 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand 34 states. [2019-08-05 10:13:31,057 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:13:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,073 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2019-08-05 10:13:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:13:32,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 121 [2019-08-05 10:13:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,078 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:13:32,078 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:13:32,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=764, Invalid=3018, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:13:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:13:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2019-08-05 10:13:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-05 10:13:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2019-08-05 10:13:32,084 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 121 [2019-08-05 10:13:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,085 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2019-08-05 10:13:32,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2019-08-05 10:13:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:13:32,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,086 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:32,087 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1854920074, now seen corresponding path program 13 times [2019-08-05 10:13:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 10:13:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:32,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:13:32,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:32,202 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 8 states. [2019-08-05 10:13:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,446 INFO L93 Difference]: Finished difference Result 387 states and 402 transitions. [2019-08-05 10:13:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:32,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-08-05 10:13:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,448 INFO L225 Difference]: With dead ends: 387 [2019-08-05 10:13:32,448 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:13:32,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:13:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:13:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:13:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:13:32,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2019-08-05 10:13:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,451 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:13:32,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:13:32,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:13:32,459 INFO L202 PluginConnector]: Adding new model pcatest1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:32 BoogieIcfgContainer [2019-08-05 10:13:32,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:32,462 INFO L168 Benchmark]: Toolchain (without parser) took 25614.89 ms. Allocated memory was 133.2 MB in the beginning and 390.1 MB in the end (delta: 256.9 MB). Free memory was 110.5 MB in the beginning and 302.4 MB in the end (delta: -191.9 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:32,463 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 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:13:32,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.46 ms. Allocated memory is still 133.2 MB. Free memory was 110.3 MB in the beginning and 108.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:32,467 INFO L168 Benchmark]: Boogie Preprocessor took 29.09 ms. Allocated memory is still 133.2 MB. Free memory was 108.4 MB in the beginning and 107.0 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:13:32,468 INFO L168 Benchmark]: RCFGBuilder took 729.05 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 89.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:32,470 INFO L168 Benchmark]: TraceAbstraction took 24814.60 ms. Allocated memory was 133.2 MB in the beginning and 390.1 MB in the end (delta: 256.9 MB). Free memory was 88.8 MB in the beginning and 302.4 MB in the end (delta: -213.6 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:32,479 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.22 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 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 37.46 ms. Allocated memory is still 133.2 MB. Free memory was 110.3 MB in the beginning and 108.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.09 ms. Allocated memory is still 133.2 MB. Free memory was 108.4 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.05 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 89.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24814.60 ms. Allocated memory was 133.2 MB in the beginning and 390.1 MB in the end (delta: 256.9 MB). Free memory was 88.8 MB in the beginning and 302.4 MB in the end (delta: -213.6 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 93]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 2 error locations. SAFE Result, 24.7s OverallTime, 23 OverallIterations, 13 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 3548 SDslu, 3984 SDs, 0 SdLazy, 2889 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1402 GetRequests, 880 SyntacticMatches, 3 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5867 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=22, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 347 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 767284 SizeOfPredicates, 314 NumberOfNonLiveVariables, 2858 ConjunctsInSsa, 681 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 527/3190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...