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/20170304-DifficultPathPrograms/count_by_k.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:48,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:48,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:48,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:48,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:48,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:48,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:49,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:49,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:49,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:49,007 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:49,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:49,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:49,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:49,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:49,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:49,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:49,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:49,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:49,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:49,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:49,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:49,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:49,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:49,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:49,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:49,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:49,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:49,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:49,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:49,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:49,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:49,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:49,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:49,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:49,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:49,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:49,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:49,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:49,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:49,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:49,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:49,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:49,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:49,105 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:49,105 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:49,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl [2019-08-05 10:21:49,107 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl' [2019-08-05 10:21:49,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:49,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:49,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:49,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:49,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:49,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:49,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:49,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:49,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:49,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/1) ... [2019-08-05 10:21:49,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:49,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:49,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:49,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:49,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (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:21:49,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:49,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:49,542 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:49,543 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:49 BoogieIcfgContainer [2019-08-05 10:21:49,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:49,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:49,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:49,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:49,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:49" (1/2) ... [2019-08-05 10:21:49,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b654e36 and model type count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:49, skipping insertion in model container [2019-08-05 10:21:49,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:49" (2/2) ... [2019-08-05 10:21:49,551 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bpl [2019-08-05 10:21:49,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:49,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:49,585 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:49,611 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:49,612 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:49,612 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:49,612 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:49,613 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:49,613 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:49,613 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:49,613 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:49,613 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:49,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:49,638 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,812 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:21:49,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:49,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:49,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:49,838 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,866 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:21:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:49,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,904 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:21:49,904 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:21:49,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:21:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:21:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:21:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:21:49,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:21:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,944 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:21:49,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:21:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:49,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:49,946 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:21:49,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:50,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:50,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:50,117 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:21:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,182 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:21:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:50,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,183 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:21:50,183 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:21:50,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:21:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:21:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:21:50,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:21:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,187 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:21:50,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:21:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:50,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,189 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:21:50,189 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:21:50,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:50,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:50,326 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:21:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,402 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:21:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:50,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:21:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,403 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:50,404 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:50,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:50,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:21:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,408 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:50,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:50,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,409 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:21:50,409 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:21:50,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,613 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:21:50,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:50,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:50,615 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:21:50,874 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-08-05 10:21:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,992 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:50,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:21:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,993 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:50,993 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:50,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:21:50,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:21:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,996 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:21:50,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:21:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:50,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,997 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:21:50,997 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:21:50,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:51,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:51,145 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:21:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,427 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:21:51,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:51,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:21:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,429 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:21:51,429 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:21:51,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:21:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:21:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:51,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:21:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,435 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:51,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:51,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,436 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:21:51,436 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:21:51,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:51,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:51,620 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:21:51,899 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2019-08-05 10:21:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,062 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:52,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:21:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,064 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:52,064 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:52,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:21:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:21:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:21:52,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:21:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,067 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:21:52,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:21:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:21:52,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,068 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:21:52,068 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:21:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:52,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:52,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:52,238 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:21:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,415 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:21:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:52,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:21:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,416 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:21:52,417 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:21:52,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:21:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:21:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:52,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:21:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,420 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:52,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:52,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,420 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:21:52,421 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:21:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:52,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:52,675 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:21:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,048 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:53,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:21:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,049 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:53,050 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:53,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:21:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:21:53,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:21:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,054 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:21:53,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:21:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:53,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,055 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:21:53,055 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:21:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:53,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:53,236 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:21:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,475 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:21:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:53,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:21:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,476 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:21:53,476 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:21:53,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:21:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:21:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:53,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:21:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,480 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:53,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:53,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,481 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:21:53,481 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:21:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:53,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:53,773 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:21:54,051 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-05 10:21:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,177 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:21:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:54,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:21:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,178 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:54,179 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:54,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:21:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:21:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:21:54,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:21:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,184 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:21:54,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:21:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:54,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,184 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:21:54,185 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:21:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:54,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:54,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:54,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:54,336 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:21:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,720 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:21:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:54,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:21:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,723 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:21:54,723 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:21:54,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:21:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:21:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:21:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:21:54,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:21:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,727 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:21:54,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:21:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:54,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,728 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:21:54,728 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:21:54,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:55,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:21:55,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:21:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:21:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:55,095 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:21:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:55,517 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:21:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:21:55,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:21:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:55,519 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:55,519 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:55,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:21:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:21:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:21:55,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:21:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:55,524 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:21:55,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:21:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:21:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:55,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:55,525 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:21:55,525 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:21:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:55,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:21:55,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:21:55,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:21:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:21:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:55,807 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:21:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:56,270 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:21:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:21:56,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:21:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:56,272 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:21:56,272 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:21:56,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:21:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:21:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:21:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:21:56,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:21:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:56,277 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:21:56,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:21:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:21:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:21:56,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:56,278 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:21:56,278 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:21:56,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:56,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:21:56,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:56,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:56,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:21:56,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:21:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:21:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:56,539 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:21:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:57,019 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:21:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:21:57,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:21:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:57,020 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:57,020 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:57,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:21:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:21:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:21:57,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:21:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:57,025 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:21:57,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:21:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:21:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:21:57,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,026 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:21:57,026 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:21:57,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:57,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:21:57,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:57,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:57,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:21:57,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:21:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:21:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:57,518 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:21:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:58,264 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:21:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:21:58,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:21:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:58,270 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:21:58,270 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:21:58,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:21:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:21:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:21:58,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:21:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:58,274 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:21:58,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:21:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:21:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:58,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:58,275 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:21:58,275 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:21:58,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:58,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:21:58,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:21:58,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:21:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:21:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:58,666 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:21:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:59,252 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:21:59,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:21:59,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:21:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:59,254 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:59,254 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:59,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:21:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:21:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:21:59,259 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:21:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:59,259 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:21:59,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:21:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:21:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:59,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:59,260 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:21:59,261 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:21:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:59,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:21:59,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:21:59,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:21:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:21:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:59,521 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:22:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:00,155 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:22:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:22:00,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:22:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:00,157 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:22:00,157 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:22:00,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:22:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:22:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:22:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:22:00,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:22:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:00,161 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:22:00,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:22:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:22:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:22:00,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:00,162 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:22:00,162 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:22:00,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:00,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:22:00,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:00,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:00,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:22:00,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:22:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:22:00,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:22:00,501 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:22:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:01,167 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:22:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:22:01,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:22:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:01,169 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:22:01,169 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:22:01,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:22:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:22:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:22:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:22:01,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:22:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:01,174 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:22:01,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:22:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:22:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:22:01,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:01,175 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:22:01,175 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:22:01,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:01,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:22:01,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:01,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:01,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:22:01,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:22:01,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:22:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:22:01,478 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:22:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:02,210 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:22:02,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:22:02,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:22:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:02,211 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:22:02,211 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:22:02,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:22:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:22:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:22:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:22:02,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:22:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:02,216 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:22:02,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:22:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:22:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:22:02,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:02,217 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:22:02,218 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:22:02,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:02,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:02,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:22:02,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:22:02,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:22:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:22:02,542 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:22:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:03,543 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:22:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:22:03,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:22:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:03,544 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:22:03,544 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:22:03,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:22:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:22:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:22:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:22:03,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:22:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:03,549 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:22:03,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:22:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:22:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:22:03,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:03,550 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:22:03,550 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:22:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:03,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:22:03,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:03,853 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:22:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:22:03,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:22:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:22:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:22:03,855 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:22:04,055 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2019-08-05 10:22:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:04,857 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:22:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:22:04,858 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:22:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:04,859 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:22:04,859 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:22:04,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:22:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:22:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:22:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:22:04,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:22:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:04,863 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:22:04,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:22:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:22:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:22:04,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:04,864 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:22:04,864 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:22:04,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:04,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:22:04,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:05,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:05,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:22:05,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:22:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:22:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:22:05,229 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:22:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,222 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:22:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:22:06,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:22:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,225 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:22:06,225 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:22:06,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:22:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:22:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:22:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:22:06,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:22:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,228 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:22:06,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:22:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:22:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:22:06,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,229 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:22:06,229 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:22:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:06,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:22:06,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:22:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:22:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:22:06,779 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:22:07,844 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 11 [2019-08-05 10:22:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:08,304 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:22:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:22:08,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:22:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:08,305 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:22:08,305 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:22:08,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:22:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:22:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:22:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:22:08,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:22:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:08,311 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:22:08,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:22:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:22:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:22:08,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:08,311 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:22:08,312 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:22:08,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:08,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:22:08,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:08,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:22:08,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:22:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:22:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:22:08,672 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:22:09,934 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-05 10:22:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:10,325 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:22:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:22:10,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:22:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:10,327 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:22:10,327 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:22:10,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:22:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:22:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:22:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:22:10,331 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:22:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:10,332 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:22:10,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:22:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:22:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:22:10,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:10,333 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:22:10,333 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:22:10,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:10,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:22:10,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:22:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:22:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:22:10,742 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:22:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:12,036 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:22:12,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:22:12,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:22:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:12,037 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:22:12,037 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:22:12,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:22:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:22:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:22:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:22:12,040 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:22:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:12,041 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:22:12,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:22:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:22:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:22:12,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:12,042 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:22:12,042 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:22:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:12,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:22:12,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:12,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:12,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:22:12,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:22:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:22:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:22:12,523 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:22:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,031 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:22:14,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:22:14,031 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:22:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,032 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:22:14,032 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:22:14,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:22:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:22:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:22:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:22:14,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:22:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,036 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:22:14,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:22:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:22:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:22:14,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,037 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:22:14,037 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:22:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:14,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:14,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:22:14,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:22:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:22:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:22:14,508 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:22:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:16,098 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:22:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:22:16,098 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:22:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:16,099 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:22:16,099 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:22:16,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:22:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:22:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:22:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:22:16,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:22:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:16,104 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:22:16,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:22:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:22:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:22:16,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:16,105 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:22:16,105 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:22:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:16,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:22:16,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:16,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:22:16,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:22:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:22:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:22:16,560 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:22:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:18,092 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:22:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:22:18,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:22:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:18,093 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:22:18,093 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:22:18,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:22:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:22:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:22:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:22:18,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:22:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:18,098 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:22:18,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:22:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:22:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:22:18,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:18,099 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:22:18,099 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:22:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:18,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:22:18,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:18,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:18,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:22:18,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:22:18,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:22:18,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:22:18,855 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:22:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,548 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:22:20,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:22:20,548 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:22:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,549 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:22:20,549 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:22:20,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:22:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:22:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:22:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:22:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:22:20,554 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:22:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,554 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:22:20,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:22:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:22:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:22:20,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,555 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:22:20,555 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:22:20,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:22:21,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:22:21,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:22:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:22:21,130 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:22:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,956 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:22:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:22:22,956 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:22:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,957 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:22:22,957 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:22:22,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:22:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:22:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:22:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:22:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:22:22,962 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:22:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,962 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:22:22,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:22:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:22:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:22:22,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,963 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:22:22,963 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:22:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:23,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:22:23,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:22:23,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:22:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:22:23,798 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:22:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:25,765 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:22:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:22:25,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:22:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:25,766 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:22:25,766 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:22:25,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:22:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:22:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:22:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:22:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:22:25,770 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:22:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:25,771 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:22:25,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:22:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:22:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:22:25,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:25,771 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:22:25,771 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:22:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:25,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:22:25,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:26,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:22:26,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:22:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:22:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:22:26,331 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:22:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:28,351 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:22:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:22:28,352 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:22:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:28,353 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:22:28,353 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:22:28,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:22:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:22:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:22:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:22:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:22:28,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:22:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:28,357 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:22:28,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:22:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:22:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:22:28,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:28,358 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:22:28,358 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:22:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:28,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:22:28,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:22:31,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:22:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:22:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:31,150 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:22:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:33,313 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:22:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:22:33,313 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:22:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:33,314 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:22:33,314 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:22:33,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:22:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:22:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:22:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:22:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:22:33,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:22:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:33,319 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:22:33,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:22:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:22:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:22:33,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:33,319 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:22:33,320 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:22:33,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:33,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:22:33,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:34,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:34,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:22:34,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:22:34,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:22:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:22:34,457 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:22:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:36,785 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:22:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:22:36,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:22:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:36,787 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:22:36,787 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:22:36,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:22:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:22:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:22:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:22:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:22:36,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:22:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:36,791 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:22:36,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:22:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:22:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:22:36,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:36,791 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:22:36,792 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:36,792 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:22:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:22:36,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:37,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:37,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:22:37,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:22:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:22:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:37,499 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:22:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:40,097 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:22:40,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:22:40,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:22:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:40,098 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:22:40,098 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:22:40,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:22:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:22:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:22:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:22:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:22:40,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:22:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:40,102 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:22:40,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:22:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:22:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:22:40,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:40,103 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:22:40,103 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:22:40,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:40,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:22:40,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:40,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:40,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:22:40,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:22:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:22:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:41,000 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:22:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:43,714 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:22:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:22:43,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:22:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:43,715 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:22:43,715 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:22:43,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:22:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:22:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:22:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:22:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:22:43,719 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:22:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:43,719 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:22:43,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:22:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:22:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:22:43,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:43,719 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:22:43,720 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:22:43,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:43,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:22:43,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:44,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:44,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:22:44,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:22:44,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:22:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:44,823 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:22:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:47,625 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:22:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:22:47,626 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:22:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:47,627 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:22:47,627 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:22:47,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:22:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:22:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:22:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:22:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:22:47,630 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:22:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:47,631 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:22:47,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:22:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:22:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:22:47,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:47,632 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:22:47,632 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:22:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:22:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:48,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:48,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:22:48,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:22:48,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:22:48,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:48,439 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:22:49,043 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 11 [2019-08-05 10:22:49,180 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 11 [2019-08-05 10:22:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:51,617 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:22:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:22:51,617 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:22:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:51,618 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:22:51,618 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:22:51,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:22:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:22:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:22:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:22:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:22:51,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:22:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:51,622 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:22:51,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:22:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:22:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:22:51,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:51,623 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:22:51,623 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:51,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:22:51,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:51,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:22:51,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:22:52,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:22:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:22:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:52,471 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:22:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:55,765 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:22:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:22:55,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:22:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:55,766 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:22:55,766 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:22:55,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:22:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:22:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:22:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:22:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:22:55,770 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:22:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:55,770 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:22:55,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:22:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:22:55,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:55,771 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:22:55,771 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:22:55,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:55,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:22:55,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:56,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:56,679 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:23:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:00,269 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:23:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:23:00,270 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:23:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:00,270 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:23:00,270 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:23:00,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:23:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:23:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:23:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:23:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:23:00,274 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:23:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:00,274 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:23:00,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:23:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:23:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:23:00,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:00,275 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:23:00,275 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:23:00,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:00,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:23:00,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:01,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:23:01,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:23:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:23:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:23:01,236 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:23:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:05,049 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:23:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:23:05,049 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:23:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:05,050 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:23:05,050 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:23:05,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:23:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:23:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:23:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:23:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:23:05,054 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:23:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:05,054 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:23:05,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:23:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:23:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:23:05,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:05,055 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:23:05,055 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:23:05,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:05,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:23:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:23:06,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:23:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:23:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:23:06,024 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:23:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:09,937 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:23:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:23:09,938 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:23:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:09,939 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:23:09,939 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:23:09,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:23:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:23:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:23:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:23:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:23:09,941 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:23:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:09,942 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:23:09,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:23:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:23:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:23:09,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:09,942 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:23:09,943 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:23:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:09,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:23:09,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:23:10,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:23:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:23:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:23:10,996 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:23:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:15,328 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:23:15,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:23:15,329 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:23:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:15,329 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:23:15,329 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:23:15,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:23:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:23:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:23:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:23:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:23:15,333 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:23:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:15,333 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:23:15,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:23:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:23:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:23:15,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:15,334 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:23:15,334 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:23:15,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:15,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:23:15,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:16,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:23:16,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:23:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:23:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:23:16,388 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:23:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:21,021 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:23:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:23:21,022 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:23:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:21,022 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:23:21,022 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:23:21,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:23:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:23:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:23:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:23:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:23:21,026 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:23:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:21,026 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:23:21,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:23:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:23:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:23:21,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:21,027 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:23:21,028 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:23:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:21,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:23:21,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:22,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:22,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:23:22,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:23:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:23:22,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:23:22,148 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:23:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:26,917 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:23:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:23:26,918 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:23:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:26,918 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:23:26,919 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:23:26,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:23:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:23:26,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:23:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:23:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:23:26,922 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:23:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:26,922 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:23:26,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:23:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:23:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:23:26,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:26,923 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:23:26,923 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:23:26,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:26,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:23:26,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:28,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:23:28,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:23:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:23:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:23:28,093 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:23:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:33,219 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:23:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:23:33,219 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:23:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:33,220 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:23:33,220 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:23:33,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:23:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:23:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:23:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:23:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:23:33,223 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:23:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:33,223 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:23:33,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:23:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:23:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:23:33,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:33,224 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:23:33,224 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:23:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:33,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:23:33,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:23:34,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:23:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:23:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:23:34,426 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:23:34,767 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:23:35,001 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-05 10:23:35,131 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 11 [2019-08-05 10:23:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:39,547 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:23:39,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:23:39,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:23:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:39,549 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:23:39,549 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:23:39,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:23:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:23:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:23:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:23:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:23:39,552 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:23:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:39,552 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:23:39,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:23:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:23:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:23:39,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:39,553 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:23:39,553 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:23:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:39,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:23:39,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:41,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:41,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:23:41,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:23:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:23:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:23:41,085 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:23:41,434 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:23:41,560 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:23:41,692 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:23:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:46,544 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:23:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:23:46,544 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:23:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:46,545 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:23:46,545 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:23:46,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:23:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:23:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:23:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:23:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:23:46,549 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:23:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:46,549 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:23:46,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:23:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:23:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:23:46,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:46,550 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:23:46,550 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:23:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:46,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:23:46,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:47,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:47,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:23:47,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:23:47,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:23:47,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:23:47,845 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:23:48,204 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:23:48,323 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:23:48,573 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:23:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:53,444 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:23:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:23:53,444 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:23:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:53,445 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:23:53,445 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:23:53,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:23:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:23:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:23:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:23:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:23:53,449 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:23:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:53,449 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:23:53,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:23:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:23:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:23:53,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:53,450 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:23:53,450 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:23:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:53,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:23:53,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:23:54,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:23:54,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:23:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:23:54,812 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:23:55,227 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:23:55,352 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:23:55,491 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:23:55,634 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:23:55,779 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:23:55,924 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-05 10:24:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:00,878 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:24:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:24:00,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:24:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:00,879 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:24:00,879 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:24:00,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:24:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:24:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:24:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:24:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:24:00,881 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:24:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:00,882 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:24:00,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:24:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:24:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:24:00,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:00,882 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:24:00,883 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:24:00,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:00,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:24:00,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:02,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:02,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:24:02,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:24:02,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:24:02,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:24:02,342 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:24:02,602 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 9 [2019-08-05 10:24:02,729 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:02,978 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:03,119 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:24:03,254 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:24:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:08,704 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:24:08,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:24:08,706 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:24:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:08,707 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:24:08,707 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:24:08,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:24:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:24:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:24:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:24:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:24:08,711 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:24:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:08,711 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:24:08,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:24:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:24:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:24:08,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:08,712 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:24:08,712 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:24:08,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:08,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:24:08,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:24:10,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:24:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:24:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:24:10,158 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:24:10,416 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 9 [2019-08-05 10:24:10,549 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:10,676 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:10,817 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:10,957 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:11,105 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:24:11,249 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:24:13,888 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 11 [2019-08-05 10:24:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:16,836 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:24:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:24:16,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:24:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:16,837 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:24:16,837 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:24:16,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:24:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:24:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:24:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:24:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:24:16,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:24:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:16,840 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:24:16,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:24:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:24:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:24:16,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:16,840 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:24:16,841 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:24:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:16,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:24:16,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:18,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:18,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:24:18,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:24:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:24:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:24:18,345 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:24:18,508 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 8 [2019-08-05 10:24:18,642 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 9 [2019-08-05 10:24:18,785 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:24:18,919 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:19,055 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:19,187 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:19,458 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:24:19,605 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:24:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:25,156 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:24:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:24:25,157 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:24:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:25,157 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:24:25,158 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:24:25,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:24:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:24:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:24:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:24:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:24:25,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:24:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:25,161 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:24:25,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:24:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:24:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:24:25,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:25,162 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:24:25,162 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:24:25,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:24:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:24:27,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:24:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:24:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:24:27,598 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:24:27,740 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 8 [2019-08-05 10:24:27,870 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 9 [2019-08-05 10:24:28,001 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:24:28,136 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:24:28,282 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:28,421 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:28,561 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:28,700 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:28,849 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:24:29,146 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:24:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:34,689 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:24:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:24:34,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:24:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:34,690 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:24:34,691 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:24:34,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:24:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:24:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:24:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:24:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:24:34,694 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:24:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:34,694 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:24:34,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:24:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:24:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:24:34,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:34,695 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:24:34,695 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:24:34,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:34,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:24:34,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:36,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:36,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:24:36,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:24:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:24:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:24:36,284 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:24:36,434 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 8 [2019-08-05 10:24:36,585 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 9 [2019-08-05 10:24:36,729 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:24:36,878 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:24:37,023 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:24:37,164 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:37,305 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:37,451 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:37,604 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:43,757 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:24:43,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:24:43,757 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:24:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:43,758 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:24:43,758 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:24:43,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:24:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:24:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:24:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:24:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:24:43,761 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:24:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:43,761 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:24:43,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:24:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:24:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:24:43,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:43,761 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:24:43,762 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:24:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:43,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:24:43,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:24:45,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:24:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:24:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:24:45,400 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:24:45,555 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 8 [2019-08-05 10:24:45,694 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 9 [2019-08-05 10:24:45,843 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:24:45,987 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:24:46,137 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:24:46,282 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:24:46,435 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:46,587 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:46,738 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:46,911 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:47,083 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:24:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:53,247 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:24:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:24:53,249 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:24:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:53,249 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:24:53,250 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:24:53,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:24:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:24:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:24:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:24:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:24:53,253 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:24:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:53,253 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:24:53,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:24:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:24:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:24:53,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:53,254 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:24:53,254 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:53,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:53,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:24:53,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:53,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:24:53,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:24:54,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:24:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:24:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:24:54,958 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:24:55,115 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 8 [2019-08-05 10:24:55,258 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 9 [2019-08-05 10:24:55,407 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:24:55,553 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:24:55,710 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:24:55,857 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:24:56,008 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:24:56,155 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:24:56,317 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:24:56,484 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:24:56,636 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:24:56,969 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:24:57,149 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:25:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:03,186 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:25:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:25:03,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:25:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:03,188 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:25:03,188 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:25:03,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:25:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:25:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:25:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:25:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:25:03,192 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:25:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:03,192 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:25:03,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:25:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:25:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:25:03,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:03,193 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:25:03,193 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:25:03,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:03,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:25:03,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:04,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:04,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:25:04,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:25:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:25:04,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:25:04,923 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:25:05,082 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 8 [2019-08-05 10:25:05,235 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 9 [2019-08-05 10:25:05,384 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:25:05,540 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:25:05,688 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:25:05,843 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:25:06,003 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:25:06,155 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:25:06,312 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:25:06,476 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:25:06,642 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:25:06,806 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:25:06,977 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:25:07,325 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:25:07,510 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-05 10:25:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:13,899 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:25:13,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:25:13,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:25:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:13,901 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:25:13,901 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:25:13,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:25:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:25:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:25:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:25:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:25:13,905 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:25:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:13,905 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:25:13,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:25:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:25:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:25:13,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:13,906 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:25:13,906 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:25:13,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:25:14,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:15,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:15,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:25:15,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:25:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:25:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:25:15,716 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:25:15,875 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 8 [2019-08-05 10:25:16,032 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 9 [2019-08-05 10:25:16,187 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:25:16,345 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:25:16,509 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:25:16,669 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:25:16,829 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:25:16,988 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:25:17,157 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:25:17,323 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:25:17,515 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:25:17,706 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:25:17,882 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:25:18,226 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:25:19,425 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 11 [2019-08-05 10:25:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:25,112 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:25:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:25:25,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:25:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:25,114 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:25:25,114 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:25:25,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:25:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:25:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:25:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:25:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:25:25,117 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:25:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:25,117 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:25:25,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:25:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:25:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:25:25,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:25,117 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:25:25,118 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:25:25,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:25,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:25:25,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:27,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:25:27,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:25:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:25:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:25:27,049 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:25:27,227 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 8 [2019-08-05 10:25:27,382 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 9 [2019-08-05 10:25:27,542 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:25:27,719 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:25:27,897 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:25:28,061 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:25:28,225 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:25:28,386 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:25:28,553 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:25:28,729 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:25:28,905 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:25:29,069 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:25:29,235 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:25:29,413 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:25:29,589 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:25:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:36,237 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:25:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:25:36,237 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:25:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:36,238 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:25:36,238 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:25:36,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:25:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:25:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:25:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:25:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:25:36,241 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:25:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:36,242 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:25:36,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:25:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:25:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:25:36,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:36,242 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:25:36,242 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:25:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:36,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:25:36,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:38,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:25:38,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:25:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:25:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:25:38,418 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:25:38,599 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 8 [2019-08-05 10:25:38,754 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 9 [2019-08-05 10:25:38,928 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:25:39,093 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:25:39,253 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:25:39,421 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:25:39,587 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:25:39,754 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:25:39,925 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:25:40,104 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:25:40,279 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:25:40,447 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:25:40,623 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:25:40,801 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:25:40,994 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:25:41,178 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:25:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:47,957 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:25:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:25:47,958 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:25:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:47,959 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:25:47,959 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:25:47,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:25:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:25:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:25:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:25:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:25:47,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:25:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:47,962 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:25:47,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:25:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:25:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:25:47,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:47,963 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:25:47,963 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:25:47,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:48,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:25:48,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:50,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:50,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:25:50,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:25:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:25:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:25:50,239 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:25:50,426 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 8 [2019-08-05 10:25:50,581 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 9 [2019-08-05 10:25:50,755 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-05 10:25:50,921 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:25:51,090 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:25:51,257 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:25:51,423 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:25:51,596 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:25:51,771 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-05 10:25:51,951 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-05 10:25:52,128 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-05 10:25:52,311 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-05 10:25:52,492 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-05 10:25:52,670 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-05 10:25:52,860 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-05 10:25:53,050 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-05 10:25:53,247 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-05 10:25:53,455 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-05 10:25:53,656 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-05 10:26:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:00,225 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:26:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:26:00,226 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:26:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:00,227 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:26:00,227 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:26:00,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:26:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:26:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:26:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:26:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:26:00,229 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:26:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:00,230 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:26:00,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:26:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:26:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:26:00,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:00,230 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:26:00,230 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:26:00,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:00,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:26:00,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:26:02,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:26:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:26:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:26:02,302 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:26:02,485 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 8 [2019-08-05 10:26:02,647 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 9 [2019-08-05 10:26:02,812 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 11 [2019-08-05 10:26:02,985 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-05 10:26:03,167 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-05 10:26:03,338 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-05 10:26:03,517 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-05 10:26:03,711 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-05 10:26:03,906 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-05 10:26:04,094 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 Received shutdown request... [2019-08-05 10:26:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:04,108 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:26:04,112 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:26:04,113 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:26:04 BoogieIcfgContainer [2019-08-05 10:26:04,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:26:04,114 INFO L168 Benchmark]: Toolchain (without parser) took 254966.82 ms. Allocated memory was 142.1 MB in the beginning and 266.9 MB in the end (delta: 124.8 MB). Free memory was 110.4 MB in the beginning and 129.8 MB in the end (delta: -19.5 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:04,114 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:26:04,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.68 ms. Allocated memory is still 142.1 MB. Free memory was 110.1 MB in the beginning and 108.6 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:26:04,115 INFO L168 Benchmark]: Boogie Preprocessor took 21.62 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 107.5 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:26:04,116 INFO L168 Benchmark]: RCFGBuilder took 334.23 ms. Allocated memory is still 142.1 MB. Free memory was 107.5 MB in the beginning and 98.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:04,116 INFO L168 Benchmark]: TraceAbstraction took 254568.35 ms. Allocated memory was 142.1 MB in the beginning and 266.9 MB in the end (delta: 124.8 MB). Free memory was 97.8 MB in the beginning and 129.8 MB in the end (delta: -32.0 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:04,118 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 142.1 MB. Free memory was 111.6 MB in the beginning and 111.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.68 ms. Allocated memory is still 142.1 MB. Free memory was 110.1 MB in the beginning and 108.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.62 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 107.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.23 ms. Allocated memory is still 142.1 MB. Free memory was 107.5 MB in the beginning and 98.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254568.35 ms. Allocated memory was 142.1 MB in the beginning and 266.9 MB in the end (delta: 124.8 MB). Free memory was 97.8 MB in the beginning and 129.8 MB in the end (delta: -32.0 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (66states) and FLOYD_HOARE automaton (currently 12 states, 65 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 254.5s OverallTime, 63 OverallIterations, 62 TraceHistogramMax, 198.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 0 SDslu, 1953 SDs, 0 SdLazy, 4470 SolverSat, 1830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3978 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3914 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37864 ImplicationChecksByTransitivity, 241.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 62 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 2142 NumberOfCodeBlocks, 2142 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 463783 SizeOfPredicates, 128 NumberOfNonLiveVariables, 6993 ConjunctsInSsa, 2146 ConjunctsInUnsatCore, 63 InterpolantComputations, 1 PerfectInterpolantSequences, 0/41664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown