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/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:44:59,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:44:59,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:44:59,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:44:59,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:44:59,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:44:59,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:44:59,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:44:59,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:44:59,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:44:59,767 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:44:59,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:44:59,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:44:59,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:44:59,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:44:59,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:44:59,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:44:59,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:44:59,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:44:59,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:44:59,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:44:59,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:44:59,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:44:59,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:44:59,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:44:59,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:44:59,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:44:59,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:44:59,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:44:59,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:44:59,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:44:59,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:44:59,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:44:59,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:44:59,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:44:59,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:44:59,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:44:59,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:44:59,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:44:59,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:44:59,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:44:59,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:44:59,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:44:59,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:44:59,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:44:59,852 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:44:59,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:44:59,854 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:44:59,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:44:59,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:44:59,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:59,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:44:59,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:44:59,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:59,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:44:59,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:44:59,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:44:59,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/1) ... [2019-08-05 10:44:59,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:44:59,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:44:59,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:44:59,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:44:59,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (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:45:00,015 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:45:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:45:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:45:00,263 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:45:00,265 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:45:00,266 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:00 BoogieIcfgContainer [2019-08-05 10:45:00,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:45:00,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:45:00,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:45:00,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:45:00,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:59" (1/2) ... [2019-08-05 10:45:00,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ec993 and model type count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:45:00, skipping insertion in model container [2019-08-05 10:45:00,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:45:00" (2/2) ... [2019-08-05 10:45:00,279 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:45:00,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:45:00,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:45:00,312 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:45:00,335 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:45:00,336 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:45:00,336 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:45:00,336 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:45:00,336 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:45:00,337 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:45:00,337 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:45:00,337 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:45:00,337 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:45:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:45:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:45:00,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:45:00,359 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-05 10:45:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,480 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:45:00,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:45:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:45:00,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:45:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:45:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:45:00,501 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:45:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,525 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:45:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:45:00,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:45:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,538 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:45:00,538 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:45:00,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:45:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:45:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:45:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:45:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:45:00,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:45:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,573 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:45:00,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:45:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:45:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:45:00,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:45:00,575 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-05 10:45:00,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:45:00,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:45:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:45:00,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:00,719 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:45:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,806 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:45:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:45:00,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:45:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,808 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:45:00,808 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:45:00,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:45:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:45:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:45:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:45:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:45:00,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:45:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,818 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:45:00,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:45:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:45:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:45:00,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,822 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:45:00,822 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-05 10:45:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:45:01,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:45:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:45:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:01,043 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:45:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,100 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:45:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:45:01,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:45:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,104 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:45:01,104 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:45:01,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:45:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:45:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:45:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:45:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:45:01,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:45:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,108 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:45:01,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:45:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:45:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:45:01,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,109 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:45:01,109 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-05 10:45:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:45:01,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:45:01,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:45:01,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:45:01,226 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:45:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,287 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:45:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:45:01,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:45:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,289 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:45:01,289 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:45:01,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:45:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:45:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:45:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:45:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:45:01,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:45:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,293 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:45:01,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:45:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:45:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:45:01,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,294 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:45:01,294 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-05 10:45:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:45:01,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:45:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:45:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:45:01,498 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:45:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,637 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:45:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:45:01,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:45:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,640 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:45:01,640 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:45:01,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:45:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:45:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:45:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:45:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:45:01,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:45:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,646 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:45:01,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:45:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:45:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:45:01,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,648 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:45:01,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-05 10:45:01,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:45:01,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:45:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:45:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:45:01,790 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:45:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,829 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:45:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:45:01,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:45:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,830 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:45:01,830 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:45:01,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:45:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:45:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:45:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:45:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:45:01,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:45:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,834 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:45:01,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:45:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:45:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:45:01,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,835 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:45:01,835 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-05 10:45:01,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:45:02,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:45:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:45:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:02,015 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:45:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,071 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:45:02,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:45:02,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:45:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,073 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:45:02,073 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:45:02,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:45:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:45:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:45:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:45:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:45:02,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:45:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,077 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:45:02,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:45:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:45:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:45:02,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,078 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:45:02,078 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-05 10:45:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:45:02,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:45:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:45:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:45:02,272 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:45:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,315 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:45:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:45:02,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:45:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,316 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:45:02,317 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:45:02,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:45:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:45:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:45:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:45:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:45:02,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:45:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,321 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:45:02,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:45:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:45:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:45:02,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,322 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:45:02,322 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-05 10:45:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:45:02,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:45:02,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:45:02,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:02,740 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:45:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,786 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:45:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:45:02,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:45:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,788 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:45:02,788 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:45:02,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:45:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:45:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:45:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:45:02,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:45:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,792 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:45:02,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:45:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:45:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:45:02,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,793 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:45:02,794 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-05 10:45:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:45:02,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:45:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:45:02,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:02,990 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:45:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,025 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:45:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:45:03,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:45:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,026 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:45:03,026 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:45:03,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:45:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:45:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:45:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:45:03,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:45:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,031 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:45:03,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:45:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:45:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:45:03,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,032 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:45:03,032 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-05 10:45:03,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:45:03,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:45:03,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:45:03,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:03,247 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:45:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,278 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:45:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:45:03,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:45:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,279 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:45:03,280 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:45:03,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:45:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:45:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:45:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:45:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:45:03,283 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:45:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,284 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:45:03,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:45:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:45:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:45:03,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,285 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:45:03,285 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-05 10:45:03,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:45:03,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:45:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:45:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:03,540 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:45:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,608 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:45:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:45:03,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:45:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,609 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:45:03,609 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:45:03,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:45:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:45:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:45:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:45:03,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:45:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,612 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:45:03,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:45:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:45:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:45:03,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,612 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:45:03,613 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-05 10:45:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:45:03,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:45:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:45:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:03,786 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:45:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,814 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:45:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:45:03,814 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:45:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,815 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:45:03,816 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:45:03,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:45:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:45:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:45:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:45:03,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:45:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,820 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:45:03,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:45:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:45:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:45:03,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,821 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:45:03,821 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-05 10:45:03,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:45:04,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:45:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:45:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:04,073 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:45:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,097 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:45:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:45:04,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:45:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,098 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:45:04,098 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:45:04,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:45:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:45:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:45:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:45:04,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:45:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,103 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:45:04,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:45:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:45:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:45:04,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,104 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:45:04,104 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-05 10:45:04,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:04,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:45:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:45:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:04,360 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:45:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,462 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:45:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:45:04,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:45:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,463 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:45:04,464 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:45:04,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:45:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:45:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:45:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:45:04,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:45:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,471 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:45:04,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:45:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:45:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:45:04,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,472 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:45:04,473 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-05 10:45:04,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:04,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:04,891 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:45:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,185 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:45:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:05,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,187 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:45:05,187 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:45:05,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:45:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:45:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:45:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:45:05,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:45:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,191 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:45:05,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:45:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:05,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,192 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:45:05,193 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-05 10:45:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:05,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:05,743 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:45:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,793 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:45:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:05,794 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,794 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:45:05,794 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:45:05,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:45:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:45:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:45:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:45:05,797 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:45:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,797 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:45:05,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:45:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:05,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,798 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:45:05,798 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-05 10:45:05,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:06,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:06,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:06,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:06,355 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:45:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,387 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:45:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:06,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,394 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:45:06,394 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:45:06,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:45:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:45:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:45:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:45:06,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:45:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,399 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:45:06,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:45:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:06,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,400 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:45:06,400 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-05 10:45:06,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:07,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:07,020 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:45:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,056 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:45:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:07,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,058 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:45:07,058 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:45:07,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:45:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:45:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:45:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:45:07,062 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:45:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,063 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:45:07,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:45:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:07,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,075 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:45:07,075 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-05 10:45:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:07,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:07,369 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:45:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,396 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:45:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:07,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,397 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:45:07,397 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:45:07,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:45:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:45:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:45:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:45:07,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:45:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,402 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:45:07,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:45:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:07,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,403 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:45:07,403 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-05 10:45:07,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:07,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:07,746 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:45:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,777 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:45:07,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:07,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:45:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,778 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:45:07,778 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:45:07,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:45:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:45:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:45:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:45:07,782 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:45:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,782 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:45:07,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:45:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:45:07,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,783 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:45:07,783 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-05 10:45:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:45:08,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:08,081 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:45:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,170 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:45:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:08,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:45:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,173 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:45:08,173 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:45:08,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:45:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:45:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:45:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:45:08,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:45:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,179 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:45:08,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:45:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:45:08,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,180 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:45:08,180 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-05 10:45:08,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:45:08,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:45:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:45:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:08,591 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:45:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,623 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:45:08,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:45:08,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:45:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,624 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:45:08,624 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:45:08,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:45:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:45:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:45:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:45:08,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:45:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,629 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:45:08,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:45:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:45:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:45:08,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,630 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:45:08,630 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-05 10:45:08,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,901 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:45:08,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:45:08,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:45:08,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:45:08,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:08,903 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:45:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,966 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:45:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:45:08,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:45:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,967 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:45:08,967 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:45:08,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:45:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:45:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:45:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:45:08,972 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:45:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,973 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:45:08,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:45:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:45:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:45:08,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,974 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:45:08,974 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-05 10:45:08,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:45:09,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:45:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:45:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:09,942 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:45:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,990 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:45:09,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:45:09,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:45:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,991 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:45:09,992 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:45:09,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:45:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:45:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:45:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:45:09,998 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:45:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,998 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:45:09,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:45:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:45:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:45:09,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,999 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:45:09,999 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-05 10:45:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:10,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:45:10,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:45:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:45:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:10,563 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:45:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,635 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:45:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:45:10,635 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:45:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,635 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:45:10,636 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:45:10,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:45:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:45:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:45:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:45:10,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:45:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,638 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:45:10,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:45:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:45:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:45:10,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,639 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:45:10,639 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-05 10:45:10,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:45:11,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:45:11,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:45:11,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:11,617 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:45:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,696 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:45:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:45:11,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:45:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,697 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:45:11,697 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:45:11,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:45:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:45:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:45:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:45:11,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:45:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:45:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:45:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:45:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:45:11,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,706 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:45:11,706 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-05 10:45:11,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:45:12,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:45:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:45:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:12,146 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:45:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,205 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:45:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:45:12,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:45:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,206 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:45:12,206 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:45:12,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:45:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:45:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:45:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:45:12,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:45:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,211 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:45:12,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:45:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:45:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:45:12,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,212 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:45:12,212 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-05 10:45:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:45:12,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:45:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:45:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:12,620 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:45:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,664 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:45:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:45:12,664 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:45:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,665 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:45:12,665 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:45:12,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:45:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:45:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:45:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:45:12,669 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:45:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,669 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:45:12,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:45:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:45:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:45:12,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,670 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:45:12,670 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-05 10:45:12,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:45:13,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:45:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:45:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:13,414 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:45:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,506 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:45:13,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:45:13,506 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:45:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,507 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:45:13,507 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:45:13,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:45:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:45:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:45:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:45:13,511 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:45:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,511 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:45:13,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:45:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:45:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:45:13,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,512 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:45:13,512 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-05 10:45:13,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:45:13,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:45:13,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:45:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:13,925 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:45:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,969 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:45:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:45:13,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:45:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,970 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:45:13,971 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:45:13,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:45:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:45:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:45:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:45:13,974 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:45:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,974 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:45:13,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:45:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:45:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:45:13,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,975 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:45:13,976 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-05 10:45:13,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:45:14,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:45:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:45:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:14,671 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:45:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,723 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:45:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:45:14,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:45:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,724 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:45:14,725 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:45:14,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:45:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:45:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:45:14,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:45:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,729 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:45:14,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:45:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:45:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:45:14,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,730 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:45:14,730 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-05 10:45:14,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:15,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:45:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:45:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:15,163 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:45:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,227 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:45:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:45:15,228 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:45:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,228 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:45:15,228 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:45:15,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:45:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:45:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:45:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:45:15,232 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:45:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,232 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:45:15,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:45:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:45:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:15,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,233 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:45:15,233 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-05 10:45:15,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:16,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:16,171 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:45:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,213 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:45:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:16,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:45:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,214 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:45:16,214 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:45:16,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:45:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:45:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:45:16,218 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:45:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,218 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:45:16,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:45:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:45:16,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,219 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:45:16,219 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-05 10:45:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:16,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:45:16,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:17,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:17,812 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:45:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,849 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:45:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:17,850 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:45:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,850 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:45:17,850 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:45:17,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:45:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:45:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:45:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:45:17,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:45:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,853 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:45:17,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:45:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:17,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,854 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:45:17,854 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-05 10:45:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:18,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:18,801 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:45:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,864 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:45:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:18,865 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:45:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,865 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:45:18,865 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:45:18,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:45:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:45:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:45:18,868 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:45:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,869 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:45:18,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:45:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:45:18,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,870 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:45:18,870 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-05 10:45:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:19,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:19,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:19,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:19,485 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:45:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,526 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:45:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:19,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:45:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,527 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:45:19,528 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:45:19,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:45:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:45:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:45:19,531 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:45:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,531 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:45:19,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:45:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:19,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,532 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:45:19,532 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-05 10:45:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:20,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:20,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:20,234 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:45:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,304 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:45:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:20,304 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:45:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,305 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:45:20,305 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:45:20,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:45:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:45:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:45:20,308 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:45:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,309 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:45:20,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:45:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:45:20,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,310 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:45:20,310 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-05 10:45:20,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:21,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:21,192 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:45:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,241 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:45:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:21,241 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:45:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,242 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:45:21,242 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:45:21,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:45:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:45:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:45:21,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:45:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,246 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:45:21,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:45:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:21,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,246 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:45:21,246 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-05 10:45:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:21,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:21,841 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:45:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,887 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:45:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:21,888 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:45:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,888 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:45:21,889 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:45:21,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:45:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:45:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:45:21,892 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:45:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,892 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:45:21,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:45:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:45:21,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,893 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:45:21,893 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-05 10:45:21,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:22,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:22,632 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:45:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,720 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:45:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:45:22,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:45:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,721 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:45:22,722 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:45:22,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:45:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:45:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:45:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:45:22,724 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:45:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,725 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:45:22,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:45:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:45:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:45:22,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,725 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:45:22,726 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-05 10:45:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:45:23,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:45:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:45:23,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:23,393 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:45:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:23,459 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:45:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:45:23,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:45:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:23,460 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:45:23,460 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:45:23,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:45:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:45:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:45:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:45:23,463 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:45:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:23,463 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:45:23,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:45:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:45:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:45:23,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:23,464 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:45:23,464 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-05 10:45:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:23,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:45:23,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:45:24,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:45:24,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:45:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:24,157 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:45:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,209 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:45:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:45:24,210 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:45:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,210 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:45:24,211 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:45:24,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:45:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:45:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:45:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:45:24,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:45:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,215 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:45:24,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:45:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:45:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:45:24,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,216 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:45:24,216 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-05 10:45:24,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:45:24,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:45:24,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:45:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:24,954 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:45:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,076 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:45:25,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:45:25,077 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:45:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,077 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:45:25,077 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:25,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:45:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:45:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:45:25,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:45:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,079 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:45:25,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:45:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:45:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:45:25,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,080 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:45:25,080 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-05 10:45:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:45:26,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:45:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:45:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:45:26,244 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:45:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,314 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:45:26,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:45:26,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:45:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,315 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:26,315 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:26,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:45:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:45:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:45:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:45:26,318 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:45:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:26,319 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:45:26,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:45:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:45:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:45:26,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:26,320 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:45:26,320 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-05 10:45:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:26,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:45:26,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:45:27,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:45:27,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:45:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:45:27,305 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:45:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,567 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:45:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:45:27,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:45:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,568 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:45:27,568 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:45:27,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:45:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:45:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:45:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:45:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:45:27,571 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:45:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,571 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:45:27,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:45:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:45:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:45:27,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,572 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:45:27,572 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-05 10:45:27,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:27,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:45:27,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:45:28,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:45:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:45:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:45:28,564 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:45:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:28,624 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:45:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:45:28,624 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:45:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:28,625 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:28,625 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:28,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:45:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:45:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:45:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:45:28,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:45:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:28,628 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:45:28,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:45:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:45:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:45:28,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:28,629 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:45:28,629 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-05 10:45:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:29,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:29,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:45:29,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:45:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:45:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:45:29,530 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:45:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,586 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:45:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:45:29,586 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:45:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,587 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:29,588 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:45:29,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:45:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:45:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:45:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:45:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:45:29,591 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:45:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,592 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:45:29,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:45:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:45:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:45:29,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,593 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:45:29,593 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-05 10:45:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:30,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:30,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:45:30,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:45:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:45:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:45:30,453 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:45:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,531 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:45:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:45:30,531 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:45:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,532 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:30,532 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:45:30,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:45:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:45:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:45:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:45:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:45:30,534 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:45:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,534 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:45:30,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:45:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:45:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:45:30,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,535 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:45:30,535 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-05 10:45:30,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:31,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:45:31,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:45:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:45:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:45:31,992 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:45:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:32,045 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:45:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:45:32,045 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:45:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:32,046 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:45:32,046 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:32,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:45:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:45:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:45:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:45:32,049 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:45:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:32,049 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:45:32,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:45:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:45:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:45:32,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:32,050 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:45:32,050 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:32,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-05 10:45:32,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:32,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:45:32,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:33,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:33,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:45:33,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:45:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:45:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:45:33,056 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:45:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:33,126 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:45:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:45:33,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:45:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:33,129 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:33,129 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:33,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:45:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:45:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:45:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:45:33,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:45:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:33,131 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:45:33,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:45:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:45:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:45:33,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:33,132 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:45:33,132 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-05 10:45:33,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:33,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:45:33,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:45:34,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:45:34,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:45:34,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:45:34,618 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:45:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,720 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:45:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:45:34,721 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:45:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,722 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:45:34,722 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:45:34,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:45:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:45:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:45:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:45:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:45:34,724 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:45:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,725 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:45:34,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:45:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:45:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:45:34,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,725 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:45:34,725 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,726 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-05 10:45:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:45:35,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:45:35,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:45:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:45:35,732 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:45:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,884 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:45:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:45:35,885 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:45:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,886 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:45:35,886 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:35,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:45:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:45:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:45:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:45:35,888 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:45:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,889 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:45:35,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:45:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:45:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:45:35,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,889 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:45:35,890 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-05 10:45:35,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:37,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:45:37,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:45:37,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:45:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:37,304 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:45:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,369 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:45:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:45:37,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:45:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,371 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:37,371 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:45:37,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:45:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:45:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:45:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:45:37,373 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:45:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,373 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:45:37,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:45:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:45:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:45:37,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,374 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:45:37,374 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-05 10:45:37,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:45:38,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:45:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:45:38,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:38,462 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:45:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,535 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:45:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:45:38,536 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:45:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,536 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:38,536 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:45:38,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:45:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:45:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:45:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:45:38,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:45:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,539 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:45:38,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:45:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:45:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:45:38,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,540 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:45:38,540 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-05 10:45:38,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:39,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:45:39,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:45:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:45:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:39,671 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:45:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,740 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:45:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:45:39,741 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:45:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,742 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:45:39,742 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:39,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:45:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:45:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:45:39,745 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:45:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,746 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:45:39,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:45:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:45:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:45:39,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,746 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:45:39,747 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-05 10:45:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:45:40,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:45:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:45:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:40,954 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:45:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:41,023 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:45:41,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:45:41,023 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:45:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:41,024 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:41,024 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:45:41,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:45:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:45:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:45:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:45:41,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:45:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:41,028 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:45:41,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:45:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:45:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:45:41,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:41,029 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:45:41,029 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-05 10:45:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:41,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:45:41,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:42,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:45:42,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:45:42,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:45:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:42,373 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:45:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,437 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:45:42,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:45:42,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:45:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,439 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:45:42,439 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:45:42,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:45:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:45:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:45:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:45:42,441 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:45:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,442 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:45:42,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:45:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:45:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:45:42,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,443 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:45:42,443 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-05 10:45:42,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:43,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:43,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:45:43,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:45:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:45:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:43,724 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:45:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,788 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:45:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:45:43,789 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:45:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,790 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:45:43,790 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:43,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:45:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:45:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:45:43,793 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:45:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,793 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:45:43,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:45:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:45:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:45:43,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,794 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:45:43,794 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:43,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,795 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-05 10:45:43,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:45:45,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:45:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:45:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:45,365 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:45:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,450 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:45:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:45:45,451 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:45:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,452 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:45,452 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:45:45,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:45:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:45:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:45:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:45:45,455 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:45:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,455 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:45:45,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:45:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:45:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:45:45,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,456 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:45:45,456 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-05 10:45:45,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:47,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:45:47,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:45:47,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:45:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:47,213 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:45:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,296 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:45:47,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:45:47,297 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:45:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,298 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:45:47,298 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:45:47,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:45:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:45:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:45:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:45:47,300 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:45:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,301 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:45:47,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:45:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:45:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:45:47,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,302 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:45:47,302 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-05 10:45:47,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:45:47,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:45:48,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:45:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:45:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:48,657 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:45:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:48,752 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:45:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:45:48,752 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:45:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:48,753 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:45:48,753 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:45:48,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:45:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:45:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:45:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:45:48,755 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:45:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:48,756 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:45:48,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:45:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:45:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:45:48,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:48,757 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:45:48,757 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-05 10:45:48,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:45:50,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:45:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:45:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:50,203 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:45:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,289 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:45:50,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:45:50,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:45:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,290 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:45:50,290 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:45:50,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:45:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:45:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:45:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:45:50,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:45:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,294 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:45:50,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:45:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:45:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:45:50,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,294 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:45:50,295 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2019-08-05 10:45:50,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:50,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:45:50,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:45:52,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:45:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:45:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:52,212 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:45:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:52,324 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:45:52,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:45:52,326 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:45:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:52,327 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:45:52,327 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:45:52,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:45:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:45:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:45:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:45:52,330 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:45:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:52,330 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:45:52,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:45:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:45:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:45:52,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:52,331 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:45:52,331 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2019-08-05 10:45:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:52,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:45:52,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:45:54,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:45:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:45:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:54,055 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:45:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:54,134 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:45:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:45:54,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:45:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:54,135 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:45:54,135 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:45:54,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:45:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:45:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:45:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:45:54,138 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:45:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:54,139 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:45:54,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:45:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:45:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:45:54,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:54,140 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:45:54,140 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2019-08-05 10:45:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:55,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:45:55,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:45:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:45:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:55,677 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:45:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:55,770 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:45:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:45:55,770 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:45:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:55,771 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:45:55,771 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:45:55,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:45:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:45:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:45:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:45:55,774 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:45:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:55,774 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:45:55,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:45:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:45:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:45:55,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:55,775 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:45:55,775 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2019-08-05 10:45:55,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:55,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:45:55,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:57,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:45:57,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:45:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:45:57,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:45:57,794 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:45:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:57,875 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:45:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:45:57,876 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:45:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:57,877 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:45:57,877 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:45:57,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:45:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:45:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:45:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:45:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:45:57,879 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:45:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:57,880 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:45:57,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:45:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:45:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:45:57,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:57,881 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:45:57,881 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2019-08-05 10:45:57,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:57,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:57,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:59,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:45:59,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:45:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:45:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:45:59,749 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:45:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:59,841 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:45:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:45:59,842 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:45:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:59,843 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:45:59,843 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:45:59,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:45:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:45:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:45:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:45:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:45:59,845 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:45:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:59,846 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:45:59,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:45:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:45:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:45:59,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:59,847 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:45:59,847 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:59,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2019-08-05 10:45:59,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:59,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:45:59,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:01,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:01,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:46:01,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:46:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:46:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:01,529 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:46:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:01,630 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:46:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:46:01,631 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:46:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:01,631 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:46:01,631 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:46:01,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:46:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:46:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:46:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:46:01,633 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:46:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:01,633 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:46:01,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:46:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:46:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:46:01,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:01,634 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:46:01,634 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2019-08-05 10:46:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:01,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:46:01,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:03,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:03,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:46:03,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:46:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:46:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:03,526 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:46:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,619 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:46:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:46:03,619 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:46:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,620 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:46:03,620 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:46:03,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:46:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:46:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:46:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:46:03,623 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:46:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,624 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:46:03,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:46:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:46:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:46:03,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,625 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:46:03,625 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2019-08-05 10:46:03,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:46:05,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:46:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:46:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:05,438 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:46:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:05,537 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:46:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:46:05,538 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:46:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:05,539 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:46:05,539 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:46:05,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:46:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:46:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:46:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:46:05,543 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:46:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:05,543 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:46:05,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:46:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:46:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:46:05,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:05,544 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:46:05,544 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2019-08-05 10:46:05,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:05,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:46:05,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:07,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:07,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:46:07,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:46:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:46:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:07,617 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:46:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:07,700 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:46:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:46:07,701 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:46:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:07,702 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:46:07,702 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:46:07,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:46:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:46:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:46:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:46:07,705 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:46:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:07,705 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:46:07,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:46:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:46:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:46:07,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:07,706 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:46:07,706 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2019-08-05 10:46:07,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:07,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:46:07,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:09,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:09,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:46:09,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:46:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:46:09,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:09,693 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:46:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,792 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:46:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:46:09,793 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:46:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,794 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:46:09,794 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:46:09,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:46:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:46:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:46:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:46:09,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:46:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,798 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:46:09,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:46:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:46:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:46:09,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,799 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:46:09,799 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2019-08-05 10:46:09,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:12,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:46:12,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:46:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:46:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:12,358 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:46:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,446 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:46:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:46:12,447 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:46:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,447 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:46:12,447 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:46:12,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:46:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:46:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:46:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:46:12,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:46:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,450 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:46:12,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:46:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:46:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:46:12,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,451 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:46:12,452 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2019-08-05 10:46:12,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:14,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:14,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:46:14,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:46:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:46:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:14,484 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:46:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:14,564 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:46:14,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:46:14,564 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:46:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:14,564 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:46:14,565 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:46:14,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:46:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:46:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:46:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:46:14,566 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:46:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:14,567 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:46:14,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:46:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:46:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:46:14,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:14,568 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:46:14,568 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2019-08-05 10:46:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:14,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:46:14,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:46:16,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:46:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:46:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:46:16,651 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:46:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:16,753 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:46:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:46:16,754 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:46:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:16,755 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:46:16,755 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:46:16,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:46:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:46:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:46:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:46:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:46:16,757 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:46:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:16,758 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:46:16,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:46:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:46:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:46:16,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:16,759 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:46:16,759 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2019-08-05 10:46:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:46:16,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:19,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:19,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:46:19,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:46:19,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:46:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:46:19,172 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:46:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,262 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:46:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:46:19,263 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:46:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,264 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:46:19,264 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:46:19,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:46:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:46:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:46:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:46:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:46:19,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:46:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,268 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:46:19,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:46:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:46:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:46:19,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,268 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:46:19,269 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2019-08-05 10:46:19,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:21,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:46:21,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:46:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:46:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:46:21,432 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:46:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,649 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:46:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:46:21,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:46:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,650 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:46:21,651 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:46:21,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:46:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:46:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:46:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:46:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:46:21,653 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:46:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,654 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:46:21,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:46:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:46:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:46:21,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,654 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:46:21,654 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2019-08-05 10:46:21,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:24,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:46:24,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:46:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:46:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:46:24,175 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:46:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:24,490 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:46:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:46:24,490 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:46:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:24,491 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:46:24,491 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:46:24,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:46:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:46:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:46:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:46:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:46:24,496 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:46:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:24,496 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:46:24,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:46:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:46:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:46:24,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:24,497 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:46:24,497 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2019-08-05 10:46:24,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:24,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:46:24,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:26,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:26,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:46:26,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:46:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:46:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:46:26,840 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:46:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,943 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:46:26,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:46:26,943 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:46:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,944 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:46:26,944 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:46:26,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:46:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:46:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:46:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:46:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:46:26,946 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:46:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,947 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:46:26,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:46:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:46:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:46:26,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,947 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:46:26,947 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2019-08-05 10:46:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:29,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:29,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:46:29,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:46:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:46:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:46:29,675 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:46:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:29,784 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:46:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:46:29,784 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:46:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:29,785 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:46:29,785 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:46:29,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:46:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:46:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:46:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:46:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:46:29,788 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:46:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:29,788 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:46:29,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:46:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:46:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:46:29,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:29,789 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:46:29,789 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2019-08-05 10:46:29,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:29,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:46:29,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:32,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:32,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:46:32,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:46:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:46:32,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:46:32,206 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:46:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:32,522 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:46:32,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:46:32,523 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:46:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:32,523 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:46:32,523 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:46:32,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:46:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:46:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:46:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:46:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:46:32,525 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:46:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:32,525 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:46:32,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:46:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:46:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:46:32,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:32,526 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:46:32,526 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2019-08-05 10:46:32,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:32,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:46:32,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:46:35,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:46:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:46:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:46:35,965 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:46:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:36,073 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:46:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:46:36,073 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:46:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:36,074 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:46:36,074 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:46:36,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:46:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:46:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:46:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:46:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:46:36,077 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:46:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:36,078 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:46:36,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:46:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:46:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:46:36,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:36,078 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:46:36,079 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2019-08-05 10:46:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:36,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:36,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:46:38,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:46:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:46:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:46:38,805 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:46:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:39,096 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:46:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:46:39,097 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:46:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:39,098 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:46:39,098 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:46:39,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:46:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:46:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:46:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:46:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:46:39,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:46:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:39,101 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:46:39,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:46:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:46:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:46:39,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:39,101 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:46:39,102 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2019-08-05 10:46:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:39,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:46:39,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:41,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:41,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:46:41,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:46:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:46:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:46:41,631 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:46:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:41,740 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:46:41,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:46:41,741 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:46:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:41,742 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:46:41,742 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:46:41,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:46:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:46:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:46:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:46:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:46:41,745 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:46:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:41,745 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:46:41,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:46:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:46:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:46:41,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:41,746 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:46:41,749 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2019-08-05 10:46:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:41,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:41,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:46:44,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:46:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:46:44,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:46:44,623 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:46:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:44,811 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:46:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:46:44,812 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:46:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:44,813 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:46:44,813 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:46:44,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:46:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:46:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:46:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:46:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:46:44,815 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:46:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:44,816 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:46:44,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:46:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:46:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:46:44,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:44,817 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:46:44,817 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2019-08-05 10:46:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:44,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:46:44,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:46:47,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:46:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:46:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:46:47,456 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:46:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:47,575 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:46:47,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:46:47,575 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:46:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:47,576 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:46:47,576 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:46:47,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:46:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:46:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:46:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:46:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:46:47,579 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:46:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:46:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:46:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:46:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:46:47,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:47,580 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:46:47,580 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2019-08-05 10:46:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:47,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:47,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:50,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:46:50,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:46:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:46:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:46:50,644 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:46:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:50,745 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:46:50,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:46:50,745 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:46:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:50,746 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:46:50,746 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:46:50,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:46:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:46:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:46:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:46:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:46:50,748 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:46:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:50,749 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:46:50,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:46:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:46:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:46:50,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:50,749 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:46:50,750 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2019-08-05 10:46:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:50,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:46:50,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:46:53,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:46:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:46:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:46:53,815 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:46:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:53,931 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:46:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:46:53,931 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:46:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:53,932 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:46:53,932 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:46:53,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:46:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:46:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:46:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:46:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:46:53,935 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:46:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:53,935 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:46:53,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:46:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:46:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:46:53,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:53,936 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:46:53,936 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2019-08-05 10:46:53,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:53,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:53,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:56,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:56,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:46:56,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:46:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:46:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:46:56,718 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:46:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:57,906 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:46:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:46:57,906 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:46:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:57,906 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:46:57,906 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:46:57,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:46:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:46:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:46:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:46:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:46:57,908 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:46:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:57,908 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:46:57,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:46:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:46:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:46:57,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:57,909 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:46:57,909 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2019-08-05 10:46:57,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:57,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:46:57,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:01,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:01,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:47:01,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:47:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:47:01,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:47:01,104 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:47:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:01,217 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:47:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:47:01,217 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:47:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:01,218 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:47:01,219 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:47:01,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:47:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:47:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:47:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:47:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:47:01,221 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:47:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:01,221 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:47:01,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:47:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:47:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:47:01,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:01,222 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:47:01,223 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2019-08-05 10:47:01,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:01,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:01,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:04,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:04,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:47:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:47:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:47:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:47:04,366 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:47:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,480 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:47:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:47:04,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:47:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,481 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:47:04,482 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:47:04,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:47:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:47:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:47:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:47:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:47:04,484 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:47:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,484 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:47:04,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:47:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:47:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:47:04,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,487 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:47:04,487 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2019-08-05 10:47:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:07,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:47:07,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:47:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:47:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:47:07,453 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:47:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:07,581 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:47:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:47:07,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:47:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:07,582 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:47:07,582 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:47:07,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:47:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:47:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:47:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:47:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:47:07,585 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:47:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:07,585 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:47:07,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:47:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:47:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:47:07,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:07,586 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:47:07,586 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2019-08-05 10:47:07,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:07,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:07,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:47:10,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:47:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:47:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:47:10,967 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:47:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:11,081 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:47:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:47:11,082 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:47:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:11,083 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:47:11,083 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:47:11,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:47:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:47:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:47:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:47:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:47:11,086 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:47:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:11,087 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:47:11,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:47:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:47:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:47:11,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:11,087 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:47:11,088 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2019-08-05 10:47:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:11,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:47:11,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:15,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:47:15,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:47:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:47:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:47:15,011 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:47:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,146 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:47:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:47:15,147 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:47:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,148 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:47:15,148 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:47:15,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:47:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:47:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:47:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:47:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:47:15,151 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:47:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,151 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:47:15,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:47:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:47:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:47:15,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,152 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:47:15,152 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2019-08-05 10:47:15,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:18,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:47:18,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:47:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:47:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:47:18,519 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:47:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:18,712 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:47:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:47:18,712 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:47:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:18,713 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:47:18,713 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:47:18,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:47:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:47:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:47:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:47:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:47:18,714 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:47:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:18,715 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:47:18,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:47:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:47:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:47:18,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:18,716 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:47:18,716 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2019-08-05 10:47:18,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:18,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:47:18,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:21,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:21,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:47:21,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:47:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:47:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:47:21,941 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:47:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,070 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:47:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:47:22,071 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:47:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,072 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:47:22,072 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:47:22,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:47:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:47:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:47:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:47:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:47:22,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:47:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,075 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:47:22,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:47:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:47:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:47:22,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,076 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:47:22,076 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2019-08-05 10:47:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:25,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:47:25,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:47:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:47:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:47:25,618 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:47:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:25,927 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:47:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:47:25,927 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:47:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:25,928 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:47:25,929 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:47:25,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:47:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:47:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:47:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:47:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:47:25,931 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:47:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:25,931 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:47:25,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:47:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:47:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:47:25,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:25,932 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:47:25,932 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2019-08-05 10:47:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:25,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:47:25,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:29,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:29,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:47:29,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:47:29,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:47:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:47:29,615 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:47:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:29,740 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:47:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:47:29,740 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:47:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:29,741 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:47:29,741 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:47:29,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:47:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:47:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:47:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:47:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:47:29,744 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:47:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:29,744 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:47:29,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:47:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:47:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:47:29,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:29,745 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:47:29,745 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2019-08-05 10:47:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:29,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:29,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:33,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:33,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:47:33,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:47:33,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:47:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:47:33,240 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:47:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,391 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:47:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:47:33,391 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:47:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,392 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:47:33,392 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:47:33,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:47:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:47:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:47:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:47:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:47:33,395 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:47:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,395 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:47:33,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:47:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:47:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:47:33,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,396 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:47:33,396 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2019-08-05 10:47:33,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:37,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:47:37,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:47:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:47:37,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:47:37,278 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:47:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,417 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:47:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:47:37,418 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:47:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,419 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:47:37,419 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:47:37,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:47:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:47:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:47:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:47:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:47:37,422 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:47:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,422 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:47:37,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:47:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:47:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:47:37,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,423 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:47:37,424 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2019-08-05 10:47:37,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:41,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:47:41,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:47:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:47:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:47:41,292 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:47:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,473 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:47:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:47:41,474 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:47:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,475 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:47:41,475 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:47:41,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:47:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:47:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:47:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:47:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:47:41,478 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:47:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,478 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:47:41,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:47:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:47:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:47:41,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,479 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:47:41,480 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2019-08-05 10:47:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:45,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:47:45,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:47:45,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:47:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:47:45,334 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:47:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,540 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:47:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:47:45,541 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:47:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,542 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:47:45,542 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:47:45,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:47:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:47:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:47:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:47:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:47:45,546 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:47:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,546 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:47:45,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:47:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:47:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:47:45,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,547 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:47:45,547 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2019-08-05 10:47:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:49,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:47:49,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:47:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:47:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:47:49,724 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:47:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:49,891 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:47:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:47:49,892 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:47:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:49,893 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:47:49,893 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:47:49,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:47:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:47:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:47:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:47:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:47:49,896 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:47:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:49,896 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:47:49,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:47:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:47:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:47:49,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:49,897 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:47:49,897 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2019-08-05 10:47:49,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:54,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:47:54,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:47:54,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:47:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:47:54,153 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:47:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,450 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:47:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:47:54,450 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:47:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,450 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:47:54,451 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:47:54,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:47:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:47:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:47:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:47:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:47:54,453 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:47:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,453 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:47:54,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:47:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:47:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:47:54,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,454 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:47:54,454 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2019-08-05 10:47:54,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:58,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:47:58,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:47:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:47:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:47:58,369 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:47:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:58,523 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:47:58,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:47:58,524 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:47:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:58,525 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:47:58,525 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:47:58,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:47:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:47:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:47:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:47:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:47:58,528 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:47:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:58,528 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:47:58,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:47:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:47:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:47:58,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:58,529 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:47:58,529 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2019-08-05 10:47:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:58,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:47:58,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:02,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:48:02,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:48:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:48:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:48:02,507 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:48:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,675 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:48:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:48:02,675 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:48:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,676 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:48:02,676 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:48:02,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:48:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:48:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:48:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:48:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:48:02,679 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:48:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,680 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:48:02,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:48:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:48:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:48:02,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,680 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:48:02,681 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2019-08-05 10:48:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:48:07,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:48:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:48:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:48:07,028 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:48:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:07,195 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:48:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:48:07,196 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:48:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:07,196 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:48:07,197 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:48:07,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:48:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:48:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:48:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:48:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:48:07,200 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:48:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:07,201 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:48:07,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:48:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:48:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:48:07,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:07,201 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:48:07,202 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2019-08-05 10:48:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:07,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:48:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:11,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:11,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:48:11,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:48:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:48:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:48:11,593 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:48:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:11,771 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:48:11,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:48:11,771 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:48:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:11,772 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:48:11,772 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:48:11,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:48:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:48:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:48:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:48:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:48:11,775 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:48:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:11,775 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:48:11,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:48:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:48:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:48:11,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:11,776 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:48:11,776 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2019-08-05 10:48:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:11,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:48:11,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:16,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:16,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:48:16,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:48:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:48:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:48:16,262 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:48:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,454 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:48:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:48:16,455 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:48:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,455 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:48:16,455 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:48:16,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:48:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:48:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:48:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:48:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:48:16,458 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:48:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,459 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:48:16,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:48:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:48:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:48:16,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,460 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:48:16,460 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2019-08-05 10:48:16,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:48:21,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:48:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:48:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:48:21,024 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:48:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,173 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:48:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:48:21,173 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:48:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,174 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:48:21,174 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:48:21,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:48:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:48:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:48:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:48:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:48:21,177 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:48:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,177 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:48:21,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:48:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:48:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:48:21,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,178 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:48:21,178 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2019-08-05 10:48:21,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:25,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:48:25,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:48:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:48:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:48:25,761 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:48:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,924 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:48:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:48:25,924 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:48:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,925 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:48:25,925 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:48:25,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:48:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:48:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:48:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:48:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:48:25,928 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:48:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,928 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:48:25,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:48:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:48:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:48:25,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,929 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:48:25,929 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2019-08-05 10:48:25,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:48:30,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:48:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:48:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:48:30,677 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:48:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:30,897 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:48:30,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:48:30,898 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:48:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:30,899 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:48:30,899 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:48:30,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:48:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:48:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:48:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:48:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:48:30,900 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:48:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:30,900 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:48:30,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:48:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:48:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:48:30,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:30,901 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:48:30,901 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:30,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2019-08-05 10:48:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:48:30,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:35,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:35,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:48:35,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:48:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:48:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:48:35,621 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:48:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,794 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:48:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:48:35,794 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:48:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,795 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:48:35,795 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:48:35,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:48:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:48:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:48:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:48:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:48:35,798 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:48:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,799 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:48:35,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:48:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:48:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:48:35,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,799 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:48:35,800 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2019-08-05 10:48:35,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:40,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:48:40,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:48:40,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:48:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:48:40,272 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:48:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:40,576 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:48:40,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:48:40,576 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:48:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:40,577 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:48:40,577 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:48:40,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:48:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:48:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:48:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:48:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:48:40,580 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:48:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:40,580 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:48:40,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:48:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:48:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:48:40,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:40,581 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:48:40,581 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2019-08-05 10:48:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:40,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:48:40,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:45,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:48:45,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:48:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:48:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:48:45,101 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:48:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,306 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:48:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:48:45,307 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:48:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,307 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:48:45,308 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:48:45,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:48:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:48:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:48:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:48:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:48:45,310 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:48:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,310 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:48:45,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:48:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:48:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:48:45,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,311 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:48:45,311 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2019-08-05 10:48:45,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:50,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:50,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:48:50,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:48:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:48:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:48:50,145 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:48:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:50,391 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:48:50,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:48:50,392 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:48:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:50,392 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:48:50,393 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:48:50,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:48:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:48:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:48:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:48:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:48:50,395 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:48:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:50,395 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:48:50,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:48:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:48:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:48:50,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:50,397 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:48:50,397 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -204943256, now seen corresponding path program 117 times [2019-08-05 10:48:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:50,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:48:50,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:55,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:48:55,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:48:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:48:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:48:55,462 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:48:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:55,676 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:48:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:48:55,676 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:48:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:55,676 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:48:55,677 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:48:55,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:48:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:48:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:48:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:48:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:48:55,679 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:48:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:55,679 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:48:55,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:48:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:48:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:48:55,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:55,680 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:48:55,681 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2058275615, now seen corresponding path program 118 times [2019-08-05 10:48:55,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:55,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:48:55,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:00,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-08-05 10:49:00,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-08-05 10:49:00,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-08-05 10:49:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:49:00,713 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2019-08-05 10:49:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:00,972 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:49:00,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-08-05 10:49:00,972 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2019-08-05 10:49:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:00,972 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:49:00,973 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:49:00,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:49:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:49:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:49:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:49:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:49:00,974 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2019-08-05 10:49:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:00,975 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:49:00,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-08-05 10:49:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:49:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:49:00,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:00,975 INFO L399 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2019-08-05 10:49:00,976 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash 617963400, now seen corresponding path program 119 times [2019-08-05 10:49:00,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:00,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:49:00,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:49:01,835 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:49:01,836 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:49:01,840 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:49:01,840 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:49:01 BoogieIcfgContainer [2019-08-05 10:49:01,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:49:01,843 INFO L168 Benchmark]: Toolchain (without parser) took 241955.58 ms. Allocated memory was 134.7 MB in the beginning and 808.5 MB in the end (delta: 673.7 MB). Free memory was 112.2 MB in the beginning and 636.8 MB in the end (delta: -524.5 MB). Peak memory consumption was 149.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,843 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.32 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 134.7 MB. Free memory was 112.0 MB in the beginning and 110.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,844 INFO L168 Benchmark]: Boogie Preprocessor took 21.82 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,845 INFO L168 Benchmark]: RCFGBuilder took 321.64 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,846 INFO L168 Benchmark]: TraceAbstraction took 241572.42 ms. Allocated memory was 134.7 MB in the beginning and 808.5 MB in the end (delta: 673.7 MB). Free memory was 100.2 MB in the beginning and 636.8 MB in the end (delta: -536.6 MB). Peak memory consumption was 137.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:01,848 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.32 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 134.7 MB. Free memory was 112.0 MB in the beginning and 110.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.82 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.64 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241572.42 ms. Allocated memory was 134.7 MB in the beginning and 808.5 MB in the end (delta: 673.7 MB). Free memory was 100.2 MB in the beginning and 636.8 MB in the end (delta: -536.6 MB). Peak memory consumption was 137.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 119,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 241.5s OverallTime, 120 OverallIterations, 119 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 357 SDtfs, 0 SDslu, 1986 SDs, 0 SdLazy, 9245 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7259 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 221.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=119, 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.2s AutomataMinimizationTime, 119 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 223.8s InterpolantComputationTime, 7378 NumberOfCodeBlocks, 7378 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 7259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1735139 SizeOfPredicates, 119 NumberOfNonLiveVariables, 22610 ConjunctsInSsa, 7259 ConjunctsInUnsatCore, 119 InterpolantComputations, 1 PerfectInterpolantSequences, 0/280840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown