java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:48:20,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:48:20,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:48:20,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:48:20,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:48:20,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:48:20,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:48:20,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:48:20,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:48:20,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:48:20,287 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:48:20,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:48:20,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:48:20,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:48:20,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:48:20,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:48:20,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:48:20,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:48:20,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:48:20,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:48:20,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:48:20,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:48:20,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:48:20,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:48:20,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:48:20,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:48:20,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:48:20,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:48:20,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:48:20,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:48:20,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:48:20,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:48:20,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:48:20,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:48:20,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:48:20,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:48:20,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:48:20,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:48:20,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:48:20,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:48:20,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:48:20,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:48:20,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:48:20,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:48:20,381 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:48:20,382 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:48:20,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2019-08-05 10:48:20,383 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2019-08-05 10:48:20,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:48:20,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:48:20,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:20,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:48:20,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:48:20,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:48:20,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:48:20,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:48:20,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:48:20,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/1) ... [2019-08-05 10:48:20,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:48:20,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:48:20,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:48:20,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:48:20,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (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:48:20,538 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:48:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:48:20,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:48:20,811 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:48:20,813 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:48:20,814 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:48:20,816 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:48:20 BoogieIcfgContainer [2019-08-05 10:48:20,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:48:20,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:48:20,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:48:20,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:48:20,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:48:20" (1/2) ... [2019-08-05 10:48:20,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512aa1be and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:48:20, skipping insertion in model container [2019-08-05 10:48:20,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:48:20" (2/2) ... [2019-08-05 10:48:20,825 INFO L109 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2019-08-05 10:48:20,835 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:48:20,848 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:48:20,864 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:48:20,887 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:48:20,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:48:20,888 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:48:20,888 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:48:20,888 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:48:20,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:48:20,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:48:20,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:48:20,889 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:48:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:48:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:48:20,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:48:20,911 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:48:20,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,047 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:48:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:48:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:48:21,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:48:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:48:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:48:21,071 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:48:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,153 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:48:21,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:48:21,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:48:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,187 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:48:21,187 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:48:21,193 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:48:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:48:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:48:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:48:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:48:21,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:48:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,235 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:48:21,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:48:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:48:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:48:21,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:48:21,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2019-08-05 10:48:21,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:48:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:48:21,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:48:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:48:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:48:21,302 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:48:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,325 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:48:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:48:21,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:48:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,326 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:48:21,326 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:48:21,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:48:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:48:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:48:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:48:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:48:21,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:48:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,330 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:48:21,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:48:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:48:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:48:21,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:48:21,331 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2019-08-05 10:48:21,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:48:21,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:48:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:48:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:21,420 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 10:48:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,486 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:48:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:48:21,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:48:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,488 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:48:21,488 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:48:21,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:48:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:48:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:48:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:48:21,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:48:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,492 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:48:21,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:48:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:48:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:48:21,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,493 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:48:21,493 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2019-08-05 10:48:21,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:48:21,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:48:21,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:48:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:48:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:21,571 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 10:48:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,611 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 10:48:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:48:21,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:48:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,613 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:48:21,613 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:48:21,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:48:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:48:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:48:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:48:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:48:21,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-05 10:48:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,617 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:48:21,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:48:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:48:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:48:21,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,618 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 10:48:21,619 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2019-08-05 10:48:21,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:48:21,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:48:21,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:48:21,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:48:21,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:48:21,742 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-05 10:48:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,789 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:48:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:48:21,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 10:48:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,790 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:48:21,791 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:48:21,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:48:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:48:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 10:48:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:48:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 10:48:21,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-08-05 10:48:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,796 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 10:48:21,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:48:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 10:48:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:48:21,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,797 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2019-08-05 10:48:21,797 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1664408161, now seen corresponding path program 4 times [2019-08-05 10:48:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 10:48:21,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:48:21,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:48:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:48:21,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:48:21,994 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2019-08-05 10:48:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,081 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 10:48:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:48:22,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 10:48:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,083 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:48:22,083 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:48:22,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:48:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:48:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-08-05 10:48:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:48:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 10:48:22,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2019-08-05 10:48:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,088 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 10:48:22,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:48:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 10:48:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:48:22,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,089 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2019-08-05 10:48:22,089 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1303113173, now seen corresponding path program 5 times [2019-08-05 10:48:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 10:48:22,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:48:22,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:48:22,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:48:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:48:22,300 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2019-08-05 10:48:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,343 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-08-05 10:48:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:48:22,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 10:48:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,346 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:48:22,346 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:48:22,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:48:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:48:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-08-05 10:48:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:48:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-08-05 10:48:22,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2019-08-05 10:48:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,351 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-08-05 10:48:22,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:48:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-08-05 10:48:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:48:22,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,352 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1] [2019-08-05 10:48:22,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1813927157, now seen corresponding path program 6 times [2019-08-05 10:48:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:48:22,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:48:22,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:48:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:48:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:22,583 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 8 states. [2019-08-05 10:48:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,661 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-08-05 10:48:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:48:22,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-08-05 10:48:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,662 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:48:22,662 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:48:22,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:48:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:48:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-08-05 10:48:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:48:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-08-05 10:48:22,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2019-08-05 10:48:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,667 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-08-05 10:48:22,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:48:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-08-05 10:48:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:22,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,669 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1] [2019-08-05 10:48:22,669 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -568974657, now seen corresponding path program 7 times [2019-08-05 10:48:22,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:48:22,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:48:22,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:48:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:48:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:48:22,851 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 9 states. [2019-08-05 10:48:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:22,911 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-08-05 10:48:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:48:22,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 10:48:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:22,913 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:48:22,913 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:48:22,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:48:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:48:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-08-05 10:48:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:48:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-08-05 10:48:22,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2019-08-05 10:48:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:22,918 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-08-05 10:48:22,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:48:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-08-05 10:48:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:48:22,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:22,919 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 7, 1, 1, 1] [2019-08-05 10:48:22,919 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash -797049975, now seen corresponding path program 8 times [2019-08-05 10:48:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 10:48:23,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:48:23,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:48:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:48:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:48:23,403 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2019-08-05 10:48:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,499 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-08-05 10:48:23,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:48:23,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-08-05 10:48:23,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,500 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:48:23,500 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:48:23,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:48:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:48:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-08-05 10:48:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:48:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-08-05 10:48:23,505 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 31 [2019-08-05 10:48:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,505 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-08-05 10:48:23,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:48:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-08-05 10:48:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:48:23,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,507 INFO L399 BasicCegarLoop]: trace histogram [16, 8, 8, 1, 1, 1] [2019-08-05 10:48:23,507 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 643325779, now seen corresponding path program 9 times [2019-08-05 10:48:23,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-08-05 10:48:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:48:23,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:48:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:48:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:48:23,774 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 11 states. [2019-08-05 10:48:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,839 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-08-05 10:48:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:48:23,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-08-05 10:48:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,841 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:48:23,841 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:48:23,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:48:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:48:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-08-05 10:48:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:48:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-08-05 10:48:23,847 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 35 [2019-08-05 10:48:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,848 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-08-05 10:48:23,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:48:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-08-05 10:48:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:48:23,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,849 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1] [2019-08-05 10:48:23,849 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2103954973, now seen corresponding path program 10 times [2019-08-05 10:48:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-05 10:48:24,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:48:24,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:48:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:48:24,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:24,076 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 12 states. [2019-08-05 10:48:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,213 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 10:48:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:48:24,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-08-05 10:48:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,215 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:48:24,215 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:48:24,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:48:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:48:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-08-05 10:48:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:48:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-08-05 10:48:24,220 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 39 [2019-08-05 10:48:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-08-05 10:48:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:48:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-08-05 10:48:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:48:24,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,223 INFO L399 BasicCegarLoop]: trace histogram [20, 10, 10, 1, 1, 1] [2019-08-05 10:48:24,223 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash -835794969, now seen corresponding path program 11 times [2019-08-05 10:48:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:48:24,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:48:24,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:48:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:48:24,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:48:24,690 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 13 states. [2019-08-05 10:48:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,063 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-08-05 10:48:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:48:25,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-08-05 10:48:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,064 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:48:25,064 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:48:25,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:48:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:48:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-08-05 10:48:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:48:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-08-05 10:48:25,072 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 43 [2019-08-05 10:48:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,072 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-08-05 10:48:25,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:48:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-08-05 10:48:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:48:25,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,073 INFO L399 BasicCegarLoop]: trace histogram [22, 11, 11, 1, 1, 1] [2019-08-05 10:48:25,074 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash 200264881, now seen corresponding path program 12 times [2019-08-05 10:48:25,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 10:48:25,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:48:25,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:48:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:48:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:25,372 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 14 states. [2019-08-05 10:48:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,492 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-08-05 10:48:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:48:25,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-08-05 10:48:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,495 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:48:25,496 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:48:25,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:48:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-08-05 10:48:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-08-05 10:48:25,500 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 47 [2019-08-05 10:48:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,501 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-08-05 10:48:25,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:48:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-08-05 10:48:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:48:25,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,502 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 12, 1, 1, 1] [2019-08-05 10:48:25,502 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash -995271557, now seen corresponding path program 13 times [2019-08-05 10:48:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:48:25,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:48:25,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:48:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:48:25,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:25,794 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 15 states. [2019-08-05 10:48:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:25,878 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 10:48:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:48:25,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-08-05 10:48:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:25,882 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:48:25,882 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:48:25,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:48:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-08-05 10:48:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:48:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2019-08-05 10:48:25,887 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 51 [2019-08-05 10:48:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:25,888 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-08-05 10:48:25,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:48:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2019-08-05 10:48:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:48:25,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:25,889 INFO L399 BasicCegarLoop]: trace histogram [26, 13, 13, 1, 1, 1] [2019-08-05 10:48:25,889 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1054214331, now seen corresponding path program 14 times [2019-08-05 10:48:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:25,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:48:25,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-08-05 10:48:26,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:48:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:48:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:48:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:26,164 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 16 states. [2019-08-05 10:48:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,221 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-08-05 10:48:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:48:26,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-08-05 10:48:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,223 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:48:26,223 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:48:26,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:48:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-08-05 10:48:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:48:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-08-05 10:48:26,228 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 55 [2019-08-05 10:48:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,229 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-08-05 10:48:26,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:48:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-08-05 10:48:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:48:26,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,230 INFO L399 BasicCegarLoop]: trace histogram [28, 14, 14, 1, 1, 1] [2019-08-05 10:48:26,230 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1528292081, now seen corresponding path program 15 times [2019-08-05 10:48:26,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-08-05 10:48:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:48:26,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:48:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:48:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:26,518 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 17 states. [2019-08-05 10:48:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,929 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-08-05 10:48:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:48:26,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-08-05 10:48:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,931 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:48:26,931 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:48:26,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:48:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-08-05 10:48:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:48:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-08-05 10:48:26,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 59 [2019-08-05 10:48:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,936 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-08-05 10:48:26,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:48:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-08-05 10:48:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:48:26,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,938 INFO L399 BasicCegarLoop]: trace histogram [30, 15, 15, 1, 1, 1] [2019-08-05 10:48:26,938 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1909830183, now seen corresponding path program 16 times [2019-08-05 10:48:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 10:48:27,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:27,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:48:27,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:48:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:48:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:27,272 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 18 states. [2019-08-05 10:48:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,347 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-08-05 10:48:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:48:27,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-08-05 10:48:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,353 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:48:27,353 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:48:27,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:48:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-08-05 10:48:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:48:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2019-08-05 10:48:27,365 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 63 [2019-08-05 10:48:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,365 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2019-08-05 10:48:27,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:48:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2019-08-05 10:48:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:48:27,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,366 INFO L399 BasicCegarLoop]: trace histogram [32, 16, 16, 1, 1, 1] [2019-08-05 10:48:27,367 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1242363485, now seen corresponding path program 17 times [2019-08-05 10:48:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-08-05 10:48:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:48:27,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:48:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:48:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:48:27,792 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 19 states. [2019-08-05 10:48:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,876 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-08-05 10:48:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:48:27,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-08-05 10:48:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,877 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:48:27,877 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:27,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:48:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-08-05 10:48:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:48:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-08-05 10:48:27,882 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 67 [2019-08-05 10:48:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,882 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-08-05 10:48:27,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:48:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-08-05 10:48:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:48:27,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,884 INFO L399 BasicCegarLoop]: trace histogram [34, 17, 17, 1, 1, 1] [2019-08-05 10:48:27,884 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 268750957, now seen corresponding path program 18 times [2019-08-05 10:48:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 10:48:28,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:48:28,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:48:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:48:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:28,146 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 20 states. [2019-08-05 10:48:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,232 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2019-08-05 10:48:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:48:28,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-08-05 10:48:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,235 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:48:28,235 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:28,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-08-05 10:48:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:48:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2019-08-05 10:48:28,238 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 71 [2019-08-05 10:48:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,239 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2019-08-05 10:48:28,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:48:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2019-08-05 10:48:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:48:28,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,240 INFO L399 BasicCegarLoop]: trace histogram [36, 18, 18, 1, 1, 1] [2019-08-05 10:48:28,241 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash -354278857, now seen corresponding path program 19 times [2019-08-05 10:48:28,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-08-05 10:48:28,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:48:28,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:48:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:48:28,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:48:28,654 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 21 states. [2019-08-05 10:48:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,838 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2019-08-05 10:48:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:48:28,838 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2019-08-05 10:48:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,839 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:48:28,840 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:48:28,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:48:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:48:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-08-05 10:48:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:48:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-08-05 10:48:28,844 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 75 [2019-08-05 10:48:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,844 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-08-05 10:48:28,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:48:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-08-05 10:48:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:48:28,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,845 INFO L399 BasicCegarLoop]: trace histogram [38, 19, 19, 1, 1, 1] [2019-08-05 10:48:28,846 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1882358015, now seen corresponding path program 20 times [2019-08-05 10:48:28,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 10:48:29,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:48:29,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:48:29,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:48:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:29,161 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 22 states. [2019-08-05 10:48:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,251 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-08-05 10:48:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:48:29,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2019-08-05 10:48:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,255 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:48:29,255 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:48:29,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:48:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-08-05 10:48:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:48:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-08-05 10:48:29,258 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 79 [2019-08-05 10:48:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,258 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-08-05 10:48:29,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:48:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-08-05 10:48:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:48:29,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,260 INFO L399 BasicCegarLoop]: trace histogram [40, 20, 20, 1, 1, 1] [2019-08-05 10:48:29,260 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -490117429, now seen corresponding path program 21 times [2019-08-05 10:48:29,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 10:48:30,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:48:30,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:48:30,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:48:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:30,336 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 23 states. [2019-08-05 10:48:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:30,402 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2019-08-05 10:48:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:48:30,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-08-05 10:48:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:30,404 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:48:30,404 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:48:30,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:48:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-08-05 10:48:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:48:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2019-08-05 10:48:30,408 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 83 [2019-08-05 10:48:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:30,408 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2019-08-05 10:48:30,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:48:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2019-08-05 10:48:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:48:30,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:30,409 INFO L399 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1] [2019-08-05 10:48:30,409 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 43538837, now seen corresponding path program 22 times [2019-08-05 10:48:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:48:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:48:30,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:48:30,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:48:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:48:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:30,931 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 24 states. [2019-08-05 10:48:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,073 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-08-05 10:48:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:48:31,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2019-08-05 10:48:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,075 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:48:31,076 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:48:31,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:48:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-08-05 10:48:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:48:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2019-08-05 10:48:31,079 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 87 [2019-08-05 10:48:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,079 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-08-05 10:48:31,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:48:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2019-08-05 10:48:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:48:31,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,080 INFO L399 BasicCegarLoop]: trace histogram [44, 22, 22, 1, 1, 1] [2019-08-05 10:48:31,080 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash -390277281, now seen corresponding path program 23 times [2019-08-05 10:48:31,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 10:48:31,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:48:31,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:48:31,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:48:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:31,421 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand 25 states. [2019-08-05 10:48:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,492 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-08-05 10:48:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:48:31,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-08-05 10:48:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,494 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:48:31,494 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:48:31,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:48:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-08-05 10:48:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:48:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-08-05 10:48:31,498 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 91 [2019-08-05 10:48:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,498 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-08-05 10:48:31,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:48:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-08-05 10:48:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:48:31,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,499 INFO L399 BasicCegarLoop]: trace histogram [46, 23, 23, 1, 1, 1] [2019-08-05 10:48:31,499 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 158949417, now seen corresponding path program 24 times [2019-08-05 10:48:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-08-05 10:48:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:31,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:48:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:48:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:31,848 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 26 states. [2019-08-05 10:48:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,931 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2019-08-05 10:48:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:48:31,932 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2019-08-05 10:48:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,933 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:48:31,934 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:48:31,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:48:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-08-05 10:48:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:48:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-08-05 10:48:31,937 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 95 [2019-08-05 10:48:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,938 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-08-05 10:48:31,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:48:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-08-05 10:48:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:48:31,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,939 INFO L399 BasicCegarLoop]: trace histogram [48, 24, 24, 1, 1, 1] [2019-08-05 10:48:31,939 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash -204442637, now seen corresponding path program 25 times [2019-08-05 10:48:31,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-08-05 10:48:32,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:32,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:48:32,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:32,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:32,672 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 27 states. [2019-08-05 10:48:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:32,771 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2019-08-05 10:48:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:32,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2019-08-05 10:48:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:32,773 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:48:32,773 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:48:32,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:48:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-08-05 10:48:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:48:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2019-08-05 10:48:32,777 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 99 [2019-08-05 10:48:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:32,778 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2019-08-05 10:48:32,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2019-08-05 10:48:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:48:32,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:32,779 INFO L399 BasicCegarLoop]: trace histogram [50, 25, 25, 1, 1, 1] [2019-08-05 10:48:32,779 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash -242969923, now seen corresponding path program 26 times [2019-08-05 10:48:32,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:32,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:48:32,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-08-05 10:48:33,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:48:33,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:48:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:48:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:33,516 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand 28 states. [2019-08-05 10:48:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,598 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2019-08-05 10:48:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:48:33,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2019-08-05 10:48:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,600 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:48:33,600 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:48:33,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:48:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-08-05 10:48:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:48:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2019-08-05 10:48:33,605 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 103 [2019-08-05 10:48:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,605 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2019-08-05 10:48:33,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:48:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2019-08-05 10:48:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:48:33,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,607 INFO L399 BasicCegarLoop]: trace histogram [52, 26, 26, 1, 1, 1] [2019-08-05 10:48:33,607 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1491583865, now seen corresponding path program 27 times [2019-08-05 10:48:33,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3354 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 10:48:34,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:34,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:48:34,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:48:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:48:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:34,492 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand 29 states. [2019-08-05 10:48:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:34,576 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-08-05 10:48:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:48:34,580 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 107 [2019-08-05 10:48:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:34,581 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:48:34,581 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:48:34,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:48:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-08-05 10:48:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:48:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-08-05 10:48:34,584 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 107 [2019-08-05 10:48:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:34,585 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-08-05 10:48:34,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:48:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2019-08-05 10:48:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:48:34,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:34,586 INFO L399 BasicCegarLoop]: trace histogram [54, 27, 27, 1, 1, 1] [2019-08-05 10:48:34,586 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1278348975, now seen corresponding path program 28 times [2019-08-05 10:48:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:34,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:48:34,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3618 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 10:48:35,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:35,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:35,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:35,365 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 30 states. [2019-08-05 10:48:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,555 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2019-08-05 10:48:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:35,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-08-05 10:48:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,557 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:48:35,557 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:48:35,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:48:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-08-05 10:48:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:48:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2019-08-05 10:48:35,561 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 111 [2019-08-05 10:48:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,561 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2019-08-05 10:48:35,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2019-08-05 10:48:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:48:35,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,562 INFO L399 BasicCegarLoop]: trace histogram [56, 28, 28, 1, 1, 1] [2019-08-05 10:48:35,562 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1369977115, now seen corresponding path program 29 times [2019-08-05 10:48:35,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-08-05 10:48:36,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:48:36,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:48:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:48:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:36,040 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 31 states. [2019-08-05 10:48:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,152 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2019-08-05 10:48:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:48:36,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2019-08-05 10:48:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,153 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:48:36,154 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:48:36,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:48:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2019-08-05 10:48:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:48:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2019-08-05 10:48:36,158 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 115 [2019-08-05 10:48:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,158 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2019-08-05 10:48:36,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:48:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2019-08-05 10:48:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:48:36,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,159 INFO L399 BasicCegarLoop]: trace histogram [58, 29, 29, 1, 1, 1] [2019-08-05 10:48:36,159 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash -177636379, now seen corresponding path program 30 times [2019-08-05 10:48:36,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 10:48:36,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:36,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:36,723 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 32 states. [2019-08-05 10:48:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,841 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2019-08-05 10:48:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:36,842 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2019-08-05 10:48:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,843 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:48:36,843 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:48:36,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:48:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-08-05 10:48:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:48:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2019-08-05 10:48:36,848 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 119 [2019-08-05 10:48:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,848 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2019-08-05 10:48:36,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2019-08-05 10:48:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:48:36,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,849 INFO L399 BasicCegarLoop]: trace histogram [60, 30, 30, 1, 1, 1] [2019-08-05 10:48:36,849 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash -292269649, now seen corresponding path program 31 times [2019-08-05 10:48:36,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-08-05 10:48:37,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:48:37,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:48:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:48:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:37,390 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand 33 states. [2019-08-05 10:48:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:37,543 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-08-05 10:48:37,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:48:37,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 123 [2019-08-05 10:48:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:37,545 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:48:37,546 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:48:37,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:48:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-08-05 10:48:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:48:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2019-08-05 10:48:37,550 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 123 [2019-08-05 10:48:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:37,550 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2019-08-05 10:48:37,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:48:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2019-08-05 10:48:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:48:37,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:37,551 INFO L399 BasicCegarLoop]: trace histogram [62, 31, 31, 1, 1, 1] [2019-08-05 10:48:37,551 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 124465785, now seen corresponding path program 32 times [2019-08-05 10:48:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:37,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:48:37,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-08-05 10:48:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:38,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:38,219 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand 34 states. [2019-08-05 10:48:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:38,317 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2019-08-05 10:48:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:38,317 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 127 [2019-08-05 10:48:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:38,319 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:48:38,319 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:48:38,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:48:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-08-05 10:48:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:48:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-08-05 10:48:38,323 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 127 [2019-08-05 10:48:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:38,323 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-08-05 10:48:38,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-08-05 10:48:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:48:38,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:38,324 INFO L399 BasicCegarLoop]: trace histogram [64, 32, 32, 1, 1, 1] [2019-08-05 10:48:38,324 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 619748931, now seen corresponding path program 33 times [2019-08-05 10:48:38,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:38,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:48:38,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5088 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 10:48:39,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:39,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:48:39,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:48:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:48:39,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:39,101 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 35 states. [2019-08-05 10:48:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,204 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2019-08-05 10:48:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:48:39,205 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 131 [2019-08-05 10:48:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,206 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:48:39,206 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:48:39,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:48:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-08-05 10:48:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:48:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2019-08-05 10:48:39,211 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 131 [2019-08-05 10:48:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,211 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2019-08-05 10:48:39,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:48:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2019-08-05 10:48:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:48:39,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,212 INFO L399 BasicCegarLoop]: trace histogram [66, 33, 33, 1, 1, 1] [2019-08-05 10:48:39,212 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -421063411, now seen corresponding path program 34 times [2019-08-05 10:48:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5412 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:48:40,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:48:40,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:48:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:48:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:40,447 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand 36 states. [2019-08-05 10:48:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:40,982 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2019-08-05 10:48:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:40,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 135 [2019-08-05 10:48:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:40,984 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:48:40,985 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:48:40,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:48:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-08-05 10:48:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:48:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2019-08-05 10:48:40,989 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 135 [2019-08-05 10:48:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:40,989 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2019-08-05 10:48:40,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:48:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2019-08-05 10:48:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:48:40,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:40,991 INFO L399 BasicCegarLoop]: trace histogram [68, 34, 34, 1, 1, 1] [2019-08-05 10:48:40,991 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1204885207, now seen corresponding path program 35 times [2019-08-05 10:48:40,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:41,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:48:41,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5746 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-08-05 10:48:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:48:41,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:48:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:48:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:41,760 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 37 states. [2019-08-05 10:48:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:41,865 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2019-08-05 10:48:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:48:41,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 139 [2019-08-05 10:48:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:41,867 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:48:41,867 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:48:41,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:48:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-08-05 10:48:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:48:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2019-08-05 10:48:41,872 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 139 [2019-08-05 10:48:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:41,872 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2019-08-05 10:48:41,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:48:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2019-08-05 10:48:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:48:41,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:41,873 INFO L399 BasicCegarLoop]: trace histogram [70, 35, 35, 1, 1, 1] [2019-08-05 10:48:41,873 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1022436257, now seen corresponding path program 36 times [2019-08-05 10:48:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:41,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:48:41,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-08-05 10:48:42,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:42,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:48:42,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:48:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:48:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:42,451 INFO L87 Difference]: Start difference. First operand 144 states and 179 transitions. Second operand 38 states. [2019-08-05 10:48:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,603 INFO L93 Difference]: Finished difference Result 151 states and 188 transitions. [2019-08-05 10:48:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:42,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-08-05 10:48:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,605 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:48:42,606 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:48:42,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:48:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-08-05 10:48:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:48:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2019-08-05 10:48:42,609 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 143 [2019-08-05 10:48:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,610 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2019-08-05 10:48:42,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:48:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2019-08-05 10:48:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:48:42,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,611 INFO L399 BasicCegarLoop]: trace histogram [72, 36, 36, 1, 1, 1] [2019-08-05 10:48:42,611 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1447672683, now seen corresponding path program 37 times [2019-08-05 10:48:42,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-08-05 10:48:43,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:48:43,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:48:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:48:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:43,561 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand 39 states. [2019-08-05 10:48:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:43,772 INFO L93 Difference]: Finished difference Result 155 states and 193 transitions. [2019-08-05 10:48:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:48:43,772 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 147 [2019-08-05 10:48:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:43,774 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:48:43,774 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:48:43,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:48:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-08-05 10:48:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:48:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 189 transitions. [2019-08-05 10:48:43,778 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 189 transitions. Word has length 147 [2019-08-05 10:48:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:43,778 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 189 transitions. [2019-08-05 10:48:43,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:48:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2019-08-05 10:48:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:48:43,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:43,780 INFO L399 BasicCegarLoop]: trace histogram [74, 37, 37, 1, 1, 1] [2019-08-05 10:48:43,780 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1587371573, now seen corresponding path program 38 times [2019-08-05 10:48:43,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:43,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:48:43,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6808 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 10:48:44,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:44,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:48:44,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:48:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:48:44,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:44,664 INFO L87 Difference]: Start difference. First operand 152 states and 189 transitions. Second operand 40 states. [2019-08-05 10:48:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:44,780 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-05 10:48:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:44,781 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 151 [2019-08-05 10:48:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:44,782 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:48:44,782 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:48:44,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:48:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-08-05 10:48:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:48:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2019-08-05 10:48:44,786 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 151 [2019-08-05 10:48:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:44,787 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2019-08-05 10:48:44,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:48:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2019-08-05 10:48:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:48:44,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:44,788 INFO L399 BasicCegarLoop]: trace histogram [76, 38, 38, 1, 1, 1] [2019-08-05 10:48:44,788 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash -76641281, now seen corresponding path program 39 times [2019-08-05 10:48:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:44,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:48:44,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7182 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 10:48:46,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:46,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:48:46,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:48:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:48:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:46,108 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand 41 states. [2019-08-05 10:48:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:46,222 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions. [2019-08-05 10:48:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:48:46,223 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 155 [2019-08-05 10:48:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:46,224 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:48:46,224 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:48:46,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:48:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2019-08-05 10:48:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:48:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2019-08-05 10:48:46,228 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 155 [2019-08-05 10:48:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:46,229 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2019-08-05 10:48:46,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:48:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2019-08-05 10:48:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:48:46,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:46,230 INFO L399 BasicCegarLoop]: trace histogram [78, 39, 39, 1, 1, 1] [2019-08-05 10:48:46,230 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1291830473, now seen corresponding path program 40 times [2019-08-05 10:48:46,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:46,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:48:46,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7566 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 10:48:46,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:46,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:48:46,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:48:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:48:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:46,993 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand 42 states. [2019-08-05 10:48:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,410 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2019-08-05 10:48:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:47,410 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 159 [2019-08-05 10:48:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,412 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:48:47,412 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:48:47,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:48:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2019-08-05 10:48:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:48:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2019-08-05 10:48:47,418 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 159 [2019-08-05 10:48:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,418 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2019-08-05 10:48:47,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:48:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2019-08-05 10:48:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:48:47,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,420 INFO L399 BasicCegarLoop]: trace histogram [80, 40, 40, 1, 1, 1] [2019-08-05 10:48:47,420 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1907128173, now seen corresponding path program 41 times [2019-08-05 10:48:47,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7960 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:48:48,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:48,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:48:48,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:48:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:48:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:48,621 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand 43 states. [2019-08-05 10:48:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:48,817 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2019-08-05 10:48:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:48:48,817 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2019-08-05 10:48:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:48,819 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:48:48,819 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:48:48,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:48:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2019-08-05 10:48:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:48:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2019-08-05 10:48:48,824 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 163 [2019-08-05 10:48:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:48,824 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2019-08-05 10:48:48,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:48:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2019-08-05 10:48:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:48:48,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:48,826 INFO L399 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1] [2019-08-05 10:48:48,826 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:48,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1255385251, now seen corresponding path program 42 times [2019-08-05 10:48:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:48,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:48:48,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-08-05 10:48:49,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:49,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:48:49,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:48:49,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:48:49,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:49,909 INFO L87 Difference]: Start difference. First operand 168 states and 209 transitions. Second operand 44 states. [2019-08-05 10:48:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:50,038 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2019-08-05 10:48:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:50,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 167 [2019-08-05 10:48:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:50,040 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:48:50,040 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:48:50,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:48:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-08-05 10:48:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:48:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2019-08-05 10:48:50,044 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 167 [2019-08-05 10:48:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:50,044 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2019-08-05 10:48:50,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:48:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2019-08-05 10:48:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:48:50,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:50,046 INFO L399 BasicCegarLoop]: trace histogram [84, 42, 42, 1, 1, 1] [2019-08-05 10:48:50,046 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:50,046 INFO L82 PathProgramCache]: Analyzing trace with hash 302821671, now seen corresponding path program 43 times [2019-08-05 10:48:50,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:50,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:48:50,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:48:51,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:48:51,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:48:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:48:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:51,456 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand 45 states. [2019-08-05 10:48:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:51,622 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2019-08-05 10:48:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:48:51,622 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 171 [2019-08-05 10:48:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:51,624 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:48:51,624 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:48:51,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:48:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-08-05 10:48:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:48:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 219 transitions. [2019-08-05 10:48:51,628 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 219 transitions. Word has length 171 [2019-08-05 10:48:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:51,628 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 219 transitions. [2019-08-05 10:48:51,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:48:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 219 transitions. [2019-08-05 10:48:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:48:51,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:51,629 INFO L399 BasicCegarLoop]: trace histogram [86, 43, 43, 1, 1, 1] [2019-08-05 10:48:51,629 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -264825359, now seen corresponding path program 44 times [2019-08-05 10:48:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:51,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:48:51,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9202 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 10:48:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:52,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:48:52,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:48:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:48:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:52,605 INFO L87 Difference]: Start difference. First operand 176 states and 219 transitions. Second operand 46 states. [2019-08-05 10:48:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:52,945 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2019-08-05 10:48:52,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:52,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 175 [2019-08-05 10:48:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:52,947 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:48:52,947 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:48:52,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:48:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2019-08-05 10:48:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:48:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2019-08-05 10:48:52,951 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 175 [2019-08-05 10:48:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:52,951 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2019-08-05 10:48:52,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:48:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2019-08-05 10:48:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:48:52,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:52,953 INFO L399 BasicCegarLoop]: trace histogram [88, 44, 44, 1, 1, 1] [2019-08-05 10:48:52,953 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 900597179, now seen corresponding path program 45 times [2019-08-05 10:48:52,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:52,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:48:52,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9636 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-08-05 10:48:53,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:53,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:48:53,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:48:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:48:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:53,856 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand 47 states. [2019-08-05 10:48:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:54,015 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-08-05 10:48:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:48:54,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 179 [2019-08-05 10:48:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:54,017 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:48:54,017 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:48:54,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:48:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2019-08-05 10:48:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:48:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2019-08-05 10:48:54,021 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 179 [2019-08-05 10:48:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:54,021 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2019-08-05 10:48:54,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:48:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2019-08-05 10:48:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:48:54,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:54,022 INFO L399 BasicCegarLoop]: trace histogram [90, 45, 45, 1, 1, 1] [2019-08-05 10:48:54,022 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash 53739653, now seen corresponding path program 46 times [2019-08-05 10:48:54,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:48:54,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-08-05 10:48:55,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:55,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:48:55,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:48:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:48:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:55,054 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand 48 states. [2019-08-05 10:48:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:55,195 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2019-08-05 10:48:55,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:48:55,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 183 [2019-08-05 10:48:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:55,197 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:48:55,197 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:48:55,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:48:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-08-05 10:48:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:48:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2019-08-05 10:48:55,202 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 183 [2019-08-05 10:48:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:55,202 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2019-08-05 10:48:55,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:48:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2019-08-05 10:48:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:48:55,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:55,204 INFO L399 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1] [2019-08-05 10:48:55,204 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1414235727, now seen corresponding path program 47 times [2019-08-05 10:48:55,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:55,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:48:55,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-08-05 10:48:56,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:56,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:48:56,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:48:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:48:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:56,406 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 49 states. [2019-08-05 10:48:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:56,561 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2019-08-05 10:48:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:48:56,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 187 [2019-08-05 10:48:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:56,563 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:48:56,563 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:48:56,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:48:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-08-05 10:48:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:48:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2019-08-05 10:48:56,568 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 187 [2019-08-05 10:48:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:56,568 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2019-08-05 10:48:56,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:48:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2019-08-05 10:48:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 10:48:56,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:56,569 INFO L399 BasicCegarLoop]: trace histogram [94, 47, 47, 1, 1, 1] [2019-08-05 10:48:56,569 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1623779559, now seen corresponding path program 48 times [2019-08-05 10:48:56,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-08-05 10:48:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:48:57,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:48:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:48:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:57,696 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand 50 states. [2019-08-05 10:48:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:57,846 INFO L93 Difference]: Finished difference Result 199 states and 248 transitions. [2019-08-05 10:48:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:48:57,847 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 191 [2019-08-05 10:48:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:57,848 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:48:57,848 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 10:48:57,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 10:48:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-08-05 10:48:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:48:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2019-08-05 10:48:57,852 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 191 [2019-08-05 10:48:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:57,853 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2019-08-05 10:48:57,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:48:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2019-08-05 10:48:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:48:57,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:57,854 INFO L399 BasicCegarLoop]: trace histogram [96, 48, 48, 1, 1, 1] [2019-08-05 10:48:57,854 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1962488547, now seen corresponding path program 49 times [2019-08-05 10:48:57,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:57,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:48:57,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11472 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-08-05 10:48:58,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:58,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:48:58,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:48:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:48:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:58,808 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand 51 states. [2019-08-05 10:48:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:58,968 INFO L93 Difference]: Finished difference Result 203 states and 253 transitions. [2019-08-05 10:48:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:48:58,969 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 195 [2019-08-05 10:48:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:58,970 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:48:58,971 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:48:58,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:48:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-08-05 10:48:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:48:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2019-08-05 10:48:58,974 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 195 [2019-08-05 10:48:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:58,974 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2019-08-05 10:48:58,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:48:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2019-08-05 10:48:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:48:58,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:58,975 INFO L399 BasicCegarLoop]: trace histogram [98, 49, 49, 1, 1, 1] [2019-08-05 10:48:58,976 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 559176109, now seen corresponding path program 50 times [2019-08-05 10:48:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:58,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:48:59,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11956 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-08-05 10:49:00,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:00,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:00,005 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand 52 states. [2019-08-05 10:49:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:00,174 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2019-08-05 10:49:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:00,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 199 [2019-08-05 10:49:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:00,176 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:49:00,176 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:49:00,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:49:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2019-08-05 10:49:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:49:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2019-08-05 10:49:00,180 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 199 [2019-08-05 10:49:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:00,181 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2019-08-05 10:49:00,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2019-08-05 10:49:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:49:00,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:00,182 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2019-08-05 10:49:00,182 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1254820727, now seen corresponding path program 51 times [2019-08-05 10:49:00,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:00,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:49:00,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-08-05 10:49:01,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:01,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:01,602 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2019-08-05 10:49:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:01,761 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2019-08-05 10:49:01,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:01,761 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2019-08-05 10:49:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:01,763 INFO L225 Difference]: With dead ends: 211 [2019-08-05 10:49:01,763 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 10:49:01,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 10:49:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-08-05 10:49:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:49:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2019-08-05 10:49:01,768 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 203 [2019-08-05 10:49:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:01,768 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2019-08-05 10:49:01,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2019-08-05 10:49:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 10:49:01,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:01,770 INFO L399 BasicCegarLoop]: trace histogram [102, 51, 51, 1, 1, 1] [2019-08-05 10:49:01,770 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1835022271, now seen corresponding path program 52 times [2019-08-05 10:49:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:01,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:49:01,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12954 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-05 10:49:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:03,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:03,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:03,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:03,084 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand 54 states. [2019-08-05 10:49:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:03,237 INFO L93 Difference]: Finished difference Result 215 states and 268 transitions. [2019-08-05 10:49:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:03,237 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 207 [2019-08-05 10:49:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:03,239 INFO L225 Difference]: With dead ends: 215 [2019-08-05 10:49:03,239 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 10:49:03,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 10:49:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-08-05 10:49:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:49:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2019-08-05 10:49:03,244 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 207 [2019-08-05 10:49:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:03,244 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2019-08-05 10:49:03,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2019-08-05 10:49:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 10:49:03,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:03,246 INFO L399 BasicCegarLoop]: trace histogram [104, 52, 52, 1, 1, 1] [2019-08-05 10:49:03,246 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 886378507, now seen corresponding path program 53 times [2019-08-05 10:49:03,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:03,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:03,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13468 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 10:49:04,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:04,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:49:04,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:49:04,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:49:04,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:04,951 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand 55 states. [2019-08-05 10:49:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,135 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2019-08-05 10:49:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:05,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 211 [2019-08-05 10:49:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,137 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:49:05,137 INFO L226 Difference]: Without dead ends: 219 [2019-08-05 10:49:05,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-05 10:49:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-08-05 10:49:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 10:49:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 269 transitions. [2019-08-05 10:49:05,142 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 269 transitions. Word has length 211 [2019-08-05 10:49:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,142 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 269 transitions. [2019-08-05 10:49:05,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:49:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 269 transitions. [2019-08-05 10:49:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 10:49:05,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,144 INFO L399 BasicCegarLoop]: trace histogram [106, 53, 53, 1, 1, 1] [2019-08-05 10:49:05,144 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1473420587, now seen corresponding path program 54 times [2019-08-05 10:49:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13992 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 10:49:07,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:49:07,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:49:07,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:49:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:07,073 INFO L87 Difference]: Start difference. First operand 216 states and 269 transitions. Second operand 56 states. [2019-08-05 10:49:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,245 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2019-08-05 10:49:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:49:07,245 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 215 [2019-08-05 10:49:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,247 INFO L225 Difference]: With dead ends: 223 [2019-08-05 10:49:07,247 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 10:49:07,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 10:49:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2019-08-05 10:49:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:49:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2019-08-05 10:49:07,251 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 215 [2019-08-05 10:49:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,251 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2019-08-05 10:49:07,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:49:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2019-08-05 10:49:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-08-05 10:49:07,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,253 INFO L399 BasicCegarLoop]: trace histogram [108, 54, 54, 1, 1, 1] [2019-08-05 10:49:07,253 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1043021983, now seen corresponding path program 55 times [2019-08-05 10:49:07,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14526 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 10:49:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:08,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:08,500 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 57 states. [2019-08-05 10:49:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,674 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2019-08-05 10:49:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:08,675 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 219 [2019-08-05 10:49:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,676 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:49:08,676 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 10:49:08,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 10:49:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-08-05 10:49:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:49:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2019-08-05 10:49:08,680 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 219 [2019-08-05 10:49:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,680 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2019-08-05 10:49:08,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2019-08-05 10:49:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 10:49:08,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,682 INFO L399 BasicCegarLoop]: trace histogram [110, 55, 55, 1, 1, 1] [2019-08-05 10:49:08,682 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1022285463, now seen corresponding path program 56 times [2019-08-05 10:49:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15070 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:49:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:49:09,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:49:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:49:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:09,904 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand 58 states. [2019-08-05 10:49:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,077 INFO L93 Difference]: Finished difference Result 231 states and 288 transitions. [2019-08-05 10:49:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:49:10,077 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 223 [2019-08-05 10:49:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,079 INFO L225 Difference]: With dead ends: 231 [2019-08-05 10:49:10,079 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:49:10,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:49:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-08-05 10:49:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 10:49:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2019-08-05 10:49:10,083 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 223 [2019-08-05 10:49:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,083 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2019-08-05 10:49:10,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:49:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2019-08-05 10:49:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 10:49:10,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,085 INFO L399 BasicCegarLoop]: trace histogram [112, 56, 56, 1, 1, 1] [2019-08-05 10:49:10,085 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 501325107, now seen corresponding path program 57 times [2019-08-05 10:49:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15624 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-08-05 10:49:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:49:11,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:49:11,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:49:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:11,628 INFO L87 Difference]: Start difference. First operand 228 states and 284 transitions. Second operand 59 states. [2019-08-05 10:49:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,796 INFO L93 Difference]: Finished difference Result 235 states and 293 transitions. [2019-08-05 10:49:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:49:11,801 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 227 [2019-08-05 10:49:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,803 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:49:11,803 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:49:11,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:49:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-08-05 10:49:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:49:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 289 transitions. [2019-08-05 10:49:11,806 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 289 transitions. Word has length 227 [2019-08-05 10:49:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,807 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 289 transitions. [2019-08-05 10:49:11,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:49:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 289 transitions. [2019-08-05 10:49:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-08-05 10:49:11,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,808 INFO L399 BasicCegarLoop]: trace histogram [114, 57, 57, 1, 1, 1] [2019-08-05 10:49:11,809 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -262202371, now seen corresponding path program 58 times [2019-08-05 10:49:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16188 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 10:49:13,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:13,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:13,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:13,214 INFO L87 Difference]: Start difference. First operand 232 states and 289 transitions. Second operand 60 states. [2019-08-05 10:49:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,392 INFO L93 Difference]: Finished difference Result 239 states and 298 transitions. [2019-08-05 10:49:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:13,393 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 231 [2019-08-05 10:49:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,395 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:49:13,395 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:49:13,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:49:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-08-05 10:49:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 10:49:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 294 transitions. [2019-08-05 10:49:13,399 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 294 transitions. Word has length 231 [2019-08-05 10:49:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,399 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 294 transitions. [2019-08-05 10:49:13,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 294 transitions. [2019-08-05 10:49:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 10:49:13,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,400 INFO L399 BasicCegarLoop]: trace histogram [116, 58, 58, 1, 1, 1] [2019-08-05 10:49:13,400 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 923542983, now seen corresponding path program 59 times [2019-08-05 10:49:13,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16762 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-08-05 10:49:14,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:49:14,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:49:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:49:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:14,729 INFO L87 Difference]: Start difference. First operand 236 states and 294 transitions. Second operand 61 states. [2019-08-05 10:49:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,913 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2019-08-05 10:49:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:14,913 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 235 [2019-08-05 10:49:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,915 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:49:14,915 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:49:14,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:49:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2019-08-05 10:49:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 10:49:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 299 transitions. [2019-08-05 10:49:14,918 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 299 transitions. Word has length 235 [2019-08-05 10:49:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,919 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 299 transitions. [2019-08-05 10:49:14,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 299 transitions. [2019-08-05 10:49:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-08-05 10:49:14,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,920 INFO L399 BasicCegarLoop]: trace histogram [118, 59, 59, 1, 1, 1] [2019-08-05 10:49:14,920 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,920 INFO L82 PathProgramCache]: Analyzing trace with hash -383042927, now seen corresponding path program 60 times [2019-08-05 10:49:14,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17346 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-08-05 10:49:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:16,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:16,742 INFO L87 Difference]: Start difference. First operand 240 states and 299 transitions. Second operand 62 states. [2019-08-05 10:49:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,926 INFO L93 Difference]: Finished difference Result 247 states and 308 transitions. [2019-08-05 10:49:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:16,926 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 239 [2019-08-05 10:49:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,928 INFO L225 Difference]: With dead ends: 247 [2019-08-05 10:49:16,928 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:49:16,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:49:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2019-08-05 10:49:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:49:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2019-08-05 10:49:16,932 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 239 [2019-08-05 10:49:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,932 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2019-08-05 10:49:16,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2019-08-05 10:49:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-08-05 10:49:16,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,934 INFO L399 BasicCegarLoop]: trace histogram [120, 60, 60, 1, 1, 1] [2019-08-05 10:49:16,934 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1732322725, now seen corresponding path program 61 times [2019-08-05 10:49:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:16,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:16,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17940 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 10:49:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:18,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:18,428 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand 63 states. [2019-08-05 10:49:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,625 INFO L93 Difference]: Finished difference Result 251 states and 313 transitions. [2019-08-05 10:49:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:18,626 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 243 [2019-08-05 10:49:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,628 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:49:18,628 INFO L226 Difference]: Without dead ends: 251 [2019-08-05 10:49:18,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-08-05 10:49:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2019-08-05 10:49:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-05 10:49:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 309 transitions. [2019-08-05 10:49:18,632 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 309 transitions. Word has length 243 [2019-08-05 10:49:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:18,632 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 309 transitions. [2019-08-05 10:49:18,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 309 transitions. [2019-08-05 10:49:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-05 10:49:18,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:18,634 INFO L399 BasicCegarLoop]: trace histogram [122, 61, 61, 1, 1, 1] [2019-08-05 10:49:18,634 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 311002405, now seen corresponding path program 62 times [2019-08-05 10:49:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:18,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:49:18,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18544 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-08-05 10:49:20,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:20,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:49:20,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:49:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:49:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:20,357 INFO L87 Difference]: Start difference. First operand 248 states and 309 transitions. Second operand 64 states. [2019-08-05 10:49:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,562 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2019-08-05 10:49:20,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:49:20,563 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 247 [2019-08-05 10:49:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,573 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:49:20,573 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:49:20,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:49:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-08-05 10:49:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-08-05 10:49:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2019-08-05 10:49:20,576 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 247 [2019-08-05 10:49:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,577 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2019-08-05 10:49:20,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:49:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2019-08-05 10:49:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-08-05 10:49:20,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,579 INFO L399 BasicCegarLoop]: trace histogram [124, 62, 62, 1, 1, 1] [2019-08-05 10:49:20,579 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -32654609, now seen corresponding path program 63 times [2019-08-05 10:49:20,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19158 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-08-05 10:49:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:49:22,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:49:22,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:49:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:22,323 INFO L87 Difference]: Start difference. First operand 252 states and 314 transitions. Second operand 65 states. [2019-08-05 10:49:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:22,524 INFO L93 Difference]: Finished difference Result 259 states and 323 transitions. [2019-08-05 10:49:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:49:22,524 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-08-05 10:49:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:22,526 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:49:22,526 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 10:49:22,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 10:49:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-08-05 10:49:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:49:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 319 transitions. [2019-08-05 10:49:22,530 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 319 transitions. Word has length 251 [2019-08-05 10:49:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:22,530 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 319 transitions. [2019-08-05 10:49:22,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:49:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 319 transitions. [2019-08-05 10:49:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-08-05 10:49:22,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:22,532 INFO L399 BasicCegarLoop]: trace histogram [126, 63, 63, 1, 1, 1] [2019-08-05 10:49:22,532 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2106457017, now seen corresponding path program 64 times [2019-08-05 10:49:22,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:22,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:49:22,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19782 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-08-05 10:49:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:49:24,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:49:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:49:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:24,090 INFO L87 Difference]: Start difference. First operand 256 states and 319 transitions. Second operand 66 states. [2019-08-05 10:49:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:24,282 INFO L93 Difference]: Finished difference Result 263 states and 328 transitions. [2019-08-05 10:49:24,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:49:24,282 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-08-05 10:49:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:24,284 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:49:24,284 INFO L226 Difference]: Without dead ends: 263 [2019-08-05 10:49:24,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-08-05 10:49:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2019-08-05 10:49:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 10:49:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 324 transitions. [2019-08-05 10:49:24,288 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 324 transitions. Word has length 255 [2019-08-05 10:49:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:24,288 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 324 transitions. [2019-08-05 10:49:24,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:49:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 324 transitions. [2019-08-05 10:49:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 10:49:24,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:24,289 INFO L399 BasicCegarLoop]: trace histogram [128, 64, 64, 1, 1, 1] [2019-08-05 10:49:24,289 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash -838023293, now seen corresponding path program 65 times [2019-08-05 10:49:24,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:24,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:24,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 20416 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 10:49:25,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:49:25,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:49:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:49:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:49:25,845 INFO L87 Difference]: Start difference. First operand 260 states and 324 transitions. Second operand 67 states. [2019-08-05 10:49:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:26,064 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2019-08-05 10:49:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:49:26,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 259 [2019-08-05 10:49:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:26,066 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:49:26,067 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:49:26,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:49:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:49:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2019-08-05 10:49:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:49:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2019-08-05 10:49:26,071 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 329 transitions. Word has length 259 [2019-08-05 10:49:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:26,071 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 329 transitions. [2019-08-05 10:49:26,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:49:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2019-08-05 10:49:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-08-05 10:49:26,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:26,073 INFO L399 BasicCegarLoop]: trace histogram [130, 65, 65, 1, 1, 1] [2019-08-05 10:49:26,073 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -414409139, now seen corresponding path program 66 times [2019-08-05 10:49:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:26,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:49:26,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21060 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-08-05 10:49:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:49:27,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:49:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:49:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:49:27,988 INFO L87 Difference]: Start difference. First operand 264 states and 329 transitions. Second operand 68 states. [2019-08-05 10:49:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,197 INFO L93 Difference]: Finished difference Result 271 states and 338 transitions. [2019-08-05 10:49:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:49:28,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 263 [2019-08-05 10:49:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,199 INFO L225 Difference]: With dead ends: 271 [2019-08-05 10:49:28,199 INFO L226 Difference]: Without dead ends: 271 [2019-08-05 10:49:28,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:49:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-08-05 10:49:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-08-05 10:49:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:49:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 334 transitions. [2019-08-05 10:49:28,203 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 334 transitions. Word has length 263 [2019-08-05 10:49:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,204 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 334 transitions. [2019-08-05 10:49:28,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:49:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 334 transitions. [2019-08-05 10:49:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 10:49:28,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,205 INFO L399 BasicCegarLoop]: trace histogram [132, 66, 66, 1, 1, 1] [2019-08-05 10:49:28,205 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,206 INFO L82 PathProgramCache]: Analyzing trace with hash 466616343, now seen corresponding path program 67 times [2019-08-05 10:49:28,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21714 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-08-05 10:49:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:49:29,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:49:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:49:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:49:29,888 INFO L87 Difference]: Start difference. First operand 268 states and 334 transitions. Second operand 69 states. [2019-08-05 10:49:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,123 INFO L93 Difference]: Finished difference Result 275 states and 343 transitions. [2019-08-05 10:49:30,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:49:30,124 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 267 [2019-08-05 10:49:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,125 INFO L225 Difference]: With dead ends: 275 [2019-08-05 10:49:30,126 INFO L226 Difference]: Without dead ends: 275 [2019-08-05 10:49:30,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:49:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-05 10:49:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-08-05 10:49:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 10:49:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 339 transitions. [2019-08-05 10:49:30,129 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 339 transitions. Word has length 267 [2019-08-05 10:49:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,130 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 339 transitions. [2019-08-05 10:49:30,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:49:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 339 transitions. [2019-08-05 10:49:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 10:49:30,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,131 INFO L399 BasicCegarLoop]: trace histogram [134, 67, 67, 1, 1, 1] [2019-08-05 10:49:30,131 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1193710367, now seen corresponding path program 68 times [2019-08-05 10:49:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22378 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-08-05 10:49:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:49:32,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:49:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:49:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:49:32,058 INFO L87 Difference]: Start difference. First operand 272 states and 339 transitions. Second operand 70 states. [2019-08-05 10:49:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:33,103 INFO L93 Difference]: Finished difference Result 279 states and 348 transitions. [2019-08-05 10:49:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:49:33,104 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 271 [2019-08-05 10:49:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:33,105 INFO L225 Difference]: With dead ends: 279 [2019-08-05 10:49:33,106 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 10:49:33,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:49:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 10:49:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-08-05 10:49:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-08-05 10:49:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 344 transitions. [2019-08-05 10:49:33,109 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 344 transitions. Word has length 271 [2019-08-05 10:49:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:33,110 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 344 transitions. [2019-08-05 10:49:33,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:49:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 344 transitions. [2019-08-05 10:49:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-08-05 10:49:33,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:33,112 INFO L399 BasicCegarLoop]: trace histogram [136, 68, 68, 1, 1, 1] [2019-08-05 10:49:33,112 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1502911317, now seen corresponding path program 69 times [2019-08-05 10:49:33,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:33,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:49:33,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23052 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 10:49:34,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:34,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:49:34,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:49:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:49:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:49:34,983 INFO L87 Difference]: Start difference. First operand 276 states and 344 transitions. Second operand 71 states. [2019-08-05 10:49:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,206 INFO L93 Difference]: Finished difference Result 283 states and 353 transitions. [2019-08-05 10:49:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:49:35,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 275 [2019-08-05 10:49:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,209 INFO L225 Difference]: With dead ends: 283 [2019-08-05 10:49:35,209 INFO L226 Difference]: Without dead ends: 283 [2019-08-05 10:49:35,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:49:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-08-05 10:49:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2019-08-05 10:49:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:49:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 349 transitions. [2019-08-05 10:49:35,213 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 349 transitions. Word has length 275 [2019-08-05 10:49:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,214 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 349 transitions. [2019-08-05 10:49:35,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:49:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 349 transitions. [2019-08-05 10:49:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 10:49:35,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,215 INFO L399 BasicCegarLoop]: trace histogram [138, 69, 69, 1, 1, 1] [2019-08-05 10:49:35,216 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 122185589, now seen corresponding path program 70 times [2019-08-05 10:49:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23736 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-08-05 10:49:37,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:37,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:49:37,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:49:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:49:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:49:37,448 INFO L87 Difference]: Start difference. First operand 280 states and 349 transitions. Second operand 72 states. [2019-08-05 10:49:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:37,662 INFO L93 Difference]: Finished difference Result 287 states and 358 transitions. [2019-08-05 10:49:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:49:37,663 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 279 [2019-08-05 10:49:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:37,664 INFO L225 Difference]: With dead ends: 287 [2019-08-05 10:49:37,664 INFO L226 Difference]: Without dead ends: 287 [2019-08-05 10:49:37,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:49:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-08-05 10:49:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-08-05 10:49:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 10:49:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 354 transitions. [2019-08-05 10:49:37,668 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 354 transitions. Word has length 279 [2019-08-05 10:49:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:37,668 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 354 transitions. [2019-08-05 10:49:37,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:49:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 354 transitions. [2019-08-05 10:49:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-08-05 10:49:37,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:37,670 INFO L399 BasicCegarLoop]: trace histogram [140, 70, 70, 1, 1, 1] [2019-08-05 10:49:37,670 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash -655166145, now seen corresponding path program 71 times [2019-08-05 10:49:37,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:37,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:49:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24430 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 10:49:39,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:49:39,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:49:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:49:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:49:39,600 INFO L87 Difference]: Start difference. First operand 284 states and 354 transitions. Second operand 73 states. [2019-08-05 10:49:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,831 INFO L93 Difference]: Finished difference Result 291 states and 363 transitions. [2019-08-05 10:49:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:49:39,831 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 283 [2019-08-05 10:49:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,833 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:49:39,833 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 10:49:39,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:49:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 10:49:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2019-08-05 10:49:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 10:49:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 359 transitions. [2019-08-05 10:49:39,836 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 359 transitions. Word has length 283 [2019-08-05 10:49:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,837 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 359 transitions. [2019-08-05 10:49:39,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:49:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 359 transitions. [2019-08-05 10:49:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-08-05 10:49:39,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,838 INFO L399 BasicCegarLoop]: trace histogram [142, 71, 71, 1, 1, 1] [2019-08-05 10:49:39,838 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1817342455, now seen corresponding path program 72 times [2019-08-05 10:49:39,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25134 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-08-05 10:49:41,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:41,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:49:41,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:49:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:49:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:49:41,994 INFO L87 Difference]: Start difference. First operand 288 states and 359 transitions. Second operand 74 states. [2019-08-05 10:49:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,316 INFO L93 Difference]: Finished difference Result 295 states and 368 transitions. [2019-08-05 10:49:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:49:42,317 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 287 [2019-08-05 10:49:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,318 INFO L225 Difference]: With dead ends: 295 [2019-08-05 10:49:42,319 INFO L226 Difference]: Without dead ends: 295 [2019-08-05 10:49:42,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:49:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-08-05 10:49:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-08-05 10:49:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 10:49:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 364 transitions. [2019-08-05 10:49:42,322 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 364 transitions. Word has length 287 [2019-08-05 10:49:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,322 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 364 transitions. [2019-08-05 10:49:42,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:49:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 364 transitions. [2019-08-05 10:49:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-08-05 10:49:42,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,324 INFO L399 BasicCegarLoop]: trace histogram [144, 72, 72, 1, 1, 1] [2019-08-05 10:49:42,324 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash -897928749, now seen corresponding path program 73 times [2019-08-05 10:49:42,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25848 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-08-05 10:49:44,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:44,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:49:44,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:49:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:49:44,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:49:44,350 INFO L87 Difference]: Start difference. First operand 292 states and 364 transitions. Second operand 75 states. [2019-08-05 10:49:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:44,589 INFO L93 Difference]: Finished difference Result 299 states and 373 transitions. [2019-08-05 10:49:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:49:44,590 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 291 [2019-08-05 10:49:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:44,592 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:49:44,592 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 10:49:44,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:49:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 10:49:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-08-05 10:49:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-05 10:49:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2019-08-05 10:49:44,596 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 291 [2019-08-05 10:49:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:44,596 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2019-08-05 10:49:44,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:49:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2019-08-05 10:49:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-08-05 10:49:44,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:44,597 INFO L399 BasicCegarLoop]: trace histogram [146, 73, 73, 1, 1, 1] [2019-08-05 10:49:44,598 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash -887299939, now seen corresponding path program 74 times [2019-08-05 10:49:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:44,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:49:44,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26572 backedges. 0 proven. 26353 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 10:49:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:46,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:49:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:49:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:49:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:49:46,612 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 76 states. [2019-08-05 10:49:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,901 INFO L93 Difference]: Finished difference Result 303 states and 378 transitions. [2019-08-05 10:49:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:49:46,901 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 295 [2019-08-05 10:49:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,902 INFO L225 Difference]: With dead ends: 303 [2019-08-05 10:49:46,902 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:49:46,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:49:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:49:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2019-08-05 10:49:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-08-05 10:49:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2019-08-05 10:49:46,906 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 295 [2019-08-05 10:49:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,906 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2019-08-05 10:49:46,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:49:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2019-08-05 10:49:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-08-05 10:49:46,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,908 INFO L399 BasicCegarLoop]: trace histogram [148, 74, 74, 1, 1, 1] [2019-08-05 10:49:46,908 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1041668711, now seen corresponding path program 75 times [2019-08-05 10:49:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27306 backedges. 0 proven. 27084 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-08-05 10:49:49,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:49,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:49:49,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:49:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:49:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:49:49,109 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 77 states. [2019-08-05 10:49:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:49,428 INFO L93 Difference]: Finished difference Result 307 states and 383 transitions. [2019-08-05 10:49:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:49:49,428 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 299 [2019-08-05 10:49:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:49,430 INFO L225 Difference]: With dead ends: 307 [2019-08-05 10:49:49,430 INFO L226 Difference]: Without dead ends: 307 [2019-08-05 10:49:49,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:49:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-08-05 10:49:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2019-08-05 10:49:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:49:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 379 transitions. [2019-08-05 10:49:49,435 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 379 transitions. Word has length 299 [2019-08-05 10:49:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:49,435 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 379 transitions. [2019-08-05 10:49:49,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:49:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 379 transitions. [2019-08-05 10:49:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 10:49:49,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:49,437 INFO L399 BasicCegarLoop]: trace histogram [150, 75, 75, 1, 1, 1] [2019-08-05 10:49:49,437 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash -961913039, now seen corresponding path program 76 times [2019-08-05 10:49:49,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:49,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:49:49,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28050 backedges. 0 proven. 27825 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-08-05 10:49:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:51,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:49:51,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:49:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:49:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:49:51,543 INFO L87 Difference]: Start difference. First operand 304 states and 379 transitions. Second operand 78 states. [2019-08-05 10:49:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,788 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2019-08-05 10:49:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:49:51,789 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 303 [2019-08-05 10:49:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,790 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:49:51,791 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 10:49:51,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:49:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 10:49:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2019-08-05 10:49:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 10:49:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 384 transitions. [2019-08-05 10:49:51,794 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 384 transitions. Word has length 303 [2019-08-05 10:49:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,794 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 384 transitions. [2019-08-05 10:49:51,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:49:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 384 transitions. [2019-08-05 10:49:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-08-05 10:49:51,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,796 INFO L399 BasicCegarLoop]: trace histogram [152, 76, 76, 1, 1, 1] [2019-08-05 10:49:51,796 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1562726661, now seen corresponding path program 77 times [2019-08-05 10:49:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 28804 backedges. 0 proven. 28576 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-08-05 10:49:54,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:54,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:49:54,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:49:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:49:54,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:49:54,106 INFO L87 Difference]: Start difference. First operand 308 states and 384 transitions. Second operand 79 states. [2019-08-05 10:49:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,352 INFO L93 Difference]: Finished difference Result 315 states and 393 transitions. [2019-08-05 10:49:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:49:54,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 307 [2019-08-05 10:49:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,355 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:49:54,355 INFO L226 Difference]: Without dead ends: 315 [2019-08-05 10:49:54,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:49:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-08-05 10:49:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-08-05 10:49:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-08-05 10:49:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 389 transitions. [2019-08-05 10:49:54,358 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 389 transitions. Word has length 307 [2019-08-05 10:49:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,359 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 389 transitions. [2019-08-05 10:49:54,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:49:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 389 transitions. [2019-08-05 10:49:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-08-05 10:49:54,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,360 INFO L399 BasicCegarLoop]: trace histogram [154, 77, 77, 1, 1, 1] [2019-08-05 10:49:54,360 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1265240517, now seen corresponding path program 78 times [2019-08-05 10:49:54,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29568 backedges. 0 proven. 29337 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-08-05 10:49:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:49:56,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:49:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:49:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:49:56,572 INFO L87 Difference]: Start difference. First operand 312 states and 389 transitions. Second operand 80 states. [2019-08-05 10:49:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,826 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2019-08-05 10:49:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:49:56,827 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 311 [2019-08-05 10:49:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,829 INFO L225 Difference]: With dead ends: 319 [2019-08-05 10:49:56,829 INFO L226 Difference]: Without dead ends: 319 [2019-08-05 10:49:56,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:49:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-08-05 10:49:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-08-05 10:49:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:49:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 394 transitions. [2019-08-05 10:49:56,833 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 394 transitions. Word has length 311 [2019-08-05 10:49:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,833 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 394 transitions. [2019-08-05 10:49:56,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:49:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 394 transitions. [2019-08-05 10:49:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 10:49:56,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,834 INFO L399 BasicCegarLoop]: trace histogram [156, 78, 78, 1, 1, 1] [2019-08-05 10:49:56,835 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 333115279, now seen corresponding path program 79 times [2019-08-05 10:49:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30342 backedges. 0 proven. 30108 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-08-05 10:49:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:49:59,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:49:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:49:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:49:59,319 INFO L87 Difference]: Start difference. First operand 316 states and 394 transitions. Second operand 81 states. [2019-08-05 10:49:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,585 INFO L93 Difference]: Finished difference Result 323 states and 403 transitions. [2019-08-05 10:49:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:49:59,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 315 [2019-08-05 10:49:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,588 INFO L225 Difference]: With dead ends: 323 [2019-08-05 10:49:59,588 INFO L226 Difference]: Without dead ends: 323 [2019-08-05 10:49:59,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:49:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-08-05 10:49:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2019-08-05 10:49:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-08-05 10:49:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 399 transitions. [2019-08-05 10:49:59,591 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 399 transitions. Word has length 315 [2019-08-05 10:49:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,591 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 399 transitions. [2019-08-05 10:49:59,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:49:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 399 transitions. [2019-08-05 10:49:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-08-05 10:49:59,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,593 INFO L399 BasicCegarLoop]: trace histogram [158, 79, 79, 1, 1, 1] [2019-08-05 10:49:59,593 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash -898637735, now seen corresponding path program 80 times [2019-08-05 10:49:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31126 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-08-05 10:50:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:50:01,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:50:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:50:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:01,961 INFO L87 Difference]: Start difference. First operand 320 states and 399 transitions. Second operand 82 states. [2019-08-05 10:50:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:02,255 INFO L93 Difference]: Finished difference Result 327 states and 408 transitions. [2019-08-05 10:50:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:50:02,255 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 319 [2019-08-05 10:50:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:02,256 INFO L225 Difference]: With dead ends: 327 [2019-08-05 10:50:02,256 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 10:50:02,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 10:50:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2019-08-05 10:50:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-08-05 10:50:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 404 transitions. [2019-08-05 10:50:02,260 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 404 transitions. Word has length 319 [2019-08-05 10:50:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:02,260 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 404 transitions. [2019-08-05 10:50:02,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:50:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 404 transitions. [2019-08-05 10:50:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-08-05 10:50:02,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:02,262 INFO L399 BasicCegarLoop]: trace histogram [160, 80, 80, 1, 1, 1] [2019-08-05 10:50:02,262 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1479236643, now seen corresponding path program 81 times [2019-08-05 10:50:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:02,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:50:02,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 31920 backedges. 0 proven. 31680 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-08-05 10:50:04,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:04,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:50:04,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:50:04,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:50:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:04,819 INFO L87 Difference]: Start difference. First operand 324 states and 404 transitions. Second operand 83 states. [2019-08-05 10:50:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:05,091 INFO L93 Difference]: Finished difference Result 331 states and 413 transitions. [2019-08-05 10:50:05,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:50:05,092 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 323 [2019-08-05 10:50:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:05,093 INFO L225 Difference]: With dead ends: 331 [2019-08-05 10:50:05,094 INFO L226 Difference]: Without dead ends: 331 [2019-08-05 10:50:05,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-08-05 10:50:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2019-08-05 10:50:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 10:50:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 409 transitions. [2019-08-05 10:50:05,097 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 409 transitions. Word has length 323 [2019-08-05 10:50:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:05,097 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 409 transitions. [2019-08-05 10:50:05,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:50:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 409 transitions. [2019-08-05 10:50:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 10:50:05,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:05,099 INFO L399 BasicCegarLoop]: trace histogram [162, 81, 81, 1, 1, 1] [2019-08-05 10:50:05,099 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1624236781, now seen corresponding path program 82 times [2019-08-05 10:50:05,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:05,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:50:05,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32724 backedges. 0 proven. 32481 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-08-05 10:50:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:50:07,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:50:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:50:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:07,735 INFO L87 Difference]: Start difference. First operand 328 states and 409 transitions. Second operand 84 states. [2019-08-05 10:50:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:08,012 INFO L93 Difference]: Finished difference Result 335 states and 418 transitions. [2019-08-05 10:50:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:50:08,012 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 327 [2019-08-05 10:50:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:08,014 INFO L225 Difference]: With dead ends: 335 [2019-08-05 10:50:08,015 INFO L226 Difference]: Without dead ends: 335 [2019-08-05 10:50:08,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-08-05 10:50:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-08-05 10:50:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-08-05 10:50:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 414 transitions. [2019-08-05 10:50:08,018 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 414 transitions. Word has length 327 [2019-08-05 10:50:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:08,019 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 414 transitions. [2019-08-05 10:50:08,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:50:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 414 transitions. [2019-08-05 10:50:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-08-05 10:50:08,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:08,020 INFO L399 BasicCegarLoop]: trace histogram [164, 82, 82, 1, 1, 1] [2019-08-05 10:50:08,020 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash -488639305, now seen corresponding path program 83 times [2019-08-05 10:50:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33538 backedges. 0 proven. 33292 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-05 10:50:10,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:50:10,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:50:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:50:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:50:10,661 INFO L87 Difference]: Start difference. First operand 332 states and 414 transitions. Second operand 85 states. [2019-08-05 10:50:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:10,965 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2019-08-05 10:50:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:50:10,965 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 331 [2019-08-05 10:50:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:10,967 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:50:10,968 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:50:10,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:50:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:50:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-08-05 10:50:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-08-05 10:50:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 419 transitions. [2019-08-05 10:50:10,972 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 419 transitions. Word has length 331 [2019-08-05 10:50:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:10,972 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 419 transitions. [2019-08-05 10:50:10,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:50:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 419 transitions. [2019-08-05 10:50:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-08-05 10:50:10,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:10,974 INFO L399 BasicCegarLoop]: trace histogram [166, 83, 83, 1, 1, 1] [2019-08-05 10:50:10,974 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -677506687, now seen corresponding path program 84 times [2019-08-05 10:50:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:11,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:50:11,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34362 backedges. 0 proven. 34113 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-08-05 10:50:13,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:50:13,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:50:13,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:50:13,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:50:13,724 INFO L87 Difference]: Start difference. First operand 336 states and 419 transitions. Second operand 86 states. [2019-08-05 10:50:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,006 INFO L93 Difference]: Finished difference Result 343 states and 428 transitions. [2019-08-05 10:50:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:50:14,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 335 [2019-08-05 10:50:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,009 INFO L225 Difference]: With dead ends: 343 [2019-08-05 10:50:14,009 INFO L226 Difference]: Without dead ends: 343 [2019-08-05 10:50:14,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:50:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-08-05 10:50:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2019-08-05 10:50:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 10:50:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 424 transitions. [2019-08-05 10:50:14,013 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 424 transitions. Word has length 335 [2019-08-05 10:50:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:14,013 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 424 transitions. [2019-08-05 10:50:14,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:50:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 424 transitions. [2019-08-05 10:50:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 10:50:14,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:14,015 INFO L399 BasicCegarLoop]: trace histogram [168, 84, 84, 1, 1, 1] [2019-08-05 10:50:14,015 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash -754140853, now seen corresponding path program 85 times [2019-08-05 10:50:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:14,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:50:14,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35196 backedges. 0 proven. 34944 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-08-05 10:50:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:16,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:50:16,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:50:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:50:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:16,701 INFO L87 Difference]: Start difference. First operand 340 states and 424 transitions. Second operand 87 states. [2019-08-05 10:50:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:16,995 INFO L93 Difference]: Finished difference Result 347 states and 433 transitions. [2019-08-05 10:50:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:50:16,995 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 339 [2019-08-05 10:50:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:16,997 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:50:16,997 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 10:50:16,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 10:50:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2019-08-05 10:50:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 10:50:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 429 transitions. [2019-08-05 10:50:17,002 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 429 transitions. Word has length 339 [2019-08-05 10:50:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:17,002 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 429 transitions. [2019-08-05 10:50:17,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:50:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 429 transitions. [2019-08-05 10:50:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-08-05 10:50:17,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:17,003 INFO L399 BasicCegarLoop]: trace histogram [170, 85, 85, 1, 1, 1] [2019-08-05 10:50:17,003 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1544655851, now seen corresponding path program 86 times [2019-08-05 10:50:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:17,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:50:17,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36040 backedges. 0 proven. 35785 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-08-05 10:50:19,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:19,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:50:19,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:50:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:50:19,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:19,841 INFO L87 Difference]: Start difference. First operand 344 states and 429 transitions. Second operand 88 states. [2019-08-05 10:50:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:20,144 INFO L93 Difference]: Finished difference Result 351 states and 438 transitions. [2019-08-05 10:50:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:50:20,145 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 343 [2019-08-05 10:50:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:20,147 INFO L225 Difference]: With dead ends: 351 [2019-08-05 10:50:20,147 INFO L226 Difference]: Without dead ends: 351 [2019-08-05 10:50:20,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-08-05 10:50:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2019-08-05 10:50:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:50:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 434 transitions. [2019-08-05 10:50:20,151 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 434 transitions. Word has length 343 [2019-08-05 10:50:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:20,151 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 434 transitions. [2019-08-05 10:50:20,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:50:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 434 transitions. [2019-08-05 10:50:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-08-05 10:50:20,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:20,152 INFO L399 BasicCegarLoop]: trace histogram [172, 86, 86, 1, 1, 1] [2019-08-05 10:50:20,152 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -205149729, now seen corresponding path program 87 times [2019-08-05 10:50:20,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:20,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:50:20,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36894 backedges. 0 proven. 36636 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-08-05 10:50:23,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:23,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:50:23,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:50:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:50:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:23,212 INFO L87 Difference]: Start difference. First operand 348 states and 434 transitions. Second operand 89 states. [2019-08-05 10:50:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:23,497 INFO L93 Difference]: Finished difference Result 355 states and 443 transitions. [2019-08-05 10:50:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:50:23,497 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 347 [2019-08-05 10:50:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:23,499 INFO L225 Difference]: With dead ends: 355 [2019-08-05 10:50:23,500 INFO L226 Difference]: Without dead ends: 355 [2019-08-05 10:50:23,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-08-05 10:50:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-08-05 10:50:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-08-05 10:50:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 439 transitions. [2019-08-05 10:50:23,504 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 439 transitions. Word has length 347 [2019-08-05 10:50:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:23,504 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 439 transitions. [2019-08-05 10:50:23,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:50:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 439 transitions. [2019-08-05 10:50:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-08-05 10:50:23,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:23,506 INFO L399 BasicCegarLoop]: trace histogram [174, 87, 87, 1, 1, 1] [2019-08-05 10:50:23,506 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash -422251863, now seen corresponding path program 88 times [2019-08-05 10:50:23,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:23,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:50:23,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 37758 backedges. 0 proven. 37497 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-08-05 10:50:26,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:50:26,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:50:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:50:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:50:26,272 INFO L87 Difference]: Start difference. First operand 352 states and 439 transitions. Second operand 90 states. [2019-08-05 10:50:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:26,582 INFO L93 Difference]: Finished difference Result 359 states and 448 transitions. [2019-08-05 10:50:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:50:26,583 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 351 [2019-08-05 10:50:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:26,585 INFO L225 Difference]: With dead ends: 359 [2019-08-05 10:50:26,585 INFO L226 Difference]: Without dead ends: 359 [2019-08-05 10:50:26,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:50:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-08-05 10:50:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-08-05 10:50:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 10:50:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 444 transitions. [2019-08-05 10:50:26,589 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 444 transitions. Word has length 351 [2019-08-05 10:50:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:26,589 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 444 transitions. [2019-08-05 10:50:26,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:50:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 444 transitions. [2019-08-05 10:50:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-08-05 10:50:26,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:26,590 INFO L399 BasicCegarLoop]: trace histogram [176, 88, 88, 1, 1, 1] [2019-08-05 10:50:26,591 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1138833805, now seen corresponding path program 89 times [2019-08-05 10:50:26,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:26,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:50:26,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38632 backedges. 0 proven. 38368 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-08-05 10:50:29,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:29,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:50:29,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:50:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:50:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:50:29,666 INFO L87 Difference]: Start difference. First operand 356 states and 444 transitions. Second operand 91 states. [2019-08-05 10:50:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:29,965 INFO L93 Difference]: Finished difference Result 363 states and 453 transitions. [2019-08-05 10:50:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:50:29,966 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 355 [2019-08-05 10:50:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:29,968 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:50:29,968 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:50:29,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:50:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:50:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2019-08-05 10:50:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 10:50:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 449 transitions. [2019-08-05 10:50:29,972 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 449 transitions. Word has length 355 [2019-08-05 10:50:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:29,972 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 449 transitions. [2019-08-05 10:50:29,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:50:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 449 transitions. [2019-08-05 10:50:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-08-05 10:50:29,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:29,974 INFO L399 BasicCegarLoop]: trace histogram [178, 89, 89, 1, 1, 1] [2019-08-05 10:50:29,974 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1835377981, now seen corresponding path program 90 times [2019-08-05 10:50:29,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 39516 backedges. 0 proven. 39249 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-08-05 10:50:32,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:50:32,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:50:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:50:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:50:32,892 INFO L87 Difference]: Start difference. First operand 360 states and 449 transitions. Second operand 92 states. [2019-08-05 10:50:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:33,305 INFO L93 Difference]: Finished difference Result 367 states and 458 transitions. [2019-08-05 10:50:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:50:33,305 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 359 [2019-08-05 10:50:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:33,306 INFO L225 Difference]: With dead ends: 367 [2019-08-05 10:50:33,306 INFO L226 Difference]: Without dead ends: 367 [2019-08-05 10:50:33,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:50:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-08-05 10:50:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2019-08-05 10:50:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 10:50:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 454 transitions. [2019-08-05 10:50:33,311 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 454 transitions. Word has length 359 [2019-08-05 10:50:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:33,311 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 454 transitions. [2019-08-05 10:50:33,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:50:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 454 transitions. [2019-08-05 10:50:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-08-05 10:50:33,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:33,313 INFO L399 BasicCegarLoop]: trace histogram [180, 90, 90, 1, 1, 1] [2019-08-05 10:50:33,313 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1328287495, now seen corresponding path program 91 times [2019-08-05 10:50:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:33,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:50:33,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 40410 backedges. 0 proven. 40140 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-08-05 10:50:36,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:36,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:50:36,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:50:36,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:50:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:50:36,322 INFO L87 Difference]: Start difference. First operand 364 states and 454 transitions. Second operand 93 states. [2019-08-05 10:50:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:36,645 INFO L93 Difference]: Finished difference Result 371 states and 463 transitions. [2019-08-05 10:50:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:50:36,646 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 363 [2019-08-05 10:50:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:36,648 INFO L225 Difference]: With dead ends: 371 [2019-08-05 10:50:36,648 INFO L226 Difference]: Without dead ends: 371 [2019-08-05 10:50:36,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:50:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-08-05 10:50:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-08-05 10:50:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-08-05 10:50:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 459 transitions. [2019-08-05 10:50:36,652 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 459 transitions. Word has length 363 [2019-08-05 10:50:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:36,652 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 459 transitions. [2019-08-05 10:50:36,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:50:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 459 transitions. [2019-08-05 10:50:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-08-05 10:50:36,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:36,654 INFO L399 BasicCegarLoop]: trace histogram [182, 91, 91, 1, 1, 1] [2019-08-05 10:50:36,654 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1330347055, now seen corresponding path program 92 times [2019-08-05 10:50:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:36,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:50:36,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 41314 backedges. 0 proven. 41041 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-08-05 10:50:39,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:39,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:50:39,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:50:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:50:39,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:50:39,953 INFO L87 Difference]: Start difference. First operand 368 states and 459 transitions. Second operand 94 states. [2019-08-05 10:50:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,269 INFO L93 Difference]: Finished difference Result 375 states and 468 transitions. [2019-08-05 10:50:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:50:40,269 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 367 [2019-08-05 10:50:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,272 INFO L225 Difference]: With dead ends: 375 [2019-08-05 10:50:40,272 INFO L226 Difference]: Without dead ends: 375 [2019-08-05 10:50:40,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:50:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-08-05 10:50:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-08-05 10:50:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-08-05 10:50:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 464 transitions. [2019-08-05 10:50:40,276 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 464 transitions. Word has length 367 [2019-08-05 10:50:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,276 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 464 transitions. [2019-08-05 10:50:40,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:50:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 464 transitions. [2019-08-05 10:50:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-08-05 10:50:40,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,278 INFO L399 BasicCegarLoop]: trace histogram [184, 92, 92, 1, 1, 1] [2019-08-05 10:50:40,278 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2080474011, now seen corresponding path program 93 times [2019-08-05 10:50:40,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 42228 backedges. 0 proven. 41952 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-08-05 10:50:43,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:43,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:50:43,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:50:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:50:43,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:50:43,667 INFO L87 Difference]: Start difference. First operand 372 states and 464 transitions. Second operand 95 states. [2019-08-05 10:50:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:43,995 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2019-08-05 10:50:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:50:43,995 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 371 [2019-08-05 10:50:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:43,997 INFO L225 Difference]: With dead ends: 379 [2019-08-05 10:50:43,997 INFO L226 Difference]: Without dead ends: 379 [2019-08-05 10:50:43,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:50:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-08-05 10:50:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-08-05 10:50:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 10:50:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 469 transitions. [2019-08-05 10:50:44,001 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 469 transitions. Word has length 371 [2019-08-05 10:50:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:44,002 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 469 transitions. [2019-08-05 10:50:44,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:50:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 469 transitions. [2019-08-05 10:50:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-08-05 10:50:44,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:44,003 INFO L399 BasicCegarLoop]: trace histogram [186, 93, 93, 1, 1, 1] [2019-08-05 10:50:44,003 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -707424667, now seen corresponding path program 94 times [2019-08-05 10:50:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:44,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:50:44,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 43152 backedges. 0 proven. 42873 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-08-05 10:50:47,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:47,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:50:47,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:50:47,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:50:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:50:47,698 INFO L87 Difference]: Start difference. First operand 376 states and 469 transitions. Second operand 96 states. [2019-08-05 10:50:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:48,038 INFO L93 Difference]: Finished difference Result 383 states and 478 transitions. [2019-08-05 10:50:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:50:48,039 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 375 [2019-08-05 10:50:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:48,041 INFO L225 Difference]: With dead ends: 383 [2019-08-05 10:50:48,041 INFO L226 Difference]: Without dead ends: 383 [2019-08-05 10:50:48,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:50:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-08-05 10:50:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2019-08-05 10:50:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-08-05 10:50:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 474 transitions. [2019-08-05 10:50:48,045 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 474 transitions. Word has length 375 [2019-08-05 10:50:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:48,046 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 474 transitions. [2019-08-05 10:50:48,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:50:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 474 transitions. [2019-08-05 10:50:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-08-05 10:50:48,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:48,047 INFO L399 BasicCegarLoop]: trace histogram [188, 94, 94, 1, 1, 1] [2019-08-05 10:50:48,048 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1112333265, now seen corresponding path program 95 times [2019-08-05 10:50:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:48,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:50:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44086 backedges. 0 proven. 43804 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-08-05 10:50:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:51,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:50:51,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:50:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:50:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:50:51,512 INFO L87 Difference]: Start difference. First operand 380 states and 474 transitions. Second operand 97 states. [2019-08-05 10:50:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:51,846 INFO L93 Difference]: Finished difference Result 387 states and 483 transitions. [2019-08-05 10:50:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:50:51,846 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 379 [2019-08-05 10:50:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:51,848 INFO L225 Difference]: With dead ends: 387 [2019-08-05 10:50:51,849 INFO L226 Difference]: Without dead ends: 387 [2019-08-05 10:50:51,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:50:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-08-05 10:50:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2019-08-05 10:50:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-08-05 10:50:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 479 transitions. [2019-08-05 10:50:51,852 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 479 transitions. Word has length 379 [2019-08-05 10:50:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:51,852 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 479 transitions. [2019-08-05 10:50:51,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:50:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 479 transitions. [2019-08-05 10:50:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-08-05 10:50:51,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:51,854 INFO L399 BasicCegarLoop]: trace histogram [190, 95, 95, 1, 1, 1] [2019-08-05 10:50:51,854 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1378040583, now seen corresponding path program 96 times [2019-08-05 10:50:51,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:51,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:50:51,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45030 backedges. 0 proven. 44745 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-08-05 10:50:55,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:55,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:50:55,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:50:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:50:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:50:55,187 INFO L87 Difference]: Start difference. First operand 384 states and 479 transitions. Second operand 98 states. [2019-08-05 10:50:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:55,525 INFO L93 Difference]: Finished difference Result 391 states and 488 transitions. [2019-08-05 10:50:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:50:55,525 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 383 [2019-08-05 10:50:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:55,528 INFO L225 Difference]: With dead ends: 391 [2019-08-05 10:50:55,528 INFO L226 Difference]: Without dead ends: 391 [2019-08-05 10:50:55,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:50:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-08-05 10:50:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 388. [2019-08-05 10:50:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:50:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 484 transitions. [2019-08-05 10:50:55,532 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 484 transitions. Word has length 383 [2019-08-05 10:50:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:55,532 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 484 transitions. [2019-08-05 10:50:55,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:50:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 484 transitions. [2019-08-05 10:50:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-08-05 10:50:55,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:55,534 INFO L399 BasicCegarLoop]: trace histogram [192, 96, 96, 1, 1, 1] [2019-08-05 10:50:55,534 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 995422403, now seen corresponding path program 97 times [2019-08-05 10:50:55,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:55,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:50:55,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 45984 backedges. 0 proven. 45696 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-08-05 10:50:59,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:59,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:50:59,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:50:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:50:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:50:59,106 INFO L87 Difference]: Start difference. First operand 388 states and 484 transitions. Second operand 99 states. [2019-08-05 10:50:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:59,461 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2019-08-05 10:50:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:50:59,462 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 387 [2019-08-05 10:50:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:59,464 INFO L225 Difference]: With dead ends: 395 [2019-08-05 10:50:59,464 INFO L226 Difference]: Without dead ends: 395 [2019-08-05 10:50:59,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:50:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-08-05 10:50:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-08-05 10:50:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-08-05 10:50:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 489 transitions. [2019-08-05 10:50:59,468 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 489 transitions. Word has length 387 [2019-08-05 10:50:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:59,468 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 489 transitions. [2019-08-05 10:50:59,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:50:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 489 transitions. [2019-08-05 10:50:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-08-05 10:50:59,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:59,470 INFO L399 BasicCegarLoop]: trace histogram [194, 97, 97, 1, 1, 1] [2019-08-05 10:50:59,470 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:59,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1243732083, now seen corresponding path program 98 times [2019-08-05 10:50:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:59,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:50:59,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 46948 backedges. 0 proven. 46657 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-08-05 10:51:02,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:02,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:51:02,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:51:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:51:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:02,936 INFO L87 Difference]: Start difference. First operand 392 states and 489 transitions. Second operand 100 states. [2019-08-05 10:51:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:03,297 INFO L93 Difference]: Finished difference Result 399 states and 498 transitions. [2019-08-05 10:51:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:51:03,297 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 391 [2019-08-05 10:51:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:03,300 INFO L225 Difference]: With dead ends: 399 [2019-08-05 10:51:03,300 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:51:03,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:51:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-08-05 10:51:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:51:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 494 transitions. [2019-08-05 10:51:03,304 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 494 transitions. Word has length 391 [2019-08-05 10:51:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:03,305 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 494 transitions. [2019-08-05 10:51:03,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:51:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 494 transitions. [2019-08-05 10:51:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-08-05 10:51:03,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:03,307 INFO L399 BasicCegarLoop]: trace histogram [196, 98, 98, 1, 1, 1] [2019-08-05 10:51:03,307 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash -939857577, now seen corresponding path program 99 times [2019-08-05 10:51:03,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:03,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:51:03,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 47922 backedges. 0 proven. 47628 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-08-05 10:51:07,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:07,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:51:07,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:51:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:51:07,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:07,052 INFO L87 Difference]: Start difference. First operand 396 states and 494 transitions. Second operand 101 states. [2019-08-05 10:51:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:07,412 INFO L93 Difference]: Finished difference Result 403 states and 503 transitions. [2019-08-05 10:51:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:51:07,413 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 395 [2019-08-05 10:51:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:07,415 INFO L225 Difference]: With dead ends: 403 [2019-08-05 10:51:07,416 INFO L226 Difference]: Without dead ends: 403 [2019-08-05 10:51:07,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-08-05 10:51:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2019-08-05 10:51:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-08-05 10:51:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 499 transitions. [2019-08-05 10:51:07,421 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 499 transitions. Word has length 395 [2019-08-05 10:51:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:07,422 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 499 transitions. [2019-08-05 10:51:07,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:51:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 499 transitions. [2019-08-05 10:51:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-08-05 10:51:07,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:07,424 INFO L399 BasicCegarLoop]: trace histogram [198, 99, 99, 1, 1, 1] [2019-08-05 10:51:07,424 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash 384677409, now seen corresponding path program 100 times [2019-08-05 10:51:07,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:07,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:51:07,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 48906 backedges. 0 proven. 48609 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-08-05 10:51:11,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:11,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:51:11,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:51:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:51:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:11,422 INFO L87 Difference]: Start difference. First operand 400 states and 499 transitions. Second operand 102 states. [2019-08-05 10:51:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:11,772 INFO L93 Difference]: Finished difference Result 407 states and 508 transitions. [2019-08-05 10:51:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:51:11,773 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 399 [2019-08-05 10:51:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:11,774 INFO L225 Difference]: With dead ends: 407 [2019-08-05 10:51:11,774 INFO L226 Difference]: Without dead ends: 407 [2019-08-05 10:51:11,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-08-05 10:51:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2019-08-05 10:51:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-08-05 10:51:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 504 transitions. [2019-08-05 10:51:11,780 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 504 transitions. Word has length 399 [2019-08-05 10:51:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:11,780 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 504 transitions. [2019-08-05 10:51:11,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:51:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 504 transitions. [2019-08-05 10:51:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-08-05 10:51:11,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:11,783 INFO L399 BasicCegarLoop]: trace histogram [200, 100, 100, 1, 1, 1] [2019-08-05 10:51:11,783 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash -491188757, now seen corresponding path program 101 times [2019-08-05 10:51:11,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:11,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:51:11,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 49900 backedges. 0 proven. 49600 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-08-05 10:51:15,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:15,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:51:15,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:51:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:51:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:15,648 INFO L87 Difference]: Start difference. First operand 404 states and 504 transitions. Second operand 103 states. [2019-08-05 10:51:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:16,008 INFO L93 Difference]: Finished difference Result 411 states and 513 transitions. [2019-08-05 10:51:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:51:16,009 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 403 [2019-08-05 10:51:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:16,010 INFO L225 Difference]: With dead ends: 411 [2019-08-05 10:51:16,010 INFO L226 Difference]: Without dead ends: 411 [2019-08-05 10:51:16,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-08-05 10:51:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-08-05 10:51:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-08-05 10:51:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 509 transitions. [2019-08-05 10:51:16,016 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 509 transitions. Word has length 403 [2019-08-05 10:51:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:16,016 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 509 transitions. [2019-08-05 10:51:16,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:51:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 509 transitions. [2019-08-05 10:51:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-08-05 10:51:16,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:16,019 INFO L399 BasicCegarLoop]: trace histogram [202, 101, 101, 1, 1, 1] [2019-08-05 10:51:16,019 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1507888971, now seen corresponding path program 102 times [2019-08-05 10:51:16,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:16,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:51:16,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 50904 backedges. 0 proven. 50601 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-08-05 10:51:19,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:19,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:51:19,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:51:19,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:51:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:19,915 INFO L87 Difference]: Start difference. First operand 408 states and 509 transitions. Second operand 104 states. [2019-08-05 10:51:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:20,288 INFO L93 Difference]: Finished difference Result 415 states and 518 transitions. [2019-08-05 10:51:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:51:20,289 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 407 [2019-08-05 10:51:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:20,290 INFO L225 Difference]: With dead ends: 415 [2019-08-05 10:51:20,291 INFO L226 Difference]: Without dead ends: 415 [2019-08-05 10:51:20,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-08-05 10:51:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-08-05 10:51:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 10:51:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 514 transitions. [2019-08-05 10:51:20,296 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 514 transitions. Word has length 407 [2019-08-05 10:51:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:20,297 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 514 transitions. [2019-08-05 10:51:20,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:51:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 514 transitions. [2019-08-05 10:51:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-08-05 10:51:20,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:20,299 INFO L399 BasicCegarLoop]: trace histogram [204, 102, 102, 1, 1, 1] [2019-08-05 10:51:20,299 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1230807425, now seen corresponding path program 103 times [2019-08-05 10:51:20,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:20,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:51:20,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 51918 backedges. 0 proven. 51612 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-08-05 10:51:24,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:24,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:51:24,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:51:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:51:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:24,202 INFO L87 Difference]: Start difference. First operand 412 states and 514 transitions. Second operand 105 states. [2019-08-05 10:51:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:24,654 INFO L93 Difference]: Finished difference Result 419 states and 523 transitions. [2019-08-05 10:51:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:51:24,655 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 411 [2019-08-05 10:51:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:24,656 INFO L225 Difference]: With dead ends: 419 [2019-08-05 10:51:24,656 INFO L226 Difference]: Without dead ends: 419 [2019-08-05 10:51:24,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-08-05 10:51:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-08-05 10:51:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-05 10:51:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 519 transitions. [2019-08-05 10:51:24,661 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 519 transitions. Word has length 411 [2019-08-05 10:51:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:24,661 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 519 transitions. [2019-08-05 10:51:24,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:51:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 519 transitions. [2019-08-05 10:51:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-08-05 10:51:24,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:24,663 INFO L399 BasicCegarLoop]: trace histogram [206, 103, 103, 1, 1, 1] [2019-08-05 10:51:24,664 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -460892343, now seen corresponding path program 104 times [2019-08-05 10:51:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:24,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:51:24,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 52942 backedges. 0 proven. 52633 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-08-05 10:51:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:51:28,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:51:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:51:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:51:28,514 INFO L87 Difference]: Start difference. First operand 416 states and 519 transitions. Second operand 106 states. [2019-08-05 10:51:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:28,893 INFO L93 Difference]: Finished difference Result 423 states and 528 transitions. [2019-08-05 10:51:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:51:28,894 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 415 [2019-08-05 10:51:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:28,895 INFO L225 Difference]: With dead ends: 423 [2019-08-05 10:51:28,895 INFO L226 Difference]: Without dead ends: 423 [2019-08-05 10:51:28,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:51:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-08-05 10:51:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 420. [2019-08-05 10:51:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-08-05 10:51:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 524 transitions. [2019-08-05 10:51:28,899 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 524 transitions. Word has length 415 [2019-08-05 10:51:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:28,900 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 524 transitions. [2019-08-05 10:51:28,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:51:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 524 transitions. [2019-08-05 10:51:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-08-05 10:51:28,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:28,902 INFO L399 BasicCegarLoop]: trace histogram [208, 104, 104, 1, 1, 1] [2019-08-05 10:51:28,902 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:28,902 INFO L82 PathProgramCache]: Analyzing trace with hash 449698579, now seen corresponding path program 105 times [2019-08-05 10:51:28,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:28,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:51:28,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 53976 backedges. 0 proven. 53664 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-08-05 10:51:33,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:33,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:51:33,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:51:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:51:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:51:33,125 INFO L87 Difference]: Start difference. First operand 420 states and 524 transitions. Second operand 107 states. [2019-08-05 10:51:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:33,511 INFO L93 Difference]: Finished difference Result 427 states and 533 transitions. [2019-08-05 10:51:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:51:33,511 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 419 [2019-08-05 10:51:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:33,512 INFO L225 Difference]: With dead ends: 427 [2019-08-05 10:51:33,513 INFO L226 Difference]: Without dead ends: 427 [2019-08-05 10:51:33,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:51:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-08-05 10:51:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2019-08-05 10:51:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-08-05 10:51:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 529 transitions. [2019-08-05 10:51:33,517 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 529 transitions. Word has length 419 [2019-08-05 10:51:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:33,517 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 529 transitions. [2019-08-05 10:51:33,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:51:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 529 transitions. [2019-08-05 10:51:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-08-05 10:51:33,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:33,519 INFO L399 BasicCegarLoop]: trace histogram [210, 105, 105, 1, 1, 1] [2019-08-05 10:51:33,519 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -13014563, now seen corresponding path program 106 times [2019-08-05 10:51:33,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:33,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:51:33,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55020 backedges. 0 proven. 54705 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-08-05 10:51:37,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:37,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:51:37,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:51:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:51:37,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:51:37,804 INFO L87 Difference]: Start difference. First operand 424 states and 529 transitions. Second operand 108 states. [2019-08-05 10:51:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:38,193 INFO L93 Difference]: Finished difference Result 431 states and 538 transitions. [2019-08-05 10:51:38,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:51:38,194 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 423 [2019-08-05 10:51:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:38,195 INFO L225 Difference]: With dead ends: 431 [2019-08-05 10:51:38,195 INFO L226 Difference]: Without dead ends: 431 [2019-08-05 10:51:38,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:51:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-08-05 10:51:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2019-08-05 10:51:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-05 10:51:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 534 transitions. [2019-08-05 10:51:38,199 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 534 transitions. Word has length 423 [2019-08-05 10:51:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:38,199 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 534 transitions. [2019-08-05 10:51:38,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:51:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 534 transitions. [2019-08-05 10:51:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-08-05 10:51:38,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:38,201 INFO L399 BasicCegarLoop]: trace histogram [212, 106, 106, 1, 1, 1] [2019-08-05 10:51:38,201 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1840479321, now seen corresponding path program 107 times [2019-08-05 10:51:38,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:38,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:51:38,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 56074 backedges. 0 proven. 55756 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-08-05 10:51:42,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:42,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:51:42,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:51:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:51:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:51:42,589 INFO L87 Difference]: Start difference. First operand 428 states and 534 transitions. Second operand 109 states. [2019-08-05 10:51:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:43,006 INFO L93 Difference]: Finished difference Result 435 states and 543 transitions. [2019-08-05 10:51:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:51:43,007 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 427 [2019-08-05 10:51:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:43,008 INFO L225 Difference]: With dead ends: 435 [2019-08-05 10:51:43,008 INFO L226 Difference]: Without dead ends: 435 [2019-08-05 10:51:43,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:51:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-08-05 10:51:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2019-08-05 10:51:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:51:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 539 transitions. [2019-08-05 10:51:43,012 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 539 transitions. Word has length 427 [2019-08-05 10:51:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:43,012 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 539 transitions. [2019-08-05 10:51:43,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:51:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 539 transitions. [2019-08-05 10:51:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-08-05 10:51:43,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:43,014 INFO L399 BasicCegarLoop]: trace histogram [214, 107, 107, 1, 1, 1] [2019-08-05 10:51:43,014 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -817256335, now seen corresponding path program 108 times [2019-08-05 10:51:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:43,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:51:43,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 57138 backedges. 0 proven. 56817 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-08-05 10:51:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:51:47,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:51:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:51:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:51:47,378 INFO L87 Difference]: Start difference. First operand 432 states and 539 transitions. Second operand 110 states. [2019-08-05 10:51:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:47,779 INFO L93 Difference]: Finished difference Result 439 states and 548 transitions. [2019-08-05 10:51:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:51:47,780 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 431 [2019-08-05 10:51:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:47,781 INFO L225 Difference]: With dead ends: 439 [2019-08-05 10:51:47,781 INFO L226 Difference]: Without dead ends: 439 [2019-08-05 10:51:47,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:51:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-08-05 10:51:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-08-05 10:51:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:51:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 544 transitions. [2019-08-05 10:51:47,786 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 544 transitions. Word has length 431 [2019-08-05 10:51:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:47,786 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 544 transitions. [2019-08-05 10:51:47,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:51:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 544 transitions. [2019-08-05 10:51:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-08-05 10:51:47,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:47,788 INFO L399 BasicCegarLoop]: trace histogram [216, 108, 108, 1, 1, 1] [2019-08-05 10:51:47,788 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1278433339, now seen corresponding path program 109 times [2019-08-05 10:51:47,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:47,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1748 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:51:47,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 58212 backedges. 0 proven. 57888 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-08-05 10:51:52,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:52,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:51:52,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:51:52,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:51:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:51:52,174 INFO L87 Difference]: Start difference. First operand 436 states and 544 transitions. Second operand 111 states. [2019-08-05 10:51:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:52,586 INFO L93 Difference]: Finished difference Result 443 states and 553 transitions. [2019-08-05 10:51:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:51:52,587 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 435 [2019-08-05 10:51:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:52,588 INFO L225 Difference]: With dead ends: 443 [2019-08-05 10:51:52,588 INFO L226 Difference]: Without dead ends: 443 [2019-08-05 10:51:52,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:51:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-08-05 10:51:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2019-08-05 10:51:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-08-05 10:51:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 549 transitions. [2019-08-05 10:51:52,592 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 549 transitions. Word has length 435 [2019-08-05 10:51:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:52,593 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 549 transitions. [2019-08-05 10:51:52,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:51:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 549 transitions. [2019-08-05 10:51:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-08-05 10:51:52,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:52,594 INFO L399 BasicCegarLoop]: trace histogram [218, 109, 109, 1, 1, 1] [2019-08-05 10:51:52,595 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -640937211, now seen corresponding path program 110 times [2019-08-05 10:51:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:52,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:51:52,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 59296 backedges. 0 proven. 58969 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-08-05 10:51:57,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:57,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:51:57,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:51:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:51:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:51:57,299 INFO L87 Difference]: Start difference. First operand 440 states and 549 transitions. Second operand 112 states. [2019-08-05 10:51:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:57,734 INFO L93 Difference]: Finished difference Result 447 states and 558 transitions. [2019-08-05 10:51:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:51:57,735 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 439 [2019-08-05 10:51:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:57,736 INFO L225 Difference]: With dead ends: 447 [2019-08-05 10:51:57,737 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 10:51:57,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:51:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 10:51:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2019-08-05 10:51:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-08-05 10:51:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 554 transitions. [2019-08-05 10:51:57,742 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 554 transitions. Word has length 439 [2019-08-05 10:51:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:57,742 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 554 transitions. [2019-08-05 10:51:57,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:51:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 554 transitions. [2019-08-05 10:51:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-08-05 10:51:57,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:57,744 INFO L399 BasicCegarLoop]: trace histogram [220, 110, 110, 1, 1, 1] [2019-08-05 10:51:57,745 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 597055695, now seen corresponding path program 111 times [2019-08-05 10:51:57,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:51:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 60390 backedges. 0 proven. 60060 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-08-05 10:52:02,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:02,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:52:02,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:52:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:52:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:02,350 INFO L87 Difference]: Start difference. First operand 444 states and 554 transitions. Second operand 113 states. [2019-08-05 10:52:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:02,809 INFO L93 Difference]: Finished difference Result 451 states and 563 transitions. [2019-08-05 10:52:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:52:02,810 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 443 [2019-08-05 10:52:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:02,811 INFO L225 Difference]: With dead ends: 451 [2019-08-05 10:52:02,811 INFO L226 Difference]: Without dead ends: 451 [2019-08-05 10:52:02,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-08-05 10:52:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2019-08-05 10:52:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-08-05 10:52:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 559 transitions. [2019-08-05 10:52:02,815 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 559 transitions. Word has length 443 [2019-08-05 10:52:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:02,815 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 559 transitions. [2019-08-05 10:52:02,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:52:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 559 transitions. [2019-08-05 10:52:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-08-05 10:52:02,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:02,818 INFO L399 BasicCegarLoop]: trace histogram [222, 111, 111, 1, 1, 1] [2019-08-05 10:52:02,818 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:02,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:02,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1339337113, now seen corresponding path program 112 times [2019-08-05 10:52:02,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:02,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1796 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:52:02,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 61494 backedges. 0 proven. 61161 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-08-05 10:52:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:52:07,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:52:07,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:52:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:52:07,646 INFO L87 Difference]: Start difference. First operand 448 states and 559 transitions. Second operand 114 states. [2019-08-05 10:52:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:08,101 INFO L93 Difference]: Finished difference Result 455 states and 568 transitions. [2019-08-05 10:52:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:52:08,102 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 447 [2019-08-05 10:52:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:08,103 INFO L225 Difference]: With dead ends: 455 [2019-08-05 10:52:08,103 INFO L226 Difference]: Without dead ends: 455 [2019-08-05 10:52:08,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:52:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-08-05 10:52:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 452. [2019-08-05 10:52:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-08-05 10:52:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 564 transitions. [2019-08-05 10:52:08,108 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 564 transitions. Word has length 447 [2019-08-05 10:52:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:08,108 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 564 transitions. [2019-08-05 10:52:08,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:52:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 564 transitions. [2019-08-05 10:52:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-08-05 10:52:08,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:08,110 INFO L399 BasicCegarLoop]: trace histogram [224, 112, 112, 1, 1, 1] [2019-08-05 10:52:08,110 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1618377373, now seen corresponding path program 113 times [2019-08-05 10:52:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:08,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1812 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:52:08,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 62608 backedges. 0 proven. 62272 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-08-05 10:52:12,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:52:12,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:52:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:52:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:12,978 INFO L87 Difference]: Start difference. First operand 452 states and 564 transitions. Second operand 115 states. [2019-08-05 10:52:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,417 INFO L93 Difference]: Finished difference Result 459 states and 573 transitions. [2019-08-05 10:52:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:52:13,418 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 451 [2019-08-05 10:52:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,419 INFO L225 Difference]: With dead ends: 459 [2019-08-05 10:52:13,420 INFO L226 Difference]: Without dead ends: 459 [2019-08-05 10:52:13,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-08-05 10:52:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2019-08-05 10:52:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-08-05 10:52:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 569 transitions. [2019-08-05 10:52:13,424 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 569 transitions. Word has length 451 [2019-08-05 10:52:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,424 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 569 transitions. [2019-08-05 10:52:13,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:52:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 569 transitions. [2019-08-05 10:52:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-08-05 10:52:13,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,426 INFO L399 BasicCegarLoop]: trace histogram [226, 113, 113, 1, 1, 1] [2019-08-05 10:52:13,427 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash 242707501, now seen corresponding path program 114 times [2019-08-05 10:52:13,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 63732 backedges. 0 proven. 63393 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-08-05 10:52:18,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:18,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:52:18,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:52:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:52:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:18,375 INFO L87 Difference]: Start difference. First operand 456 states and 569 transitions. Second operand 116 states. [2019-08-05 10:52:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:18,824 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2019-08-05 10:52:18,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:52:18,824 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 455 [2019-08-05 10:52:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:18,825 INFO L225 Difference]: With dead ends: 463 [2019-08-05 10:52:18,826 INFO L226 Difference]: Without dead ends: 463 [2019-08-05 10:52:18,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-08-05 10:52:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2019-08-05 10:52:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 10:52:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 574 transitions. [2019-08-05 10:52:18,831 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 574 transitions. Word has length 455 [2019-08-05 10:52:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:18,831 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 574 transitions. [2019-08-05 10:52:18,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:52:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 574 transitions. [2019-08-05 10:52:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 10:52:18,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:18,833 INFO L399 BasicCegarLoop]: trace histogram [228, 114, 114, 1, 1, 1] [2019-08-05 10:52:18,833 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash -215949833, now seen corresponding path program 115 times [2019-08-05 10:52:18,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:18,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:52:18,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:52:21,638 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:52:21,638 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:52:21,643 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:52:21,644 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:52:21 BoogieIcfgContainer [2019-08-05 10:52:21,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:52:21,646 INFO L168 Benchmark]: Toolchain (without parser) took 241230.56 ms. Allocated memory was 135.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 109.3 MB in the beginning and 783.0 MB in the end (delta: -673.7 MB). Peak memory consumption was 416.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:21,647 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 110.5 MB in the beginning and 110.3 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:52:21,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.88 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 107.5 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:52:21,648 INFO L168 Benchmark]: Boogie Preprocessor took 19.09 ms. Allocated memory is still 135.8 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:21,648 INFO L168 Benchmark]: RCFGBuilder took 347.59 ms. Allocated memory is still 135.8 MB. Free memory was 106.2 MB in the beginning and 96.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:21,649 INFO L168 Benchmark]: TraceAbstraction took 240826.37 ms. Allocated memory was 135.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 96.5 MB in the beginning and 783.0 MB in the end (delta: -686.5 MB). Peak memory consumption was 404.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:52:21,652 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.17 ms. Allocated memory is still 135.8 MB. Free memory was 110.5 MB in the beginning and 110.3 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 32.88 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 107.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.09 ms. Allocated memory is still 135.8 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.59 ms. Allocated memory is still 135.8 MB. Free memory was 106.2 MB in the beginning and 96.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240826.37 ms. Allocated memory was 135.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 96.5 MB in the beginning and 783.0 MB in the end (delta: -686.5 MB). Peak memory consumption was 404.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 460 with TraceHistMax 228,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 240.7s OverallTime, 117 OverallIterations, 228 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 466 SDtfs, 13110 SDslu, 7476 SDs, 0 SdLazy, 14261 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26001 GetRequests, 19443 SyntacticMatches, 0 SemanticMatches, 6558 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 198.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 116 MinimizatonAttempts, 340 StatesRemovedByMinimization, 114 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 205.7s InterpolantComputationTime, 26117 NumberOfCodeBlocks, 26117 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 26001 ConstructedInterpolants, 0 QuantifiedInterpolants, 23652333 SizeOfPredicates, 116 NumberOfNonLiveVariables, 105396 ConjunctsInSsa, 6674 ConjunctsInUnsatCore, 116 InterpolantComputations, 2 PerfectInterpolantSequences, 19325/2430407 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown