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/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:47:36,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:47:36,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:47:36,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:47:36,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:47:36,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:47:36,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:47:36,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:47:36,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:47:36,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:47:36,890 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:47:36,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:47:36,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:47:36,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:47:36,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:47:36,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:47:36,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:47:36,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:47:36,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:47:36,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:47:36,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:47:36,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:47:36,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:47:36,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:47:36,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:47:36,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:47:36,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:47:36,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:47:36,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:47:36,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:47:36,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:47:36,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:47:36,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:47:36,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:47:36,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:47:36,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:47:36,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:47:36,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:47:36,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:47:36,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:47:36,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:47:36,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:47:36,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:47:36,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:47:36,985 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:47:36,986 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:47:36,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2019-08-05 10:47:36,987 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl' [2019-08-05 10:47:37,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:47:37,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:47:37,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:37,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:47:37,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:47:37,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:37,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:47:37,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:47:37,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:47:37,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/1) ... [2019-08-05 10:47:37,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:47:37,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:47:37,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:47:37,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:47:37,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (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:47:37,145 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:47:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:47:37,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:47:37,360 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:47:37,361 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:47:37,363 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:37 BoogieIcfgContainer [2019-08-05 10:47:37,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:47:37,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:47:37,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:47:37,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:47:37,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:37" (1/2) ... [2019-08-05 10:47:37,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abe172a and model type overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:47:37, skipping insertion in model container [2019-08-05 10:47:37,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:37" (2/2) ... [2019-08-05 10:47:37,373 INFO L109 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2019-08-05 10:47:37,382 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:47:37,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:47:37,406 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:47:37,429 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:47:37,430 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:47:37,430 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:47:37,430 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:47:37,430 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:47:37,430 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:47:37,431 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:47:37,431 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:47:37,431 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:47:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:47:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:47:37,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:47:37,455 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-05 10:47:37,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,593 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:47:37,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:37,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:47:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:47:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:47:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:47:37,618 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:47:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,651 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:47:37,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:47:37,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:47:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,665 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:47:37,665 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:47:37,667 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:47:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:47:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:47:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:47:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:47:37,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:47:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,701 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:47:37,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:47:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:47:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:47:37,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:47:37,703 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-05 10:47:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,816 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:47:37,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:47:37,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:47:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:47:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:37,819 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:47:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,884 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:47:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:47:37,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:47:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,887 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:47:37,887 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:47:37,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:47:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:47:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:47:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:47:37,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:47:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,893 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:47:37,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:47:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:47:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:47:37,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,895 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:47:37,895 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,899 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-05 10:47:37,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,057 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:47:38,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:47:38,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:47:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:47:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:38,059 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:47:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,121 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:47:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:47:38,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:47:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,122 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:47:38,122 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:47:38,123 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:47:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:47:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:47:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:47:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:47:38,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:47:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,128 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:47:38,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:47:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:47:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:47:38,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,129 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:47:38,129 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-05 10:47:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,251 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:47:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:38,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:38,253 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:47:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,289 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:47:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:38,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:47:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,291 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:47:38,291 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:47:38,292 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:47:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:47:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:47:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:47:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:47:38,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:47:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,295 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:47:38,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:47:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:47:38,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,296 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:47:38,297 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-05 10:47:38,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,520 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:47:38,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:47:38,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:47:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:47:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:38,522 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:47:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,646 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:47:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:47:38,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:47:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,647 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:47:38,648 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:47:38,648 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:47:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:47:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:47:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:47:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:47:38,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:47:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,651 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:47:38,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:47:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:47:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:47:38,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,652 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:47:38,652 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-05 10:47:38,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,799 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:47:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:38,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:38,801 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:47:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,888 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:47:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:38,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:47:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,890 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:47:38,890 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:47:38,890 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:47:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:47:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:47:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:47:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:47:38,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:47:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,893 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:47:38,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:47:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:47:38,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,894 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:47:38,894 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-05 10:47:38,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,143 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:47:39,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:47:39,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:47:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:47:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:39,145 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:47:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,175 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:47:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:47:39,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:47:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,176 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:47:39,176 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:47:39,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:47:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:47:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:47:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:47:39,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:47:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,180 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:47:39,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:47:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:47:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:47:39,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,181 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:47:39,181 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-05 10:47:39,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,341 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:47:39,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:39,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:39,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:39,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:39,345 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:47:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,390 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:47:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:39,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:47:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,391 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:47:39,392 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:47:39,392 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:47:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:47:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:47:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:47:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:47:39,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:47:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,395 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:47:39,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:47:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:47:39,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,396 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:47:39,397 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-05 10:47:39,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,878 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:47:39,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:47:39,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:47:39,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:47:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:39,880 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:47:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,918 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:47:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:47:39,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:47:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,920 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:39,920 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:39,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:47:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:47:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:47:39,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:47:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,924 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:47:39,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:47:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:47:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:47:39,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,924 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:47:39,925 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-05 10:47:39,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,148 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:47:40,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:40,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:40,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:40,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:40,151 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:47:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,197 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:47:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:40,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:47:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,199 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:47:40,199 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:47:40,200 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:47:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:47:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:47:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:47:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:47:40,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:47:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,204 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:47:40,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:47:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:47:40,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,204 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:47:40,205 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-05 10:47:40,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,413 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:47:40,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:47:40,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:47:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:47:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:40,416 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:47:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,456 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:47:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:47:40,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:47:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,457 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:47:40,457 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:47:40,458 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:47:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:47:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:47:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:47:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:47:40,461 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:47:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,462 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:47:40,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:47:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:47:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:47:40,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,462 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:47:40,463 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-05 10:47:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,709 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:47:40,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:47:40,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:47:40,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:47:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:40,712 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:47:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,809 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:47:40,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:40,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:47:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,810 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:47:40,811 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:40,811 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:47:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:47:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:47:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:47:40,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:47:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,815 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:47:40,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:47:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:47:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:47:40,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,816 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:47:40,816 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-05 10:47:40,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,103 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:47:41,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:47:41,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:47:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:47:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:41,105 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:47:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,136 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:47:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:47:41,137 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:47:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,137 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:47:41,138 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:47:41,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:47:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:47:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:47:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:47:41,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:47:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,141 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:47:41,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:47:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:47:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:47:41,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,142 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:47:41,142 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-05 10:47:41,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,468 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:47:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:47:41,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:47:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:47:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:41,470 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:47:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,497 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:47:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:41,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:47:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,499 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:47:41,499 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:47:41,500 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:47:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:47:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:47:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:47:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:47:41,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:47:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,503 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:47:41,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:47:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:47:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:47:41,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,504 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:47:41,504 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-05 10:47:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,739 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:47:41,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:47:41,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:47:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:47:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:41,742 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:47:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,840 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:47:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:47:41,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:47:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,841 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:47:41,841 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:41,847 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:47:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:47:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:47:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:47:41,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:47:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,851 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:47:41,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:47:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:47:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:47:41,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,852 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:47:41,852 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-05 10:47:41,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,287 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:47:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:47:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:47:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:47:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:42,289 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:47:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,336 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:47:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:42,336 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:47:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,337 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:47:42,337 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:47:42,338 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:47:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:47:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:47:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:47:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:47:42,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:47:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:47:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:47:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:47:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:47:42,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,343 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:47:42,343 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-05 10:47:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,591 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:47:42,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:47:42,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:47:42,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:47:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:42,593 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:47:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,638 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:47:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:47:42,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:47:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,639 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:47:42,639 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:47:42,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:47:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:47:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:47:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:47:42,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:47:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,643 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:47:42,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:47:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:47:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:47:42,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,643 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:47:42,644 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-05 10:47:42,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:43,204 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:47:43,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:43,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:47:43,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:47:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:47:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:43,211 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:47:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,243 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:47:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:47:43,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:47:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,251 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:47:43,251 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:47:43,252 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:47:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:47:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:47:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:47:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:47:43,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:47:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,255 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:47:43,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:47:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:47:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:47:43,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,258 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:47:43,258 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-05 10:47:43,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:43,662 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:47:43,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:43,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:47:43,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:47:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:47:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:43,664 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:47:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,716 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:47:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:47:43,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:47:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,718 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:47:43,718 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:47:43,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:47:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:47:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:47:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:47:43,722 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:47:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,722 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:47:43,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:47:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:47:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:47:43,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,724 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:47:43,724 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-05 10:47:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,207 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:47:44,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:47:44,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:47:44,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:47:44,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:47:44,209 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:47:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,248 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:47:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:47:44,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:47:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,249 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:47:44,249 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:47:44,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:47:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:47:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:47:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:47:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:47:44,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:47:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,254 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:47:44,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:47:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:47:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:47:44,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,255 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:47:44,255 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-05 10:47:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,588 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:47:44,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:47:44,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:47:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:47:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:44,589 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:47:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,623 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:47:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:47:44,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:47:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,625 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:47:44,625 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:47:44,626 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:47:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:47:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:47:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:47:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:47:44,628 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:47:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:47:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:47:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:47:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:47:44,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,630 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:47:44,630 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-05 10:47:44,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,984 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:47:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:44,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:47:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:47:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:47:44,985 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:47:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,027 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:47:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:47:45,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:47:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,030 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:47:45,030 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:47:45,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:47:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:47:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:47:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:47:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:47:45,033 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:47:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,033 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:47:45,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:47:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:47:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:45,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,034 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:47:45,034 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-05 10:47:45,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,393 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:47:45,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:45,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:45,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:45,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:45,394 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:47:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,448 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:47:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:45,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,449 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:47:45,449 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:47:45,450 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:47:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:47:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:47:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:47:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:47:45,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:47:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,453 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:47:45,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:47:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:45,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,454 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:47:45,455 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-05 10:47:45,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,779 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:47:45,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:45,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:45,782 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:47:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,849 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:47:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:45,855 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,856 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:47:45,856 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:47:45,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:47:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:47:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:47:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:47:45,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:47:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,860 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:47:45,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:47:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:45,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,861 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:47:45,861 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-05 10:47:45,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:46,835 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:47:46,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:46,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:47:46,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:46,837 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:47:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:46,891 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:47:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:46,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:46,892 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:47:46,892 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:47:46,893 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:47:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:47:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:47:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:47:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:47:46,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:47:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:47:46,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:47:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:47:46,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:46,898 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:47:46,898 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-05 10:47:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:46,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:47:46,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:47,436 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:47:47,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:47,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:47:47,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:47:47,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:47:47,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:47,437 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:47:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:47,497 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:47:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:47:47,498 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:47:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:47,498 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:47:47,498 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:47:47,499 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:47:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:47:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:47:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:47:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:47:47,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:47:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:47,502 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:47:47,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:47:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:47:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:47:47,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:47,503 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:47:47,503 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-05 10:47:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:47,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:47:47,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:48,472 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:47:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:47:48,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:47:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:47:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:48,474 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:47:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:48,563 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:47:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:47:48,564 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:47:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:48,564 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:47:48,564 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:47:48,565 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:47:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:47:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:47:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:47:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:47:48,567 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:47:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:48,567 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:47:48,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:47:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:47:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:47:48,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:48,569 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:47:48,569 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-05 10:47:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:48,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:47:48,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:48,999 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:47:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:47:49,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:47:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:47:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:47:49,001 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:47:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:49,059 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:47:49,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:47:49,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:47:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:49,060 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:47:49,060 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:47:49,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:47:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:47:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:47:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:47:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:47:49,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:47:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:49,064 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:47:49,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:47:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:47:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:47:49,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:49,064 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:47:49,065 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-05 10:47:49,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:49,475 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:47:49,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:47:49,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:47:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:47:49,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:47:49,476 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:47:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:49,534 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:47:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:47:49,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:47:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:49,535 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:47:49,535 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:47:49,536 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:47:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:47:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:47:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:47:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:47:49,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:47:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:49,541 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:47:49,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:47:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:47:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:47:49,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:49,542 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:47:49,542 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-05 10:47:49,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:50,076 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:47:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:47:50,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:47:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:47:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:47:50,078 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:47:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:50,175 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:47:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:47:50,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:47:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:50,176 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:47:50,176 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:47:50,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:47:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:47:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:47:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:47:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:47:50,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:47:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:50,180 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:47:50,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:47:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:47:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:47:50,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:50,181 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:47:50,182 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-05 10:47:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:50,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:47:50,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:50,593 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:47:50,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:50,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:47:50,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:47:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:47:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:47:50,596 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:47:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:50,647 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:47:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:47:50,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:47:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:50,648 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:47:50,648 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:47:50,649 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:47:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:47:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:47:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:47:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:47:50,651 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:47:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:50,652 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:47:50,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:47:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:47:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:47:50,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:50,652 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:47:50,652 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-05 10:47:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:50,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:47:50,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:51,301 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:47:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:51,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:47:51,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:47:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:47:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:47:51,303 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:47:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,361 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:47:51,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:47:51,362 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:47:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,362 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:47:51,362 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:47:51,363 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:47:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:47:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:47:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:47:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:47:51,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:47:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,370 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:47:51,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:47:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:47:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:47:51,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,371 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:47:51,371 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-05 10:47:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:51,848 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:47:51,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:51,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:47:51,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:47:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:47:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:47:51,850 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:47:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,890 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:47:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:47:51,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:47:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,891 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:47:51,891 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:47:51,893 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:47:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:47:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:47:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:47:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:47:51,895 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:47:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,896 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:47:51,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:47:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:47:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:47:51,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,896 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:47:51,897 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-05 10:47:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:52,498 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:47:52,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:52,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:47:52,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:47:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:47:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:47:52,500 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:47:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:52,544 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:47:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:47:52,544 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:47:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:52,545 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:47:52,545 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:47:52,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:47:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:47:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:47:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:47:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:47:52,548 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:47:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:52,548 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:47:52,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:47:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:47:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:47:52,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:52,549 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:47:52,549 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-05 10:47:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:52,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:47:52,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,678 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:47:53,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:47:53,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:47:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:47:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:47:53,680 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:47:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,720 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:47:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:47:53,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:47:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,722 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:47:53,722 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:47:53,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:47:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:47:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:47:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:47:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:47:53,725 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:47:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,725 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:47:53,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:47:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:47:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:47:53,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,726 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:47:53,726 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-05 10:47:53,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,585 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:47:54,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:47:54,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:47:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:47:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:47:54,587 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:47:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,651 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:47:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:47:54,651 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:47:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,652 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:47:54,652 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:47:54,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:47:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:47:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:47:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:47:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:47:54,655 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:47:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,655 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:47:54,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:47:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:47:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:47:54,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,656 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:47:54,656 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-05 10:47:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,246 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:47:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:47:56,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:47:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:47:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:47:56,249 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:47:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,291 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:47:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:47:56,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:47:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,292 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:47:56,292 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:47:56,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:47:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:47:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:47:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:47:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:47:56,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:47:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,296 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:47:56,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:47:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:47:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:47:56,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,297 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:47:56,297 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-05 10:47:56,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,005 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:47:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:47:57,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:47:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:47:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:47:57,006 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:47:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,077 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:47:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:47:57,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:47:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,078 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:47:57,078 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:47:57,079 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:47:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:47:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:47:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:47:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:47:57,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:47:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,081 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:47:57,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:47:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:47:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:47:57,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,082 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:47:57,083 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-05 10:47:57,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,681 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:47:57,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:47:57,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:47:57,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:47:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:47:57,683 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:47:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,736 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:47:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:47:57,736 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:47:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,737 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:47:57,737 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:47:57,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:47:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:47:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:47:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:47:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:47:57,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:47:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,740 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:47:57,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:47:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:47:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:47:57,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,741 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:47:57,741 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-05 10:47:57,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:58,403 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:47:58,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:58,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:47:58,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:47:58,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:47:58,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:47:58,405 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:47:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:58,458 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:47:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:47:58,459 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:47:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:58,459 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:47:58,459 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:47:58,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:47:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:47:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:47:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:47:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:47:58,463 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:47:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:58,463 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:47:58,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:47:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:47:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:47:58,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:58,464 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:47:58,464 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-05 10:47:58,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:58,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:47:58,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:59,295 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:47:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:47:59,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:47:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:47:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:47:59,297 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:47:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,409 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:47:59,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:47:59,409 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:47:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,410 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:47:59,410 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:47:59,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:47:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:47:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:47:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:47:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:47:59,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:47:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,414 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:47:59,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:47:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:47:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:47:59,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,414 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:47:59,415 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-05 10:47:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,288 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:48:00,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:48:00,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:48:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:48:00,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:00,290 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:48:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:00,348 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:48:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:00,348 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:48:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:00,349 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:48:00,349 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:00,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:48:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:48:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:48:00,352 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:48:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:00,352 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:48:00,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:48:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:48:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:48:00,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:00,353 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:48:00,353 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-05 10:48:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:01,338 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:48:01,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:01,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:48:01,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:48:01,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:48:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:01,340 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:48:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:01,395 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:48:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:48:01,396 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:48:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:01,396 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:48:01,396 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:48:01,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:48:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:48:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:48:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:48:01,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:48:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:01,400 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:48:01,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:48:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:48:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:48:01,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:01,401 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:48:01,401 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-05 10:48:01,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:01,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:48:01,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,145 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:48:02,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:48:02,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:48:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:48:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:02,147 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:48:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,226 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:48:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:02,227 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:48:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,228 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:48:02,228 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:48:02,229 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:48:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:48:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:48:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:48:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:48:02,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:48:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,231 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:48:02,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:48:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:48:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:48:02,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,232 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:48:02,232 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-05 10:48:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:03,142 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:48:03,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:03,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:48:03,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:48:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:48:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:03,143 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:48:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:03,218 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:48:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:48:03,219 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:48:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:03,220 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:48:03,220 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:48:03,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:48:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:48:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:48:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:48:03,224 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:48:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:03,224 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:48:03,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:48:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:48:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:48:03,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:03,225 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:48:03,225 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-05 10:48:03,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:03,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:48:03,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:04,406 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:48:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:48:04,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:48:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:48:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:04,408 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:48:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,684 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:48:04,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:48:04,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:48:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,685 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:48:04,685 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:48:04,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:48:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:48:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:48:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:48:04,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:48:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,687 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:48:04,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:48:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:48:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:48:04,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,688 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:48:04,688 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-05 10:48:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:05,603 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:48:05,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:05,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:48:05,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:48:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:48:05,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:05,605 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:48:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:05,668 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:48:05,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:48:05,675 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:48:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:05,676 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:48:05,676 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:48:05,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:48:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:48:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:48:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:48:05,678 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:48:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:05,679 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:48:05,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:48:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:48:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:48:05,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:05,679 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:48:05,679 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-05 10:48:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:05,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:48:05,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,610 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:48:06,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:48:06,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:48:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:48:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:06,611 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:48:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,669 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:48:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:48:06,670 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:48:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,671 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:48:06,671 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:48:06,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:48:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:48:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:48:06,675 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:48:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,675 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:48:06,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:48:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:48:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:48:06,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,676 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:48:06,676 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-05 10:48:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:07,599 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:48:07,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:07,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:48:07,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:48:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:48:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:07,601 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:48:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:07,675 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:48:07,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:48:07,676 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:48:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:07,677 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:48:07,677 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:48:07,678 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:48:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:48:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:48:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:48:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:48:07,680 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:48:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:07,681 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:48:07,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:48:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:48:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:48:07,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:07,681 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:48:07,682 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-05 10:48:07,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:07,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:48:07,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:08,674 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:48:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:48:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:48:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:48:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:48:08,675 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:48:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:08,733 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:48:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:48:08,733 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:48:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:08,734 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:48:08,734 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:48:08,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:48:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:48:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:48:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:48:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:48:08,738 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:48:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:08,738 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:48:08,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:48:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:48:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:48:08,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:08,739 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:48:08,739 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-05 10:48:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:08,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:48:08,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,133 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:48:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:48:10,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:48:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:48:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:48:10,135 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:48:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:10,215 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:48:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:48:10,216 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:48:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:10,217 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:48:10,217 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:48:10,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:48:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:48:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:48:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:48:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:48:10,219 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:48:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:10,219 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:48:10,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:48:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:48:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:48:10,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:10,220 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:48:10,220 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-05 10:48:10,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:48:10,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:11,952 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:48:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:48:11,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:48:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:48:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:48:11,954 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:48:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:12,061 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:48:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:48:12,061 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:48:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:12,062 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:48:12,062 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:48:12,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:48:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:48:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:48:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:48:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:48:12,065 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:48:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:12,066 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:48:12,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:48:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:48:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:48:12,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:12,066 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:48:12,066 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-05 10:48:12,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:12,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:48:12,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:13,074 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:48:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:48:13,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:48:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:48:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:48:13,076 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:48:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:13,154 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:48:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:48:13,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:48:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:13,155 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:48:13,156 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:48:13,157 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:48:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:48:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:48:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:48:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:48:13,159 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:48:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:13,160 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:48:13,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:48:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:48:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:48:13,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:13,160 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:48:13,161 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:13,161 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-05 10:48:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:13,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:48:13,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:14,370 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:48:14,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:14,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:48:14,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:48:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:48:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:14,372 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:48:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:14,440 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:48:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:48:14,441 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:48:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:14,442 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:48:14,442 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:48:14,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:48:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:48:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:48:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:48:14,445 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:48:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:14,445 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:48:14,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:48:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:48:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:48:14,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:14,445 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:48:14,446 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-05 10:48:14,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:14,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:48:14,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,901 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:48:15,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:48:15,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:48:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:48:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:48:15,903 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:48:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:15,986 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:48:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:48:15,986 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:48:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:15,987 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:48:15,987 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:48:15,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:48:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:48:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:48:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:48:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:48:15,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:48:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:15,990 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:48:15,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:48:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:48:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:48:15,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:15,991 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:48:15,991 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-05 10:48:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,116 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:48:17,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:48:17,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:48:17,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:48:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:48:17,118 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:48:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:17,208 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:48:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:48:17,209 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:48:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:17,210 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:48:17,210 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:48:17,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:48:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:48:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:48:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:48:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:48:17,214 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:48:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:17,215 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:48:17,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:48:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:48:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:48:17,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:17,215 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:48:17,216 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-05 10:48:17,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:17,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:48:17,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:18,426 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:48:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:18,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:48:18,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:48:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:48:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:48:18,428 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:48:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,502 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:48:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:48:18,503 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:48:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,504 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:48:18,504 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:48:18,505 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:48:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:48:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:48:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:48:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:48:18,507 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:48:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,507 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:48:18,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:48:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:48:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:48:18,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,508 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:48:18,509 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-05 10:48:18,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:19,745 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:48:19,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:19,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:48:19,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:48:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:48:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:48:19,747 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:48:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:19,831 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:48:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:48:19,832 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:48:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:19,832 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:48:19,832 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:48:19,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:48:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:48:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:48:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:48:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:48:19,834 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:48:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:19,835 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:48:19,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:48:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:48:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:48:19,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:19,835 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:48:19,836 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-05 10:48:19,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:19,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:48:19,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,362 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:48:21,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:48:21,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:48:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:48:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:48:21,363 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:48:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,432 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:48:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:48:21,433 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:48:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,433 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:48:21,434 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:48:21,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:48:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:48:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:48:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:48:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:48:21,437 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:48:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,437 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:48:21,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:48:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:48:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:48:21,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,437 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:48:21,438 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-05 10:48:21,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,847 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:48:22,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:48:22,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:48:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:48:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:48:22,849 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:48:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,947 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:48:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:48:22,948 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:48:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,949 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:48:22,949 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:48:22,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:48:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:48:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:48:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:48:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:48:22,951 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:48:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,952 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:48:22,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:48:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:48:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:48:22,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,953 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:48:22,953 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-05 10:48:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,352 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:48:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:48:24,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:48:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:48:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:48:24,353 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:48:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,444 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:48:24,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:48:24,444 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:48:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,445 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:48:24,445 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:48:24,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:48:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:48:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:48:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:48:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:48:24,448 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:48:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,448 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:48:24,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:48:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:48:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:48:24,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,449 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:48:24,449 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-05 10:48:24,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,145 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:48:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:48:26,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:48:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:48:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:48:26,147 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:48:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,267 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:48:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:48:26,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:48:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,268 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:48:26,268 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:48:26,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:48:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:48:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:48:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:48:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:48:26,271 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:48:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,272 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:48:26,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:48:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:48:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:48:26,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,272 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:48:26,273 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-05 10:48:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,158 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:48:28,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:48:28,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:48:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:48:28,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:28,160 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:48:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,258 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:48:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:48:28,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:48:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,259 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:48:28,259 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:48:28,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:48:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:48:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:48:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:48:28,262 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:48:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,263 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:48:28,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:48:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:48:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:48:28,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,264 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:48:28,264 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2019-08-05 10:48:28,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:29,779 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:48:29,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:48:29,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:48:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:48:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:48:29,781 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:48:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,885 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:48:29,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:48:29,887 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:48:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,888 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:48:29,888 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:48:29,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:48:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:48:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:48:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:48:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:48:29,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:48:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,890 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:48:29,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:48:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:48:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:48:29,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,891 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:48:29,891 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2019-08-05 10:48:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,579 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:48:31,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:48:31,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:48:31,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:48:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:48:31,580 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:48:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,687 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:48:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:48:31,688 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:48:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,689 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:48:31,689 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:48:31,689 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:48:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:48:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:48:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:48:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:48:31,692 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:48:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,692 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:48:31,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:48:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:48:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:48:31,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,693 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:48:31,693 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2019-08-05 10:48:31,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,278 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:48:33,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:48:33,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:48:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:48:33,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:48:33,279 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:48:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,363 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:48:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:48:33,363 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:48:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,364 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:48:33,364 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:48:33,365 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:48:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:48:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:48:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:48:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:48:33,367 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:48:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,367 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:48:33,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:48:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:48:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:48:33,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,368 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:48:33,368 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2019-08-05 10:48:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:34,996 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:48:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:48:34,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:48:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:48:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:48:34,998 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:48:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,091 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:48:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:48:35,092 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:48:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,093 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:48:35,093 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:48:35,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:48:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:48:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:48:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:48:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:48:35,096 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:48:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,096 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:48:35,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:48:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:48:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:48:35,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,097 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:48:35,098 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2019-08-05 10:48:35,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,010 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:48:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:48:37,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:48:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:48:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:37,012 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:48:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:37,111 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:48:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:48:37,111 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:48:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:37,112 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:48:37,112 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:48:37,113 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:48:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:48:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:48:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:48:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:48:37,115 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:48:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:37,115 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:48:37,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:48:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:48:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:48:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:37,116 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:48:37,116 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2019-08-05 10:48:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:37,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:48:37,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:38,764 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:48:38,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:48:38,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:48:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:48:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:48:38,766 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:48:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:38,851 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:48:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:48:38,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:48:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:38,852 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:48:38,852 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:48:38,853 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:48:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:48:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:48:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:48:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:48:38,855 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:48:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:38,856 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:48:38,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:48:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:48:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:48:38,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:38,857 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:48:38,857 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2019-08-05 10:48:38,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:38,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:48:38,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,085 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:48:41,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:48:41,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:48:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:48:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:41,086 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:48:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:41,184 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:48:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:48:41,185 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:48:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:41,186 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:48:41,186 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:48:41,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:48:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:48:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:48:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:48:41,189 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:48:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:41,189 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:48:41,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:48:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:48:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:48:41,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:41,190 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:48:41,191 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2019-08-05 10:48:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:41,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:48:41,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,122 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:48:43,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:48:43,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:48:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:48:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:43,124 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:48:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:43,232 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:48:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:48:43,232 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:48:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:43,234 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:48:43,234 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:43,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:48:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:48:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:48:43,237 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:48:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:43,237 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:48:43,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:48:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:48:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:48:43,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:43,238 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:48:43,238 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2019-08-05 10:48:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:43,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:48:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:45,200 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:48:45,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:45,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:48:45,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:48:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:48:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:45,202 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:48:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,295 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:48:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:48:45,295 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:48:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,296 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:45,297 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:45,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:48:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:48:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:48:45,299 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:48:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,300 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:48:45,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:48:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:48:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:48:45,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,301 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:48:45,301 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,301 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2019-08-05 10:48:45,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:47,517 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:48:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:47,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:48:47,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:48:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:48:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:47,519 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:48:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,626 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:48:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:48:47,627 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:48:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,628 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:48:47,628 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:48:47,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:48:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:48:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:48:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:48:47,631 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:48:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,631 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:48:47,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:48:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:48:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:48:47,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,632 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:48:47,632 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2019-08-05 10:48:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:49,578 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:48:49,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:49,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:48:49,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:48:49,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:48:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:49,580 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:48:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:49,679 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:48:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:48:49,680 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:48:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:49,681 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:48:49,681 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:48:49,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:48:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:48:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:48:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:48:49,684 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:48:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:49,684 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:48:49,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:48:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:48:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:48:49,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:49,685 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:48:49,686 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2019-08-05 10:48:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:49,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:48:49,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:52,208 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:48:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:52,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:48:52,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:48:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:48:52,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:52,209 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:48:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:52,300 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:48:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:48:52,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:48:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:52,301 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:48:52,301 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:52,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:48:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:48:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:48:52,306 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:48:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:48:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:48:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:48:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:48:52,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:52,306 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:48:52,307 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2019-08-05 10:48:52,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:52,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:48:52,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:54,451 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:48:54,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:54,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:48:54,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:48:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:48:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:54,452 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:48:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:54,560 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:48:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:48:54,560 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:48:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:54,561 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:48:54,561 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:48:54,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:48:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:48:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:48:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:48:54,564 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:48:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:54,564 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:48:54,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:48:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:48:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:48:54,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:54,565 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:48:54,565 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2019-08-05 10:48:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:54,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:48:54,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:56,803 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:48:56,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:56,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:48:56,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:48:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:48:56,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:48:56,805 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:48:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:56,906 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:48:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:48:56,906 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:48:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:56,907 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:48:56,907 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:48:56,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:48:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:48:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:48:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:48:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:48:56,911 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:48:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:56,911 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:48:56,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:48:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:48:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:48:56,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:56,912 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:48:56,913 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2019-08-05 10:48:56,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:59,149 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:48:59,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:59,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:48:59,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:48:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:48:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:48:59,151 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:48:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:59,675 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:48:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:48:59,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:48:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:59,676 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:48:59,676 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:48:59,677 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:48:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:48:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:48:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:48:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:48:59,679 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:48:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:59,679 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:48:59,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:48:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:48:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:48:59,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:59,680 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:48:59,680 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2019-08-05 10:48:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:59,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:48:59,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:02,134 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:49:02,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:02,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:49:02,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:49:02,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:49:02,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:49:02,136 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:49:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:02,305 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:49:02,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:49:02,306 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:49:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:02,307 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:49:02,307 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:49:02,308 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:49:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:49:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:49:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:49:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:49:02,311 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:49:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:02,311 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:49:02,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:49:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:49:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:49:02,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:02,312 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:49:02,312 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2019-08-05 10:49:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:49:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,656 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:49:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:49:04,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:49:04,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:49:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:49:04,658 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:49:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:04,778 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:49:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:49:04,778 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:49:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:04,779 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:49:04,779 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:49:04,780 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:49:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:49:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:49:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:49:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:49:04,782 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:49:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:04,782 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:49:04,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:49:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:49:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:49:04,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,784 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:49:04,784 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2019-08-05 10:49:04,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,775 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:49:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:49:07,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:49:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:49:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:49:07,777 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:49:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,925 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:49:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:49:07,926 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:49:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,927 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:49:07,927 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:49:07,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:49:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:49:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:49:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:49:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:49:07,930 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:49:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,930 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:49:07,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:49:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:49:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:49:07,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,932 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:49:07,932 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2019-08-05 10:49:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,362 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:49:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:49:10,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:49:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:49:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:49:10,364 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:49:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,632 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:49:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:49:10,633 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:49:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,634 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:49:10,634 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:49:10,635 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:49:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:49:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:49:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:49:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:49:10,637 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:49:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,637 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:49:10,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:49:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:49:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:49:10,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,638 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:49:10,638 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2019-08-05 10:49:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,285 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:49:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:49:14,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:49:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:49:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:49:14,286 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:49:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,400 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:49:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:49:14,401 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:49:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,402 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:49:14,402 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:49:14,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:49:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:49:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:49:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:49:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:49:14,405 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:49:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,405 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:49:14,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:49:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:49:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:49:14,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,406 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:49:14,406 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2019-08-05 10:49:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,099 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:49:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:49:17,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:49:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:49:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:49:17,101 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:49:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:17,319 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:49:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:49:17,319 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:49:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:17,320 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:49:17,320 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:49:17,321 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:49:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:49:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:49:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:49:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:49:17,323 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:49:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:17,323 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:49:17,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:49:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:49:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:49:17,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:17,324 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:49:17,325 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2019-08-05 10:49:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,848 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:49:19,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:49:19,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:49:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:49:19,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:49:19,850 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:49:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,974 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:49:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:49:19,975 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:49:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,976 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:49:19,976 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:49:19,977 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:49:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:49:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:49:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:49:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:49:19,980 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:49:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,980 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:49:19,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:49:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:49:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:49:19,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,981 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:49:19,981 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2019-08-05 10:49:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,780 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:49:22,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:49:22,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:49:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:49:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:49:22,782 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:49:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:22,968 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:49:22,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:49:22,972 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:49:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:22,973 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:49:22,973 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:49:22,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:49:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:49:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:49:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:49:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:49:22,975 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:49:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:22,975 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:49:22,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:49:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:49:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:49:22,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:22,976 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:49:22,976 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2019-08-05 10:49:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:22,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:49:22,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,598 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:49:25,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:49:25,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:49:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:49:25,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:49:25,600 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:49:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,729 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:49:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:49:25,730 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:49:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,730 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:49:25,731 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:49:25,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:49:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:49:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:49:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:49:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:49:25,734 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:49:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,734 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:49:25,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:49:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:49:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:49:25,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,735 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:49:25,735 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2019-08-05 10:49:25,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,573 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:49:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:49:28,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:49:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:49:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:49:28,575 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:49:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,690 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:49:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:49:28,691 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:49:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,692 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:49:28,692 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:49:28,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:49:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:49:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:49:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:49:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:49:28,694 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:49:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,695 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:49:28,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:49:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:49:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:49:28,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,696 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:49:28,696 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2019-08-05 10:49:28,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:31,408 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:49:31,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:31,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:49:31,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:49:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:49:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:49:31,410 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:49:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:31,541 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:49:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:49:31,541 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:49:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:31,542 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:49:31,542 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:49:31,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:49:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:49:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:49:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:49:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:49:31,545 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:49:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:31,545 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:49:31,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:49:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:49:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:49:31,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:31,546 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:49:31,546 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:31,546 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2019-08-05 10:49:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:49:31,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:34,418 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:49:34,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:49:34,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:49:34,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:49:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:49:34,420 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:49:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,644 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:49:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:49:35,645 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:49:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,646 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:49:35,646 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:49:35,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:49:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:49:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:49:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:49:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:49:35,649 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:49:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,649 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:49:35,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:49:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:49:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:49:35,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,650 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:49:35,650 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,650 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2019-08-05 10:49:35,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,097 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:49:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:49:39,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:49:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:49:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:49:39,098 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:49:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,213 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:49:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:49:39,214 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:49:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,215 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:49:39,215 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:49:39,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:49:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:49:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:49:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:49:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:49:39,218 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:49:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,218 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:49:39,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:49:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:49:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:49:39,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,219 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:49:39,220 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2019-08-05 10:49:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:42,291 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:49:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:49:42,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:49:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:49:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:49:42,292 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:49:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,420 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:49:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:49:42,421 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:49:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,422 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:49:42,422 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:49:42,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:49:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:49:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:49:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:49:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:49:42,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:49:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,425 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:49:42,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:49:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:49:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:49:42,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,426 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:49:42,426 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2019-08-05 10:49:42,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:45,504 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:49:45,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:45,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:49:45,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:49:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:49:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:49:45,506 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:49:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,638 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:49:45,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:49:45,638 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:49:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,639 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:49:45,639 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:49:45,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:49:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:49:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:49:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:49:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:49:45,642 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:49:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,643 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:49:45,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:49:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:49:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:49:45,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,643 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:49:45,644 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2019-08-05 10:49:45,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:45,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:49:45,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:48,916 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:49:48,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:48,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:49:48,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:49:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:49:48,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:49:48,918 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:49:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:49,044 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:49:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:49:49,044 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:49:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:49,045 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:49:49,046 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:49:49,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:49:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:49:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:49:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:49:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:49:49,048 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:49:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:49,049 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:49:49,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:49:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:49:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:49:49,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:49,050 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:49:49,050 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2019-08-05 10:49:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:49,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:49:49,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,873 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:49:52,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:52,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:49:52,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:49:52,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:49:52,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:49:52,875 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:49:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,017 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:49:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:49:53,018 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:49:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,018 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:49:53,019 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:49:53,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:49:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:49:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:49:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:49:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:49:53,021 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:49:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,021 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:49:53,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:49:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:49:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:49:53,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,022 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:49:53,022 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2019-08-05 10:49:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,154 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:49:56,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:49:56,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:49:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:49:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:56,156 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:49:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,285 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:49:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:49:56,285 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:49:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,286 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:49:56,286 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:49:56,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:49:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:49:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:49:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:49:56,289 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:49:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,290 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:49:56,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:49:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:49:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:49:56,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,291 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:49:56,291 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2019-08-05 10:49:56,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,791 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:49:59,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:49:59,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:49:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:49:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:49:59,793 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:49:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,948 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:49:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:49:59,949 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:49:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,950 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:49:59,950 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:49:59,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:49:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:49:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:49:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:49:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:49:59,953 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:49:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,954 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:49:59,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:49:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:49:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:49:59,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,955 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:49:59,955 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2019-08-05 10:49:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,353 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:50:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:50:03,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:50:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:50:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:50:03,355 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:50:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,664 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:50:03,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:50:03,664 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:50:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,665 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:50:03,665 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:50:03,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:50:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:50:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:50:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:50:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:50:03,669 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:50:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,669 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:50:03,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:50:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:50:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:50:03,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:03,670 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:50:03,670 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2019-08-05 10:50:03,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:03,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:50:03,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,062 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:50:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:50:07,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:50:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:50:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:50:07,064 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:50:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,198 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:50:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:50:07,199 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:50:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,200 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:50:07,200 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:50:07,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:50:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:50:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:50:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:50:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:50:07,203 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:50:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,204 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:50:07,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:50:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:50:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:50:07,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,205 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:50:07,205 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2019-08-05 10:50:07,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:50:07,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:10,972 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:50:10,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:10,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:50:10,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:50:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:50:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:50:10,974 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:50:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:11,144 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:50:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:50:11,145 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:50:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:11,146 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:50:11,146 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:50:11,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:50:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:50:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:50:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:50:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:50:11,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:50:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:11,150 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:50:11,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:50:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:50:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:50:11,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:11,151 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:50:11,151 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2019-08-05 10:50:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:50:11,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:14,848 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:50:14,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:14,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:50:14,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:50:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:50:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:50:14,850 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:50:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,989 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:50:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:50:14,990 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:50:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,991 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:50:14,991 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:50:14,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:50:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:50:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:50:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:50:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:50:14,995 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:50:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:14,995 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:50:14,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:50:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:50:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:50:14,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:14,996 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:50:14,997 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2019-08-05 10:50:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:15,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:50:15,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:18,681 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:50:18,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:18,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:50:18,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:50:18,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:50:18,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:50:18,684 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:50:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:18,863 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:50:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:50:18,864 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:50:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:18,865 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:50:18,865 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:50:18,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:50:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:50:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:50:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:50:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:50:18,868 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:50:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:18,869 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:50:18,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:50:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:50:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:50:18,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:18,870 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:50:18,870 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2019-08-05 10:50:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:18,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:50:18,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:22,587 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:50:22,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:22,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:50:22,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:50:22,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:50:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:50:22,588 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:50:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:22,879 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:50:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:50:22,879 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:50:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:22,880 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:50:22,880 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:50:22,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:50:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:50:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:50:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:50:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:50:22,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:50:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:22,882 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:50:22,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:50:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:50:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:50:22,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:22,883 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:50:22,883 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2019-08-05 10:50:22,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:22,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:50:22,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:26,923 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:50:26,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:50:26,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:50:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:50:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:50:26,925 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:50:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:27,085 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:50:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:50:27,086 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:50:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:27,086 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:50:27,086 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:50:27,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:50:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:50:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:50:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:50:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:50:27,090 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:50:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:27,090 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:50:27,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:50:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:50:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:50:27,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:27,090 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:50:27,091 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2019-08-05 10:50:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:27,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:50:27,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,565 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:50:31,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:31,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:50:31,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:50:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:50:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:50:31,567 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:50:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:31,783 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:50:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:50:31,784 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:50:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:31,784 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:50:31,785 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:50:31,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:50:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:50:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:50:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:50:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:50:31,788 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:50:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:31,788 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:50:31,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:50:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:50:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:50:31,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:31,789 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:50:31,789 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:31,790 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2019-08-05 10:50:31,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:31,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:50:31,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:35,945 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:50:35,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:35,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:50:35,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:50:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:50:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:50:35,947 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:50:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:36,111 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:50:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:50:36,111 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:50:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:36,112 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:50:36,112 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:50:36,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:50:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:50:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:50:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:50:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:50:36,116 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:50:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:36,116 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:50:36,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:50:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:50:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:50:36,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:36,117 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:50:36,117 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2019-08-05 10:50:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:36,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:50:36,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:40,206 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:50:40,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:40,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:50:40,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:50:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:50:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:50:40,208 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:50:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,403 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:50:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:50:40,404 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:50:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,404 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:50:40,405 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:50:40,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:50:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:50:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:50:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:50:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:50:40,407 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:50:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,407 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:50:40,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:50:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:50:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:50:40,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,408 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:50:40,408 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2019-08-05 10:50:40,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:44,656 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:50:44,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:44,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:50:44,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:50:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:50:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:50:44,659 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:50:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:44,836 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:50:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:50:44,837 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:50:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:44,838 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:50:44,838 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:50:44,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:50:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:50:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:50:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:50:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:50:44,841 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:50:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:44,841 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:50:44,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:50:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:50:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:50:44,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:44,842 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:50:44,842 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2019-08-05 10:50:44,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:44,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:50:44,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:49,133 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:50:49,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:49,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:50:49,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:50:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:50:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:50:49,135 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:50:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:49,298 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:50:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:50:49,299 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:50:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:49,300 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:50:49,300 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:50:49,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:50:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:50:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:50:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:50:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:50:49,303 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:50:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:49,304 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:50:49,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:50:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:50:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:50:49,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:49,305 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:50:49,305 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2019-08-05 10:50:49,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:49,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:50:49,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:53,494 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:50:53,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:53,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:50:53,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:50:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:50:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:50:53,496 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:50:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:53,701 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:50:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:50:53,702 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:50:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:53,702 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:50:53,703 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:50:53,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:50:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:50:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:50:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:50:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:50:53,705 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:50:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:53,706 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:50:53,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:50:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:50:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:50:53,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:53,707 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:50:53,707 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2019-08-05 10:50:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:53,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:50:53,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:58,052 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:50:58,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:58,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:50:58,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:50:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:50:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:50:58,054 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:50:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:58,232 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:50:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:50:58,233 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:50:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:58,234 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:50:58,234 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:50:58,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:50:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:50:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:50:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:50:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:50:58,237 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:50:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:58,237 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:50:58,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:50:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:50:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:50:58,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:58,238 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:50:58,238 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2019-08-05 10:50:58,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:58,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:50:58,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:02,990 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:51:02,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:02,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:51:02,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:51:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:51:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:51:02,992 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:51:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:03,177 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:51:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:51:03,178 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:51:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:03,178 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:51:03,179 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:51:03,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:51:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:51:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:51:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:51:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:51:03,181 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:51:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:03,182 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:51:03,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:51:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:51:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:51:03,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:03,182 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:51:03,183 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2019-08-05 10:51:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:03,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:51:03,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:08,009 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:51:08,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:08,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:51:08,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:51:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:51:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:51:08,011 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:51:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:08,252 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:51:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:51:08,252 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:51:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:08,253 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:51:08,253 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:51:08,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:51:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:51:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:51:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:51:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:51:08,256 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:51:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:08,256 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:51:08,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:51:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:51:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:51:08,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:08,257 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:51:08,258 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2019-08-05 10:51:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:08,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:51:08,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:13,023 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:51:13,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:13,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:51:13,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:51:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:51:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:51:13,025 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:51:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:13,222 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:51:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:51:13,223 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:51:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:13,223 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:51:13,223 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:51:13,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:51:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:51:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:51:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:51:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:51:13,227 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:51:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:13,228 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:51:13,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:51:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:51:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:51:13,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:13,228 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:51:13,229 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2019-08-05 10:51:13,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:13,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:51:13,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:18,110 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:51:18,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:18,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:51:18,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:51:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:51:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:51:18,112 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:51:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:18,332 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:51:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:51:18,332 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:51:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:18,333 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:51:18,333 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:51:18,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:51:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:51:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:51:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:51:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:51:18,335 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:51:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:18,335 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:51:18,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:51:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:51:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:51:18,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:18,336 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:51:18,336 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2019-08-05 10:51:18,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:18,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:51:18,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:23,256 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:51:23,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:51:23,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:51:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:51:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:51:23,258 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:51:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:23,484 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:51:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:51:23,485 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:51:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:23,486 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:51:23,486 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:51:23,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:51:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:51:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:51:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:51:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:51:23,489 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:51:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:23,489 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:51:23,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:51:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:51:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:51:23,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:23,490 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:51:23,490 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2019-08-05 10:51:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:23,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:51:23,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:28,468 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:51:28,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:28,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:51:28,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:51:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:51:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:51:28,470 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:51:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:28,732 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:51:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:51:28,733 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:51:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:28,733 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:51:28,733 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:51:28,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:51:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:51:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:51:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:51:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:51:28,736 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:51:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:28,736 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:51:28,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:51:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:51:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:51:28,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:28,737 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:51:28,737 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:28,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash -204943256, now seen corresponding path program 117 times [2019-08-05 10:51:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:51:28,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:33,838 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:51:33,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:33,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:51:33,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:51:33,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:51:33,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:51:33,840 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:51:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:34,037 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:51:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:51:34,037 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:51:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:34,038 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:51:34,038 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:51:34,039 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:51:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:51:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:51:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:51:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:51:34,040 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:51:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:34,041 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:51:34,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:51:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:51:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:51:34,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:34,041 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:51:34,041 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2058275615, now seen corresponding path program 118 times [2019-08-05 10:51:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:34,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:51:34,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:51:37,428 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:51:37,429 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:51:37,433 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:51:37,433 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:51:37 BoogieIcfgContainer [2019-08-05 10:51:37,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:51:37,435 INFO L168 Benchmark]: Toolchain (without parser) took 240416.19 ms. Allocated memory was 141.6 MB in the beginning and 710.4 MB in the end (delta: 568.9 MB). Free memory was 111.1 MB in the beginning and 138.9 MB in the end (delta: -27.8 MB). Peak memory consumption was 541.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:37,436 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 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:51:37,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.40 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.4 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:51:37,437 INFO L168 Benchmark]: Boogie Preprocessor took 19.39 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:37,438 INFO L168 Benchmark]: RCFGBuilder took 290.42 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 99.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:37,441 INFO L168 Benchmark]: TraceAbstraction took 240068.53 ms. Allocated memory was 141.6 MB in the beginning and 710.4 MB in the end (delta: 568.9 MB). Free memory was 98.8 MB in the beginning and 138.9 MB in the end (delta: -40.1 MB). Peak memory consumption was 528.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:37,444 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.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 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 33.40 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.39 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 290.42 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 99.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240068.53 ms. Allocated memory was 141.6 MB in the beginning and 710.4 MB in the end (delta: 568.9 MB). Free memory was 98.8 MB in the beginning and 138.9 MB in the end (delta: -40.1 MB). Peak memory consumption was 528.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 98 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 240.0s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 354 SDtfs, 0 SDslu, 1956 SDs, 0 SdLazy, 9095 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 216.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, 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, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 219.4s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 29736 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown