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/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:44:56,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:44:56,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:44:56,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:44:56,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:44:56,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:44:56,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:44:56,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:44:56,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:44:56,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:44:56,024 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:44:56,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:44:56,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:44:56,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:44:56,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:44:56,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:44:56,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:44:56,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:44:56,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:44:56,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:44:56,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:44:56,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:44:56,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:44:56,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:44:56,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:44:56,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:44:56,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:44:56,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:44:56,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:44:56,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:44:56,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:44:56,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:44:56,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:44:56,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:44:56,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:44:56,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:44:56,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:44:56,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:44:56,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:44:56,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:44:56,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:44:56,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:44:56,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:44:56,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:44:56,125 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:44:56,125 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:44:56,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-05 10:44:56,127 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2019-08-05 10:44:56,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:44:56,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:44:56,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:56,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:44:56,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:44:56,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:56,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:44:56,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:44:56,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:44:56,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/1) ... [2019-08-05 10:44:56,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:44:56,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:44:56,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:44:56,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:44:56,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (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:44:56,323 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:44:56,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:44:56,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:44:56,585 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:44:56,585 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:44:56,587 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:56 BoogieIcfgContainer [2019-08-05 10:44:56,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:44:56,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:44:56,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:44:56,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:44:56,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:56" (1/2) ... [2019-08-05 10:44:56,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c39b888 and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:44:56, skipping insertion in model container [2019-08-05 10:44:56,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:56" (2/2) ... [2019-08-05 10:44:56,595 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-05 10:44:56,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:44:56,611 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:44:56,625 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:44:56,654 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:44:56,654 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:44:56,655 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:44:56,655 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:44:56,655 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:44:56,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:44:56,655 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:44:56,655 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:44:56,656 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:44:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:44:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:44:56,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:44:56,680 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 889618619, now seen corresponding path program 1 times [2019-08-05 10:44:56,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,818 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:44:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:44:56,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:44:56,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:44:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:44:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:44:56,840 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:44:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,914 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:44:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:44:56,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:44:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,932 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:44:56,932 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:44:56,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:44:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:44:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:44:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:44:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:44:56,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:44:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,982 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:44:56,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:44:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:44:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:56,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,984 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:44:56,984 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 141442743, now seen corresponding path program 1 times [2019-08-05 10:44:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:44:57,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:44:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:44:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:57,071 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 10:44:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,125 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:44:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:44:57,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:44:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,126 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:44:57,126 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:44:57,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:44:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:44:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:44:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:44:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:44:57,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:44:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,132 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:44:57,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:44:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:44:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:57,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,133 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:44:57,133 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1596035661, now seen corresponding path program 2 times [2019-08-05 10:44:57,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,254 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:44:57,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:44:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:44:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:57,257 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-08-05 10:44:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,330 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:44:57,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:44:57,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:44:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,331 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:44:57,332 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:44:57,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:44:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:44:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:44:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:44:57,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:44:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,336 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:44:57,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:44:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:44:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:57,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,338 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 10:44:57,338 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash -570503761, now seen corresponding path program 3 times [2019-08-05 10:44:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:57,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:57,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:57,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:57,492 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2019-08-05 10:44:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,556 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:44:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:57,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 10:44:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,558 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:44:57,558 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:57,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:44:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:44:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:44:57,562 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:44:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,562 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:44:57,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:44:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:57,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,563 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 10:44:57,564 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1418141355, now seen corresponding path program 4 times [2019-08-05 10:44:57,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:57,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:57,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:57,900 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-08-05 10:44:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,961 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 10:44:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:57,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:44:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,962 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:44:57,962 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:44:57,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:44:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:44:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:44:57,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 10:44:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,967 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:44:57,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:44:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:57,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,968 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 10:44:57,968 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1245651111, now seen corresponding path program 5 times [2019-08-05 10:44:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:58,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:58,128 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2019-08-05 10:44:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,184 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:44:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:58,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-05 10:44:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,186 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:58,186 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:44:58,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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:44:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:44:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:44:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:44:58,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 10:44:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,190 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:44:58,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:44:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:58,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,191 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 10:44:58,191 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1308716125, now seen corresponding path program 6 times [2019-08-05 10:44:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:58,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:58,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:58,454 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-05 10:44:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,495 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:44:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:58,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:44:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,497 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:44:58,499 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:58,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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:44:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:44:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:44:58,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 10:44:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:44:58,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:44:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,504 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 10:44:58,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 665663391, now seen corresponding path program 7 times [2019-08-05 10:44:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:58,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:58,648 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-08-05 10:44:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,675 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:44:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:58,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-05 10:44:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,676 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:44:58,677 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:44:58,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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:44:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:44:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:44:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:44:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 10:44:58,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-05 10:44:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,683 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 10:44:58,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 10:44:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:44:58,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,684 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 10:44:58,684 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -331166565, now seen corresponding path program 8 times [2019-08-05 10:44:58,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:59,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:59,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:59,210 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2019-08-05 10:44:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,259 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:44:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:59,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-08-05 10:44:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,261 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:59,261 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:44:59,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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:44:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:44:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:44:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:44:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:44:59,265 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-05 10:44:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,265 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:44:59,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:44:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:44:59,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,266 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 10:44:59,266 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -507047273, now seen corresponding path program 9 times [2019-08-05 10:44:59,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:59,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:59,490 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2019-08-05 10:44:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,545 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 10:44:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:59,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:44:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,547 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:44:59,547 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:59,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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:44:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:44:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:44:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:44:59,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 10:44:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,552 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:44:59,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:44:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:44:59,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,554 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-05 10:44:59,554 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2024683117, now seen corresponding path program 10 times [2019-08-05 10:44:59,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:59,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:59,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:59,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:59,779 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2019-08-05 10:44:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,837 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 10:44:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:59,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-05 10:44:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,838 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:44:59,839 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:44:59,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 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:44:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:44:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:44:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 10:44:59,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-05 10:44:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,844 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 10:44:59,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 10:44:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:44:59,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,845 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-05 10:44:59,846 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -183848561, now seen corresponding path program 11 times [2019-08-05 10:44:59,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:45:00,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:45:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:45:00,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:00,181 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-08-05 10:45:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,319 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:45:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:45:00,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-05 10:45:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,321 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:45:00,321 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:45:00,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:45:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:45:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:45:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:45:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:45:00,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-08-05 10:45:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,325 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:45:00,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:45:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:45:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:45:00,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,326 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-05 10:45:00,327 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -668366197, now seen corresponding path program 12 times [2019-08-05 10:45:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:45:00,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:45:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:45:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:45:00,667 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2019-08-05 10:45:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,935 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:45:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:45:00,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-08-05 10:45:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,940 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:45:00,940 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:45:00,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 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:45:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:45:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:45:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:45:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:45:00,947 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-05 10:45:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,949 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:45:00,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:45:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:45:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:45:00,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,951 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-05 10:45:00,951 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1861620871, now seen corresponding path program 13 times [2019-08-05 10:45:00,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:45:01,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:45:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:45:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:01,266 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2019-08-05 10:45:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,317 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 10:45:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:45:01,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-08-05 10:45:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,319 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:45:01,319 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:45:01,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:45:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:45:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:45:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:45:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 10:45:01,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-05 10:45:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,324 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 10:45:01,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:45:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 10:45:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:45:01,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,325 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-05 10:45:01,326 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2067263613, now seen corresponding path program 14 times [2019-08-05 10:45:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:01,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:45:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:45:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:01,594 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-08-05 10:45:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,647 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:45:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:45:01,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-05 10:45:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,649 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:45:01,649 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:45:01,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:45:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:45:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:45:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:45:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:45:01,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-05 10:45:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,655 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:45:01,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:45:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:45:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:45:01,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,656 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-05 10:45:01,656 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1845967743, now seen corresponding path program 15 times [2019-08-05 10:45:01,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:02,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:02,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:02,075 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 18 states. [2019-08-05 10:45:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,129 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 10:45:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:02,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-08-05 10:45:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,135 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:45:02,135 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:45:02,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:45:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:45:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:45:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:45:02,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-05 10:45:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,140 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:45:02,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:45:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:45:02,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,141 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-05 10:45:02,141 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,141 INFO L82 PathProgramCache]: Analyzing trace with hash 69949563, now seen corresponding path program 16 times [2019-08-05 10:45:02,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:02,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:02,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:02,844 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2019-08-05 10:45:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,872 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 10:45:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:02,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-08-05 10:45:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,873 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:45:02,873 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:45:02,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:45:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:45:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 10:45:02,878 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-08-05 10:45:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,878 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 10:45:02,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 10:45:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:45:02,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,879 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-05 10:45:02,879 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1581504905, now seen corresponding path program 17 times [2019-08-05 10:45:02,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:03,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:03,230 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2019-08-05 10:45:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,363 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:45:03,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:03,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-08-05 10:45:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,364 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:45:03,365 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:45:03,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:45:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:45:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:45:03,369 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-05 10:45:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,369 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:45:03,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:45:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:45:03,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,370 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-05 10:45:03,371 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 508650867, now seen corresponding path program 18 times [2019-08-05 10:45:03,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:03,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:03,743 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2019-08-05 10:45:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,784 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 10:45:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:03,784 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-05 10:45:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,785 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:45:03,785 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:45:03,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 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:45:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:45:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:45:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:45:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:45:03,791 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 10:45:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,791 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:45:03,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:45:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:45:03,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,792 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-05 10:45:03,792 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -896346769, now seen corresponding path program 19 times [2019-08-05 10:45:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:04,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:04,053 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 22 states. [2019-08-05 10:45:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,092 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 10:45:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:04,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-08-05 10:45:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,093 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:45:04,093 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:45:04,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:45:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:45:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:45:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 10:45:04,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-08-05 10:45:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,098 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 10:45:04,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 10:45:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:45:04,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,099 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-05 10:45:04,100 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1815623275, now seen corresponding path program 20 times [2019-08-05 10:45:04,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:04,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:04,515 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 23 states. [2019-08-05 10:45:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,715 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:45:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:04,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-08-05 10:45:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,716 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:04,716 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:04,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:45:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:45:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:45:04,720 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-08-05 10:45:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,720 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:45:04,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:45:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:45:04,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,721 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-05 10:45:04,722 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 973686887, now seen corresponding path program 21 times [2019-08-05 10:45:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:45:05,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:05,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:05,145 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2019-08-05 10:45:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,203 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 10:45:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:05,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-08-05 10:45:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,207 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:05,207 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:05,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 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:45:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:45:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:45:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:45:05,212 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 10:45:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,212 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:45:05,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:45:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:45:05,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,213 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-05 10:45:05,214 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -673330333, now seen corresponding path program 22 times [2019-08-05 10:45:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:45:05,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:45:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:45:05,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:05,786 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2019-08-05 10:45:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,857 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:45:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:45:05,857 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-05 10:45:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,858 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:05,858 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:45:05,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:45:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:45:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:45:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 10:45:05,863 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-05 10:45:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,864 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 10:45:05,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:45:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 10:45:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:45:05,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,865 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-05 10:45:05,865 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1386053471, now seen corresponding path program 23 times [2019-08-05 10:45:05,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:06,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:06,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:45:06,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:45:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:45:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:06,326 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 26 states. [2019-08-05 10:45:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,383 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:45:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:45:06,384 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-05 10:45:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,384 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:06,385 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:06,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:45:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:45:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:45:06,388 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-08-05 10:45:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,388 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:45:06,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:45:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:45:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:45:06,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,389 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-05 10:45:06,390 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 473965659, now seen corresponding path program 24 times [2019-08-05 10:45:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:45:08,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:45:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:45:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:08,029 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 27 states. [2019-08-05 10:45:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,080 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-05 10:45:08,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:45:08,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-08-05 10:45:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,081 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:45:08,081 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:08,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:45:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:45:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:45:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:45:08,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-05 10:45:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,085 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:45:08,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:45:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:45:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:45:08,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,086 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-05 10:45:08,087 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash 130906711, now seen corresponding path program 25 times [2019-08-05 10:45:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:45:08,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:45:08,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:45:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:08,543 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 28 states. [2019-08-05 10:45:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,579 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-05 10:45:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:45:08,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-08-05 10:45:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,580 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:08,580 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:45:08,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:45:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:45:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:45:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:45:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 10:45:08,584 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-05 10:45:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,584 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 10:45:08,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:45:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 10:45:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:45:08,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,585 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-05 10:45:08,585 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1163739475, now seen corresponding path program 26 times [2019-08-05 10:45:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:45:09,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:45:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:45:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:09,307 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2019-08-05 10:45:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,348 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 10:45:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:45:09,348 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-05 10:45:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,349 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:09,349 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:45:09,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:45:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:45:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:45:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:45:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:45:09,354 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-05 10:45:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,354 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:45:09,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:45:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:45:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:45:09,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,355 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-05 10:45:09,355 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1578580303, now seen corresponding path program 27 times [2019-08-05 10:45:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:45:09,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:45:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:45:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:09,779 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 30 states. [2019-08-05 10:45:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,842 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:45:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:45:09,842 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-08-05 10:45:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,843 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:45:09,843 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:09,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:45:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:45:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:45:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:45:09,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-05 10:45:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,849 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:45:09,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:45:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:45:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:45:09,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,849 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-05 10:45:09,850 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash 808657483, now seen corresponding path program 28 times [2019-08-05 10:45:09,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:45:10,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:45:10,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:45:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:10,289 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 31 states. [2019-08-05 10:45:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,327 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-05 10:45:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:45:10,328 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-08-05 10:45:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,329 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:45:10,329 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:45:10,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:45:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:45:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:45:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:45:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 10:45:10,333 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-08-05 10:45:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,333 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 10:45:10,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:45:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 10:45:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:45:10,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,333 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-05 10:45:10,334 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -352797625, now seen corresponding path program 29 times [2019-08-05 10:45:10,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:45:10,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:45:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:45:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:10,995 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2019-08-05 10:45:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,046 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:45:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:45:11,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-08-05 10:45:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,047 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:45:11,048 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:45:11,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:45:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:45:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:45:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:45:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:45:11,051 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-05 10:45:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,051 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:45:11,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:45:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:45:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:45:11,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,052 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-05 10:45:11,053 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 180340547, now seen corresponding path program 30 times [2019-08-05 10:45:11,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:45:11,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:45:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:45:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:11,660 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2019-08-05 10:45:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,873 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-05 10:45:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:45:11,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-05 10:45:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,874 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:45:11,875 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:45:11,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:45:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:45:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:45:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:45:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:45:11,878 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 10:45:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,878 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:45:11,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:45:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:45:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:45:11,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,879 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-05 10:45:11,880 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1425015615, now seen corresponding path program 31 times [2019-08-05 10:45:11,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:45:12,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:45:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:45:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:12,355 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 34 states. [2019-08-05 10:45:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,395 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-05 10:45:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:45:12,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-08-05 10:45:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,397 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:45:12,398 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:45:12,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:45:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:45:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:45:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:45:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 10:45:12,400 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-08-05 10:45:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,401 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 10:45:12,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:45:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 10:45:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:45:12,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,402 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-05 10:45:12,402 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash -738119621, now seen corresponding path program 32 times [2019-08-05 10:45:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:45:12,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:45:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:45:12,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:12,978 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states. [2019-08-05 10:45:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,019 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:45:13,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:45:13,020 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-08-05 10:45:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,021 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:45:13,021 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:45:13,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:45:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:45:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:45:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:45:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:45:13,025 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-08-05 10:45:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,025 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:45:13,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:45:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:45:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:45:13,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,026 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-05 10:45:13,026 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -746910153, now seen corresponding path program 33 times [2019-08-05 10:45:13,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:45:13,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:45:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:45:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:13,794 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 36 states. [2019-08-05 10:45:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,842 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-05 10:45:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:45:13,843 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-08-05 10:45:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,844 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:45:13,844 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:45:13,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:45:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:45:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:45:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:45:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:45:13,847 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 10:45:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,847 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:45:13,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:45:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:45:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:45:13,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,848 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-05 10:45:13,848 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -604676813, now seen corresponding path program 34 times [2019-08-05 10:45:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:45:14,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:45:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:45:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:14,622 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2019-08-05 10:45:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,719 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-05 10:45:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:45:14,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-05 10:45:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,721 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:45:14,721 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:45:14,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:45:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:45:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:45:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:45:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 10:45:14,724 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-05 10:45:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,724 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 10:45:14,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:45:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 10:45:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:45:14,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,725 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-05 10:45:14,725 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1357390545, now seen corresponding path program 35 times [2019-08-05 10:45:14,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:45:15,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:45:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:45:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:15,281 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 38 states. [2019-08-05 10:45:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,349 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:45:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:45:15,350 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-08-05 10:45:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,351 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:45:15,351 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:45:15,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:45:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:45:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:45:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:45:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:45:15,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-08-05 10:45:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,355 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:45:15,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:45:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:45:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:45:15,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,356 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-05 10:45:15,356 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1134186027, now seen corresponding path program 36 times [2019-08-05 10:45:15,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:45:17,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:45:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:45:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:17,660 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 39 states. [2019-08-05 10:45:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,733 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-05 10:45:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:45:17,734 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-08-05 10:45:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,735 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:45:17,735 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:45:17,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:45:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:45:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:45:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:45:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:45:17,738 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-05 10:45:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,738 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:45:17,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:45:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:45:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:45:17,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,739 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-05 10:45:17,739 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1052479449, now seen corresponding path program 37 times [2019-08-05 10:45:17,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:45:18,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:45:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:45:18,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:18,591 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 40 states. [2019-08-05 10:45:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,644 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:45:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:45:18,645 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-08-05 10:45:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,646 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:45:18,646 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:45:18,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:45:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:45:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:45:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:45:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 10:45:18,649 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-05 10:45:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,649 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 10:45:18,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:45:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 10:45:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:45:18,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,650 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-05 10:45:18,650 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2095973155, now seen corresponding path program 38 times [2019-08-05 10:45:18,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:45:19,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:45:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:45:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:45:19,280 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2019-08-05 10:45:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,333 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:45:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:45:19,333 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-05 10:45:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,334 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:45:19,334 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:45:19,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 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:45:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:45:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:45:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:45:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:45:19,337 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-05 10:45:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,338 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:45:19,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:45:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:45:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:45:19,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,339 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-05 10:45:19,339 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash -193018081, now seen corresponding path program 39 times [2019-08-05 10:45:19,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:20,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:45:20,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:45:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:45:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:20,320 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 42 states. [2019-08-05 10:45:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,389 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-05 10:45:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:45:20,390 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2019-08-05 10:45:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,391 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:45:20,391 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:45:20,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:45:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:45:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:45:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:45:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:45:20,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-05 10:45:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,395 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:45:20,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:45:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:45:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:45:20,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,396 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-05 10:45:20,396 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash -890340325, now seen corresponding path program 40 times [2019-08-05 10:45:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:45:21,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:45:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:45:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:21,381 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 43 states. [2019-08-05 10:45:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,458 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-05 10:45:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:45:21,458 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-08-05 10:45:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,459 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:45:21,460 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:45:21,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:45:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:45:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:45:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:45:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 10:45:21,463 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-08-05 10:45:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,463 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 10:45:21,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:45:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 10:45:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:45:21,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,464 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-05 10:45:21,465 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1002118633, now seen corresponding path program 41 times [2019-08-05 10:45:21,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:22,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:45:22,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:45:22,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:45:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:45:22,325 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 44 states. [2019-08-05 10:45:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,386 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:45:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:45:22,386 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-08-05 10:45:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,387 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:45:22,388 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:45:22,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 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:45:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:45:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:45:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:45:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:45:22,391 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-05 10:45:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,391 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:45:22,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:45:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:45:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:45:22,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,392 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-05 10:45:22,392 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1046890221, now seen corresponding path program 42 times [2019-08-05 10:45:22,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:45:23,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:45:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:45:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:23,311 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2019-08-05 10:45:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:23,408 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 10:45:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:45:23,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-05 10:45:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:23,409 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:45:23,409 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:45:23,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:45:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:45:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:45:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:45:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:45:23,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 10:45:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:23,414 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:45:23,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:45:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:45:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:45:23,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:23,414 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-05 10:45:23,415 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1122713329, now seen corresponding path program 43 times [2019-08-05 10:45:23,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:23,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:45:23,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:45:24,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:45:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:45:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:24,229 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 46 states. [2019-08-05 10:45:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,287 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-05 10:45:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:45:24,288 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2019-08-05 10:45:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,289 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:45:24,289 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:45:24,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:45:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:45:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:45:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:45:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 10:45:24,293 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-08-05 10:45:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,293 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 10:45:24,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:45:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 10:45:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:45:24,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,294 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-05 10:45:24,294 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -974276085, now seen corresponding path program 44 times [2019-08-05 10:45:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:25,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:25,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:45:25,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:45:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:45:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:45:25,156 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 47 states. [2019-08-05 10:45:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,230 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 10:45:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:45:25,230 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-08-05 10:45:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,231 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:45:25,231 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:45:25,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 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:45:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:45:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:45:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:45:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:45:25,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-08-05 10:45:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,235 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:45:25,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:45:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:45:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:45:25,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,235 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-05 10:45:25,236 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -60005369, now seen corresponding path program 45 times [2019-08-05 10:45:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:45:26,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:45:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:45:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:45:26,622 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 48 states. [2019-08-05 10:45:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,002 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-05 10:45:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:45:27,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-08-05 10:45:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,003 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:45:27,004 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:45:27,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:45:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:45:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:45:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:45:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:45:27,007 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 10:45:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,007 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:45:27,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:45:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:45:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:45:27,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,008 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-05 10:45:27,008 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1914142973, now seen corresponding path program 46 times [2019-08-05 10:45:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:27,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:45:27,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:45:27,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:45:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:45:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:45:27,909 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2019-08-05 10:45:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,974 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-05 10:45:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:45:27,975 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-05 10:45:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,976 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:45:27,976 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:45:27,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 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:45:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:45:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:45:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:45:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 10:45:27,980 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-05 10:45:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 10:45:27,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:45:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 10:45:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:45:27,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,981 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-05 10:45:27,981 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1328952577, now seen corresponding path program 47 times [2019-08-05 10:45:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:45:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:45:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:45:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:45:28,912 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 50 states. [2019-08-05 10:45:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:28,982 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:45:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:45:28,983 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-08-05 10:45:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:28,984 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:45:28,985 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:45:28,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:45:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:45:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:45:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:45:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:45:28,987 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-08-05 10:45:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:28,988 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:45:28,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:45:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:45:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:45:28,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:28,989 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-05 10:45:28,989 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1601697797, now seen corresponding path program 48 times [2019-08-05 10:45:28,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:29,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:45:29,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:45:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:45:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:45:29,938 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 51 states. [2019-08-05 10:45:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,020 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-05 10:45:30,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:45:30,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2019-08-05 10:45:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,021 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:45:30,022 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:45:30,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:45:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:45:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:45:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:45:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:45:30,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-05 10:45:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,025 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:45:30,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:45:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:45:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:45:30,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,026 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-05 10:45:30,027 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1716849161, now seen corresponding path program 49 times [2019-08-05 10:45:30,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:31,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:45:31,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:45:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:45:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:45:31,330 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 52 states. [2019-08-05 10:45:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,412 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-05 10:45:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:45:31,412 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-08-05 10:45:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,414 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:45:31,414 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:45:31,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:45:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:45:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:45:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:45:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 10:45:31,418 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-05 10:45:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,419 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 10:45:31,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:45:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 10:45:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:45:31,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,419 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-05 10:45:31,420 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -708160269, now seen corresponding path program 50 times [2019-08-05 10:45:31,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:32,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:45:32,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:45:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:45:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:45:32,892 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2019-08-05 10:45:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:33,043 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 10:45:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:45:33,043 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-05 10:45:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:33,045 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:45:33,045 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:45:33,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:45:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:45:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:45:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:45:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:45:33,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-05 10:45:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:33,049 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:45:33,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:45:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:45:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:45:33,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:33,049 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-05 10:45:33,050 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2020743953, now seen corresponding path program 51 times [2019-08-05 10:45:33,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:33,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:45:33,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:45:34,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:45:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:45:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:45:34,473 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 54 states. [2019-08-05 10:45:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,590 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-05 10:45:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:45:34,591 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2019-08-05 10:45:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,592 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:45:34,592 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:45:34,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:45:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:45:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:45:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:45:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:45:34,595 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-05 10:45:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,595 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:45:34,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:45:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:45:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:45:34,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,596 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-05 10:45:34,596 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -693279253, now seen corresponding path program 52 times [2019-08-05 10:45:34,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:35,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:45:35,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:45:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:45:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:45:35,727 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 55 states. [2019-08-05 10:45:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,804 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:45:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:45:35,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2019-08-05 10:45:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,806 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:45:35,806 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:45:35,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:45:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:45:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:45:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:45:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-05 10:45:35,810 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-08-05 10:45:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,810 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-05 10:45:35,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:45:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-05 10:45:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:45:35,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,811 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2019-08-05 10:45:35,812 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash -604989465, now seen corresponding path program 53 times [2019-08-05 10:45:35,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:45:37,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:45:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:45:37,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:37,313 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 56 states. [2019-08-05 10:45:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,435 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 10:45:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:45:37,436 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-08-05 10:45:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,437 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:45:37,437 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:45:37,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:45:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:45:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:45:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:45:37,441 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-05 10:45:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,441 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:45:37,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:45:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:45:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:45:37,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,442 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2019-08-05 10:45:37,442 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1657849117, now seen corresponding path program 54 times [2019-08-05 10:45:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:45:38,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:45:38,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:45:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:38,871 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2019-08-05 10:45:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,072 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-08-05 10:45:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:45:39,073 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2019-08-05 10:45:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,073 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:45:39,074 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:45:39,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:45:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:45:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:45:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 10:45:39,076 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 10:45:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,076 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 10:45:39,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:45:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 10:45:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:45:39,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,077 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2019-08-05 10:45:39,077 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash 156307167, now seen corresponding path program 55 times [2019-08-05 10:45:39,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:45:40,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:45:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:45:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:40,723 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 58 states. [2019-08-05 10:45:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:40,793 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-05 10:45:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:45:40,794 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 116 [2019-08-05 10:45:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:40,795 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:45:40,795 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:45:40,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:45:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:45:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:45:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-05 10:45:40,799 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-08-05 10:45:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:40,799 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-05 10:45:40,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:45:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-05 10:45:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:45:40,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:40,800 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2019-08-05 10:45:40,801 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -196226085, now seen corresponding path program 56 times [2019-08-05 10:45:40,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:40,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:45:40,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:43,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:43,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:45:43,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:45:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:45:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:43,003 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 59 states. [2019-08-05 10:45:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,076 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 10:45:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:45:43,076 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 118 [2019-08-05 10:45:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,078 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:45:43,078 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:45:43,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:45:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:45:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:45:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 10:45:43,082 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-08-05 10:45:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,082 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 10:45:43,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:45:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 10:45:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:45:43,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,083 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2019-08-05 10:45:43,084 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 321735127, now seen corresponding path program 57 times [2019-08-05 10:45:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:44,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:45:44,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:45:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:45:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:44,439 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 60 states. [2019-08-05 10:45:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:44,603 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:45:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:45:44,604 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-08-05 10:45:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:44,605 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:45:44,605 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:45:44,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 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:45:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:45:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:45:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:45:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:45:44,609 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 10:45:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:44,610 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:45:44,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:45:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:45:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:45:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:44,611 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2019-08-05 10:45:44,611 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -133746477, now seen corresponding path program 58 times [2019-08-05 10:45:44,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:44,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:45:45,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:45:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:45:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:45,933 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2019-08-05 10:45:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:46,127 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-05 10:45:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:45:46,127 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2019-08-05 10:45:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:46,128 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:45:46,128 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:45:46,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:45:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:45:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:45:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-05 10:45:46,132 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-05 10:45:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:46,133 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-05 10:45:46,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:45:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-05 10:45:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:45:46,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:46,134 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2019-08-05 10:45:46,134 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash 235096271, now seen corresponding path program 59 times [2019-08-05 10:45:46,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:46,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:45:46,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:45:47,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:45:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:45:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:47,848 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 62 states. [2019-08-05 10:45:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,953 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:45:47,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:45:47,963 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 124 [2019-08-05 10:45:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,964 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:45:47,964 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:45:47,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:45:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:45:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:45:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 10:45:47,967 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-08-05 10:45:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,967 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 10:45:47,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:45:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 10:45:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:45:47,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,968 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2019-08-05 10:45:47,969 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1789308469, now seen corresponding path program 60 times [2019-08-05 10:45:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:49,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:45:49,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:45:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:45:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:49,571 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 63 states. [2019-08-05 10:45:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,650 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-08-05 10:45:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:45:49,651 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2019-08-05 10:45:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,652 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:45:49,652 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:45:49,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:45:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:45:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:45:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 10:45:49,655 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-05 10:45:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,655 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 10:45:49,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:45:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 10:45:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:45:49,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,656 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2019-08-05 10:45:49,656 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1622078521, now seen corresponding path program 61 times [2019-08-05 10:45:49,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:51,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:51,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:45:51,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:45:51,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:45:51,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:51,133 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 64 states. [2019-08-05 10:45:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:51,227 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-05 10:45:51,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:45:51,228 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-08-05 10:45:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:51,229 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:45:51,229 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:45:51,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:45:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:45:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:45:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 10:45:51,232 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-05 10:45:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:51,232 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 10:45:51,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:45:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 10:45:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:45:51,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:51,233 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2019-08-05 10:45:51,233 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 172111555, now seen corresponding path program 62 times [2019-08-05 10:45:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:51,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:45:51,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:45:52,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:45:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:45:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:52,979 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2019-08-05 10:45:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,102 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:45:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:45:53,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2019-08-05 10:45:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,103 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:45:53,103 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:45:53,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:45:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:45:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:45:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 10:45:53,106 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-05 10:45:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,106 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 10:45:53,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:45:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 10:45:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:45:53,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,107 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2019-08-05 10:45:53,107 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:53,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2106888895, now seen corresponding path program 63 times [2019-08-05 10:45:53,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:53,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:45:53,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:54,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:45:54,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:45:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:45:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:54,614 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 66 states. [2019-08-05 10:45:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:54,699 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-05 10:45:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:45:54,700 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 132 [2019-08-05 10:45:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:54,701 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:45:54,701 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:45:54,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 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:45:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:45:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:45:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:45:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 10:45:54,704 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-05 10:45:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:54,704 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 10:45:54,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:45:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 10:45:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:45:54,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:54,709 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2019-08-05 10:45:54,709 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1707073467, now seen corresponding path program 64 times [2019-08-05 10:45:54,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:56,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:56,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:45:56,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:45:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:45:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:56,266 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 67 states. [2019-08-05 10:45:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:56,360 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-05 10:45:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:45:56,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 134 [2019-08-05 10:45:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:56,361 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:45:56,361 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:45:56,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:45:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:45:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:45:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-05 10:45:56,365 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-08-05 10:45:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:56,365 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-05 10:45:56,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:45:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-05 10:45:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:45:56,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:56,366 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2019-08-05 10:45:56,366 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -263463497, now seen corresponding path program 65 times [2019-08-05 10:45:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:56,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:45:56,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:45:58,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:45:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:45:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:58,239 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 68 states. [2019-08-05 10:45:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:58,398 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 10:45:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:45:58,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-08-05 10:45:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:58,399 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:45:58,399 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:45:58,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:45:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:45:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:45:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:45:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:45:58,402 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-05 10:45:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:58,403 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:45:58,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:45:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:45:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:45:58,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:58,403 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2019-08-05 10:45:58,404 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash 131091635, now seen corresponding path program 66 times [2019-08-05 10:45:58,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:58,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:45:58,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:00,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:00,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:46:00,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:46:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:46:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:46:00,045 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2019-08-05 10:46:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:00,162 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-05 10:46:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:46:00,162 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2019-08-05 10:46:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:00,163 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:46:00,163 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:46:00,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 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:46:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:46:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:46:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:46:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 10:46:00,166 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 10:46:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:00,167 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 10:46:00,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:46:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 10:46:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:46:00,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:00,168 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2019-08-05 10:46:00,168 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1341451439, now seen corresponding path program 67 times [2019-08-05 10:46:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:00,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:46:00,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:01,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:01,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:46:01,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:46:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:46:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:01,986 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 70 states. [2019-08-05 10:46:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:02,151 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:46:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:46:02,152 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 140 [2019-08-05 10:46:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:02,153 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:46:02,153 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:46:02,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:46:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:46:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:46:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-05 10:46:02,156 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-08-05 10:46:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:02,156 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-05 10:46:02,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:46:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-05 10:46:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:46:02,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:02,157 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2019-08-05 10:46:02,157 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash 561085867, now seen corresponding path program 68 times [2019-08-05 10:46:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:02,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:46:02,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:03,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:46:03,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:46:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:46:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:03,893 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 71 states. [2019-08-05 10:46:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:04,006 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-05 10:46:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:46:04,007 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2019-08-05 10:46:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:04,007 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:46:04,008 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:46:04,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:46:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:46:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:46:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 10:46:04,010 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-08-05 10:46:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:04,011 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 10:46:04,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:46:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 10:46:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:46:04,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:04,012 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2019-08-05 10:46:04,012 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2045919321, now seen corresponding path program 69 times [2019-08-05 10:46:04,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:04,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:46:04,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:06,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:06,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:46:06,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:46:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:46:06,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:06,027 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 72 states. [2019-08-05 10:46:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:06,134 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-05 10:46:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:46:06,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-08-05 10:46:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:06,135 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:46:06,135 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:46:06,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:46:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:46:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:46:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:46:06,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-05 10:46:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:06,139 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:46:06,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:46:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:46:06,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:46:06,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:06,140 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2019-08-05 10:46:06,140 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 882995875, now seen corresponding path program 70 times [2019-08-05 10:46:06,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:06,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:46:06,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:08,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:08,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:46:08,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:46:08,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:46:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:08,192 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2019-08-05 10:46:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:08,314 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-05 10:46:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:46:08,314 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2019-08-05 10:46:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:08,315 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:46:08,315 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:46:08,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:46:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:46:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:46:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-05 10:46:08,318 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-08-05 10:46:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:08,319 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-05 10:46:08,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:46:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-05 10:46:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:46:08,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:08,320 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2019-08-05 10:46:08,320 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1928046945, now seen corresponding path program 71 times [2019-08-05 10:46:08,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:08,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:46:08,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:46:10,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:46:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:46:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:10,275 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 74 states. [2019-08-05 10:46:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:10,378 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-05 10:46:10,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:46:10,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 148 [2019-08-05 10:46:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:10,380 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:46:10,380 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:46:10,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:46:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:46:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:46:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 10:46:10,383 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-08-05 10:46:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:10,383 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 10:46:10,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:46:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 10:46:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:46:10,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:10,384 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2019-08-05 10:46:10,385 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1805767781, now seen corresponding path program 72 times [2019-08-05 10:46:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:10,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:46:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:12,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:46:12,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:46:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:46:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:12,548 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 75 states. [2019-08-05 10:46:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,673 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-05 10:46:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:46:12,674 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 150 [2019-08-05 10:46:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,675 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:46:12,675 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:46:12,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:46:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-05 10:46:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:46:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 10:46:12,679 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-05 10:46:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,679 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 10:46:12,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:46:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 10:46:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:46:12,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,680 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2019-08-05 10:46:12,681 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -259608169, now seen corresponding path program 73 times [2019-08-05 10:46:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:14,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:14,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:46:14,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:46:14,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:46:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:14,776 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 76 states. [2019-08-05 10:46:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:14,877 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-05 10:46:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:46:14,878 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-08-05 10:46:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:14,879 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:46:14,879 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:46:14,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 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:46:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:46:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:46:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:46:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-05 10:46:14,882 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-08-05 10:46:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:14,882 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-05 10:46:14,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:46:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-05 10:46:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:46:14,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:14,884 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2019-08-05 10:46:14,884 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -458905453, now seen corresponding path program 74 times [2019-08-05 10:46:14,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:14,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:46:14,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:16,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:46:16,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:46:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:46:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:16,888 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2019-08-05 10:46:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:17,012 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-05 10:46:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:46:17,013 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2019-08-05 10:46:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:17,013 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:46:17,014 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:46:17,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:46:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:46:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:46:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:46:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 10:46:17,016 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-08-05 10:46:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:17,016 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 10:46:17,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:46:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 10:46:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:46:17,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:17,017 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2019-08-05 10:46:17,018 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1289932943, now seen corresponding path program 75 times [2019-08-05 10:46:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:17,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:46:17,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:19,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:19,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:46:19,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:46:19,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:46:19,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:46:19,246 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 78 states. [2019-08-05 10:46:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,357 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-05 10:46:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:46:19,357 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 156 [2019-08-05 10:46:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,358 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:46:19,358 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:46:19,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 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:46:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:46:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 10:46:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:46:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 10:46:19,361 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-05 10:46:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,361 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 10:46:19,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:46:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 10:46:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:46:19,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,362 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2019-08-05 10:46:19,362 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1703548533, now seen corresponding path program 76 times [2019-08-05 10:46:19,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:21,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:46:21,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:46:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:46:21,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:46:21,649 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 79 states. [2019-08-05 10:46:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,761 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-05 10:46:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:46:21,762 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2019-08-05 10:46:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,763 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:46:21,763 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:46:21,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:46:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:46:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-05 10:46:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:46:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-08-05 10:46:21,766 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-08-05 10:46:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-08-05 10:46:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:46:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-08-05 10:46:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:46:21,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,767 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2019-08-05 10:46:21,768 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash -811158649, now seen corresponding path program 77 times [2019-08-05 10:46:21,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:24,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:46:24,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:46:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:46:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:46:24,243 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 80 states. [2019-08-05 10:46:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:24,352 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:46:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:46:24,353 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-08-05 10:46:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:24,354 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:46:24,354 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:46:24,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:46:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:46:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:46:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:46:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:46:24,358 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-08-05 10:46:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:24,358 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:46:24,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:46:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:46:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:46:24,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:24,359 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2019-08-05 10:46:24,359 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2077027971, now seen corresponding path program 78 times [2019-08-05 10:46:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:24,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:46:24,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:46:26,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:46:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:46:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:46:26,700 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2019-08-05 10:46:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,805 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-08-05 10:46:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:46:26,805 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2019-08-05 10:46:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,806 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:46:26,807 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:46:26,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:46:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:46:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-05 10:46:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:46:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-05 10:46:26,810 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-05 10:46:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,810 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-05 10:46:26,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:46:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-05 10:46:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:46:26,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,811 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2019-08-05 10:46:26,811 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1219470721, now seen corresponding path program 79 times [2019-08-05 10:46:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:29,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:46:29,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:46:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:46:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:46:29,420 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 82 states. [2019-08-05 10:46:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:29,536 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-05 10:46:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:46:29,537 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 164 [2019-08-05 10:46:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:29,538 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:46:29,538 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:46:29,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:46:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:46:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-05 10:46:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:46:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-08-05 10:46:29,542 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-08-05 10:46:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:29,542 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-08-05 10:46:29,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:46:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-08-05 10:46:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:46:29,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:29,543 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2019-08-05 10:46:29,543 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash 531150715, now seen corresponding path program 80 times [2019-08-05 10:46:29,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:29,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:46:29,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:31,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:31,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:46:31,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:46:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:46:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:46:31,927 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 83 states. [2019-08-05 10:46:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:32,044 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-05 10:46:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:46:32,045 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 166 [2019-08-05 10:46:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:32,046 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:46:32,046 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:46:32,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:46:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:46:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-05 10:46:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:46:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-08-05 10:46:32,050 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-08-05 10:46:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:32,050 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-08-05 10:46:32,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:46:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-08-05 10:46:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:46:32,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:32,051 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2019-08-05 10:46:32,051 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash -748829321, now seen corresponding path program 81 times [2019-08-05 10:46:32,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:32,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:46:32,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:46:34,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:46:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:46:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:46:34,801 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 84 states. [2019-08-05 10:46:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:34,920 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-08-05 10:46:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:46:34,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2019-08-05 10:46:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:34,922 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:46:34,922 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:46:34,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:46:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:46:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-05 10:46:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:46:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-08-05 10:46:34,926 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-08-05 10:46:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:34,926 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-08-05 10:46:34,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:46:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-08-05 10:46:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-05 10:46:34,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:34,927 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2019-08-05 10:46:34,927 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1845970035, now seen corresponding path program 82 times [2019-08-05 10:46:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:34,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:46:34,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:37,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:37,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:46:37,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:46:37,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:46:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:46:37,717 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2019-08-05 10:46:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:37,824 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-05 10:46:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:46:37,824 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2019-08-05 10:46:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:37,825 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:46:37,825 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:46:37,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:46:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:46:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-05 10:46:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:46:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-08-05 10:46:37,828 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-08-05 10:46:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:37,828 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-08-05 10:46:37,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:46:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-08-05 10:46:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:46:37,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:37,829 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2019-08-05 10:46:37,829 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash 72152175, now seen corresponding path program 83 times [2019-08-05 10:46:37,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:37,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:37,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:40,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:40,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:46:40,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:46:40,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:46:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:46:40,416 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 86 states. [2019-08-05 10:46:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:40,538 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-08-05 10:46:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:46:40,539 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 172 [2019-08-05 10:46:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,540 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:46:40,540 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:46:40,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:46:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:46:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-05 10:46:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:46:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-08-05 10:46:40,544 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-08-05 10:46:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,544 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-08-05 10:46:40,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:46:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-08-05 10:46:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:46:40,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,545 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2019-08-05 10:46:40,546 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 535205227, now seen corresponding path program 84 times [2019-08-05 10:46:40,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:43,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:43,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:46:43,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:46:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:46:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:46:43,603 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 87 states. [2019-08-05 10:46:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:43,731 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-08-05 10:46:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:46:43,731 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 174 [2019-08-05 10:46:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:43,732 INFO L225 Difference]: With dead ends: 177 [2019-08-05 10:46:43,733 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 10:46:43,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:46:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 10:46:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-08-05 10:46:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:46:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-08-05 10:46:43,736 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-08-05 10:46:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:43,736 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-08-05 10:46:43,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:46:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-08-05 10:46:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:46:43,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:43,738 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2019-08-05 10:46:43,738 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1147410585, now seen corresponding path program 85 times [2019-08-05 10:46:43,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:43,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:43,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:46:46,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:46:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:46:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:46:46,422 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 88 states. [2019-08-05 10:46:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:46,553 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-08-05 10:46:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:46:46,554 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2019-08-05 10:46:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:46,555 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:46:46,555 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:46:46,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:46:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:46:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-05 10:46:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:46:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-08-05 10:46:46,559 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-08-05 10:46:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:46,559 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-08-05 10:46:46,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:46:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-08-05 10:46:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:46:46,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:46,560 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2019-08-05 10:46:46,561 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1061464675, now seen corresponding path program 86 times [2019-08-05 10:46:46,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:49,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:49,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:46:49,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:46:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:46:49,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:46:49,468 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2019-08-05 10:46:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:50,083 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-08-05 10:46:50,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:46:50,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2019-08-05 10:46:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:50,084 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:46:50,084 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:46:50,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:46:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:46:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-05 10:46:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 10:46:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-08-05 10:46:50,087 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-08-05 10:46:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:50,088 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-08-05 10:46:50,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:46:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-08-05 10:46:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:46:50,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:50,089 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2019-08-05 10:46:50,089 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2076745311, now seen corresponding path program 87 times [2019-08-05 10:46:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:50,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:50,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:46:53,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:46:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:46:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:46:53,151 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 90 states. [2019-08-05 10:46:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:53,296 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:46:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:46:53,297 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 180 [2019-08-05 10:46:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:53,298 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:46:53,298 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:46:53,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:46:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:46:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-05 10:46:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:46:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-08-05 10:46:53,301 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-08-05 10:46:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:53,301 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-08-05 10:46:53,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:46:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-08-05 10:46:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-05 10:46:53,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:53,302 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2019-08-05 10:46:53,302 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1491106981, now seen corresponding path program 88 times [2019-08-05 10:46:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:53,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:46:53,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:56,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:46:56,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:46:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:46:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:46:56,191 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 91 states. [2019-08-05 10:46:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:56,325 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-08-05 10:46:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:46:56,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 182 [2019-08-05 10:46:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:56,327 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:46:56,327 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 10:46:56,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:46:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 10:46:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-05 10:46:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:46:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-08-05 10:46:56,330 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-08-05 10:46:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:56,331 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-08-05 10:46:56,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:46:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-08-05 10:46:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:46:56,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:56,332 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2019-08-05 10:46:56,332 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1481709911, now seen corresponding path program 89 times [2019-08-05 10:46:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:56,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:56,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:59,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:59,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:46:59,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:46:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:46:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:46:59,592 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 92 states. [2019-08-05 10:46:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:59,726 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-08-05 10:46:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:46:59,726 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 184 [2019-08-05 10:46:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:59,727 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:46:59,728 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:46:59,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:46:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:46:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-05 10:46:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:46:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-08-05 10:46:59,733 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-08-05 10:46:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:59,734 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-08-05 10:46:59,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:46:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-08-05 10:46:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-05 10:46:59,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:59,735 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2019-08-05 10:46:59,735 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2089476013, now seen corresponding path program 90 times [2019-08-05 10:46:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:59,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:46:59,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:02,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:02,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:47:02,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:47:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:47:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:47:02,733 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2019-08-05 10:47:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:02,870 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-08-05 10:47:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:47:02,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2019-08-05 10:47:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:02,871 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:47:02,872 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:47:02,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:47:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:47:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-05 10:47:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:47:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-08-05 10:47:02,875 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-08-05 10:47:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:02,876 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-08-05 10:47:02,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:47:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-08-05 10:47:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:47:02,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:02,877 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2019-08-05 10:47:02,877 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1974687823, now seen corresponding path program 91 times [2019-08-05 10:47:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:02,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:02,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:06,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:06,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:47:06,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:47:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:47:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:47:06,151 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 94 states. [2019-08-05 10:47:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:06,297 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-08-05 10:47:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:47:06,298 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 188 [2019-08-05 10:47:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:06,299 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:47:06,299 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:47:06,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:47:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:47:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-05 10:47:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-05 10:47:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-08-05 10:47:06,303 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-08-05 10:47:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:06,303 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-08-05 10:47:06,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:47:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-08-05 10:47:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-05 10:47:06,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:06,305 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2019-08-05 10:47:06,305 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -784105141, now seen corresponding path program 92 times [2019-08-05 10:47:06,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:06,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:47:06,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:10,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:47:10,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:47:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:47:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:47:10,118 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 95 states. [2019-08-05 10:47:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,284 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-05 10:47:10,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:47:10,284 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 190 [2019-08-05 10:47:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,286 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:47:10,286 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:47:10,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:47:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:47:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-08-05 10:47:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:47:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-08-05 10:47:10,289 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-08-05 10:47:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,289 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-08-05 10:47:10,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:47:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-08-05 10:47:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 10:47:10,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,290 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2019-08-05 10:47:10,290 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1989321913, now seen corresponding path program 93 times [2019-08-05 10:47:10,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:47:13,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:47:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:47:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:47:13,701 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 96 states. [2019-08-05 10:47:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,829 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-08-05 10:47:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:47:13,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 192 [2019-08-05 10:47:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,830 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:47:13,830 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:47:13,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 97 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:47:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:47:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-05 10:47:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-05 10:47:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-08-05 10:47:13,833 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-08-05 10:47:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,833 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-08-05 10:47:13,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:47:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-08-05 10:47:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:47:13,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,834 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2019-08-05 10:47:13,834 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -561469885, now seen corresponding path program 94 times [2019-08-05 10:47:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:47:17,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:47:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:47:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:47:17,038 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2019-08-05 10:47:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:17,183 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-08-05 10:47:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:47:17,183 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2019-08-05 10:47:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:17,185 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:47:17,185 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:47:17,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:47:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:47:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-05 10:47:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:47:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-08-05 10:47:17,188 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-08-05 10:47:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:17,189 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-08-05 10:47:17,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:47:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-08-05 10:47:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:47:17,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:17,190 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2019-08-05 10:47:17,190 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1509761599, now seen corresponding path program 95 times [2019-08-05 10:47:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:17,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:17,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:47:20,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:47:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:47:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:47:20,807 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 98 states. [2019-08-05 10:47:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:21,102 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-08-05 10:47:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:47:21,103 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 196 [2019-08-05 10:47:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:21,104 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:47:21,104 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 10:47:21,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:47:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 10:47:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-05 10:47:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 10:47:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-08-05 10:47:21,108 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-08-05 10:47:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:21,108 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-08-05 10:47:21,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:47:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-08-05 10:47:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-05 10:47:21,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:21,110 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2019-08-05 10:47:21,110 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash -901607621, now seen corresponding path program 96 times [2019-08-05 10:47:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:21,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:47:21,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:24,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:47:24,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:47:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:47:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:47:24,683 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 99 states. [2019-08-05 10:47:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,833 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-08-05 10:47:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:47:24,833 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 198 [2019-08-05 10:47:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,835 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:47:24,835 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:47:24,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 100 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:47:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:47:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-08-05 10:47:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:47:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-08-05 10:47:24,838 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-08-05 10:47:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,839 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-08-05 10:47:24,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:47:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-08-05 10:47:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:47:24,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,840 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2019-08-05 10:47:24,840 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1054911799, now seen corresponding path program 97 times [2019-08-05 10:47:24,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:28,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:28,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:47:28,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:47:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:47:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:47:28,215 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 100 states. [2019-08-05 10:47:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:28,375 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-05 10:47:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:47:28,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 200 [2019-08-05 10:47:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:28,377 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:47:28,377 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:47:28,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:47:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:47:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-05 10:47:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:47:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-08-05 10:47:28,380 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-08-05 10:47:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:28,381 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-08-05 10:47:28,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:47:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-08-05 10:47:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 10:47:28,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:28,382 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2019-08-05 10:47:28,382 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 74398771, now seen corresponding path program 98 times [2019-08-05 10:47:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:28,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:47:28,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:47:32,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:47:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:47:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:47:32,217 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2019-08-05 10:47:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,392 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-08-05 10:47:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:47:32,393 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2019-08-05 10:47:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,394 INFO L225 Difference]: With dead ends: 205 [2019-08-05 10:47:32,394 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 10:47:32,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:47:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 10:47:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-05 10:47:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:47:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-08-05 10:47:32,398 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-08-05 10:47:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,398 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-08-05 10:47:32,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:47:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-08-05 10:47:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:47:32,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,399 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2019-08-05 10:47:32,399 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1600783313, now seen corresponding path program 99 times [2019-08-05 10:47:32,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:36,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:47:36,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:47:36,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:47:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:47:36,228 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 102 states. [2019-08-05 10:47:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:36,385 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-08-05 10:47:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:47:36,386 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 204 [2019-08-05 10:47:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:36,387 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:47:36,387 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:47:36,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:47:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:47:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-05 10:47:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 10:47:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-08-05 10:47:36,390 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-08-05 10:47:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:36,391 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-08-05 10:47:36,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:47:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-08-05 10:47:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:47:36,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:36,392 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2019-08-05 10:47:36,392 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:36,392 INFO L82 PathProgramCache]: Analyzing trace with hash -838030037, now seen corresponding path program 100 times [2019-08-05 10:47:36,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:36,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:47:36,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:47:40,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:47:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:47:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:47:40,375 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 103 states. [2019-08-05 10:47:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,548 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-08-05 10:47:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:47:40,548 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 206 [2019-08-05 10:47:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,550 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:47:40,550 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:47:40,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:47:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:47:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-05 10:47:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:47:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-08-05 10:47:40,552 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-08-05 10:47:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,552 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-08-05 10:47:40,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:47:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-08-05 10:47:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:47:40,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,553 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2019-08-05 10:47:40,553 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2023427879, now seen corresponding path program 101 times [2019-08-05 10:47:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:44,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:47:44,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:47:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:47:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:47:44,598 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 104 states. [2019-08-05 10:47:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,740 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2019-08-05 10:47:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:47:44,741 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 208 [2019-08-05 10:47:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,742 INFO L225 Difference]: With dead ends: 211 [2019-08-05 10:47:44,742 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 10:47:44,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:47:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 10:47:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-08-05 10:47:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-05 10:47:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-08-05 10:47:44,746 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-08-05 10:47:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,747 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-08-05 10:47:44,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:47:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-08-05 10:47:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-08-05 10:47:44,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,748 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2019-08-05 10:47:44,748 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1189551581, now seen corresponding path program 102 times [2019-08-05 10:47:44,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:48,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:48,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:47:48,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:47:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:47:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:47:48,639 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2019-08-05 10:47:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:48,816 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-08-05 10:47:48,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:47:48,816 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2019-08-05 10:47:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:48,818 INFO L225 Difference]: With dead ends: 213 [2019-08-05 10:47:48,818 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 10:47:48,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:47:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 10:47:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-08-05 10:47:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 10:47:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-08-05 10:47:48,822 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-08-05 10:47:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:48,822 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-08-05 10:47:48,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:47:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-08-05 10:47:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-05 10:47:48,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:48,823 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2019-08-05 10:47:48,823 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash -781326817, now seen corresponding path program 103 times [2019-08-05 10:47:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:47:53,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:47:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:47:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:47:53,239 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 106 states. [2019-08-05 10:47:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,414 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2019-08-05 10:47:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:47:53,414 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 212 [2019-08-05 10:47:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,415 INFO L225 Difference]: With dead ends: 215 [2019-08-05 10:47:53,416 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 10:47:53,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:47:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 10:47:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-08-05 10:47:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-05 10:47:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-08-05 10:47:53,420 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-08-05 10:47:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,420 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-08-05 10:47:53,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:47:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-08-05 10:47:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 10:47:53,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,421 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2019-08-05 10:47:53,422 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash 680647451, now seen corresponding path program 104 times [2019-08-05 10:47:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:47:57,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:47:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:47:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:47:57,601 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 107 states. [2019-08-05 10:47:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,816 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2019-08-05 10:47:57,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:47:57,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 214 [2019-08-05 10:47:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,817 INFO L225 Difference]: With dead ends: 217 [2019-08-05 10:47:57,817 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 10:47:57,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:47:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 10:47:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-08-05 10:47:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 10:47:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-08-05 10:47:57,821 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2019-08-05 10:47:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,822 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-08-05 10:47:57,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:47:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-08-05 10:47:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-05 10:47:57,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,823 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2019-08-05 10:47:57,823 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1183613207, now seen corresponding path program 105 times [2019-08-05 10:47:57,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:48:02,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:48:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:48:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:48:02,023 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 108 states. [2019-08-05 10:48:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,191 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2019-08-05 10:48:02,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:48:02,191 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 216 [2019-08-05 10:48:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,192 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:48:02,192 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:48:02,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:48:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:48:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-08-05 10:48:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-05 10:48:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2019-08-05 10:48:02,196 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2019-08-05 10:48:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,196 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2019-08-05 10:48:02,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:48:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2019-08-05 10:48:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-08-05 10:48:02,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,198 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2019-08-05 10:48:02,198 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -797599725, now seen corresponding path program 106 times [2019-08-05 10:48:02,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:48:06,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:48:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:48:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:48:06,335 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2019-08-05 10:48:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,564 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2019-08-05 10:48:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:48:06,564 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2019-08-05 10:48:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,565 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:48:06,565 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:48:06,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:48:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:48:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-08-05 10:48:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:48:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2019-08-05 10:48:06,570 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2019-08-05 10:48:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,570 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2019-08-05 10:48:06,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:48:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2019-08-05 10:48:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-05 10:48:06,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,571 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2019-08-05 10:48:06,572 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2072715249, now seen corresponding path program 107 times [2019-08-05 10:48:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:10,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:48:10,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:48:10,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:48:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:48:10,988 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 110 states. [2019-08-05 10:48:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:11,210 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2019-08-05 10:48:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:48:11,211 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 220 [2019-08-05 10:48:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:11,212 INFO L225 Difference]: With dead ends: 223 [2019-08-05 10:48:11,212 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 10:48:11,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:48:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 10:48:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-08-05 10:48:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:48:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-08-05 10:48:11,216 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2019-08-05 10:48:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:11,216 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-08-05 10:48:11,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:48:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-08-05 10:48:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-08-05 10:48:11,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:11,218 INFO L399 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2019-08-05 10:48:11,218 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 901912843, now seen corresponding path program 108 times [2019-08-05 10:48:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:11,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:48:11,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:15,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:48:15,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:48:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:48:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:48:15,832 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 111 states. [2019-08-05 10:48:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,034 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2019-08-05 10:48:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:48:16,035 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 222 [2019-08-05 10:48:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,036 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:48:16,036 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:48:16,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:48:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:48:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-08-05 10:48:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-05 10:48:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-08-05 10:48:16,039 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2019-08-05 10:48:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,039 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-08-05 10:48:16,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:48:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-08-05 10:48:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-05 10:48:16,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,040 INFO L399 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2019-08-05 10:48:16,040 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -928709881, now seen corresponding path program 109 times [2019-08-05 10:48:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:48:20,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:48:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:48:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:48:20,745 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 112 states. [2019-08-05 10:48:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,937 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2019-08-05 10:48:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:48:20,938 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 224 [2019-08-05 10:48:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,939 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:48:20,939 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 10:48:20,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:48:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 10:48:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-08-05 10:48:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:48:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2019-08-05 10:48:20,942 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2019-08-05 10:48:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,943 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2019-08-05 10:48:20,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:48:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2019-08-05 10:48:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 10:48:20,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,944 INFO L399 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2019-08-05 10:48:20,944 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 779443715, now seen corresponding path program 110 times [2019-08-05 10:48:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:25,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:48:25,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:48:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:48:25,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:48:25,565 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2019-08-05 10:48:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,767 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2019-08-05 10:48:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:48:25,768 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2019-08-05 10:48:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,768 INFO L225 Difference]: With dead ends: 229 [2019-08-05 10:48:25,769 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 10:48:25,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:48:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 10:48:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-08-05 10:48:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:48:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2019-08-05 10:48:25,772 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2019-08-05 10:48:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,772 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2019-08-05 10:48:25,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:48:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2019-08-05 10:48:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-05 10:48:25,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,773 INFO L399 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2019-08-05 10:48:25,773 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1637542399, now seen corresponding path program 111 times [2019-08-05 10:48:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:30,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:48:30,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:48:30,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:48:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:48:30,411 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 114 states. [2019-08-05 10:48:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:30,636 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2019-08-05 10:48:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:48:30,636 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 228 [2019-08-05 10:48:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:30,637 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:48:30,637 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:48:30,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:48:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:48:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-08-05 10:48:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-08-05 10:48:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-08-05 10:48:30,640 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2019-08-05 10:48:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:30,641 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-08-05 10:48:30,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:48:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-08-05 10:48:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-08-05 10:48:30,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:30,642 INFO L399 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2019-08-05 10:48:30,642 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1636656891, now seen corresponding path program 112 times [2019-08-05 10:48:30,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:30,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:48:30,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:35,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:35,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:48:35,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:48:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:48:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:48:35,102 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 115 states. [2019-08-05 10:48:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,481 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2019-08-05 10:48:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:48:35,481 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 230 [2019-08-05 10:48:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,482 INFO L225 Difference]: With dead ends: 233 [2019-08-05 10:48:35,482 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 10:48:35,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:48:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 10:48:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-08-05 10:48:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:48:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-08-05 10:48:35,484 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2019-08-05 10:48:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,484 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-08-05 10:48:35,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:48:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-08-05 10:48:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:48:35,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,485 INFO L399 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2019-08-05 10:48:35,485 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 785683703, now seen corresponding path program 113 times [2019-08-05 10:48:35,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:40,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:48:40,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:48:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:48:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:48:40,231 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 116 states. [2019-08-05 10:48:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:40,561 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2019-08-05 10:48:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:48:40,561 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 232 [2019-08-05 10:48:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:40,562 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:48:40,562 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:48:40,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:48:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:48:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-08-05 10:48:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 10:48:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-08-05 10:48:40,565 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2019-08-05 10:48:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:40,566 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2019-08-05 10:48:40,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:48:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2019-08-05 10:48:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 10:48:40,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:40,567 INFO L399 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2019-08-05 10:48:40,567 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash -955763725, now seen corresponding path program 114 times [2019-08-05 10:48:40,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:40,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:48:40,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:45,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:45,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:48:45,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:48:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:48:45,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:48:45,569 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2019-08-05 10:48:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:45,864 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2019-08-05 10:48:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:48:45,865 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2019-08-05 10:48:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:45,866 INFO L225 Difference]: With dead ends: 237 [2019-08-05 10:48:45,866 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 10:48:45,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 118 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:48:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 10:48:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-08-05 10:48:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-05 10:48:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2019-08-05 10:48:45,869 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2019-08-05 10:48:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:45,869 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2019-08-05 10:48:45,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:48:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2019-08-05 10:48:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-05 10:48:45,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:45,870 INFO L399 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2019-08-05 10:48:45,870 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 550503407, now seen corresponding path program 115 times [2019-08-05 10:48:45,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:45,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:48:45,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:51,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:48:51,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:48:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:48:51,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:48:51,055 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 118 states. [2019-08-05 10:48:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:51,257 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2019-08-05 10:48:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:48:51,258 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 236 [2019-08-05 10:48:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:51,258 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:48:51,259 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:48:51,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:48:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:48:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-08-05 10:48:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-05 10:48:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-08-05 10:48:51,262 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2019-08-05 10:48:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:51,262 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-08-05 10:48:51,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:48:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-08-05 10:48:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 10:48:51,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:51,263 INFO L399 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1, 1, 1] [2019-08-05 10:48:51,264 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash 669238507, now seen corresponding path program 116 times [2019-08-05 10:48:51,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:51,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:48:51,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:48:56,254 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:48:56,254 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:48:56,258 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:48:56,259 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:48:56 BoogieIcfgContainer [2019-08-05 10:48:56,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:48:56,261 INFO L168 Benchmark]: Toolchain (without parser) took 240079.22 ms. Allocated memory was 141.6 MB in the beginning and 809.0 MB in the end (delta: 667.4 MB). Free memory was 111.0 MB in the beginning and 664.6 MB in the end (delta: -553.7 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,262 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,263 INFO L168 Benchmark]: Boogie Preprocessor took 25.54 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,264 INFO L168 Benchmark]: RCFGBuilder took 341.11 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 96.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,264 INFO L168 Benchmark]: TraceAbstraction took 239670.49 ms. Allocated memory was 141.6 MB in the beginning and 809.0 MB in the end (delta: 667.4 MB). Free memory was 96.5 MB in the beginning and 664.6 MB in the end (delta: -568.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:56,267 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.4 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 141.6 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.54 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.11 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 96.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239670.49 ms. Allocated memory was 141.6 MB in the beginning and 809.0 MB in the end (delta: 667.4 MB). Free memory was 96.5 MB in the beginning and 664.6 MB in the end (delta: -568.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was analyzing trace of length 239 with TraceHistMax 117,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 117 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.6s OverallTime, 117 OverallIterations, 117 TraceHistogramMax, 14.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 812 SDtfs, 0 SDslu, 10035 SDs, 0 SdLazy, 9068 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13920 GetRequests, 7134 SyntacticMatches, 0 SemanticMatches, 6786 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 209.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=116, 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.3s AutomataMinimizationTime, 116 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 213.6s InterpolantComputationTime, 14036 NumberOfCodeBlocks, 14036 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 13920 ConstructedInterpolants, 0 QuantifiedInterpolants, 6488460 SizeOfPredicates, 116 NumberOfNonLiveVariables, 69948 ConjunctsInSsa, 6902 ConjunctsInUnsatCore, 116 InterpolantComputations, 1 PerfectInterpolantSequences, 0/520260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown